{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T12:18:11Z","timestamp":1782303491808,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415265","type":"print"},{"value":"9783642415272","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_19","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"269-283","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Register Allocation with a Linear Number of Registers"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie","family":"Lamport","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082(2), 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR2","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"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: FOCS, pp. 262\u2013272. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"J.H. Anderson","year":"1994","unstructured":"Anderson, J.H.: Multi-writer composite registers. Distributed Computing\u00a07(4), 175\u2013195 (1994)","journal-title":"Distributed Computing"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","volume":"10","author":"E.A. Ashcroft","year":"1975","unstructured":"Ashcroft, E.A.: Proving assertions about parallel programs. Journal of Computer and System Sciences\u00a010, 110\u2013135 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","unstructured":"Aspnes, J.: Slightly smaller splitter networks. CoRR, abs\/1011.3170 (2010)"},{"issue":"3","key":"19_CR7","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"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput.\u00a031(2), 642\u2013664 (2002)","journal-title":"SIAM J. Comput."},{"key":"19_CR9","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill (1998)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351. ACM Press (1993)","DOI":"10.1145\/164051.164056"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-35668-1_25","volume-title":"Distributed Computing and Networking","author":"C. Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Linear Space Bootstrap Communication Schemes. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol.\u00a07730, pp. 363\u2013377. Springer, Heidelberg (2013)"},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F.E. Fich","year":"1998","unstructured":"Fich, F.E., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. Journal of the ACM\u00a045(5), 843\u2013862 (1998)","journal-title":"Journal of the ACM"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Gafni, E.: A simple algorithmic characterization of uniform solvability. In: FOCS, pp. 228\u2013237. IEEE Computer Society (2002)","DOI":"10.1109\/SFCS.2002.1181946"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: PODC, pp. 161\u2013169. ACM (2001)","DOI":"10.1145\/383962.384008"},{"key":"19_CR15","unstructured":"Lamport, L.: Proofs for adaptive register allocation with a linear number of registers, http:\/\/research.microsoft.com\/en-us\/um\/people\/lamport\/tla\/snapshot.html"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"19_CR17","unstructured":"Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2002)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03466-4_2","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"L. Lamport","year":"2009","unstructured":"Lamport, L.: The PlusCal Algorithm Language. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 36\u201360. Springer, Heidelberg (2009)"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program.\u00a025(1), 1\u201339 (1995)","journal-title":"Sci. Comput. Program."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:29Z","timestamp":1746026849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}