{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:16:44Z","timestamp":1787498204838,"version":"build-2736575974"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-6423(97)00016-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:33:51Z","timestamp":1052782431000},"page":"287-308","source":"Crossref","is-referenced-by-count":18,"title":["Fast, long-lived renaming improved and simplified"],"prefix":"10.1016","volume":"30","author":[{"given":"Mark","family":"Moir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(97)00016-6_BIB1","series-title":"Preliminary version appeared in Proc. 13th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"141","article-title":"Using local-spin k-exclusion algorithms to improve wait-free object implementations to appear in Distributed Computing","author":"Anderson","year":"1994"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB2","series-title":"Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"337","article-title":"Achievable cases in an asynchronous environment","author":"Attiya","year":"1987"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB3","series-title":"Proc. 8th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"307","article-title":"Shared memory versus message-passing in an asynchronous distributed environment","author":"Bar-Noy","year":"1989"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB4","series-title":"Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"41","article-title":"Immediate atomic snapshots and fast renaming","author":"Borowsky","year":"1993"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB5","series-title":"Proc. 14th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"194","article-title":"Long-lived renaming made fast","author":"Buhrman","year":"1995"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB6","series-title":"Proc. 8th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"145","article-title":"The ambiguity of choosing","author":"Burns","year":"1989"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB7","series-title":"Parallel Program Design: A Foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/331524.331529","article-title":"The topological structure of asynchronous computability","author":"Herlihy","year":"1996"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB9_1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB9_2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0167-6423(97)00016-6_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7351.7352","article-title":"A fast mutual exclusion algorithm","volume":"5","author":"Lamport","year":"1987","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB11_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","article-title":"Wait-free algorithms for fast, long-lived renaming","volume":"25","author":"Moir","year":"1995","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB11_2","series-title":"Proc. 8th Internat. Workshop on Distributed Algorithms","first-page":"141","author":"Moir","year":"1994"},{"key":"10.1016\/S0167-6423(97)00016-6_BIB12","doi-asserted-by":"crossref","unstructured":"G. Peterson, Personal communication, November 1995.","DOI":"10.1109\/VETEC.1995.504968"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T20:51:43Z","timestamp":1556311903000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642397000166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167642397000166"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(97)00016-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}