{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:12:59Z","timestamp":1765231979752},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T00:00:00Z","timestamp":1331078400000},"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":[[2012,10]]},"DOI":"10.1007\/s00446-012-0162-z","type":"journal-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T06:37:34Z","timestamp":1331015854000},"page":"371-381","source":"Crossref","is-referenced-by-count":28,"title":["The correctness proof of Ben-Or\u2019s randomized consensus algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Marcos K.","family":"Aguilera","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,7]]},"reference":[{"issue":"5","key":"162_CR1","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/1411509.1411510","volume":"55","author":"H. Attiya","year":"2008","unstructured":"Attiya H., Censor K.: Tight bounds for asynchronous randomized consensus. J. ACM 55(5), 20:1\u201320:26 (2008)","journal-title":"J. ACM"},{"issue":"8","key":"162_CR2","doi-asserted-by":"crossref","first-page":"3885","DOI":"10.1137\/090751906","volume":"39","author":"H. Attiya","year":"2010","unstructured":"Attiya H., Censor-Hillel K.: Lower bounds for randomized consensus under a weak adversary. SIAM J. Comput. 39(8), 3885\u20133904 (2010)","journal-title":"SIAM J. Comput."},{"key":"162_CR3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"Aspnes J., Herlihy M.: Fast randomized consensus using shared memory. Journal of Algorithms 11, 441\u2013461 (1990)","journal-title":"Journal of Algorithms"},{"issue":"2\u20133","key":"162_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J. Aspnes","year":"2003","unstructured":"Aspnes J.: Randomized protocols for asynchronous consensus. Distrib. Comput. 16(2\u20133), 165\u2013175 (2003)","journal-title":"Distrib. Comput."},{"key":"162_CR5","doi-asserted-by":"crossref","unstructured":"Aspnes, J.: Randomized consensus in expected O(n 2) total work using single-writer registers. In: International Symposium on Distributed Computing, pp. 263\u2013273 (2011)","DOI":"10.1007\/978-3-642-24100-0_36"},{"key":"162_CR6","unstructured":"Aguilera, M.K., Toueg, S.: Correctness proof of Ben-Or\u2019s randomized consensus algorithm. Technical report TR98-1682, Department of Computer Science, Cornell University, Ithaca, NY 14853 (1998)"},{"key":"162_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya H., Welch J.: Distributed Computing, 2nd edn. Wiley, Hoboken (2004)","edition":"2"},{"key":"162_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"162_CR9","doi-asserted-by":"crossref","unstructured":"Bracha, G., Rachman, O.: Randomized consensus in expected O(n 2 log n operations. In: International Workshop on Distributed Algorithms, pp. 143\u2013150 (1991))","DOI":"10.1007\/BFb0022443"},{"key":"162_CR10","first-page":"443","volume":"4","author":"B. Chor","year":"1989","unstructured":"Chor B., Dwork C.: Randomization in Byzantine agreement. Adv. Comput. Res. 4, 443\u2013497 (1989)","journal-title":"Adv. Comput. Res."},{"issue":"2","key":"162_CR11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A., Paterson M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"162_CR12","doi-asserted-by":"crossref","unstructured":"Golab, W.M., Higham, L., Woelfel, P.: Linearizable implementations do not suffice for randomized distributed computation. In: ACM Symposium on Theory of Computing, pp. 373\u2013382 (2011)","DOI":"10.1145\/1993636.1993687"},{"key":"162_CR13","unstructured":"Hadzilacos, V.: Lecture notes. Unpublished manuscript (1991)"},{"key":"162_CR14","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc, San Fransisco (1996)"},{"key":"162_CR15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv 22, 299\u2013319 (1990)","journal-title":"ACM Comput. Surv"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0162-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0162-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0162-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:43:24Z","timestamp":1561423404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0162-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,7]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0162-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,7]]}}}