{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:37:00Z","timestamp":1770921420561,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-17801-5_47","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:29Z","timestamp":1770918809000},"page":"648-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal-Length Labeling Schemes and\u00a0Fast Algorithms for\u00a0k-Gathering and\u00a0k-Broadcasting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-1643","authenticated-orcid":false,"given":"Adam","family":"Ga\u0144czorz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1908-9458","authenticated-orcid":false,"given":"Tomasz","family":"Jurdzi\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Bu, G., Lotker, Z., Potop-Butucaru, M., Rabie, M.: Lower and upper bounds for deterministic convergecast with labeling schemes. Theor. Comput. Sci. 952, 113775 (2023)","DOI":"10.1016\/j.tcs.2023.113775"},{"key":"47_CR2","doi-asserted-by":"publisher","unstructured":"Bu, G., Potop-Butucaru, M., Rabie, M.: Wireless broadcast with short labels. In: Georgiou, C., Majumdar, R. (eds.) Networked Systems - 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12129, pp. 146\u2013169. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_10","DOI":"10.1007\/978-3-030-67087-0_10"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Costello, K.P.: Faster information gathering in ad-hoc radio tree networks. Algorithmica 80(3), 1013\u20131040 (2018)","DOI":"10.1007\/s00453-017-0336-y"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Costello, K.P., Gasieniec, L.: Information gathering in ad-hoc radio networks. Inf. Comput. 281, 104769 (2021)","DOI":"10.1016\/j.ic.2021.104769"},{"key":"47_CR5","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Costello, K.P., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology. Inf. Comput. 258, 1\u201327 (2018). https:\/\/doi.org\/10.1016\/j.ic.2017.11.003","DOI":"10.1016\/j.ic.2017.11.003"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Manne, F., Xin, Q.: Faster deterministic communication in radio networks. Algorithmica 54(2), 226\u2013242 (2009)","DOI":"10.1007\/s00453-007-9136-0"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Davies, P.: Deterministic communication in radio networks. SIAM J. Comput. 47(1), 218\u2013240 (2018)","DOI":"10.1137\/17M1111322"},{"key":"47_CR8","doi-asserted-by":"publisher","unstructured":"Czumaj, A., Davies, P.: Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. J. ACM 68(2), 13:1\u201313:22 (2021). https:\/\/doi.org\/10.1145\/3446383","DOI":"10.1145\/3446383"},{"key":"47_CR9","doi-asserted-by":"publisher","unstructured":"Ellen, F., Gilbert, S.: Constant-length labelling schemes for faster deterministic radio broadcast. In: Scheideler, C., Spear, M. (eds.) SPAA \u201920: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pp. 213\u2013222. ACM (2020). https:\/\/doi.org\/10.1145\/3350755.3400238","DOI":"10.1145\/3350755.3400238"},{"key":"47_CR10","doi-asserted-by":"publisher","unstructured":"Ellen, F., Gorain, B., Miller, A., Pelc, A.: Constant-length labeling schemes for deterministic radio broadcast. In: Scheideler, C., Berenbrink, P. (eds.) The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, pp. 171\u2013178. ACM (2019).https:\/\/doi.org\/10.1145\/3323165.3323194","DOI":"10.1145\/3323165.3323194"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. Theory Comput. Syst. 47(4), 920\u2013933 (2010)","DOI":"10.1007\/s00224-010-9280-9"},{"key":"47_CR12","doi-asserted-by":"publisher","unstructured":"Fusco, E.G., Pelc, A., Petreschi, R.: Topology recognition with advice. Inf. Comput. 247, 254\u2013265 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.01.005","DOI":"10.1016\/j.ic.2016.01.005"},{"key":"47_CR13","unstructured":"Ganczorz, A., Jurdzinski, T.: Optimal-length labeling schemes and fast algorithms for k-gathering and k-broadcasting (2025). https:\/\/arxiv.org\/abs\/2512.02252"},{"key":"47_CR14","doi-asserted-by":"publisher","unstructured":"Ganczorz, A., Jurdzinski, T., Lewko, M., Pelc, A.: Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. 292, 105010 (2023). https:\/\/doi.org\/10.1016\/J.IC.2023.105010","DOI":"10.1016\/J.IC.2023.105010"},{"key":"47_CR15","doi-asserted-by":"publisher","unstructured":"Ganczorz, A., Jurdzinski, T., Pelc, A.: Optimal-length labeling schemes for fast deterministic communication in radio networks. CoRR abs\/2410.07382, to appear in OPODIS 2025, (2024). https:\/\/doi.org\/10.48550\/ARXIV.2410.07382","DOI":"10.48550\/ARXIV.2410.07382"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. 83(2), 89\u201393 (2002)","DOI":"10.1016\/S0020-0190(01)00312-X"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distributed Comput. 19(4), 289\u2013300 (2007)","DOI":"10.1007\/s00446-006-0011-z"},{"key":"47_CR18","doi-asserted-by":"publisher","unstructured":"Gasieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science, vol.\u00a03111, pp. 397\u2013407. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_34","DOI":"10.1007\/978-3-540-27810-8_34"},{"key":"47_CR19","doi-asserted-by":"publisher","unstructured":"Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. ACM Trans. Algorithms 13(3), 31:1\u201331:41 (2017). https:\/\/doi.org\/10.1145\/3039870","DOI":"10.1145\/3039870"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Gorain, B., Pelc, A.: Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864, 20\u201333 (2021)","DOI":"10.1016\/j.tcs.2021.02.004"},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"Gorain, B., Pelc, A.: Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861, 23\u201344 (2021)","DOI":"10.1016\/j.tcs.2021.02.008"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Ilcinkas, D., Kowalski, D.R., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14\u201315), 1544\u20131557 (2010)","DOI":"10.1016\/j.tcs.2010.01.004"},{"issue":"3","key":"47_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"DR Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185\u2013195 (2007)","journal-title":"Distrib. Comput."},{"key":"47_CR24","doi-asserted-by":"publisher","unstructured":"Krisko, C., Miller, A.: Labeling schemes for deterministic radio multi-broadcast. In: Kowalik, L., Pilipczuk, M., Rzazewski, P. (eds.) Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12911, pp. 374\u2013387. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_29","DOI":"10.1007\/978-3-030-86838-3_29"},{"key":"47_CR25","doi-asserted-by":"crossref","unstructured":"Marco, G.D.: Distributed broadcast in unknown radio networks. SIAM J. Comput. 39(6), 2162\u20132175 (2010)","DOI":"10.1137\/080733826"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Vaya, S.: Round complexity of leader election and gossiping in bidirectional radio networks. Inf. Process. Lett. 113(9), 307\u2013312 (2013)","DOI":"10.1016\/j.ipl.2013.02.001"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:32Z","timestamp":1770918812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}