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

On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing

A lower bound for radio broadcast

Journal of Computer and System Sciences

An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing

On Randomized Broadcasting and Gossiping in Radio Networks

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Broadcasting in undirected ad hoc radio networks

Distributed Computing - Special issue: PODC 02

Broadcasting algorithms in radio networks with unknown topology

Journal of Algorithms

Leader election in shared spectrum radio networks

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Efficient symmetry breaking in multi-channel radio networks

DISC'12 Proceedings of the 26th international conference on Distributed Computing