{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:27:34Z","timestamp":1726410454966},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662451731"},{"type":"electronic","value":"9783662451748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_21","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T11:28:20Z","timestamp":1411990100000},"page":"303-317","source":"Crossref","is-referenced-by-count":0,"title":["Space Bounds for Adaptive Renaming"],"prefix":"10.1007","author":[{"given":"Maryam","family":"Helmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Higham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","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. J. of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J. of the ACM"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M.: Fast, wait-free (2k-1)-renaming. In: Proc. of 18th PODC, pp. 105\u2013112 (1999), J. of the ACM","DOI":"10.1145\/301308.301338"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: Proc. of 52nd FOCS, pp. 718\u2013727 (2011)","DOI":"10.1109\/FOCS.2011.66"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-15763-9_9","volume-title":"Distributed Computing","author":"D. Alistarh","year":"2010","unstructured":"Alistarh, D., Attiya, H., Gilbert, S., Giurgiu, A., Guerraoui, R.: Fast randomized test-and-set and renaming. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"issue":"3","key":"21_CR5","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. J. of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. of the ACM"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fich, F., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: Proc. of 23rd PODC, pp. 60\u201369 (2004)","DOI":"10.1145\/1011767.1011777"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley Interscience (2004)","DOI":"10.1002\/0471478210"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-011-0137-5","volume":"24","author":"A. Brodsky","year":"2011","unstructured":"Brodsky, A., Ellen, F., Woelfel, P.: Fully-adaptive algorithms for long-lived renaming. Journal of Distributed Computing\u00a024(2), 119\u2013134 (2011)","journal-title":"Journal of Distributed Computing"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Journal of Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Journal of Information and Computation"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Burns, J., Peterson, G.: The ambiguity of choosing. In: Proc. of 8th PODC, PODC 1989, pp. 145\u2013157 (1989), J. of the ACM","DOI":"10.1145\/72981.72991"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-41527-2_20","volume-title":"Distributed Computing","author":"F. Ellen","year":"2013","unstructured":"Ellen, F., Woelfel, P.: An optimal implementation of fetch-and-increment. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 284\u2013298. Springer, Heidelberg (2013)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. of the ACM, 843\u2013862 (1998)","DOI":"10.1145\/290179.290183"},{"issue":"2-3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing\u00a016(2-3), 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-41527-2_4","volume-title":"Distributed Computing","author":"G. Giakkoupis","year":"2013","unstructured":"Giakkoupis, G., Helmi, M., Higham, L., Woelfel, P.: An \n                    \n                      \n                    \n                    $O(\\sqrt n)$\n                   space bound for obstruction-free leader election. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 46\u201360. Springer, Heidelberg (2013)"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/2559904","volume":"61","author":"M. Helmi","year":"2014","unstructured":"Helmi, M., Higham, L., Pacheco, E., Woelfel, P.: The space complexity of long-lived and one-shot timestamp implementations. J. of the ACM\u00a061(1), 7\u201327 (2014)","journal-title":"J. of the ACM"},{"key":"21_CR16","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann (1996)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:38:16Z","timestamp":1558989496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}