{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:08:02Z","timestamp":1774415282762,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0890-5401(92)90035-e","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"205-233","source":"Crossref","is-referenced-by-count":53,"title":["Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement"],"prefix":"10.1016","volume":"97","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Dwork","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Raymond Strong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90035-E_BIB1","series-title":"Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing","first-page":"42","article-title":"Shifting gears: Changing algorithms on the fly to expedite byzantine agreement","author":"Bar-Noy","year":"1987"},{"key":"10.1016\/0890-5401(92)90035-E_BIB2","series-title":"Proceedings of the Thirtieth Symposium on Foundations of Computer Science","first-page":"410","article-title":"Towards optimal distributed consensus","author":"Berman","year":"1989"},{"key":"10.1016\/0890-5401(92)90035-E_BIB3","author":"Berman","year":"1989"},{"key":"10.1016\/0890-5401(92)90035-E_BIB4","series-title":"Proceedings of the Fifth ACM Symposium on Principles of Distributed Computing","first-page":"63","article-title":"A communication-efficient canonical form for fault-tolerant distributed protocols","author":"Coan","year":"1986"},{"key":"10.1016\/0890-5401(92)90035-E_BIB5","article-title":"Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations","author":"Coan","year":"1987"},{"key":"10.1016\/0890-5401(92)90035-E_BIB6","series-title":"Proceedings of the Eight ACM Symposium on Principles of Distributed Computing","first-page":"295","article-title":"Modular construction of nearly optimal byzantine agreement protocols","author":"Coan","year":"1989"},{"key":"10.1016\/0890-5401(92)90035-E_BIB7_1","author":"Dolev","year":"1986","journal-title":"Early Stopping in Byzantine Agreement"},{"issue":"No. 7","key":"10.1016\/0890-5401(92)90035-E_BIB7_2","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"34","author":"Dolev","year":"1990","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(92)90035-E_BIB8","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithms for Byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(92)90035-E_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","article-title":"A lower bound for the time to assure interactive consistency","volume":"14","author":"Fischer","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(92)90035-E_BIB10","series-title":"Proceedings of the 29th Symposium on Foundations of Computer Science","first-page":"246","article-title":"(t+1)-round Byzantine agreement in polynomial time","author":"Moses","year":"1988"},{"key":"10.1016\/0890-5401(92)90035-E_BIB11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(92)90035-E_BIB12","unstructured":"Waarts, O., private communication."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290035E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290035E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:24:59Z","timestamp":1549045499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290035E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["089054019290035E"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90035-e","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}