1. Awerbuch B (1987) Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Proceedings of the 19th annual ACM symposium on theory of computing, New York City. ACM, New York, pp 230–240
2. Borůvka O (2001) Otakar Borůvka on minimum spanning tree problem (translation of both the 1926 papers, comments, history). Discret Math 233: 3–36
3. Burns JE (1980) A formal model for message-passing systems, TR-91. Indiana University, Bloomington
4. Frederickson G, Lynch N (1984) The impact of synchronous communication on the problem of electing a leader in a ring. In: Proceedings of the 16th annual ACM symposium on theory of computing, Washington, DC. ACM, New York, pp 493–503
5. Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum-weight spanning trees. ACM Trans Prog Lang Syst 5(1): 66–77