{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:40:08Z","timestamp":1747867208440,"version":"3.41.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91736-3_14","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:46Z","timestamp":1747864966000},"page":"228-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-Distortion Clustering in\u00a0Bounded Growth Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1651-1987","authenticated-orcid":false,"given":"Varsha","family":"Dani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2718-572X","authenticated-orcid":false,"given":"Thomas P.","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 49\u201355 (2005)","DOI":"10.1145\/1073970.1073978"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 157\u2013164 (2002)","DOI":"10.1145\/513800.513820"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Balliu, A., Hirvonen, J., Melnyk, D., Olivetti, D., Rybicki, J., Suomela, J.: Local mending. In: International Colloquium on Structural Information and Communication Complexity, pp. 1\u201320. Springer (2022)","DOI":"10.1007\/978-3-031-09993-9_1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bamberger, P., Kuhn, F., Maus, Y.: Efficient deterministic distributed coloring with small bandwidth. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 243\u2013252 (2020)","DOI":"10.1145\/3382734.3404504"},{"key":"14_CR5","unstructured":"Barenboim, L., Maimon, T.: Deterministic Logarithmic Completeness in the Distributed sleeping model. In: Gilbert, S. (ed.) 35th International Symposium on Distributed Computing (DISC). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0209, pp. 10:1\u201310:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Kopelowitz, T., Pettie, S., Young, M.: Contention resolution with log-logstar channel accesses. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 499\u2013508 (2016)","DOI":"10.1145\/2897518.2897655"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bodlaender, M.H., Halld\u00f3rsson, M.M., Konrad, C., Kuhn, F.: Brief announcement: local independent set approximation. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, pp. 93\u201395. ACM (2016)","DOI":"10.1145\/2933057.2933068"},{"key":"14_CR8","unstructured":"Bonamy, M., Ouvrard, P., Rabie, M., Suomela, J., Uitto, J.: Distributed recoloring. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0121, pp. 12:1\u201312:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, S., et al.: LCL problems on grids. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 101\u2013110 (2017)","DOI":"10.1145\/3087801.3087833"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Burkhart, M., Von\u00a0Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 9\u201319 (2004)","DOI":"10.1145\/989459.989462"},{"key":"14_CR11","first-page":"41","volume-title":"Algorithms for Sensor Systems","author":"K Censor-Hillel","year":"2017","unstructured":"Censor-Hillel, K., Levy, R., Shachnai, H.: Fast distributed approximation for max-cut. In: Fern\u00e1ndez Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) Algorithms for Sensor Systems, pp. 41\u201356. Springer, Cham (2017)"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Parter, M., Schwartzman, G.: Derandomizing local distributed algorithms under bandwidth restrictions. Distrib. Comput. 349\u2013366 (2020). https:\/\/doi.org\/10.1007\/s00446-020-00376-1","DOI":"10.1007\/s00446-020-00376-1"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Chang, Y.J.: The energy complexity of diameter and minimum cut computation in bounded-genus networks. In: International Colloquium on Structural Information and Communication Complexity, pp. 262\u2013296. Springer (2023)","DOI":"10.1007\/978-3-031-32733-9_12"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Dani, V., Hayes, T.P.: Low-distortion clustering in bounded growth graphs. arXiv preprint arXiv:2405.05132 (2024)","DOI":"10.1145\/3662158.3662822"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Dani, V., Hayes, T.P., He, Q., Li, W., Pettie, S.: The energy complexity of broadcast. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp. 95\u2013104 (2018)","DOI":"10.1145\/3212734.3212774"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Dani, V., Hayes, T.P., Pettie, S.: The energy complexity of BFS in radio networks. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 273\u2013282. ACM (2020)","DOI":"10.1145\/3382734.3405713"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Chang, Y., Kopelowitz, T., Pettie, S., Wang, R., Zhan, W.: Exponential separations in the energy complexity of leader election. ACM Trans. Algorithms 15(4) (2019)","DOI":"10.1145\/3341111"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Li, Z.: The complexity of distributed approximation of packing and covering integer linear programs. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC), pp. 32\u201343 (2023)","DOI":"10.1145\/3583668.3594562"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446330","volume":"68","author":"YJ Chang","year":"2021","unstructured":"Chang, Y.J., Pettie, S., Saranurak, T., Zhang, H.: Near-optimal distributed triangle enumeration via expander decompositions. J. ACM (JACM) 68(3), 1\u201336 (2021)","journal-title":"J. ACM (JACM)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Saranurak, T.: Deterministic distributed expander decomposition and routing with applications in distributed derandomization. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 377\u2013388 (2020)","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Gmyr, R., Pandurangan, G.: Sleeping is efficient: MIS in $$O(1)$$-rounds node-averaged awake complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 99\u2013108. ACM (2020)","DOI":"10.1145\/3382734.3405718"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Davies, P.: Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 3\u201312 (2017)","DOI":"10.1145\/3087801.3087825"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00446-022-00426-w","volume":"36","author":"V Dani","year":"2023","unstructured":"Dani, V., Gupta, A., Hayes, T.P., Pettie, S.: Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. Distrib. Comput. 36(3), 373\u2013384 (2023)","journal-title":"Distrib. Comput."},{"key":"14_CR24","unstructured":"Dani, V., Hayes, T.P.: How to wake up your neighbors: safe and nearly optimal generic energy conservation in radio networks. In: 36th International Symposium on Distributed Computing (DISC 2022), vol.\u00a0246, pp. 16:1\u201316:22. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Davies, P.: Uniting general-graph and geometric-based radio networks via independence number parametrization. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299 (2023)","DOI":"10.1145\/3583668.3594595"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Deurer, J., Kuhn, F., Maus, Y.: Deterministic distributed dominating set approximation in the congest model. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), pp. 94\u2013103 (2019)","DOI":"10.1145\/3293611.3331626"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Dufoulon, F., Moses\u00a0Jr, W.K., Pandurangan, G.: Distributed MIS in $$o (\\log \\log n)$$ awake complexity. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 135\u2013145 (2023)","DOI":"10.1145\/3583668.3594574"},{"issue":"1","key":"14_CR28","first-page":"1","volume":"15","author":"M Elkin","year":"2018","unstructured":"Elkin, M., Neiman, O.: Efficient algorithms for constructing very sparse spanners and emulators. ACM Trans. Algorithms (TALG) 15(1), 1\u201329 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"14_CR29","unstructured":"Even, G., et al.: Three Notes on Distributed Property Testing. In: Proceedings 31st International Symposium on Distributed Computing (DISC). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a091, pp. 15:1\u201315:30 (2017)"},{"key":"14_CR30","unstructured":"Faour, S., Fuchs, M., Kuhn, F.: Distributed CONGEST approximation of weighted vertex covers and matchings. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0217, pp. 17:1\u201317:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"14_CR31","unstructured":"Faour, S., Kuhn, F.: Approximating bipartite minimum vertex cover in the CONGEST model. In: 24th International Conference on Principles of Distributed Systems (OPODIS 2020), vol.\u00a0184, pp. 29:1\u201329:16. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR32","unstructured":"Forster, S., Gr\u00f6sbacher, M., de\u00a0Vos, T.: An improved random shift algorithm for spanners and low diameter decompositions. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0217, pp. 16:1\u201316:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"3","key":"14_CR33","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1167935.1167941","volume":"2","author":"S Funke","year":"2006","unstructured":"Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Netw. (TOSN) 2(3), 444\u2013453 (2006)","journal-title":"ACM Trans. Sens. Netw. (TOSN)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 45\u201355 (2001)","DOI":"10.1145\/501416.501424"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 53\u201360 (2007)","DOI":"10.1145\/1281100.1281111"},{"key":"14_CR36","unstructured":"Ghaffari, M., Kuhn, F.: Derandomizing distributed algorithms with small messages: spanners and dominating set. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0121, pp. 29:1\u201329:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F.: Deterministic distributed vertex coloring: simpler, faster, and without network decomposition. In: Proceedings of the IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1009\u20131020. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00101"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y., Uitto, J.: Deterministic distributed edge-coloring with fewer colors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 418\u2013430. ACM (2018)","DOI":"10.1145\/3188745.3188906"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Portmann, J.: Average awake complexity of MIS and matching. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 45\u201355 (2022)","DOI":"10.1145\/3490148.3538566"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Portmann, J.: Distributed MIS with low energy and time complexities. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 146\u2013156 (2023)","DOI":"10.1145\/3583668.3594587"},{"issue":"4","key":"14_CR41","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0109045","volume":"9","author":"EN Gilbert","year":"1961","unstructured":"Gilbert, E.N.: Random plane networks. J. Soc. Ind. Appl. Math. 9(4), 533\u2013543 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"109241","DOI":"10.1016\/j.aim.2023.109241","volume":"431","author":"J Greb\u00edk","year":"2023","unstructured":"Greb\u00edk, J., Rozho\u0148, V.: Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics. Adv. Math. 431, 109241 (2023)","journal-title":"Adv. Math."},{"issue":"7","key":"14_CR43","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/JSAC.2009.090902","volume":"27","author":"M Haenggi","year":"2009","unstructured":"Haenggi, M., Andrews, J.G., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27(7), 1029\u20131046 (2009)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Wajc, D.: A faster distributed radio broadcast primitive. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 361\u2013370. ACM (2016)","DOI":"10.1145\/2933057.2933121"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Holzer, S., Lynch, N.: A local broadcast layer for the SINR network model. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), pp. 129\u2013138 (2015)","DOI":"10.1145\/2767386.2767432"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201357 (2002)","DOI":"10.1145\/571825.571833"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: Proceedings of the 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 97\u2013103 (2005)","DOI":"10.1145\/1080810.1080827"},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 60\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 267\u2013278 (2003)","DOI":"10.1145\/778415.778447"},{"issue":"5","key":"14_CR50","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ic.2006.10.001","volume":"205","author":"C Lavault","year":"2007","unstructured":"Lavault, C., Marckert, J.F., Ravelomanana, V.: Quasi-optimal energy-efficient leader election algorithms in radio networks. Inf. Comput. 205(5), 679\u2013693 (2007)","journal-title":"Inf. Comput."},{"key":"14_CR51","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-87779-0_27","volume-title":"Distributed Computing","author":"C Lenzen","year":"2008","unstructured":"Lenzen, C., Wattenhofer, R.: Leveraging Linial\u2019s locality limit. In: Taubenfeld, G. (ed.) Distributed Computing, pp. 394\u2013407. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"issue":"1","key":"14_CR52","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00446-020-00382-3","volume":"34","author":"R Levi","year":"2021","unstructured":"Levi, R., Medina, M., Ron, D.: Property testing of planarity in the congest model. Distrib. Comput. 34(1), 15\u201332 (2021)","journal-title":"Distrib. Comput."},{"issue":"1","key":"14_CR53","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Peng, R., Xu, S.C.: Parallel graph decompositions using random shifts. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 196\u2013203. ACM (2013)","DOI":"10.1145\/2486159.2486180"},{"key":"14_CR55","doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: Randomized leader election protocols in radio networks with no collision detection. In: International Symposium on Algorithms and Computation, pp. 362\u2013373. Springer (2000)","DOI":"10.1007\/3-540-40996-3_31"},{"issue":"5\u20136","key":"14_CR56","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J Schneider","year":"2010","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22(5\u20136), 349\u2013361 (2010)","journal-title":"Distrib. Comput."},{"key":"14_CR57","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: Distributed coloring depending on the chromatic number or the neighborhood growth. In: Structural Information and Communication Complexity: 18th International Colloquium, SIROCCO 2011, Gda\u0144sk, Poland, 26\u201329 June 2011, pp. 246\u2013257. Springer (2011)","DOI":"10.1007\/978-3-642-22212-2_22"}],"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-91736-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:03:19Z","timestamp":1747864999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}