Michael Elkin. A faster distributed protocol for constructing a minimum spanning tree. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 359-368, SIAM, 2004. [doi]
Abstract is missing.