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]
@inproceedings{Elkin04:0,
title = {A faster distributed protocol for constructing a minimum spanning tree},
author = {Michael Elkin},
year = {2004},
doi = {10.1145/982792.982844},
url = {http://doi.acm.org/10.1145/982792.982844},
tags = {protocol},
researchr = {https://researchr.org/publication/Elkin04%3A0},
cites = {0},
citedby = {0},
pages = {359-368},
booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004},
editor = {J. Ian Munro},
publisher = {SIAM},
}