{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T14:23:01Z","timestamp":1770646981437,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650669","type":"print"},{"value":"9783540496939","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0056480","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:37:41Z","timestamp":1154248661000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Long-lived, fast, waitfree renaming with optimal name space and high throughput"],"prefix":"10.1007","author":[{"given":"Wayne","family":"Eberly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Higham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jolanta","family":"Warpechowska-Gruca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, E. Gafni, J. Tromp, and P. Vitanyi. Wait-free test-and-set. In Proceedings of the 6th International Workshop, WDAG'92; LNCS No. 647; Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56188-9_6"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Moir. Fast, long-lived renaming. In Proceedings of the 8th International Workshop, WDAG'94; LNCS No. 857; Springer-Verlag, pages 141\u2013155, 1994.","DOI":"10.1007\/BFb0020430"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Anderson, J. amd Moir. Using k-exclusion to implement resilient, scalable shared objects. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pages 141\u2013150, 1994.","DOI":"10.1145\/197917.198073"},{"issue":"3","key":"13_CR4","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. Journal of the Association for Computing Machinery, 37(3):524\u2013548, 1990.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. Technical Report 0931, Computer Science Department, Technion \u2014 Israel Institute of Technology, April 1998. Extended Abstract to appear in PODC'98.","DOI":"10.1145\/277697.277749"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proceedings of the Twelveth Annual ACM Symposium on Principles of Distributed Computing, pages 41\u201352, 1993.","DOI":"10.1145\/164051.164056"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"H. Buhrman, J. Garay, J.-H. Hoepman, and M. Moir. Long-lived remaning made fast. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995.","DOI":"10.1145\/224964.224986"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"J. Burns and G. Peterson. The ambiguity of choosing. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989.","DOI":"10.1145\/72981.72991"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"W. Eberly, L. Higham, and J. Warpechowska-Gruca. Long-lived, fast, waitfree renaming with optimal name space and high throughput. (In preparation), 1998.","DOI":"10.1007\/BFb0056480"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1):124\u2013149, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 111\u2013120, 1993.","DOI":"10.1145\/167088.167125"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"M. Herlihy and J. Wing. Linerizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463\u2013491, 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"M. Moir and J. Garay. Fast, long-lived renaming improved and simplified. In Proceedings of the 10th International Workshop, WDAG'96, 1996.","DOI":"10.1145\/248052.248078"},{"key":"13_CR14","first-page":"83","volume":"No. 834","author":"A. Panconesi","year":"1994","unstructured":"A. Panconesi, M. Papatriantafilou, P. Tsigas, and P. Vitanyi. Randomized wait-free naming. In ISAAC'94, LNCS No. 834, pages 83\u201391, 1994.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:46:06Z","timestamp":1578512766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056480"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0056480","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"2 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}