Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Calvin C. Newport. Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks. In Panagiota Fatourou, Gadi Taubenfeld, editors, ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013. pages 403-405, ACM, 2013. [doi]

This author has not been identified. Look up 'Calvin C. Newport' in Google

runs on WebDSL