{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:18:20Z","timestamp":1761610700845,"version":"build-2065373602"},"reference-count":24,"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":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"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\/"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1016\/j.entcs.2012.05.004","type":"journal-article","created":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T16:55:59Z","timestamp":1339088159000},"page":"29-51","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["An Introduction to the Topological Theory of Distributed Computing with Safe-consensus"],"prefix":"10.1016","volume":"283","author":[{"given":"Rodolfo","family":"Conde","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2012.05.004_br0010","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","article-title":"Atomic snapshots of shared memory","volume":"40","author":"Afek","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/j.entcs.2012.05.004_br0020","first-page":"111","article-title":"Tight group renaming on groups of size g is equivalent to g-consensus","volume":"vol. 5805","author":"Afek","year":"2009"},{"key":"10.1016\/j.entcs.2012.05.004_br0030","first-page":"58","article-title":"Group renaming","volume":"vol. 5401","author":"Afek","year":"2008"},{"key":"10.1016\/j.entcs.2012.05.004_br0040","series-title":"Combinatorial topology. Vol. 1, 2 and 3","first-page":"650","author":"Alexandrov","year":"1998"},{"year":"1983","series-title":"Basic Topology","author":"Armstrong","key":"10.1016\/j.entcs.2012.05.004_br0050"},{"key":"10.1016\/j.entcs.2012.05.004_br0060","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 J. Comput."},{"key":"10.1016\/j.entcs.2012.05.004_br0070","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","article-title":"A combinatorial characterization of the distributed 1-solvable tasks","volume":"11","author":"Biran","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/j.entcs.2012.05.004_br0080","doi-asserted-by":"crossref","unstructured":"Borowsky, E. and E. Gafni, Generalized flp impossibility result for t-resilient asynchronous computations, in: STOC \u02bc93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (1993), pp. 91\u2013100.","DOI":"10.1145\/167088.167119"},{"key":"10.1016\/j.entcs.2012.05.004_br0090","doi-asserted-by":"crossref","unstructured":"Borowsky, E. and E. Gafni, Immediate atomic snapshots and fast renaming, in: PODC \u02bc93: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing (1993), pp. 41\u201351.","DOI":"10.1145\/164051.164056"},{"key":"10.1016\/j.entcs.2012.05.004_br0100","doi-asserted-by":"crossref","unstructured":"Borowsky, E. and E. Gafni, A simple algorithmically reasoned characterization of wait-free computation (extended abstract), in: PODC \u02bc97: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing (1997), pp. 189\u2013198.","DOI":"10.1145\/259380.259439"},{"key":"10.1016\/j.entcs.2012.05.004_br0110","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.1993.1043","article-title":"More choices allow more faults: set consensus problems in totally asynchronous systems","volume":"105","author":"Chaudhuri","year":"1993","journal-title":"Inf. Comput."},{"key":"10.1016\/j.entcs.2012.05.004_br0120","unstructured":"Conde, R. and S. Rajsbaum, Two normal forms of an iterated snapshot model and their power to solve consensus from safe-consensus (2010), manuscript."},{"key":"10.1016\/j.entcs.2012.05.004_br0130","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/j.entcs.2012.05.004_br0140","first-page":"63","article-title":"Musical benches","volume":"vol. 3724","author":"Gafni","year":"2005"},{"key":"10.1016\/j.entcs.2012.05.004_br0150","first-page":"205","article-title":"Distributed programming with tasks","volume":"vol. 6490","author":"Gafni","year":"2010"},{"key":"10.1016\/j.entcs.2012.05.004_br0160","first-page":"329","article-title":"Subconsensus tasks: Renaming is weaker than set agreement","volume":"vol. 4167","author":"Gafni","year":"2006"},{"key":"10.1016\/j.entcs.2012.05.004_br0170","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0304-3975(01)00396-6","article-title":"A classification of wait-free loop agreement tasks","volume":"291","author":"Herlihy","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2012.05.004_br0180","doi-asserted-by":"crossref","unstructured":"Herlihy, M. and N. Shavit, The asynchronous computability theorem for t-resilient tasks, in: STOC \u02bc93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (1993), pp. 111\u2013120.","DOI":"10.1145\/167088.167125"},{"key":"10.1016\/j.entcs.2012.05.004_br0190","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":"J. ACM"},{"key":"10.1016\/j.entcs.2012.05.004_br0200","first-page":"163","article-title":"Memory requirements for agreement among unreliable asynchronous processes","volume":"vol. 4","author":"Loui","year":"1987"},{"key":"10.1016\/j.entcs.2012.05.004_br0210","first-page":"407","article-title":"Iterated shared memory models","volume":"vol. 6034","author":"Rajsbaum","year":"2010"},{"key":"10.1016\/j.entcs.2012.05.004_br0220","doi-asserted-by":"crossref","unstructured":"Rajsbaum, S., M. Raynal and C. Travers, The iterated restricted immediate snapshot model, in: COCOON \u02bc08: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008), pp. 487\u2013497.","DOI":"10.1007\/978-3-540-69733-6_48"},{"key":"10.1016\/j.entcs.2012.05.004_br0230","doi-asserted-by":"crossref","unstructured":"Saks, M. and F. Zaharoglou, Wait-free k-set agreement is impossible: the topology of public knowledge, in: STOC \u02bc93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (1993), pp. 101\u2013110.","DOI":"10.1145\/167088.167122"},{"key":"10.1016\/j.entcs.2012.05.004_br0240","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 J. Comput."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000059?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000059?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:32Z","timestamp":1761610292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066112000059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":24,"alternative-id":["S1571066112000059"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2012.05.004","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2012,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An Introduction to the Topological Theory of Distributed Computing with Safe-consensus","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.entcs.2012.05.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2012 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}