{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:20Z","timestamp":1749825860092,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356674"},{"type":"electronic","value":"9783642356681"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35668-1_25","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T10:07:03Z","timestamp":1357294023000},"page":"363-377","source":"Crossref","is-referenced-by-count":4,"title":["Linear Space Bootstrap Communication Schemes"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_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. Journal of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"Journal of the ACM"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-007-0041-1","volume":"20","author":"Y. Afek","year":"2007","unstructured":"Afek, Y., De Levie, Y.: Efficient adaptive collect algorithms. Distributed Computing\u00a020, 221\u2013238 (2007)","journal-title":"Distributed Computing"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proceedings of FOCS 1999, pp. 262\u2013272. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/992287.992298","volume":"35","author":"M.K. Aguilera","year":"2004","unstructured":"Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. SIGACT News\u00a035(2), 36\u201359 (2004)","journal-title":"SIGACT News"},{"issue":"1","key":"25_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2108242.2108244","volume":"59","author":"J. Aspnes","year":"2012","unstructured":"Aspnes, J., Attiya, H., Censor-Hillel, K.: Polylogarithmic concurrent data structures from monotone circuits. J. ACM\u00a059(1), 2:1\u20132:24 (2012)","journal-title":"J. ACM"},{"issue":"3","key":"25_CR6","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"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-40026-5_10","volume-title":"Distributed Computing","author":"H. Attiya","year":"2000","unstructured":"Attiya, H., Fouren, A.: Polynomial and Adaptive Long-Lived (2k - 1)-Renaming. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 149\u2013163. Springer, Heidelberg (2000)"},{"issue":"2","key":"25_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."},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H. Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004460100067","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing\u00a015(2), 87\u201396 (2002)","journal-title":"Distributed Computing"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing. Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons (2004)","DOI":"10.1002\/0471478210"},{"key":"25_CR12","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"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J.E. Burns","year":"1993","unstructured":"Burns, J.E., Lynch, N.A.: Bounds on shared memory for mutual exclusion. Inf. Comput.\u00a0107(2), 171\u2013184 (1993)","journal-title":"Inf. Comput."},{"issue":"5-6","key":"25_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","volume":"22","author":"A. Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: the lower bound. Distributed Computing\u00a022(5-6), 287\u2013301 (2010)","journal-title":"Distributed Computing"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Linear space bootstrap communication scheme. Technical Report hal-00717235, LIAFA, Universit\u00e9 Paris 7-Denis Diderot, France (2012)","DOI":"10.1007\/978-3-642-35668-1_25"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/571825.571828","volume-title":"Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC 2002","author":"P. Fatourou","year":"2002","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: Space-optimal multi-writer snapshot objects are slow. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC 2002, pp. 13\u201320. ACM, New York (2002)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1132516.1132542","volume-title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006","author":"P. Fatourou","year":"2006","unstructured":"Fatourou, P., Fich, F.E., Ruppert, E.: Time-space tradeoffs for implementations of snapshots. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 169\u2013178. ACM, New York (2006)"},{"issue":"5","key":"25_CR18","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. ACM\u00a045(5), 843\u2013862 (1998)","journal-title":"J. ACM"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/1993806.1993826","volume-title":"Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011","author":"M. Helmi","year":"2011","unstructured":"Helmi, M., Higham, L., Pacheco, E., Woelfel, P.: The space complexity of long-lived and one-shot timestamp implementations. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 139\u2013148. ACM, New York (2011)"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 123\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM\u00a046(2), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"25_CR22","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P. Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput.\u00a030(2), 438\u2013456 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication; part I and II. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"3","key":"25_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-6423(97)00016-6","volume":"30","author":"M. Moir","year":"1998","unstructured":"Moir, M.: Fast, long-lived renaming improved and simplified. Sci. Comput. Program.\u00a030(3), 287\u2013308 (1998)","journal-title":"Sci. Comput. Program."},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/72981.72993","volume-title":"Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, PODC 1989","author":"E. Styer","year":"1989","unstructured":"Styer, E., Peterson, G.L.: Tight bounds for shared memory symmetric mutual exclusion problems. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, PODC 1989, pp. 177\u2013191. ACM, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35668-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:10Z","timestamp":1745942410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35668-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356674","9783642356681"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35668-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}