{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:08:27Z","timestamp":1775254107935,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030032319","type":"print"},{"value":"9783030032326","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_18","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"269-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Set Agreement and Renaming in the Presence of Contention-Related Crash Failures"],"prefix":"10.1007","author":[{"given":"Ana\u00efs","family":"Durand","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1145\/177492.177731","volume":"16","author":"Y Afek","year":"1994","unstructured":"Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, S.: A bounded first-in, first-enabled solution to the $$\\ell $$-exclusion problem. ACM Trans. Program. Lang. Syst. 16(3), 939\u2013953 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"J Anderson","year":"1994","unstructured":"Anderson, J.: Multi-writer composite registers. Distrib. Comput. 7(4), 175\u2013195 (1994)","journal-title":"Distrib. Comput."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn, p. 414. Wiley-Interscience, Hoboken (2004). ISBN 0-471-45324-2","edition":"2"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility results for $$t$$-resilient asynchronous computations. In: Proceedings of 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Casta\u00f1eda","year":"2011","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Comput. Sci. Rev. 5, 229\u2013251 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure (Preliminary Report). In: Proceedings of 20th IEEE Symposium on Foundations Of Computer Science (FOCS 1979), pp. 234\u2013254. IEEE Press (1979)","DOI":"10.1109\/SFCS.1979.37"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","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":"18_CR11","doi-asserted-by":"crossref","unstructured":"Guerraoui, R.: Indulgent algorithms. In: Proceedings of 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 289\u2013297. ACM Press (2000)","DOI":"10.1145\/343477.343630"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TC.2004.1268403","volume":"53","author":"R Guerraoui","year":"2004","unstructured":"Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Trans. Comput. 53(4), 453\u2013466 (2004)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"18_CR13","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"MP Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"18_CR15","first-page":"163","volume":"4","author":"M Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987)","journal-title":"Adv. Comput. Res."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent Programming: Algorithms, Principles and Foundations","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, p. 515. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9 . ISBN 978-3-642-32026-2"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-tolerant message-passing distributed systems: an algorithmic approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-tolerant message-passing distributed systems: an algorithmic approach, p. 550. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7 . ISBN 978-3-319-94140-0"},{"issue":"5","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free $$k$$-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","first-page":"423","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Pearson Education\/Prentice Hall, Upper Saddle River (2006). ISBN 0-131-97259-6"},{"key":"18_CR20","unstructured":"Taubenfeld, G.: Weak failures: definition, algorithms, and impossibility results. In: Proceedings of 6th International Conference on Networked Systems (NETYS 2018). LNCS, p. 15. Springer, Heidelberg (2018)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:49:28Z","timestamp":1775249368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}