Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. More choices allow more faults: set consensus problems in totally asynchronous systems;Chaudhuri;Inf. Comput.,1993
2. From consensus to atomic broadcast: time-free Byzantine-resistant protocols without signatures;Correia;Comput. J.,2006
3. Distributed Computing Through Combinatorial Topology;Herlihy,2014
4. The Byzantine generals problem;Lamport;ACM Trans. Program. Lang. Syst.,1982
5. Distributed Algorithms;Lynch,1996
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. All Byzantine Agreement Problems Are Expensive;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Some New Results With k-Set Agreement;Lecture Notes in Computer Science;2024
3. Optimal algorithms for synchronous Byzantine k-set agreement;Theoretical Computer Science;2023-09
4. On the Validity of Consensus;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
5. Optimal Algorithms for Synchronous Byzantine k-Set Agreement;Lecture Notes in Computer Science;2022