{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:14Z","timestamp":1725663314039},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:28:45Z","timestamp":1330208925000},"page":"321-333","source":"Crossref","is-referenced-by-count":2,"title":["Fast consensus in networks of bounded degree"],"prefix":"10.1007","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","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, \"Random Graphs,\" combinatorics, London Math. Society LN 52, Cambridge University Press, 1981, pp. 80\u2013102.","DOI":"10.1017\/CBO9780511662157.006"},{"key":"22_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":"22_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 PODC, August 1987, pp. 42\u201351.","DOI":"10.1145\/41840.41844"},{"key":"22_CR4","first-page":"80","volume":"372","author":"P. Berman","year":"1989","unstructured":"P. Berman and J.A. Garay, \"Asymptotically Optimal Distributed Consensus,\" Proc. ICALP 89, LNCS, Vol. 372, July 1989, pp. 80\u201394.","journal-title":"LNCS"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"P. Berman, J.A. Garay and K.J. Perry, \"Towards Optimal Distributed Consensus,\" Proc. 30th FOCS, October 1989, pp. 410\u2013415.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"P. Berman, J.A. Garay and K.J. Perry, \"Recursive Phase King Protocols for Distributed Consensus,\" PSU, CS Dept. Tech Report CS-89-24, August 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"22_CR7","unstructured":"F. Cristian, H. Aghili, R. Strong and D. Dolev, \"Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement,\" Proc. 15th Inernational Symp. on Fault-Tolerant Computing, June 1985, pp. 200\u2013206. Revised version in IBM research report RJ5244."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"B. Coan and J.Welch, \"Modular Construction of Nearly Optimal Byzantine Agreement Protocols,\" Proc. 9th Annual PODC, August 1989, pp. 295\u2013306.","DOI":"10.1145\/72981.73002"},{"key":"22_CR9","unstructured":"B. Coan and J. Welch, \"A Byzantine Agreement Protocol with Optimal Message Bit Complexity,\" Proc. 27th Annual Allerton Conf. on Communication, Control and Computing, 1989."},{"issue":"1","key":"22_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, \"The Byzantine generals strike again,\" Journal of Algorithms, Vol. 3, No. 1 (1982), pp. 14\u201330.","journal-title":"Journal of Algorithms"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"C. Dwork, D. Peleg, N. Pippenger and E. Upfal, \"Fault Tolerance in Networks of Bounded Degree,\" Proc. 18th STOC, May 1986, pp. 370\u2013379.","DOI":"10.1145\/12130.12169"},{"issue":"1","key":"22_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"D. Dolev and R. Reischuk, \"Bounds of Information Exchange for Byzantine Agreement,\" JACM, Vol. 32, No. 1, (1985), pp. 191\u2013204.","journal-title":"JACM"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"D. Dolev and H.R. Strong, \"Polynomial Algorithms for Multiple Processor Agreement,\" Proc. 14th STOC, May 1982, pp. 401\u2013407.","DOI":"10.1145\/800070.802215"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \"Optimal Algorithms for Byzantine Agreement,\" Proc. 20th STOC, May 1988, pp. 148\u2013161.","DOI":"10.1145\/62212.62225"},{"issue":"3","key":"22_CR15","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 ToPLaS, Vol. 4, No. 3, July 1982, pp. 382\u2013401.","journal-title":"ACM ToPLaS"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Y. Moses and O. Waarts, \"Coordinated Traversal: (t+1)-Round Byzantine Agreement in Polynomial Time,\" Proc. 29th FOCS, October 1988, pp. 246\u2013255.","DOI":"10.1109\/SFCS.1988.21941"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"N. Pippinger, \"On Networks of Noisy Gates,\" Proc. 26th FOCS, October 1985, pp. 31\u201338.","DOI":"10.1109\/SFCS.1985.41"},{"key":"22_CR18","unstructured":"J.D. Ullman, \"Computational Aspects of VLSI,\" Computer Science Press, 1984."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:21Z","timestamp":1605646341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}