{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:04Z","timestamp":1749825844657},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0196-6774(90)90019-b","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"374-419","source":"Crossref","is-referenced-by-count":71,"title":["Automatically increasing the fault-tolerance of distributed algorithms"],"prefix":"10.1016","volume":"11","author":[{"given":"Gil","family":"Neiger","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 6","key":"10.1016\/0196-6774(90)90019-B_BIB1","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/TSE.1985.232247","article-title":"Streets of Byzantium: Network architectures for fast reliable broadcasts","volume":"11","author":"Babao\u01e7lu","year":"1985","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0196-6774(90)90019-B_BIB2","series-title":"Proceedings, Second ACM Symposium on Principles of Distributed Computing","first-page":"27","article-title":"Another advantage of free choice: Completely asynchronous agreement protocols","author":"Ben-Or","year":"1983"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","article-title":"Asynchronous Byzantine agreement protocols","volume":"75","author":"Bracha","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0196-6774(90)90019-B_BIB4","series-title":"Proceedings, 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\/0196-6774(90)90019-B_BIB5","article-title":"Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations","author":"Coan","year":"1987"},{"issue":"No. 12","key":"10.1016\/0196-6774(90)90019-B_BIB6","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/12.9732","article-title":"A compiler that increases the fault-tolerance of asynchronous protocols","volume":"37","author":"Coan","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(90)90019-B_BIB7","series-title":"Proceedings, Fifteenth International Symposium on Fault-Tolerant Computing","first-page":"200","article-title":"Atomic broadcast: From simple message diffusion to Byzantine agreement","author":"Cristian","year":"1985"},{"issue":"No. 1","key":"10.1016\/0196-6774(90)90019-B_BIB8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","article-title":"The Byzantine generals strike again","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90019-B_BIB9","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."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB10","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","article-title":"Consensus in the presence of partial synchrony","volume":"35","author":"Dwork","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(90)90019-B_BIB12","article-title":"Issues of Fault Tolerance in Concurrent Computations","author":"Hadzilacos","year":"1985"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01667081","article-title":"Connectivity requirements for Byzantine agreement under restricted types of failures","volume":"2","author":"Hadzilacos","year":"1987","journal-title":"Distrib. Comput."},{"key":"10.1016\/0196-6774(90)90019-B_BIB14","series-title":"Proceedings, Sixth ACM Symposium on Principles of Database Systems","first-page":"129","article-title":"A knowledge theoretic analysis of atomic commitment protocols (preliminary report)","author":"Hadzilacos","year":"1987"},{"key":"10.1016\/0196-6774(90)90019-B_BIB15","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Programming Lang. Systems"},{"issue":"No. 1","key":"10.1016\/0196-6774(90)90019-B_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01762112","article-title":"Programming simultaneous actions using common knowledge","volume":"3","author":"Moses","year":"1988","journal-title":"Algorithmica"},{"issue":"No. 3","key":"10.1016\/0196-6774(90)90019-B_BIB17","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","article-title":"Distributed agreement in the presence of processor and communication faults","volume":"12","author":"Perry","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0196-6774(90)90019-B_BIB18","series-title":"Proceedings, Twenty-fourth IEEE Symposium on Foundations of Computer Science","first-page":"403","article-title":"Randomized Byzantine generals","author":"Rabin","year":"1983"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB19","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and Public-Key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/0196-6774(90)90019-B_BIB20","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/357369.357371","article-title":"Fail-stop processors: An approach to designing fault-tolerant computing systems","volume":"1","author":"Schlichting","year":"1983","journal-title":"ACM Trans. Comput. Systems"},{"issue":"No. 3","key":"10.1016\/0196-6774(90)90019-B_BIB21","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1145\/28869.28876","article-title":"Optimal clock synchronization","volume":"34","author":"Srikanth","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90019-B_BIB22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","article-title":"Simulating authenticated broadcasts to derive simple fault-tolerant algorithms","volume":"2","author":"Srikanth","year":"1987","journal-title":"Distrib. Comput."},{"key":"10.1016\/0196-6774(90)90019-B_BIB23","series-title":"Proceedings, Third ACM Symposium on Principles of Distributed Computing","first-page":"163","article-title":"Randomized Byzantine agreements","author":"Toueg","year":"1984"},{"issue":"No. 3","key":"10.1016\/0196-6774(90)90019-B_BIB24","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","article-title":"Fast distributed agreement","volume":"16","author":"Toueg","year":"1987","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090019B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090019B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:04Z","timestamp":1548744844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749090019B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["019667749090019B"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90019-b","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}