Author:
Alistarh Dan,Aspnes James,King Valerie,Saia Jared
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Abrahamson, K.: On achieving consensus using a shared memory. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 1988, pp. 291–302. ACM, New York (1988)
2. Aguilera, M.K., Toueg, S.: The correctness proof of Ben-Or’s randomized consensus algorithm. Distributed Computing 25(5), 371–381 (2012)
3. Alistarh, D., Aspnes, J., King, V., Saia, J.: Communication-efficient randomized consensus (2014), Full version available at
http://www.cs.yale.edu/homes/aspnes/papers/disc2014-submission.pdf
4. Aspnes, J.: Lower bounds for distributed coin-flipping and randomized consensus. J. ACM 45(3), 415–450 (1998)
5. Aspnes, J., Attiya, H., Censor, K.: Randomized consensus in expected O(n logn) individual work. In: PODC 2008: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 325–334 (August 2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Insight into Local Coin-Based Randomized Consensus;2019 IEEE 24th Pacific Rim International Symposium on Dependable Computing (PRDC);2019-12
2. How To Elect a Leader Faster than a Tournament;Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing;2015-07-21