{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:16:09Z","timestamp":1742933769531,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_31","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"377-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Adaptive Renaming under Eventually Limited Contention"],"prefix":"10.1007","author":[{"given":"Damien","family":"Imbs","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"issue":"4","key":"31_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. Journal of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"Journal of the ACM"},{"issue":"3","key":"31_CR2","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. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"key":"31_CR3","first-page":"336","volume-title":"Proc. 20th ACM Symposium on Parallel Architectures and Algorithms (SPAA 2008)","author":"H. Attiya","year":"2008","unstructured":"Attiya, H., Guerraoui, R., Ruppert, E.: Partial Snapshot Objects. In: Proc. 20th ACM Symposium on Parallel Architectures and Algorithms (SPAA 2008), pp. 336\u2013343. ACM Press, New York (2008)"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539795279463","volume":"27","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Rachman, O.: Atomic Snapshots in O(nlogn) Operations. SIAM Journal on Computing\u00a027(2), 319\u2013340 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"31_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.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn., p. 414. Wiley-Interscience, Hoboken (2004)","edition":"2"},{"key":"31_CR6","first-page":"91","volume-title":"Proc. 25th ACM Symposium on Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E., Generalized, F.L.P.: Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"31_CR8","first-page":"295","volume-title":"Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC 2008)","author":"A. Castaneda","year":"2008","unstructured":"Castaneda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 295\u2013304. ACM Press, New York (2008)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11945529_4","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2006","unstructured":"Gafni, E.: Renaming with k-set-consensus: An optimal algorithm into n + k \u2013 1 slots. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 36\u201344. Springer, Heidelberg (2006)"},{"key":"31_CR10","unstructured":"Gafni, E., Guerraoui, R.: Simulating Few by Many (2009) (unpublished manuscript), \nhttp:\/\/www.cs.ucla.edu\/~eli\/eli\/kconc_OnlinePDF.pdf"},{"key":"31_CR11","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0410, 1328\u20131335 (2009)","journal-title":"Theoretical Computer Science"},{"key":"31_CR12","first-page":"93","volume-title":"26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007)","author":"E. Gafni","year":"2007","unstructured":"Gafni, E., Raynal, M., Travers, C.: Test&set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. In: 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), pp. 93\u2013102. IEEE Computer Press, Los Alamitos (2007)"},{"issue":"6","key":"31_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00446-007-0046-9","volume":"20","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M., Kouznetsov, P.: The Weakest Failure Detectors to Boost Obstruction-Freedom. Distributed Computing\u00a020(6), 415\u2013433 (2008)","journal-title":"Distributed Computing"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR15","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free Synchronization: Double-ended Queues as an Example. In: Proc. 23th Int\u2019l IEEE Conference on Distributed Computing Systems (ICDCS 2003), pp. 522\u2013529 (2003)"},{"issue":"6","key":"31_CR16","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"3","key":"31_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04355-0_16","volume-title":"Distributed Computing","author":"D. Imbs","year":"2009","unstructured":"Imbs, D., Raynal, M.: Help when needed, but no more: Efficient Read\/Write Partial Snapshot (33\/117). In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 142\u2013156. Springer, Heidelberg (2009)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11864219_1","volume-title":"Distributed Computing","author":"M. Mostefaoui","year":"2006","unstructured":"Mostefaoui, M., Raynal, M., Travers, C.: Exploring Gafni\u2019s Reduction Land: from \u03a9k to Wait-free adaptive ($2p-\\lceil\\frac{p}{k}\\rceil$)-renaming via k-set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-540-87785-1_33","volume-title":"Software Technologies for Embedded and Ubiquitous Systems","author":"M. Raynal","year":"2008","unstructured":"Raynal, M.: Locks Considered Harmful: a Look at Non-traditional Synchronization. In: Brinkschulte, U., Givargis, T., Russo, S. (eds.) SEUS 2008. LNCS, vol.\u00a05287, pp. 369\u2013380. Springer, Heidelberg (2008)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11945529_2","volume-title":"Principles of Distributed Systems","author":"M. Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-free Set Agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 1\u201317. Springer, Heidelberg (2006)"},{"issue":"5","key":"31_CR22","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 Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-04355-0_17","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2009","unstructured":"Taubenfeld, G.: Contention-Sensitive Data Structure and Algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 157\u2013171. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:36:54Z","timestamp":1630726614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}