{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T12:11:37Z","timestamp":1781007097877,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035753","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"80-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Asymptotically optimal distributed consensus"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"6_CR1","first-page":"80","volume":"52","author":"B. Bollob\u00e1s","year":"1981","unstructured":"B. Bollob\u00e1s, \"Random Graphs\", Combinatorics, London Math. Society Lect. Notes 52, Cambridge University Press, 1981, pp. 80\u2013102.","journal-title":"Combinatorics, London Math. Society Lect. Notes"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev, \"Families of Consensus Algorithms\", Proc. 3rd. Aegean Workshop on Computing, June\/July 1988, pp. 380\u2013390.","DOI":"10.1007\/BFb0040405"},{"key":"6_CR3","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\u201351, August 1987.","DOI":"10.1145\/41840.41844"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"P. Berman, J. Garay and K. Perry, \"Asymptotically Optimal Distributed Consensus with Optimal Resiliency\", The Pennsylvania State University, Computer Science Department Tech. Report CS-89-08, March 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"6_CR5","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\u201372, August 1986.","DOI":"10.1145\/10590.10596"},{"key":"6_CR6","unstructured":"B. Coan, \"Efficient agreement using fault diagnosis\", personal communication, to appear in Proc. 26th. Annual Allerton Conference on Communication, Control and Computing, September 1988."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"C. Dwork, D. Peleg, N. Pippenger and E. Upfal, \"Fault tolerance in networks of bounded degree\", Proc. 18th. ACM Symp. on Theory of Computing, pp. 370\u2013379, May 1986.","DOI":"10.1145\/12130.12169"},{"key":"6_CR8","unstructured":"D. Dolev, R. Reischuk and H.R. Strong, \"Early Stopping in Byzantine Agreement\", IBM Research Report RJ5406-55357, 1986."},{"key":"6_CR9","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\u2013407, May 1982.","DOI":"10.1145\/800070.802215"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","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, pp. 382\u2013401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Y. Moses and O. Waarts, \"Coordinated Traversal: (t+1)-Round Byzantine Agreement in Polynomial Time\", Proc. 20th. Annual ACM Symp. on Theory of Computing, pp. 246\u2013255, May 1988.","DOI":"10.1109\/SFCS.1988.21941"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","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, pp. 445\u2013458, June 1987.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR13","unstructured":"J.D. Ullman, \"Computational Aspects of VLSI\", Computer Science Press, 1984."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:36:04Z","timestamp":1578544564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035753"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0035753","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}