{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:54:27Z","timestamp":1769921667698,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540561880","type":"print"},{"value":"9783540474845","type":"electronic"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/3-540-56188-9_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:20Z","timestamp":1330253780000},"page":"221-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Optimal early stopping in distributed consensus"],"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"}]},{"given":"Kenneth J.","family":"Perry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","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.","DOI":"10.1145\/41840.41844"},{"key":"15_CR2","first-page":"80","volume":"372","author":"P. Berman","year":"1989","unstructured":"P. Berman and J.A. Garay, \u201cAsymptotically Optimal Distributed Consensus,\u201d Proc. ICALP 89, LNCS Vol. 372, pp. 80\u201394, July 1989.","journal-title":"Proc. ICALP 89, LNCS"},{"key":"15_CR3","unstructured":"P. Berman and J.A. Garay, \u201cDistributed Consensus with n = (3 + \u03b5)t Processors,\u201d Proc. 5th International Workshop on Dist. Algorithms, LNCS, Springer-Verlag, October 1991."},{"key":"15_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.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"15_CR5","unstructured":"B. Coan, \u201cEfficient agreement using fault diagnosis,\u201d Proc. 26th Allerton Conf. on Comm., Control and Computing, pp. 663\u2013672, 1988."},{"issue":"No.1","key":"15_CR6","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, \u201cBounds of Information Exchange for Byzantine Agreement,\u201d JACM, Vol. 32, No. 1, pp. 191\u2013204, 1985.","journal-title":"JACM"},{"key":"15_CR7","unstructured":"D. Dolev, R. Reischuk and H.R. Strong, \u201cEventual is Earlier than Immediate,\u201d in Proc. 23rd STOC, 1982. Revised version appears in \u201cEarly Stopping in Byzantine Agreement,\u201d JACM, Vol. 37, No. 4 (1990), pp. 720\u2013741."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"D. Dolev and H.R. Strong, \u201cAuthenticated Algorithms for Byzantine Agreement,\u201d in SIAM Journal of Computing, Vol. 12, pp. 656\u2013666, 1983.","journal-title":"SIAM Journal of Computing"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \u201cOptimal Algorithms for Byzantine Agreement\u201d, Proc. 20th STOC, pp. 148\u2013161, May 1988.","DOI":"10.1145\/62212.62225"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"V. Hadzilacos and J. Halpern, \u201cMessage-Optimal Protocols for Byzantine Agreement,\u201d Proc. 10th PODC, pp. 309\u2013324, August 1991.","DOI":"10.1145\/112600.112626"},{"issue":"No.3","key":"15_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"},{"key":"15_CR12","unstructured":"L. Lamport and M. Fischer, Byzantine Generals and Transaction Commit Protocols, Opus 62, SRI International, April 1982."},{"issue":"No.3","key":"15_CR13","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"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Y. Moses and O. Waarts, \u201cCoordinated Traversal: (t+1)-Round Byzantine Agreement in Polynomial Time,\u201d Proc. 29th FOCS, pp. 246\u2013255, October 1988.","DOI":"10.1109\/SFCS.1988.21941"},{"issue":"No.3","key":"15_CR15","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"K.J. Perry and S. Toueg, \u201cDistributed agreement in the presence of processor and communication faults,\u201d IEEE Trans. on Software Engineering, Vol. 12, No. 3, pp. 477\u2013482, March 1986.","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"No.3","key":"15_CR16","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, \u201cFast Distributed Agreement,\u201d SLAM Journal of Computing, Vol. 16, No. 3, pp. 445\u2013457, June 1987.","journal-title":"SLAM Journal of Computing"},{"key":"15_CR17","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\/3-540-56188-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:01:56Z","timestamp":1578528116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_15"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}