{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T10:29:10Z","timestamp":1707474550665},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf02277668","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T12:44:56Z","timestamp":1138193096000},"page":"219-226","source":"Crossref","is-referenced-by-count":11,"title":["A self-adjusting algorithm for byzantine agreement"],"prefix":"10.1007","volume":"5","author":[{"given":"Yi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farokh B.","family":"Bastani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02277668_CR1","unstructured":"Burns J, Gouda M, Miller R: Stabilization and pseudo-stabilization. Technical Report TR-90-13, Department of Computer Sciences, University of Texas at Austin, May 1990"},{"issue":"6","key":"BF02277668_CR2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TSE.1985.232245","volume":"11","author":"B Chor","year":"1985","unstructured":"Chor B, Coan BA: A simple and efficient randomized byzantine agreement algorithm. IEEE trans software Eng SE-11 (6):531\u2013539 (1985)","journal-title":"IEEE trans software Eng"},{"issue":"11","key":"BF02277668_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra EW: Self-stabilizing system in spite of distributed control. CACM 17 (11):643\u2013644 (1974). Also as EWD391 Dijkstra EW: Selected writings on computing: a personal perspective. Springer, Berlin Heidelberg New York 1982, 41\u201346","journal-title":"CACM"},{"key":"BF02277668_CR4","doi-asserted-by":"crossref","unstructured":"Coan BA: A communication-efficient canonical form for fault-tolerant distributed protocols. Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing pp 63\u201371, 1986","DOI":"10.1145\/10590.10596"},{"issue":"1","key":"BF02277668_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev D: The byzantine generals strike again. J Algorithms 3 (1):14\u201330 (1982)","journal-title":"J Algorithms"},{"issue":"3","key":"BF02277668_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D Dolev","year":"1982","unstructured":"Dolev D, Fisher, MJ, Fowler R, Lynch NA, Strong HR: An efficient algorithm for Byzantine Agreement without authentication. Inf Cont 52 (3):257\u2013274 (1982)","journal-title":"Inf Cont"},{"key":"BF02277668_CR7","doi-asserted-by":"crossref","unstructured":"Dolev D, Strong HR: Polynomial algorithms for multiple processor agreement. Proceedings of the 14th Annual ACM Symposium on Theory Computing pp 401\u2013407, 1982","DOI":"10.1145\/800070.802215"},{"key":"BF02277668_CR8","series-title":"Technique Report RJ 3418","volume-title":"Requirements for agreement in a distributed system","author":"D Dolev","year":"1982","unstructured":"Dolev D, Strong HR: Requirements for agreement in a distributed system. Technique Report RJ 3418, IBM Research Laboratory, San Jose, CA 1982"},{"key":"BF02277668_CR9","doi-asserted-by":"crossref","unstructured":"Dolev D, Reischuk R, Strong HR: Eventual is earlier than Immediate. Proceedings of the 23rd Annual IEEE Symposium on Foundation of Computer Science 196\u2013203, 1982","DOI":"10.1109\/SFCS.1982.51"},{"issue":"1","key":"BF02277668_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev D, Reischuk, R: Bounds on information exchanged for Byzantine Agreement. J Assoc Comput Mach 32 (1):191\u2013204 (1985)","journal-title":"J Assoc Comput Mach"},{"issue":"3","key":"BF02277668_CR11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev D, Lynch N, Pinter S, Stark E, Weihl W: Reaching approximate agreement in the presence of faults. J Assoc Comput Mach 33 (3):499\u2013516 (1986)","journal-title":"J Assoc Comput Mach"},{"key":"BF02277668_CR12","doi-asserted-by":"crossref","unstructured":"Fekete A: Asymptotically optimal algorithms for approximate agreement. Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computer pp 73\u201387, 1986","DOI":"10.1145\/10590.10597"},{"issue":"4","key":"BF02277668_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer MJ, Lynch NA: A lower bound for the time to assure interactive consistency. Inf Process Lett 14 (4):183\u2013186 (1982)","journal-title":"Inf Process Lett"},{"key":"BF02277668_CR14","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"3","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M: The byzantine generals problem. ACM Trans Program Lang Syst (3):382\u2013401 (1982)","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF02277668_CR15","doi-asserted-by":"crossref","unstructured":"Lynch NA, Fischer MJ, Fowler RJ: A simple and efficient byzantine generals algorithm. Proceedings of the 2nd IEEE Symposium on Reliability in Distributed Software and Database System pp 46\u201352, 1982","DOI":"10.21236\/ADA113241"},{"key":"BF02277668_CR16","doi-asserted-by":"crossref","unstructured":"Mahaney S, Schneider F: Inexact agreement: accuracy, precision, and graceful degradation. Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing pp 237\u2013249, 1985","DOI":"10.1145\/323596.323618"},{"issue":"2","key":"BF02277668_CR17","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L: Reaching agreement in the presence of faults. JACM, 27 (2):228\u2013234 (1980)","journal-title":"JACM"},{"issue":"6","key":"BF02277668_CR18","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TSE.1985.232246","volume":"11","author":"KJ Perry","year":"1985","unstructured":"Perry KJ: Randomized byzantine agreement. IEEE Trans Software Eng, SE-11 (6):539\u2013546 (1985)","journal-title":"IEEE Trans Software Eng"},{"key":"BF02277668_CR19","doi-asserted-by":"crossref","unstructured":"Rabin M: Randomized byzantine generals. In Proceedings of the 24th Symposium on Foundations of Computer Science pp 403\u2013409, 1983","DOI":"10.1109\/SFCS.1983.48"},{"issue":"2","key":"BF02277668_CR20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"TK Srikanth","year":"1987","unstructured":"Srikanth TK, Toueg S: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib Comput 2 (2):80\u201394 (1987)","journal-title":"Distrib Comput"},{"key":"BF02277668_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin R, Coan B: Extending binary Byzantine Agreement to multivalued Byzantine Agreement. Inf Process Lett 18:73\u201376 (1984)","journal-title":"Inf Process Lett"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02277668.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02277668\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02277668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:41Z","timestamp":1557930521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02277668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF02277668"],"URL":"https:\/\/doi.org\/10.1007\/bf02277668","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}