Author:
Ramanathan Murali Krishna,Ferreira Ronaldo A.,Jagannathan Suresh,Grama Ananth,Szpankowski Wojciech
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference32 articles.
1. Agrawal D., Egecioglu Ö. and Abbadi A.E. (1997). Billiard quorums on the grid. Inf. Process. Lett. 64(1): 9–16
2. Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical Report, CS Department, Stanford University (2003)
3. Boyd S., Diaconis P. and Xiao L. (2004). Fastest mixing markov chain on a graph. SIAM Rev. 46(4): 667–689
4. Cidon, I., Mokryn, O.: Propagation and leader election in a multihop broadcast environment. In: DISC ’98 Proceedings of the 12th international symposium on distributed computing, pp. 104–118, Springer, London (1998)
5. Dolev D., Dwork C. and Stockmeyer L. (1987). On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77–97
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved Tradeoffs for Leader Election;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
2. Leader Election in Well-Connected Graphs;Algorithmica;2022-11-24
3. A synod based deterministic and indulgent leader election protocol for asynchronous large groups;International Journal of Parallel, Emergent and Distributed Systems;2021-02-01
4. Energy Efficient Naming in Beeping Networks;Ad-Hoc, Mobile, and Wireless Networks;2019
5. Leader Election in Well-Connected Graphs;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23