Author:
Amdur Eugene S.,Weber Samuel M.,Hadzilacos Vassos
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference18 articles.
1. Amdur ES: On the message complexity of byzantine agreement. M.S. Thesis, Department of Computer Science, University of Toronto 1988
2. Berman P, Garray J, Perry K: Recursive phase king protocols for distributed consensus. Technical Report CS-89-24, Computer Science Department, Pennsylvania State University 1989
3. Bracha G: Technical memorandum, Department of Computer Science, Cornell University 1984 (unpublished mansucript)
4. Coan B, Welch J: A byzantine agreement protocol with optimal message bit complexity. Proceedings of the 27th Annual Allerton Conference on Communication. Control and Computing pp 1062–1071, 1989
5. Cook SA, Dwork C, Reischuk R: Upper and lower bounds for parallel RAMs without simultaneous writes. SIAM J Comput 15(1):87–97 (1986).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Brief Announcement: Improved Consensus in Quantum Networks;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
2. Improved communication complexity of fault-tolerant consensus;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Optimistically tuning synchronous byzantine consensus: another win for null messages;Distributed Computing;2021-06-10
4. Silence;Journal of the ACM;2020-04-05
5. Communication Complexity of Wait-Free Computability in Dynamic Networks;Structural Information and Communication Complexity;2020