Computers and intractability: A guide to the theory of NP-completeness, 1979. ,
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors, SIAM Journal on Computing, vol.16, issue.2, pp.231-236, 1987. ,
DOI : 10.1137/0216019
Approximating the minimum degree spanning tree to within one from the optimal degree, ACM-SIAM Symposium on Discrete Algorithms, pp.317-324, 1982. ,
A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983. ,
DOI : 10.1145/357195.357200
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.230-240, 1987. ,
DOI : 10.1145/28395.28421
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.257-266, 1985. ,
DOI : 10.1109/SFCS.1985.7
Optimal distributed algorithm for minimum spanning trees revisited, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.231-237, 1995. ,
DOI : 10.1145/224964.225474
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2261
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees, SIAM Journal on Computing, vol.27, issue.1, pp.302-316, 1998. ,
DOI : 10.1137/S0097539794261118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.1056
A very fast (linear time) distributed algorithm, in general graphs, for the minimum spanning tree, Studia Informatica Universalis Hors Srie OPODIS, pp.113-124, 2001. ,
Introduction to Distributed Algorithms, 1994. ,
DOI : 10.1017/CBO9781139168724
URL : http://dx.doi.org/10.1016/s0898-1221(97)90063-8