{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:12:17Z","timestamp":1757311937302},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601050"},{"type":"electronic","value":"9783540494355"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015245","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:40:23Z","timestamp":1131864023000},"page":"203-217","source":"Crossref","is-referenced-by-count":11,"title":["Algebraic topology and distributed computing a primer"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"3","key":"13_CR1","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":"13_CR2","unstructured":"H. Attiya and S. Rajsbaum. A combinatorial topology framework for wait-free computability. Preprint."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"O. Biran, S. Moran, and S. Zaks. A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proceedings 7th Annual ACM Symposium on Principles of Distributed Computing, pages 263\u2013275, August 1988.","DOI":"10.1145\/62546.62590"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 206\u2013215, May 1993.","DOI":"10.1145\/167088.167119"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"E. Borowsky, E. Gafni, and Y. Afek. Consensus power makes (some) sense! In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 363\u2013373, August 1994.","DOI":"10.1145\/197917.198126"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"T Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 334\u2013343, August 1994.","DOI":"10.1145\/197917.198121"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings 9th Annual ACM Symposium On Principles of Distributed Computing, pages 311\u2013234, August 1990.","DOI":"10.1145\/93385.93431"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, M.P. Herlihy, N. Lynch, and M.R. Tuttle. A tight lower bound for k-set agreement. In Proceedings 34th annual IEEE Symposium on Foundations of Computer Science, pages 206\u2013215, October 1993.","DOI":"10.1109\/SFCS.1993.366866"},{"issue":"2","key":"13_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":"13_CR10","doi-asserted-by":"crossref","unstructured":"E. Gafni and E. Koutsoupias. 3-processor tasks are undecidable. In Proceedings 14th Annual ACM Symposium on Principles of Distributed Computing, August 1995.","DOI":"10.1145\/224964.225009"},{"issue":"1","key":"13_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":"13_CR12","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, August 1994.","DOI":"10.1145\/197917.198119"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and S. Rajsbaum. Algebraic spans. In Proceedings 14th Annual ACM Symposium on Principles of Distributed Computing, August 1995.","DOI":"10.1145\/224964.224975"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 111\u2013120, May 1993.","DOI":"10.1145\/167088.167125"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proceedings 26th Annual ACM Symposium on Theory of Computing, pages 243\u2013252, May 1994.","DOI":"10.1145\/195058.195144"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"P. Jayanti. On the robustness of Herlihy's hierarchy. In Proceedings 12th Annual ACM Symposium on Principles of Distributed Computing, pages 145\u2013158, August 1993.","DOI":"10.21236\/ADA264351"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"J. Kleinberg and S. Mullainathan. Resource bounds and combinations of consensus objects. In Proceedings 12th Annual ACM Symposium on Principles of Distributed Computing, pages 133\u2013145, August 1993.","DOI":"10.1145\/164051.164069"},{"key":"13_CR18","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":"http:\/\/id.crossref.org\/isbn\/0201045869"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"G. Peterson, R. Bazzi, and G. Neiger. A gap theorem for consensus types. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 344\u2013354, August 1994.","DOI":"10.1145\/197917.198123"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 101\u2013110, May 1993.","DOI":"10.1145\/167088.167122"}],"container-title":["Lecture Notes in Computer Science","Computer Science Today"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:49:18Z","timestamp":1586551758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601050","9783540494355"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0015245","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}