{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:15Z","timestamp":1725795855174},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_1","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Sporadic Solutions to Zero-One Exclusion Tasks"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an Asynchronous Environment. Journal of the ACM (July 1990)","DOI":"10.1145\/79147.79158"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/2484239.2484251","volume-title":"Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013","author":"H. Attiya","year":"2013","unstructured":"Attiya, H., Casta\u00f1eda, A., Herlihy, M., Paz, A.: Upper bound on the complexity of solving hard renaming. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 190\u2013199. ACM, New York (2013)"},{"key":"1_CR3","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: the lower bound. Distributed Computing\u00a022, 287\u2013301 (2010), 10.1007\/s00446-010-0108-2"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement Is Harder Than Consensus: Set Consensus Problems in totally asynchronous systems. In: Proceedings of The Ninth Annual ACM Symosium on Principles of Distributed Computing, pp. 311\u2013234 (August 1990)","DOI":"10.1145\/93385.93431"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-92221-6_17","volume-title":"Proceedings of the 12th International Conference on Principles of Distributed Systems","author":"E. Gafni","year":"2008","unstructured":"Gafni, E.: The 0\u20141-exclusion families of tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 246\u2013258. Springer, Heidelberg (2008)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.P.: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier Science (2013)","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"issue":"6","key":"1_CR9","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"1_CR10","unstructured":"Kozlov, D.N.: Weak symmetry breaking and abstract simplex paths (2013) (preprint)"},{"key":"1_CR11","unstructured":"Munkres, J.: Elements of Algebraic Topology, 2nd edn. Prentice Hall (January 1984)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:17:00Z","timestamp":1558923420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}