Time and message bounds for election in synchronous and asynchronous complete networks
Author:
Afek Yehuda,Gafni Eli
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Leader Election in Well-Connected Graphs;Algorithmica;2022-11-24
2. Leader Election in Well-Connected Graphs;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23
3. tDP;Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data;2015-05-27
4. A fault-tolerant algorithm for election in complete networks with a sense of direction;Systems and Computers in Japan;1991
5. Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction;Distributed Algorithms;1989