{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:18:47Z","timestamp":1736572727649,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056482","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:37:41Z","timestamp":1154248661000},"page":"175-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A wait-free classification of loop agreement tasks"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"15_CR1","volume-title":"Undergraduate Texts In Mathematics","author":"M. A. Armstrong","year":"1983","unstructured":"M. A. Armstrong. Basic Topology. Undergraduate Texts In Mathematics. Springer-Verlag, New York, 1983."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the ACM, 37(3):524\u2013548, July 1990.","journal-title":"Journal of the ACM"},{"key":"15_CR3","unstructured":"E. Borowsky and E. Gafni. Consensus as a form of resilience. private communication."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 1993 ACM Symposium on Theory of Computing, pages 91\u2013100, May 1993.","DOI":"10.1145\/167088.167119"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"T. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Wait-freedom vs. t-resiliency and the robustness of the wait-free hierarchies. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 334\u2013343, 1994.","DOI":"10.1145\/197917.198121"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings Of The Ninth Annual ACM Symposium On Principles of Distributed Computing, pages 311\u2013234, August 1990.","DOI":"10.1145\/93385.93431"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Y. Afek E. Borowsky, E. Gafni. Consensus power makes (some) sense! In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 363\u2013372, August 1994.","DOI":"10.1145\/197917.198126"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"A. Fekete. Asymptotically optimal algorithms for approximate agreement. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pages 73\u201387, August 1986.","DOI":"10.1145\/10590.10597"},{"issue":"2","key":"15_CR9","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. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"E. Gafni and E. Koutsoupias. Three-processor tasks are undecidable. http:\/\/daphne.cs.ucla.edu\/eli\/undec.ps, 1996.","DOI":"10.1145\/224964.225009"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"M.P. Herlihy. Wait-free synchronization. ACM Transactions On Programming Languages And Systems, 13(1):123\u2013149, January 1991.","journal-title":"ACM Transactions On Programming Languages And Systems"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects. Full version of 1994 Herlihy and Rajsbaum PODC paper op. cit.","DOI":"10.1145\/197917.198119"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 324\u2013333, August 1994.","DOI":"10.1145\/197917.198119"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. Algebraic spans. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 90\u201399. ACM, August 1995.","DOI":"10.1145\/224964.224975"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. The decidability of distributed decision task. In Proceedings of the 1997 ACM Symposium on Theory of Computing, pages 589\u2013598, May 1997. Brief announcement in PODC 1996.","DOI":"10.1145\/248052.248110"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 1993 ACM Symposium on Theory of Computing, pages 111\u2013120, May 1993.","DOI":"10.1145\/167088.167125"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proceedings of the 1994 ACM Symposium on Theory of Computing, pages 243\u2013252, May 1994.","DOI":"10.1145\/195058.195144"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"P. Jayanti. On the robustness of herlihy's hierarchy. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 145\u2013158, 1993.","DOI":"10.1145\/164051.164070"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"W-K. Lo and V. Hadzilacos. All of us are smarter than any of us: more on the robustness of the consensus hierarchy. In Proceedings of the 1997 ACM Symposium on Theory of Computing, pages 579\u2013588, 1997.","DOI":"10.1145\/258533.258651"},{"key":"15_CR20","volume-title":"Graduate Texts In Mathematics","author":"W.S. Massey","year":"1977","unstructured":"W.S. Massey. Algebraic Topology: An Introduction. Graduate Texts In Mathematics. Springer-Verlag, New York, 1977."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"S. Moran and L. Rappoport. On the robustness of h m r . In Proceedings of the 10th International Workshop on Distributed Algorithms, pages 344\u2013361. ACM, 1996.","DOI":"10.1007\/3-540-61769-8_22"},{"key":"15_CR22","isbn-type":"print","volume-title":"Elements Of Algebraic Topology","author":"J.R. Munkres","year":"1984","unstructured":"J.R. Munkres. Elements Of Algebraic Topology. Addison Wesley, Reading MA, 1984. ISBN 0-201-04586-9.","ISBN":"https:\/\/id.crossref.org\/isbn\/0201045869"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"G.L. Peterson, R. A. Bazzi, and G. Neiger. A gap theorem for consensus types. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 344\u2013353, 1994.","DOI":"10.1145\/197917.198123"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"O. Rachman. Anomalies in the wait-free hierarchy. In Proceedings of the 8th International Workshop on Distributed Algorithms, pages 156\u2013163, 1994.","DOI":"10.1007\/BFb0020431"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the 1993 ACM Symposium on Theory of Computing, pages 101\u2013110, May 1993.","DOI":"10.1145\/167088.167122"},{"key":"15_CR26","unstructured":"Eric Schenk. Computability and Complexity Results for agreement problems in shared memory systems. PhD thesis, University of Toronto, 1996."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T07:07:13Z","timestamp":1736492833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056482"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0056482","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"2 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}