{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:51:17Z","timestamp":1648921877334},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,2]],"date-time":"2012-09-02T00:00:00Z","timestamp":1346544000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s00446-012-0177-5","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T16:42:24Z","timestamp":1346517744000},"page":"411-425","source":"Crossref","is-referenced-by-count":1,"title":["Renaming and the weakest family of failure detectors"],"prefix":"10.1007","volume":"25","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Israel","family":"Nir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,2]]},"reference":[{"key":"177_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Nir, I.: Failure detectors in loosely named systems. In: PODC, pp. 65\u201374 (2008)","DOI":"10.1145\/1400751.1400762"},{"issue":"3","key":"177_CR2","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, B., Dolev, D., Peleg, D., Reischuk, R., et al.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"177_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fouren, A.: Polynomial and adaptive long-lived (2k\u20131) renaming. In: DISC, pp. 149\u2013163 (2000)","DOI":"10.1007\/3-540-40026-5_10"},{"issue":"4","key":"177_CR4","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/S0097539797330689","volume":"31","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286\u20131313 (2002)","journal-title":"SIAM J. Comput."},{"key":"177_CR5","volume-title":"Distributed Computing. Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, New York (1998)"},{"key":"177_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for $$t$$ -resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press, New york (1993)","DOI":"10.1145\/167088.167119"},{"key":"177_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","DOI":"10.1007\/PL00008933"},{"key":"177_CR8","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: PODC, pp. 295\u2013304 (2008)","DOI":"10.1145\/1400751.1400791"},{"issue":"5\u20136","key":"177_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","volume":"52","author":"A Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda, A.: New combinatorial topology upper and lower bounds for renaming: the lower bound. Distrib. Comput. 52(5\u20136), 287\u2013301 (2010)","journal-title":"Distrib. Comput."},{"key":"177_CR10","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A.,. Rajsbaum, S. : New combinatorial topology upper and lower bounds for renaming: the upper bound. J. ACM 59(1), 3:1\u20133:49 (2012)","DOI":"10.1145\/2108242.2108245"},{"issue":"4","key":"177_CR11","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"177_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"177_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: PODC, pp. 311\u2013324 (1990)","DOI":"10.1145\/93385.93431"},{"issue":"2","key":"177_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"177_CR15","doi-asserted-by":"crossref","unstructured":"Gafni E.: Renaming with k-set-consensus: an optimal algorithm into $$n + k - 1$$ slots. In: OPODIS, pp. 36\u201344 (2006)","DOI":"10.1007\/11945529_4"},{"issue":"3\u20134","key":"177_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00446-011-0142-8","volume":"24","author":"E Gafni","year":"2011","unstructured":"Gafni, E., Kuznetsov, P.: On set consensus numbers. Distrib. Comput. 24(3\u20134), 149\u2013163 (2011)","journal-title":"Distrib. Comput."},{"key":"177_CR17","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1016\/j.tcs.2008.05.016","volume":"410","author":"E Gafni","year":"2009","unstructured":"Gafni, E., Most\u00e9faoui, A., Raynal, M., Travers, C.: From adaptive renaming to set agreement. Theor. Comput. Sci. 410, 1328\u20131335 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"177_CR18","doi-asserted-by":"crossref","unstructured":"Gafni E., Rajsbaum S.: Distributed programming with tasks. In: OPODIS, pp. 205\u2013218 (2010)","DOI":"10.1007\/978-3-642-17653-1_17"},{"key":"177_CR19","doi-asserted-by":"crossref","unstructured":"Gafni E., Rajsbaum S., Herlihy, M.: Subconsensus tasks: renaming is weaker than set agreement. In: DISC, pp. 329\u2013338 (2006)","DOI":"10.1007\/11864219_23"},{"key":"177_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jcd.3180030404","volume":"3","author":"DM Gordon","year":"1995","unstructured":"Gordon, D.M., Kuperberg, G., Patashnik, O.: New constructions for covering designs. J. Combin. Des. 3, 269\u2013284 (1995)","journal-title":"J. Combin. Des."},{"issue":"1","key":"177_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"177_CR22","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1017\/S0960129500003170","volume":"10","author":"M Herlihy","year":"2000","unstructured":"Herlihy, M., Rajsbaum, S.: Algebraic spans. Math. Struct. Comput. Sci. 10(4), 549\u2013573 (2000)","journal-title":"Math. Struct. Comput. Sci."},{"key":"177_CR23","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for $$t$$ -resilient tasks. In: STOC, pp. 111\u2013120 (1993)","DOI":"10.1145\/167088.167125"},{"issue":"2","key":"177_CR24","doi-asserted-by":"crossref","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 46(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"177_CR25","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: PODC, pp. 75\u201384 (2008)","DOI":"10.1145\/1400751.1400763"},{"key":"177_CR26","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13, 383\u2013390 (1975)","journal-title":"Discret. Math."},{"key":"177_CR27","unstructured":"Raynal, M.: $$K$$ -anti-Omega, August 2007. Rump session at PODC (2007)"},{"key":"177_CR28","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-free $$k$$ -set agreement is impossible: the topology of public knowledge. In: STOC, pp. 101\u2013110. ACM Press, New York (1993)","DOI":"10.1145\/167088.167122"},{"key":"177_CR29","unstructured":"Sch\u00f6nheim, J.: On coverings. Pac. J. Math. 14, 1405\u20131411 (1964)"},{"key":"177_CR30","doi-asserted-by":"crossref","unstructured":"Zielinski, P.: Automatic classification of eventual failure detectors. In: DISC, pp. 465\u2013479 (2007)","DOI":"10.1007\/978-3-540-75142-7_35"},{"issue":"5\u20136","key":"177_CR31","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00446-010-0101-9","volume":"22","author":"P Zieli\u0144ski","year":"2010","unstructured":"Zieli\u0144ski, P.: Anti- omega: the weakest failure detector for set agreement. Distrib. Comput. 22(5\u20136), 335\u2013348 (2010)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0177-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0177-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0177-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T05:03:30Z","timestamp":1562130210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0177-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,2]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0177-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,2]]}}}