{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:17:34Z","timestamp":1763414254833,"version":"3.45.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_34","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:45Z","timestamp":1763409825000},"page":"458-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Space-Time Trade-Off in\u00a0Bounded Iterated Memory"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"Toyos-Marfurt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Distributed computing - fundamentals, simulations, and advanced topics, 2nd edn. Wiley, Wiley series on parallel and distributed computing (2004)","DOI":"10.1002\/0471478210"},{"key":"34_CR2","doi-asserted-by":"publisher","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351. ACM Press, New York (1993). https:\/\/doi.org\/10.1145\/164051.164056","DOI":"10.1145\/164051.164056"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-14472-6_10","volume-title":"Principles of Distributed Systems","author":"Z Bouzid","year":"2014","unstructured":"Bouzid, Z., Gafni, E., Kuznetsov, P.: Strong equivalence relations for iterated models. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 139\u2013154. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14472-6_10"},{"key":"34_CR4","doi-asserted-by":"publisher","unstructured":"Delporte-Gallet, C., Fauconnier, H., Fraigniaud, P., Rajsbaum, S., Travers, C.: The computational power of distributed shared-memory models with bounded-size registers. In: PODC, p. 310\u2013320. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3662158.3662789","DOI":"10.1145\/3662158.3662789"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-54921-3_17","volume-title":"Structural Information and Communication Complexity","author":"C Delporte-Gallet","year":"2020","unstructured":"Delporte-Gallet, C., Fauconnier, H., Rajsbaum, S.: Communication complexity of wait-free computability in dynamic networks. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 291\u2013309. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_17"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P., Manolescu, C.: A generalized asynchronous computability theorem. In: PODC (2014)","DOI":"10.1145\/2611462.2611477"},{"key":"34_CR7","doi-asserted-by":"publisher","unstructured":"Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 205\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17653-1_17","DOI":"10.1007\/978-3-642-17653-1_17"},{"key":"34_CR8","unstructured":"Guerraoui, R., Kuznetsov, P.: Algorithms for Concurrent Systems. EPFL Press (2018)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann (2014)","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: PODC, pp. 105\u2013113 (2010)","DOI":"10.1145\/1835698.1835724"},{"issue":"2","key":"34_CR11","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. J. ACM 46(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539701397412","volume":"36","author":"G Hoest","year":"2006","unstructured":"Hoest, G., Shavit, N.: Toward a topological characterization of asynchronous complexity. SIAM J. Comput. 36(2), 457\u2013497 (2006). https:\/\/doi.org\/10.1137\/S0097539701397412","journal-title":"SIAM J. Comput."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity Comput. Comput. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4310\/HHA.2012.v14.n2.a12","volume":"14","author":"DN Kozlov","year":"2012","unstructured":"Kozlov, D.N.: Chromatic subdivision of a simplicial complex. Homology, Homotopy Appli. 14(2), 197\u2013209 (2012)","journal-title":"Homology, Homotopy Appli."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Rieutord, T., He, Y.: An asynchronous computability theorem for fair adversaries. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2018, pp. 1\u201310. (2018)","DOI":"10.1145\/3212734.3212765"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-61769-8_9","volume-title":"Distributed Algorithms","author":"H Rodrigues","year":"1996","unstructured":"Rodrigues, H., Jones, R.: A cyclic distributed garbage collector for network objects. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 123\u2013140. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61769-8_9"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-12200-2_36","volume-title":"LATIN 2010: Theoretical Informatics","author":"S Rajsbaum","year":"2010","unstructured":"Rajsbaum, S.: Iterated shared memory models. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 407\u2013416. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_36"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-free $$k$$-set agreement is impossible: the topology of public knowledge. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 101\u2013110 (May 1993)","DOI":"10.1145\/167088.167122"},{"key":"34_CR19","doi-asserted-by":"publisher","unstructured":"Toyos-Marfurt, G., Kuznetsov, P.: On the bit complexity of iterated memory. In: Structural Information and Communication Complexity: 31st International Colloquium (SIROCCO 2024), pp. 456\u2013477. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-60603-8_25","DOI":"10.1007\/978-3-031-60603-8_25"},{"key":"34_CR20","doi-asserted-by":"publisher","unstructured":"Toyos-Marfurt, G., Kuznetsov, P.: On the bit complexity of iterated memory (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.12484","DOI":"10.48550\/arXiv.2402.12484"},{"key":"34_CR21","doi-asserted-by":"publisher","unstructured":"Toyos-Marfurt, G., Kuznetsov, P.: Space-time trade-off in bounded iterated memory (2025). https:\/\/doi.org\/10.48550\/arXiv.2509.13157","DOI":"10.48550\/arXiv.2509.13157"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M.: Shellability and the Upper Bound Theorem, pp. 231\u2013290. Springer New York (1995)","DOI":"10.1007\/978-1-4613-8431-1_8"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:46Z","timestamp":1763409826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}