{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:10Z","timestamp":1725455590174},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022442","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"129-142","source":"Crossref","is-referenced-by-count":2,"title":["Efficient distributed consensus with n=(3 + \u025b)t processors"],"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","reference":[{"doi-asserted-by":"crossref","unstructured":"H. Attiya, C. Dwork, N. Lynch and L. Stockmeyer, \u201cBounds on the time to reach agreement in the presence of timing uncertainty,\u201d Proc. 23rd STOC, May 1991.","key":"9_CR1","DOI":"10.1145\/103418.103457"},{"doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev, \u201cFamilies of Consensus Algorithms,\u201d Proc. 3rd Aegean Workshop on Computing, pp. 380\u2013390, June\/July 1988.","key":"9_CR2","DOI":"10.1007\/BFb0040405"},{"key":"9_CR3","first-page":"42","volume":"PODC","author":"A. Bar-Noy","year":"1987","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork and H.R. Strong, \u201cShifting gears: changing algorithms on the fly to expedite Byzantine Agreement,\u201d Proc. 6th PODC, pp. 42\u201351, August 1987.","journal-title":"Proc."},{"unstructured":"P. Berman and J.A. Garay, \u201cOptimal Early Stopping in Distributed Consensus,\u201d IBM Research Report RC 16746, December 1990.","key":"9_CR4"},{"doi-asserted-by":"crossref","unstructured":"P. Berman, J.A. Garay and K.J. Perry, \u201cTowards Optimal Distributed Consensus,\u201d Proc. 30th FOCS, pp. 410\u2013415, October\/November 1989.","key":"9_CR5","DOI":"10.1109\/SFCS.1989.63511"},{"doi-asserted-by":"crossref","unstructured":"B. Coan, \u201cA communication-efficient canonical form for fault-tolerant distributed protocols,\u201d Proc. 5th PODC, pp. 63\u201372, August 1986.","key":"9_CR6","DOI":"10.1145\/10590.10596"},{"issue":"No.4","key":"9_CR7","first-page":"720","volume":"37","author":"D. Dolev","year":"1990","unstructured":"D. Dolev, R. Reischuk and H.R. Strong, \u201cEventual is Earlier than Immediate,\u201d Proc. 23rd STOC, 1982. Revised version appears in \u201cEarly Stopping in Byzantine Agreement,\u201d JACM, Vol. 37, No. 4 (1990), pp. 720\u2013741.","journal-title":"Proc. 23rd STOC"},{"doi-asserted-by":"crossref","unstructured":"D. Dolev and H.R. Strong, \u201cPolynomial Algorithms for Multiple Processor Agreement,\u201d Proc. 14th STOC, pp. 401\u2013407, May 1982.","key":"9_CR8","DOI":"10.1145\/800070.802215"},{"issue":"No.2","key":"9_CR9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fisher","year":"1985","unstructured":"M. Fisher, N. Lynch and M. Paterson, \u201cImpossibility of Distributed Consensus with one faulty process,\u201d JACM, Vol. 32, No. 2 (1985), pp. 374\u2013382.","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \u201cOptimal Algorithms for Byzantine Agreement,\u201d Proc. 20th STOC, pp. 148\u2013161, May 1988.","key":"9_CR10","DOI":"10.1145\/62212.62225"},{"issue":"No.3","key":"9_CR11","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, \u201cKnowledge and common knowledge in a distributed environment,\u201d JACM, Vol. 37, No. 3 (1990), pp. 549\u2013587.","journal-title":"JACM"},{"issue":"No.3","key":"9_CR12","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, \u201cThe Byzantine Generals Problem,\u201d ACM ToPLaS, Vol. 4, No. 3, pp. 382\u2013401, July 1982.","journal-title":"ACM ToPLaS"},{"doi-asserted-by":"crossref","unstructured":"Y. Moses and O. Waarts, \u201cCoordinated Traversal: (t+l)-Round Byzantine Agreement in Polynomial Time,\u201d Proc. 29th FOCS, pp. 246\u2013255, October 1988.","key":"9_CR13","DOI":"10.1109\/SFCS.1988.21941"},{"key":"9_CR14","volume-title":"M.Sc. Thesis","author":"O. Waarts","year":"1988","unstructured":"O. Waarts, \u201cCoordinated Traversal: Byzantine Agreement in polynomial time,\u201d M.Sc. Thesis, Weizmann Institute of Science, Rehovot, Israel, August 1988."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022442.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:27Z","timestamp":1607550507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0022442","relation":{},"subject":[]}}