Author:
Baala H.,Flauzac O.,Gaber J.,Bui M.,El-Ghazawi T.
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference22 articles.
1. A distributed algorithm for minimum weight spanning trees;Gallager;TOPLAS,1983
2. A fully distributed spanning tree algorithm;Lavallée;Inform. Process. Lett.,1986
3. J.A. Garay, S. Kutten, D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, in: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, November 3–5, 1993, pp. 659–668.
4. A. Israeli, M. Jalfon, Token management schemes and random walks yields self-stabilizing mutual exclusion, in: Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing, 1990.
5. More on the power of random walks;Anagnostou,1991
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献