{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:16Z","timestamp":1742617216918,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_164","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:39:03Z","timestamp":1330292343000},"page":"622-633","source":"Crossref","is-referenced-by-count":6,"title":["Efficient asynchronous consensus with the value-oblivious adversary scheduler"],"prefix":"10.1007","author":[{"given":"Yonatan","family":"Aumann","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. On achieving consensus using shared memory. In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing, pages 291\u2013302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"J. Aspnes. Time-and space-efficient randomized consensus. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pages 325\u2013331, 1990.","DOI":"10.1145\/93385.93433"},{"issue":"3","key":"52_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441\u2013461, September 1990.","journal-title":"Journal of Algorithms"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"J. Aspnes and O. Waarts. Randomized consensus in expected O(nlog2 n) operations per processor. In Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science, pages 137\u2013146, 1992.","DOI":"10.1109\/SFCS.1992.267810"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"H. Attiya, D. Dolev, and N. Shavit. Bounded polynomial randomized consensus. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 281\u2013294, 1989.","DOI":"10.21236\/ADA213808"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"H. Attiya, N. Lynch, and N. Shavit. Are Wait-Free Algorithms Fast? In 31st FOCS, pages55\u201364, 1990.","DOI":"10.21236\/ADA232829"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90162-7","volume":"128","author":"Y. Aumann","year":"1994","unstructured":"Y. Aumann and M.O. Rabin. Clock construction in fully asynchronous parallel systems and pram simulation. Theoretical Computer Science, 128:3\u201330, 1994.","journal-title":"Theoretical Computer Science"},{"key":"52_CR8","unstructured":"G. Bracha and O. Rachman. Randomized consensus in expected O(n 2 log n) operations. In Proceedings of the 5th International Workshop on Distributed algorithms. Springer-Verlag, 1991."},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"T.D. Chandra. Polylog Randomized Wait-Free Consensus. To appear in Proceedings of the 15th PODC, 1996.","DOI":"10.1145\/248052.248083"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and L. Ming. On processor coordination using asynchronous hardware. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pages 86\u201397, 1987.","DOI":"10.1145\/41840.41848"},{"issue":"1","key":"52_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, S. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77\u201397, January 1987.","journal-title":"Journal of the ACM"},{"issue":"2","key":"52_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of ACM"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"M. Herlihy. Impossibility results for asynchronous PRAM. In Proceedings of the 3rd ACM Symposium on the Parallel Architectures and Algorithms, pages 327\u2013336, 1991.","DOI":"10.1145\/113379.113409"},{"issue":"1","key":"52_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124\u2013149, January 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"52_CR15","first-page":"163","volume":"4","author":"M. G. Loui","year":"1987","unstructured":"M. G. Loui and H. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processors. Advances in Computing Research, vol. 4, pages 163\u2013183, 1987.","journal-title":"Advances in Computing Research"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as Good as Synchronous PRAMs. In Proceeding of 31st FOCS, pages 590\u2013599, 1990.","DOI":"10.1109\/FSCS.1990.89580"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"S. Plotkin. Sticky bits and universality of consensus. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 159\u2013176, 1989.","DOI":"10.1145\/72981.72992"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","volume":"25","author":"M.O. Rabin","year":"1982","unstructured":"M.O. Rabin. N-Process mutual exclusion with bounded waiting by 4 log2 N-valued shared variable. Jour. Comp. Sys. Sc., 25:66\u201375, 1982.","journal-title":"Jour. Comp. Sys. Sc."},{"key":"52_CR19","unstructured":"M. Saks, N. Shavit, and H. Woll. Optimal Time Randomized Consensus \u2014 Making Resilient Algorithms Fast in Practice. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 351\u2013362, 1991."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_164.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:18:48Z","timestamp":1742599128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_164","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}