{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:11Z","timestamp":1725455591359},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022440","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:03:27Z","timestamp":1131843807000},"page":"95-107","source":"Crossref","is-referenced-by-count":2,"title":["Optimal amortized distributed consensus"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiko","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01798957","volume":"4","author":"A. Bar-Noy","year":"1991","unstructured":"A. Bar-Noy and D. Dolev, \u201cConsensus Algorithms with One-Bit Messages,\u201d Distributed Computing, Vol 4, pp. 105\u2013110, 1991.","journal-title":"Distributed Computing"},{"key":"7_CR2","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 ACM Symp. of Principles of Dist. Computing, pp. 42\u201351, 1987.","DOI":"10.1145\/41840.41844"},{"key":"7_CR3","unstructured":"M. Ben-Or and R. El-Yaniv, \u201cInteractive Consistency in Constant Time,\u201d unpublished manuscript."},{"key":"7_CR4","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, 1989.","journal-title":"Proc. ICALP 89"},{"key":"7_CR5","unstructured":"P. Berman, J. A. Garay, and K. J. Perry, \u201cAsymptotically Optimal Early-Stopping Consensus,\u201d IBM Research Report, in preparation."},{"key":"7_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, pp. 191\u2013204, 1985.","journal-title":"JACM"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/SFCS.1982.51","volume":"37","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, R. Reischuk, and H.R. Strong, \u201cEventual is Earlier than Immediate,\u201d Proc. 23rd Symp. on Foundations of Comp. Science, pp.196\u2013203, 1982. Revised version appears under the title, \u201cEarly-Stopping in Byzantine Agreement,\u201d JACM, Vol.37, pp. 720\u2013741, 1990.","journal-title":"Proc. 23rd Symp. on Foundations of Comp. Science"},{"key":"7_CR8","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.A. Lynch, \u201cA Lower Bound for the Time to Assure Interactive Consistency,\u201d Information Processing Letters, Vol. 14, pp.183\u2013186, 1982.","journal-title":"Information Processing Letters"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman, and S. Micali, \u201cOptimal Algorithms for Byzantine Agreement,\u201d Proc. 20th Symposium on Theory of Computing, pp. 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"7_CR10","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, \u201cReaching Agreement in the Presence of Faults,\u201d Journal of the ACM, Vol. 27, pp. 228\u2013234, 1980.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022440.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:48:26Z","timestamp":1607532506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0022440","relation":{},"subject":[]}}