Author:
Delporte-Gallet Carole,Fauconnier Hugues,Safir Mouna
Publisher
Springer International Publishing
Reference14 articles.
1. Aguilera, M.K., Toueg, S.: A simple bivalency proof that t-resilient consensus requires t+ 1 rounds. Inform. Process. Lett. 71(3–4), 155–158 (1999)
2. Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16–18, 1993, San Diego, CA, USA pp. 91–100. ACM (1993)
3. Bouzid, Z., Imbs, D., Raynal, M.: A necessary condition for byzantine k-set agreement. Inform. Process. Lett. 116(12), 757–759 (2016)
4. Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Inform. Comput. 105(1), 132–158 (1993)
5. Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: Tight bounds for k-set agreement. J. ACM 47(5), 912–943 (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. All Byzantine Agreement Problems Are Expensive;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Optimal Algorithms for Synchronous Byzantine k-Set Agreement;Lecture Notes in Computer Science;2022