{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T05:52:16Z","timestamp":1673502736555},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"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":[[2005,3]]},"DOI":"10.1007\/s00446-004-0113-4","type":"journal-article","created":{"date-parts":[[2005,3,22]],"date-time":"2005-03-22T01:29:43Z","timestamp":1111454983000},"page":"191-207","source":"Crossref","is-referenced-by-count":12,"title":["Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler"],"prefix":"10.1007","volume":"17","author":[{"given":"Yonatan","family":"Aumann","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson K: On achieving consensus using shared memory. In: Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing (PODC), 1988, pp 291-302","DOI":"10.1145\/62546.62594"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/278298.278304","volume":"45","author":"Aspnes","year":"3","unstructured":"Aspnes J: Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM 45(3):415-450 (1998)","journal-title":"Journal of the ACM"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Aspnes J: Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3):165-175 (2003)","DOI":"10.1007\/s00446-002-0081-5"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"Aspnes","year":"3","unstructured":"Aspnes J, Herlihy M: Fast randomized consensus using shared memory. Journal of Algorithms 11(3):441-461 (1990)","journal-title":"Journal of Algorithms"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1137\/S0097539792240881","volume":"25","author":"Aspnes","year":"5","unstructured":"Aspnes J, Waarts O: Randomized consensus in expected $O(N\\log^2N)$ operations per processor. SIAM Journal on Computing 25(5):1024-1044 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Attiya H, Lynch N, Shavit N: Are wait-free algorithms fast? In: Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), 1990, pp 55-64","DOI":"10.1109\/FSCS.1990.89524"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Aumann Y: Efficient asynchronous consensus with the weak adversary scheduler. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC), 1997, pp 209-218","DOI":"10.1145\/259380.259441"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Aumann Y, Bender MA: Efficient asynchronous consensus with the value-oblivious adversary scheduler. In: Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), 1996, pp 622-633","DOI":"10.1007\/3-540-61440-0_164"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1997.2653","volume":"139","author":"Aumann","year":"1","unstructured":"Aumann Y, Bender MA, Zhang L: Efficient execution of nondeterministic parallel programs on asynchronous systems. Information and Computation 139(1):1-16 (1997)","journal-title":"Information and Computation"},{"key":"CR10","unstructured":"Aumann Y, Kapah-Levy A: Cooperative sharing and asynchronous consensus using single-reader single-writer registers. In: Proceedings of the 10th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), 1999, pp 61-70"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)90162-7","volume":"128","author":"Aumann","year":"1994","unstructured":"Aumann Y, Rabin MO: Clock construction in fully asynchronous parallel systems and pram simulation. Theoretical Computer Science 128:3-30 (1994)","journal-title":"Theoretical Computer Science"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Ben-Or M: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the second annual ACM symposium on Principles of distributed computing, 1983, pp 27-30","DOI":"10.1145\/800221.806707"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Bracha G, Rachman O: Randomized consensus in expected ${O}(n^2\\log n)$ operations. In: Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), vol. 579 of Lecture Notes in Computer Science, 1991, pp 143-150","DOI":"10.1007\/BFb0022443"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Chandra TD: Polylog randomized wait-free consenus. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (PODC), 1996, pp 166-175","DOI":"10.1145\/248052.248083"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1137\/S0097539790192635","volume":"23","author":"Chor","year":"4","unstructured":"Chor, B, Israeli A, Li M: Wait-free consensus using asynchronous hardware. SIAM Journal of Computing 23(4):701-712 (1994)","journal-title":"SIAM Journal of Computing"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"Dolev","year":"1","unstructured":"Dolev D, Dwork S, Stockmeyer L: On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1):77-97 (1987)","journal-title":"Journal of the ACM"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"Dwork","year":"6","unstructured":"Dwork C, Herlihy M, Waarts O: Contention in shared memory algorithms. Journal of the ACM 44(6):779-805 (1997)","journal-title":"Journal of the ACM"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0219032","volume":"19","author":"Dwork","year":"3","unstructured":"Dwork C, Shmoys D, Stockmeyer L: Flipping persuasively in constant time. SIAM Journal of Computing 19(3):472-499 (1990)","journal-title":"SIAM Journal of Computing"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"Fischer","year":"2","unstructured":"Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed commit with one faulty process. Journal of the ACM 32(2):374-382 (1985)","journal-title":"Journal of the ACM"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"Herlihy","year":"1","unstructured":"Herlihy M: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1):124-149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"CR21","first-page":"163","volume":"4","author":"Loui","year":"1987","unstructured":"Loui M, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4:163-183 (1987)","journal-title":"Advances in Computing Research"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Martel C, Park A, Subramonian R: Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In: Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), 1990, pp 590-599","DOI":"10.1109\/FSCS.1990.89580"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Rabin MO: Randomized Byzantine generals. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS), 1983, pp 403-409","DOI":"10.1109\/SFCS.1983.48"},{"key":"CR24","unstructured":"Saks M, Shavit N, Woll H: Optimal time randomized consensus - making resilient algorithms fast in practice. In: Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), 1991, pp 351-362"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0113-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-004-0113-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0113-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T11:55:55Z","timestamp":1586174155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-004-0113-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s00446-004-0113-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}