Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference13 articles.
1. Frederickson GN, Lynch NA: Electing a leader in a synchronous ring. ACM 34(1): 98–115 (1987)
2. Pach J, Korach E, Rotem D: A technique for proving lower bounds for distributed maximum-finding algorithms. In: Proc of the 14th Annu ACM Symp on Theory of Computing, pp 378–382, 1982
3. Frederickson GN, Lynch NA: A general lower bound for electing a leader in a ring. Tech Rep CSD-TR-512. Purdue University, 1985
4. Goldreich O, Shrira L: The effect of link failures on computations in asynchronous rings. In: Proc of the ACM Symp on Principles of Distributed Computing, 1986
5. Linial N: Distributive graph algorithms — global solutions from local data. In: Proc of the 28th IEEE Annu Symp on Foundation of Computer Science, pp 331–335, 1987
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Cost of Unknown Diameter in Dynamic Networks;Journal of the ACM;2018-09-18
2. The Cost of Unknown Diameter in Dynamic Networks;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
3. Local heuristics and the emergence of spanning subgraphs in complex networks;Theoretical Computer Science;2006-04