{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T19:59:27Z","timestamp":1791143967674,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540617693","type":"print"},{"value":"9783540706793","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:22:10Z","timestamp":1330294930000},"page":"287-303","source":"Crossref","is-referenced-by-count":4,"title":["Fast, long-lived renaming improved and simplified"],"prefix":"10.1007","author":[{"given":"Mark","family":"Moir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Moir, \u201cFast k-Exclusion Algorithms\u201d, submitted to Distributed Computing. Preliminary version appeared in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, August 1994, pp. 141\u2013150.","DOI":"10.1145\/197917.198073"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk, \u201cAchievable Cases in an Asynchronous Environment\u201d, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, October 1987, pp. 337\u2013346.","DOI":"10.1109\/SFCS.1987.5"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev, \u201cShared Memory versus Message-Passing in an Asynchronous Distributed Environment\u201d, Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, August 1989, pp. 307\u2013318.","DOI":"10.1145\/72981.73003"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni, \u201cImmediate Atomic Snapshots and Fast Renaming\u201d, Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, August 1993, pp. 41\u201350.","DOI":"10.1145\/164051.164056"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"H. Buhrman, J. Garay, J. Hoepman, and M. Moir, \u201cLong-Lived Renaming Made Fast\u201d, Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, August 1995, pp. 194\u2013203.","DOI":"10.1145\/224964.224986"},{"key":"19_CR6","first-page":"145","volume-title":"The Ambiguity of Choosing","author":"J. Burns","year":"1989","unstructured":"J. Burns and G. Peterson, \u201cThe Ambiguity of Choosing\u201d, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, August 1989, pp. 145\u2013157."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"C. A. R. Hoare, \u201cAn Axiomatic Basis for Computer Programming\u201d, Communications of the ACM 12, October 1969, pp. 576\u2013580,583.","journal-title":"Communications of the ACM"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit, \u201cThe Asynchronous Computability Theorem for t-Resilient Tasks\u201d, Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 111\u2013120.","DOI":"10.1145\/167088.167125"},{"issue":"No.1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport, \u201cA Fast Mutual Exclusion Algorithm\u201d, ACM Transactions on Computer Systems, Vol. 5, No. 1, February 1987, pp. 1\u201311.","journal-title":"ACM Transactions on Computer Systems"},{"key":"19_CR10","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. Anderson, \u201cWait-Free Algorithms for Fast, Long-Lived Renaming\u201d, Science of Computer Programming 25 (1995), pp. 1\u201339. Preliminary version appeared in Proceedings of the 8th International Workshop on Distributed Algorithms, September, 1994, pp. 141\u2013155.","journal-title":"Science of Computer Programming"},{"key":"19_CR11","unstructured":"G. Peterson, personal communication, November 1995."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:25:33Z","timestamp":1742599533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}