Message-optimal protocols for Byzantine Agreement-Reference-Cited by-同舟云学术

Message-optimal protocols for Byzantine Agreement

Published:1993-03 Issue:1 Volume:26 Page:41-102
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Hadzilacos Vassos,Halpern Joseph Y.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01187074.pdf

Reference32 articles.

1. Alon, N. Private communication, June 1990.

2. Amdur, E. S., S. M. Weber, and V. Hadzilacos. On the Message Compexity of Binary Byzantine Agreement Under Crash Failures.Distributed Computing,5:175?186, 1992.

3. Attiya, H., N. A. Lynch, and N. Shavit. Are Wait-Free Algorithms Fast? InProc. 31st Symp. on Foundations of Computer Science, pp. 55?64, Oct. 1990.

4. Ben-Or, M. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. InProc. 2nd ACM Symp. on Principles of Distributed Computing, pp. 27?30, August 1983.

5. Berman, P., and J. A. Garay. Optimal Early Stopping in Distributed Consensus. IBM Research Report RC 16746, December 1990.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement;Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04

2. Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

3. Brief Announcement: Improved Consensus in Quantum Networks;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. African Diasporic Connections in the Americas: Toni Morrison in Brazil;Feminismo/s;2022-07-15

5. Improved communication complexity of fault-tolerant consensus;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09