{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:39:17Z","timestamp":1777549157521,"version":"3.51.4"},"reference-count":19,"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\/bf01187072","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:19:50Z","timestamp":1108736390000},"page":"3-19","source":"Crossref","is-referenced-by-count":35,"title":["Cloture Votes:n\/4-resilient Distributed Consensus int + 1 rounds"],"prefix":"10.1007","volume":"26","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev, Families of Consensus Algorithms,Proc. 3rd Aegean Workshop on Computing, pp. 380?390, June\/July 1988.","DOI":"10.1007\/BFb0040405"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong, Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement,Proc. 6th Annual ACM Symp. on Principles of Distributed Computing, pp. 42?51, August 1987.","DOI":"10.1145\/41840.41844"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"P. Berman and J. A. Gray, Asymptotically Optimal Distributed Consensus,Proc. 16th International Colloquium on Automata, Languages and Programming, pp. 80?94, LNCS, Vol. 372, July 1989.","DOI":"10.1007\/BFb0035753"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"P. Berman and J. A. Garay, Efficient Distributed Consensus withn = (3 + ?)t Processors,Proc. 5th International Workshop on Distributed Algorithms, pp. 129?142, LNCS 579, October 1991.","DOI":"10.1007\/BFb0022442"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"P. Berman, J. A. Garay, and K. J. Perry, Towards Optimal Distributed Consensus,Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 410?415, October\/November 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"CR6","first-page":"147","volume":"4","author":"J. Burns","year":"1987","unstructured":"J. Burns and N. Lynch, The Byzantine Firing Squad Problem,Advances in Computing Research, Vol. 4 (1987), pp. 147?161.","journal-title":"Advances in Computing Research"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"B. Coan, A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols,Proc. 5th Annual ACM Symp. on Principles of Distributed Computing, pp. 63?72, August 1986.","DOI":"10.1145\/10590.10596"},{"key":"CR8","unstructured":"B. Coan, Efficient Agreement Using Fault Diagnosis,Proc. 26th Allerton Conf. on Communication, Control and Computing, pp. 663?672, 1988."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"B. Coan and J. Welch, Modular Construction of Nearly Optimal Byzantine Agreement Protocols,Proc. 9th Annual ACM Symp. on Principles of Distributed Computing, pp. 295?306, August 1989.","DOI":"10.1145\/72981.73002"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"B. Coan and J. Welch, Modular Construction of an Efficient 1-Bit Byzantine Agreement Protocol,Mathematical Systems Theory, this issue, pp. 131?154.","DOI":"10.1007\/BF01187076"},{"issue":"No. 4","key":"CR11","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"D. Dolev, R. Reischuk, and H. R. Strong, Early Stopping in Byzantine Agreement,Journal of the ACM, Vol. 37, No. 4 (1990), pp. 720?741.","journal-title":"Journal of the ACM"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"D. Dolev and H. R. Strong, Polynomial Algorithms for Multiple Processor Agreement,Proc. 14th Annual ACM Symp. on Theory of Computing, pp. 401?407, May 1982.","DOI":"10.1145\/800070.802215"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BFb0035770","volume":"372","author":"P. Feldman","year":"1989","unstructured":"P. Feldman and S. Micali, An Optimal Probabilistic Algorithm for Byzantine Agreement (invited paper),Proc. 16th International Colloquium on Automata, Languages and Programming, LNCS, Vol. 372, pp. 341?378, July 1989.","journal-title":"Proc. 16th International Colloquium on Automata, Languages and Programming, LNCS"},{"issue":"No. 4","key":"CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"M. J. Fischer and N. Lynch, A Lower Bound for the Time to Assure Interactive Consistency,Information Processing Letters, Vol. 14, No. 4 (1982), pp. 183?186.","journal-title":"Information Processing Letters"},{"issue":"No. 3","key":"CR15","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Halpern","year":"1990","unstructured":"J. Halpern and Y. Moses, Knowledge and Common Knowledge in a Distributed Environment,Journal of the ACM, Vol. 37, No. 3 (1990), pp. 549?587.","journal-title":"Journal of the ACM"},{"issue":"No. 3","key":"CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R. E. Shostak, and M. Pease, The Byzantine Generals Problem,ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3 (1982), pp. 382?401.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Y. Moses and O. Waarts, Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time,Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 246?255, October 1988.","DOI":"10.1109\/SFCS.1988.21941"},{"issue":"No. 2","key":"CR18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults,Journal of the ACM, Vol. 27, No. 2 (1980), pp. 228?234.","journal-title":"Journal of the ACM"},{"issue":"No. 3","key":"CR19","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"S. Toueg, K. J. Perry, and T. K. Srikanth, Fast Distributed Agreement,SIAM Journal on Computing, Vol. 16, No. 3 (1987), pp. 445?458.","journal-title":"SIAM Journal on Computing"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:07:24Z","timestamp":1586120844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01187072"],"URL":"https:\/\/doi.org\/10.1007\/bf01187072","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}