{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:20Z","timestamp":1737097820128,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-40026-5_10","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T23:59:07Z","timestamp":1181692747000},"page":"149-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Polynomial and Adaptive Long-lived (2k- 1)-Renaming"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Arie","family":"Fouren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"10_CR1","unstructured":"Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Adaptive long-lived renaming using bounded memory. Available at http:\/\/www.cs.technion.ac.il\/~hagit\/pubs\/AAFST99disc.ps.gz , Apr. 1999."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 91\u2013103, 1999.","DOI":"10.1145\/301308.301335"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Y. Afek and M. Merritt. Fast, wait-free (2k-l)-renaming. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 105\u2013112, 1999.","DOI":"10.1145\/301308.301338"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive collect with applications. In Proc. 40th IEEE Symp. Foundations of Comp. Sci., pages 262\u2013272, 1999.","DOI":"10.1109\/SFFCS.1999.814598"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot.In Proc. 19th ACM Symp. Principles of Dist. Comp., 2000. To appear.","DOI":"10.1145\/343477.343521"},{"issue":"3","key":"10_CR6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. J. ACM, 37(3):524\u2013548, July 1990.","journal-title":"J. ACM"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th ACM Symp. Principles of Dist. Comp., pages 277\u2013286, 1998.","DOI":"10.1145\/277697.277749"},{"key":"10_CR8","unstructured":"H. Attiya and A. Fouren.An adaptive collect algorithm with applications. Submitted for publication. Available at http:\/\/www.cs.technion.ac.il\/~hagit\/pubs\/AF99ful.ps.gz , Aug. 1999."},{"key":"10_CR9","unstructured":"H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report 956, Faculty of Computer Science, The Technion, Mar. 1999. Available at http:\/\/www.cs.technion.ac.il\/~hagit\/pubs\/tr0956.ps.gz ."},{"issue":"l","key":"10_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01187073","volume":"26","author":"A. Bar-Noy","year":"1993","unstructured":"A. Bar-Noy and D. Dolev. A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment. Math. Sys. Theory, 26(l):21\u201339, 1993.","journal-title":"Math. Sys. Theory"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Generalized FLP impossibility result for-resilient asynchronous computations. In Proc. 25th ACM Symp. Theory of Comp., pages 91\u2013100, 1993.","DOI":"10.1145\/167088.167119"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proc. 12th ACM Symp. Principles of Dist. Comp., pages 41\u201352, 1993.","DOI":"10.1145\/164051.164056"},{"key":"10_CR13","unstructured":"E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum. The BG distributed simulation algorithm. Technical Report MIT\/LCS\/TM-573, Laboratory for Computer Science, MIT, Dec. 1997."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"H. Buhrman, J. A. Garay, J.-H. Hoepman, and M. Moir. Long-lived renaming made fast. In Proc. l th ACM Symp. Principles of Dist. Comp., pages 194\u2013203, 1995.","DOI":"10.1145\/224964.224986"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"J. E. Burns and G. L. Peterson. The ambiguity of choosing. In Proc. 8th ACM Symp. Principles of Dist. Comp., pages 145\u2013158, 1989.","DOI":"10.1145\/72981.72991"},{"key":"10_CR16","unstructured":"A. Fouren. Exponential examples for two renaming algorithms. Available at http:\/\/www.cs.technion.ac.il\/~hagit\/pubs\/expo.ps.gz , Aug. 1999."},{"key":"10_CR17","unstructured":"E. Gafni. More about renaming: Fast algorithm and reduction to the k-set test-and-set problem. Unpublished manuscript, 1992."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proc. 26th ACM Symp. Theory of Comp., pages 243\u2013252, 1994.","DOI":"10.1145\/195058.195144"},{"issue":"1","key":"10_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1\u201311, Feb. 1987.","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"10_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-6423(97)00016-6","volume":"30","author":"M. Moir","year":"1998","unstructured":"M. Moir. Fast, long-lived renaming improved and simplified. Sci. Comput. Programming, 30(3):287\u2013308, May 1998.","journal-title":"Sci. Comput. Programming"},{"issue":"1","key":"10_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1):1\u201339, Oct. 1995.","journal-title":"Sci. Comput. Programming"},{"key":"10_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-61769-8_19","volume-title":"Proc. 10th Int. Workshop on Dist. Algorithms","author":"M. Moir","year":"1996","unstructured":"M. Moir and J. A. Garay. Fast long-lived renaming improved and simplified. In Proc. 10th Int. Workshop on Dist. Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 287\u2013303. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:29Z","timestamp":1737096149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_10"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}