Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ N1-ε, where ε > 0 is any constant.
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Rolf Clauberg
IBM J. Res. Dev