A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
1987
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
This paper develops linear time d'etributed algorithms for a class of problems in an asynchronous communication network. Those problems include Minimum-Weight Spanning Tree (MST), Leader Election, counting the number of network nodes, and computing a senaitive decomposable function (e.g. majority, parity, maximum, OR, AND). The main problem considered is ,the problem of finding the MST. This problem, which has been known for at least 9 years, is one of the most fundamental and the most studied
doi:10.1145/28395.28421
dblp:conf/stoc/Awerbuch87
fatcat:3zb7nf4pf5ebnjeoovifxoeume