{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:27:54Z","timestamp":1720625274178},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":423,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1016\/j.entcs.2012.05.003","type":"journal-article","created":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T20:56:50Z","timestamp":1339102610000},"page":"13-27","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing"],"prefix":"10.1016","volume":"283","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.entcs.2012.05.003_br0010","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","article-title":"Renaming in Asynchronous Environment","volume":"37","author":"Attiya","year":"1990","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/j.entcs.2012.05.003_br0020","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/S0097539797330689","article-title":"The Combinatorial Structure of Wait-Free Solvable Tasks","volume":"31","author":"Attiya","year":"2002","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.entcs.2012.05.003_br0030","doi-asserted-by":"crossref","unstructured":"E. Borowsky & E. Gafni. Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. Proceedings of the 25th. Annual ACM Symposium on Theory of Computing, 91\u2013100 (1993).","DOI":"10.1145\/167088.167119"},{"key":"10.1016\/j.entcs.2012.05.003_br0040","doi-asserted-by":"crossref","unstructured":"A. Casta\u00f1eda & S. Rajsbaum. New Combinatorial Topology Upper and Lower Bounds for Renaming. Proceedings of the 27th. Annual ACM Symposium on Principles on Distributed Computing, 295\u2013304 (2008).","DOI":"10.1145\/1400751.1400791"},{"issue":"5","key":"10.1016\/j.entcs.2012.05.003_br0050","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","article-title":"New Combinatorial Topology Upper and Lower Bounds for Renaming: The Lower Bound","volume":"22","author":"Casta\u00f1eda","year":"2010","journal-title":"Distributed Computing"},{"key":"10.1016\/j.entcs.2012.05.003_br0060","unstructured":"Casta\u00f1eda A., Herlihy M. and Rajsbaum S., An Equivariance Theorem with Applications to Renaming. Tech Report #1975, IRISA, Universit\u00e9 de Rennes 1 (France), 2011."},{"key":"10.1016\/j.entcs.2012.05.003_br0070","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/S0021-9800(67)80063-2","article-title":"Simplicial Maps from an Orientable n-Pseudomanifold into Sm with the Octahedral Triangulation","volume":"2","author":"Fan","year":"1967","journal-title":"Journal of Combinatorial Theory"},{"key":"10.1016\/j.entcs.2012.05.003_br0080","doi-asserted-by":"crossref","unstructured":"E. Gafni, S. Rajsbaum & M. Herlihy. Subconsensus Tasks: Renaming is Weaker than Set Agreement. Proceedings of the 20th. International Symposium on Distributed Computing, 329\u2013338 (2006).","DOI":"10.1007\/11864219_23"},{"issue":"3","key":"10.1016\/j.entcs.2012.05.003_br0090","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1137\/S0097539796305766","article-title":"Three-Processor Tasks Are Undecidable","volume":"28","author":"Gafni","year":"1999","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.entcs.2012.05.003_br0100","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1017\/S0960129500003170","article-title":"Algebraic Spans","volume":"10","author":"Herlihy","year":"2000","journal-title":"Mathematical Structures in Computer Science"},{"issue":"6","key":"10.1016\/j.entcs.2012.05.003_br0110","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","article-title":"The Topological Structure of Asynchronous Computability","volume":"46","author":"Herlihy","year":"1999","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/j.entcs.2012.05.003_br0120","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/S0097539701397412","article-title":"Toward a Topological Characterization of Asynchronous Complexity","volume":"36","author":"Hoest","year":"2006","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.entcs.2012.05.003_br0130","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/S0097539796307698","article-title":"Wait-Free k-Set Agreement Is Impossible: The Topology of Public Knowledge","volume":"29","author":"Saks","year":"2000","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T23:24:50Z","timestamp":1542929090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066112000047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":13,"alternative-id":["S1571066112000047"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2012.05.003","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}