Author:
Lakshmanan K. B.,Thulasiraman K.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Technical Report;H.H. Abu-Amara,1987
2. B. Awerbuch, “Complexity of Network Synchronization”, J. Assoc. Comput. Mach., Vol. 32, No. 4, Oct. 1985, pp. 804–823.
3. B. Awerbuch, “Reducing Complexities of the Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization”, Networks, Vol. 15, 1985, pp. 425–437.
4. B. Awerbuch and R.G. Gallager, “A New Distributed Algorithm to Find Breadth-First-Search Trees”, IEEE Trans. Info. Theory, Vol. IT-33, No. 3, May 1987, pp. 315–322.
5. K.M. Chandy and J. Misra, “Distributed Computation on Graphs: Shortest Path Algorithms”, Comm. Assoc. Comput. Mach., Vol. 25, No. 11, Nov. 1982, pp. 833–837.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Simulating Synchrony on Top of Asynchronous Systems;Distributed Algorithms for Message-Passing Systems;2013
2. Low complexity network synchronization;Distributed Algorithms;1994
3. Optimal synchronization of ABD networks;Lecture Notes in Computer Science;1988
4. Message delaying synchronizers;Distributed Algorithms