{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:43:21Z","timestamp":1777596201863,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01187074","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:19:50Z","timestamp":1108736390000},"page":"41-102","source":"Crossref","is-referenced-by-count":30,"title":["Message-optimal protocols for Byzantine Agreement"],"prefix":"10.1007","volume":"26","author":[{"given":"Vassos","family":"Hadzilacos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Alon, N. Private communication, June 1990."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02277665","volume":"5","author":"E. S. Amdur","year":"1992","unstructured":"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.","journal-title":"Distributed Computing"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/FSCS.1990.89524"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/800221.806707"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., and J. A. Garay. Optimal Early Stopping in Distributed Consensus. IBM Research Report RC 16746, December 1990.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Berman, P., J. A. Garay, and K. J. Perry. Recursive Phase King Protocols for Distributed Consensus. Report CS-89-24, Penn State University, August 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"CR7","volume-title":"Extremal Graph Theory","author":"B. Bollobas","year":"1978","unstructured":"Bollobas, B.Extremal Graph Theory. Academic Press, London, 1978."},{"key":"CR8","unstructured":"Bracha, G. Unpublished manuscript, Department of Computer Science, Cornell University, July 1984."},{"key":"CR9","series-title":"Advances in Computing Research, vol. 5","first-page":"433","volume-title":"Randomness and Computation","author":"B. Chor","year":"1989","unstructured":"Chor, B., and C. Dwork. Randomization in Byzantine Agreement. InRandomness and Computation, edited by S. Micali, pp. 433?498, Advances in Computing Research, vol. 5, JAI Press, Greenwich, CT, 1989."},{"key":"CR10","unstructured":"Coan B. Private communication, 1990."},{"key":"CR11","unstructured":"Coan B., and J. Welch. A Byzantine Agrement Protocol with Optimal Message Bit Complexity. InProc. 27th Annual Allerton Conf. on Communication, Control, and Computing, pp. 1062?1071, 1989."},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., and R. Reischuk. Bounds on Information Exchange for Byzantine Agreement.Journal of the ACM,32(1): 191?204, January 1985.","journal-title":"Journal of the ACM"},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., and H. R. Strong. Authenticated Algorithms for Byzantine Agreement.SIAM Journal on Computing,12(4):656?666, November 1983.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"CR14","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., R. Reischuk, and H. R. Strong. Early Stopping in Byzantine Agreement.Journal of the ACM,37(4):720?741, 1990.","journal-title":"Journal of the ACM"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., and Y. Moses. Knowledge and Common Knowledge in a Byzantine Environment, I: Crash Failures. InProc. Conf. on Theoretical Aspects of Reasoning About Knowledge, pp. 149?169, March 1986.","DOI":"10.1016\/B978-0-934613-04-0.50013-2"},{"key":"CR16","unstructured":"Dwork, C., J. Y. Halpern, and O. Waarts. Unpublished manuscript, 1991."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Feldman, P., and S. Micali. Byzantine Agreement in Constant Expected Time (and Trusting No One). InProc. 26th Annual IEEE Symp. on Foundations of Computer Science, pp. 267?276, October 1985.","DOI":"10.1109\/SFCS.1985.14"},{"key":"CR18","unstructured":"Feldman, P., and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. Technical Report MIT\/LCS\/TM-425, Laboratory for Computer Science, Massachusetts Institute of Technology, June 1990."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Fischer, M. J. The Consensus Problem in Unreliable Distributed Systems. Research Report RR-273, Department of Computer Science, Yale University, June 1983.","DOI":"10.1007\/3-540-12689-9_99"},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"Fischer, M. J., and N. A. Lynch. A Lower Bound for the Time To Assure Interactive Consistency.Information Processing Letters,14(4):183?186, June 1982.","journal-title":"Information Processing Letters"},{"issue":"2","key":"CR21","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"Fischer, M. J., N. A. Lynch, and M. S. Paterson. Impossibility of Distributed Consensus with One Faulty Process.Journal of the ACM,32(2):374?382, April 1985.","journal-title":"Journal of the ACM"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Gray, J. N. The Cost of Messages. InProc. 7th ACM Symp. on Principles of Distributed Computing, pp. 1?7, August 1988.","DOI":"10.1145\/62546.62547"},{"key":"CR23","unstructured":"Hadzilacos, V. Issues of Fault-Tolerance in Concurrent Computations. Ph.D. Dissertation, Aiken Computation Laboratory, Harvard University, June 1984."},{"key":"CR24","volume-title":"Lecture Notes in Computer Science, Vol. 448","author":"V. Hadzilacos","year":"1990","unstructured":"Hadzilacos, V. On the Relationship Between the Atomic Commitment and Consensus Problems. InProc. Workshop on Fault Tolerant Distributed Computing, March 17?19, 1986, Pacific Grove, CA. Lecture Notes in Computer Science, Vol. 448, Springer-Verlag, Berlin, 1990."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V., and J. Y. Halpern. The Failure Discovery Problem.Mathematical Systems Theory, this issue, pp. 103?129, 1993.","DOI":"10.1007\/BF01187075"},{"issue":"3","key":"CR26","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Y. Halpern","year":"1990","unstructured":"Halpern, J. Y., and Y. Moses. Knowledge and Common Knowledge in a Distributed Environment.Journal of the ACM,37(3):549?587, 1990. (Preliminary version inProc. 3rd ACM Symp. on Principles of Distributed Conputing, pp. 50?61, August 1984.)","journal-title":"Journal of the ACM"},{"issue":"3","key":"CR27","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., R. Shostak, and M. Pease. The Byzantine Generals Problem.ACM Transactions on Programming Languages and Systems,4(3):382?401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Lynch, N. A. A Hundred Impossibility Proofs for Distributed Computing. InProc. 8th ACM Symp. on Principles of Distributed Computing, pp. 1?27, August 1989.","DOI":"10.1145\/72981.72982"},{"issue":"3","key":"CR29","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., and S. Toueg. Automatically Increasing the Fault-Tolerance of Distributed Algorithms.Journal of Algorithms,11(3):374?419, September 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"CR30","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults.Journal of the ACM,27(2):228?234, April 1980.","journal-title":"Journal of the ACM"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T. K. Srikanth","year":"1987","unstructured":"Srikanth, T. K., and S. Toueg. Simulating Authenticated Broadcasts To Derive Simple Fault-Tolerant Algorithms.Distributed Computing,2:80?94, 1987.","journal-title":"Distributed Computing"},{"key":"CR32","unstructured":"Weber, S. M. Bounds on the Message Complexity of Byzantine Agreement. Masters' Thesis, Department of Computer Science, University of Toronto, October 1989."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187074\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:07:31Z","timestamp":1586120851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01187074"],"URL":"https:\/\/doi.org\/10.1007\/bf01187074","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}