{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:42:13Z","timestamp":1763415733568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606021"},{"type":"electronic","value":"9783031606038"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_25","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"456-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Bit Complexity of\u00a0Iterated 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":[[2024,5,23]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"769","DOI":"10.13053\/cys-26-2-4234","volume":"26","author":"J Armenta-Segura","year":"2022","unstructured":"Armenta-Segura, J., Ledent, J., Rajsbaum, S.: Two-agent approximate agreement from an epistemic logic perspective. Computaci\u00f3n y Sistemas 26(2), 769\u2013785 (2022)","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"25_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":"25_CR3","doi-asserted-by":"publisher","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 189\u2013198. ACM Press, New York (1997). https:\/\/doi.org\/10.1145\/259380.259439","DOI":"10.1145\/259380.259439"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194\u2013197 (1941). https:\/\/doi.org\/10.1017\/S030500410002168X","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"25_CR5","unstructured":"Delporte, C., Fauconnier, H., Fraigniaud, P., Rajsbaum, S., Travers, C.: The computational power of distributed shared-memory models with bounded-size registers (2023)"},{"key":"25_CR6","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":"25_CR7","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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-17653-1_17","volume-title":"Principles of Distributed Systems","author":"E Gafni","year":"2010","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"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1080\/00029890.1962.11989826","volume":"69","author":"OA Gross","year":"1962","unstructured":"Gross, O.A.: Preferential arrangements. Am. Math. Mon. 69(1), 4\u20138 (1962)","journal-title":"Am. Math. Mon."},{"key":"25_CR10","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":"25_CR11","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":"25_CR12","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"},{"key":"25_CR13","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-319-24298-9_26","volume-title":"Recent Trends in Combinatorics","author":"S Klee","year":"2016","unstructured":"Klee, S., Novik, I.: Face enumeration on simplicial complexes. In: Beveridge, A., Griggs, J.R., Hogben, L., Musiker, G., Tetali, P. (eds.) Recent Trends in Combinatorics. TIVMA, vol. 159, pp. 653\u2013686. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-24298-9_26"},{"key":"25_CR14","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley Longman Publishing Co. (2005)"},{"issue":"1","key":"25_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4310\/HHA.2012.v14.n1.a1","volume":"14","author":"DN Kozlov","year":"2012","unstructured":"Kozlov, D.N.: Chromatic subdivision of a simplicial complex. Homology Homotopy Appl. 14(1), 1\u201313 (2012)","journal-title":"Homology Homotopy Appl."},{"key":"25_CR16","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":"25_CR17","unstructured":"Nishimura, S.: Schlegel diagram and optimizable immediate snapshot protocol. In: 21st International Conference on Principles of Distributed Systems, OPODIS 2017, pp. 22:1\u201322:16 (2017)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-19533-4_8","volume-title":"An Invitation to Mathematics","author":"AA Razborov","year":"2011","unstructured":"Razborov, A.A.: Communication complexity. In: Schleicher, D., Lackmann, M. (eds.) An Invitation to Mathematics, pp. 97\u2013117. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19533-4_8"},{"key":"25_CR19","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 (1993)","DOI":"10.1145\/167088.167122"},{"key":"25_CR20","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Fubini numbers, Entry A000670 (2023)"},{"key":"25_CR21","unstructured":"Toyos-Marfurt, G., Kuznetsov, P.: On the bit complexity of iterated memory (extended version). CoRR abs\/2402.12484 (2024). https:\/\/arxiv.org\/abs\/2402.12484"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-1-4613-8431-1_8","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Shellability and the upper bound theorem. In: Ziegler, G.M. (ed.) Lectures on Polytopes. GTM, vol. 152, pp. 231\u2013290. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4613-8431-1_8"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60603-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:05:05Z","timestamp":1716379505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietri sul Mare","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}