{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:30Z","timestamp":1759637790969},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020431","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"156-163","source":"Crossref","is-referenced-by-count":6,"title":["Anomalies in the wait-free hierarchy"],"prefix":"10.1007","author":[{"given":"Ophir","family":"Rachman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"12_CR1","unstructured":"Y. Afek and G. Stupp, \u201cSynchronization Power Depends on the Register Size,\u201d the 34th Annual IEEE Conference on Foundations of Computer Science, November 1993."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, E. Weisberger and H. Weisman, \u201cA Completeness Theorem for a Class of Synchronization Objects,\u201d the 12th ACM Symposium on Principles of Distributed Computing, August 1993, pp. 159\u2013170.","DOI":"10.1145\/164051.164071"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. P. Herlihy, \u201cWait-Free Data Structures in the Asynchronous PRAM Model,\u201d proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 340\u2013349.","DOI":"10.1145\/97444.97701"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"H. Attiya, N. A. Lynch and N. Shavit, \u201cAre wait-free algorithms fast?\u201d proceedings of the 31st IEEE Symposium on Foundations of Computer Science 1990, pp. 55\u201364.","DOI":"10.1109\/FSCS.1990.89524"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"E. Borowsky, E. Gafni, \u201cGeneralized FLP Impossibility Result for t-resilient Asynchronous Computations,\u201d Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.","DOI":"10.1145\/167088.167119"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"E. Borowsky, E. Gafni, Y. Afek \u201cConsensus Power Makes (Some) Sense!,\u201d to appear in the proceedings of the 13th ACM Symposium on Principles of Distributed Computing, 1994.","DOI":"10.1145\/197917.198126"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, \u201cAgreement is Harder Than Consensus: Set Consensus Problems in Totally Asynchronous Systems,\u201d proceedings of the 9th ACM Symposium on Principles of Distributed Computing, August 1990, pp. 311\u2013324.","DOI":"10.1145\/93385.93431"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li, On processor coordination using asynchronous hardware, Proc. of the 6th ACM Symp. on Principles of Distributed Computing, August 1987, pp. 86\u201397.","DOI":"10.1145\/41840.41848"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"R. Cory, S. Moran, \u201cExotic Behavior of Consensus Numbers,\u201d to appear in the proceedings of the 8th International Workshop on Distributed Algorithms, 1994.","DOI":"10.1007\/BFb0020427"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. A. Lynch and M. S. Peterson, Impossibility of distributed commit with one faulty process, Journal of ACM, 32(2), April 1985, pp. 374\u2013382.","journal-title":"Journal of ACM"},{"issue":"No.1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. P. Herlihy","year":"1991","unstructured":"M. P. Herlihy, \u201cWait-free synchronization,\u201d ACM Transactions on Programming Languages and Systems, Vol. 13, No. 1 (Jan. 1991), pp. 124\u2013149.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy and N. Shavit, \u201cThe Asynchronous Computability Theorem for t-resilient Tasks,\u201d Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.","DOI":"10.1145\/167088.167125"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"P. Jayanti, \u201cOn the Robustness of Herlihy's Hierarchy,\u201d Proc. of the 12th ACM Symp. on Principles of Distributed Computing, August 1993, pp. 145\u2013158.","DOI":"10.21236\/ADA264351"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg and S. Mullainathan, \u201cResource Bounds and Combinations of Consensus Objects,\u201d Proc. of the 12th ACM Symp. on Principles of Distributed Computing, August 1993, pp. 133\u2013144.","DOI":"10.1145\/164051.164069"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"G. Neiger, \u201cSet-Linearizability and Obliviousness: Foundations of the Study of Asynchronous Computability,\u201d to appear in the proceedings of the 13th ACM Symposium on Principles of Distributed Computing, 1994.","DOI":"10.1145\/197917.198176"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"G. L. Peterson, R. A. Bazzi, G. Neiger, \u201cA Gap Theorem for Consensus Types,\u201d to appear in the proceedings of the 13th ACM Symposium on Principles of Distributed Computing, 1994.","DOI":"10.1145\/197917.198123"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"M. Saks, F. Zaharoglou, \u201cWait-Free k-set Agreement is Impossible: The Topology of Public Knowledge,\u201d Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.","DOI":"10.1145\/167088.167122"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:45:54Z","timestamp":1586551554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0020431","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}