{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T08:11:32Z","timestamp":1774080692714,"version":"3.50.1"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2024-06411"],"award-info":[{"award-number":["RGPIN-2024-06411"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115857","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:19:26Z","timestamp":1772558366000},"page":"115857","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Labeling schemes for deterministic radio multi-broadcast"],"prefix":"10.1016","volume":"1071","author":[{"given":"Colin","family":"Krisko","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8231-3697","authenticated-orcid":false,"given":"Avery","family":"Miller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2026.115857_bib0001","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/3470633","article-title":"Constant-Length labeling schemes for deterministic radio broadcast","volume":"8","author":"Ellen","year":"2021","journal-title":"ACM Trans. Parallel Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0002","article-title":"Distinguishing numbers for graphs and groups","volume":"11","author":"Tymoczko","year":"2004","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.tcs.2026.115857_bib0003","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","article-title":"A lower bound for radio broadcast","volume":"43","author":"Alon","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115857_bib0004","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","article-title":"The wave expansion approach to broadcasting in multihop radio networks","volume":"39","author":"Chlamtac","year":"1991","journal-title":"IEEE Trans. Commun."},{"issue":"12","key":"10.1016\/j.tcs.2026.115857_bib0005","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","article-title":"On broadcasting in radio networks-Problem analysis and protocol design","volume":"33","author":"Chlamtac","year":"1985","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0006","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/1186810.1186818","article-title":"An improved algorithm for radio broadcast","volume":"3","author":"Elkin","year":"2007","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","article-title":"Centralized broadcast in multihop radio networks","volume":"46","author":"Gaber","year":"2003","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2026.115857_bib0008","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00446-006-0011-z","article-title":"Faster communication in known topology radio networks","volume":"19","author":"Gasieniec","year":"2007","journal-title":"Distributed Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.115857_bib0009","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","article-title":"Optimal deterministic broadcasting in known topology radio networks","volume":"19","author":"Kowalski","year":"2007","journal-title":"Distributed Comput."},{"key":"10.1016\/j.tcs.2026.115857_bib0010","series-title":"Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress - TC1 Stream \/ 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002)","first-page":"193","article-title":"Gossiping with unit messages in known radio networks","volume":"223","author":"Gasieniec","year":"2002"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0011","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2007.03.059","article-title":"Time efficient centralized gossiping in radio networks","volume":"383","author":"Gasieniec","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115857_bib0012","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2014.12.006","article-title":"Message and time efficient multi-broadcast schemes","volume":"569","author":"Levin","year":"2015","journal-title":"Theor Comput Sci"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0013","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","article-title":"Deterministic broadcasting in ad hoc radio networks","volume":"15","author":"Chlebus","year":"2002","journal-title":"Distributed Comput."},{"key":"10.1016\/j.tcs.2026.115857_bib0014","series-title":"Automata, Languages and Programming, 27Th International Colloquium, ICALP 2000","first-page":"717","article-title":"Deterministic radio broadcasting","volume":"1853","author":"Chlebus","year":"2000"},{"issue":"2","key":"10.1016\/j.tcs.2026.115857_bib0015","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","article-title":"Fast broadcasting and gossiping in radio networks","volume":"43","author":"Chrobak","year":"2002","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115857_bib0016","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","article-title":"Distributed broadcast in radio networks of unknown topology","volume":"302","author":"Clementi","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115857_bib0017","series-title":"Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27\u201329, 2022, Proceedings","first-page":"234","article-title":"Exactly optimal deterministic radio broadcasting with collision detection","volume":"13298","author":"Ji","year":"2022"},{"key":"10.1016\/j.tcs.2026.115857_bib0018","series-title":"Automata, Languages and Programming, 29Th International Colloquium, ICALP 2002","first-page":"377","article-title":"Gossiping with bounded size messages in ad hoc radio networks","volume":"2380","author":"Christersson","year":"2002"},{"key":"10.1016\/j.tcs.2026.115857_bib0019","series-title":"Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009","first-page":"2","article-title":"On efficient gossiping in radio networks","volume":"5869","author":"Gasieniec","year":"2009"},{"issue":"2","key":"10.1016\/j.tcs.2026.115857_bib0020","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0020-0190(01)00312-X","article-title":"On adaptive deterministic gossiping in ad hoc radio networks","volume":"83","author":"Gasieniec","year":"2002","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0021","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-006-1212-3","article-title":"Deterministic communication in radio networks with large labels","volume":"47","author":"Gasieniec","year":"2007","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115857_bib0022","series-title":"Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L\u2019Aquila, Italy, July 1\u20134, 2019, Proceedings","first-page":"66","article-title":"Optimal multi-broadcast with beeps using group testing","volume":"11639","author":"Beauquier","year":"2019"},{"key":"10.1016\/j.tcs.2026.115857_bib0023","series-title":"Automata, Languages and Programming - 38Th International Colloquium, ICALP 2011","first-page":"613","article-title":"Efficient distributed communication in ad-Hoc radio networks","volume":"6756","author":"Chlebus","year":"2011"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0024","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1137\/16M1105967","article-title":"Adjacency labeling schemes and induced-universal graphs","volume":"33","author":"Alstrup","year":"2019","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0025","doi-asserted-by":"crossref","DOI":"10.1145\/2794076","article-title":"An optimal ancestry labeling scheme with applications to XML trees and universal posets","volume":"63","author":"Fraigniaud","year":"2016","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0026","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","article-title":"Distance labeling in graphs","volume":"53","author":"Gavoille","year":"2004","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2026.115857_bib0027","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","article-title":"Proof labeling schemes","volume":"22","author":"Korman","year":"2010","journal-title":"Distributed Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0028","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/3280823","article-title":"Deterministic graph exploration with advice","volume":"15","author":"Gorain","year":"2019","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.115857_bib0029","series-title":"39th International Symposium on Distributed Computing, DISC 2025, October 27\u201331, 2025, Berlin, Germany","first-page":"12:1","article-title":"Distributed computation with local advice","volume":"356","author":"Balliu","year":"2025"},{"issue":"4","key":"10.1016\/j.tcs.2026.115857_bib0030","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1007\/s00224-010-9280-9","article-title":"Local MST computation with short advice","volume":"47","author":"Fraigniaud","year":"2010","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115857_bib0031","series-title":"Mathematical Foundations of Computer Science 2010, 35Th International Symposium, MFCS 2010, Brno, Czech Republic, August 23\u201327, 2010. Proceedings","first-page":"24","article-title":"Information complexity of online problems","volume":"6281","author":"Hromkovic","year":"2010"},{"issue":"2","key":"10.1016\/j.tcs.2026.115857_bib0032","first-page":"19:1","article-title":"Online algorithms with advice: a survey","volume":"50","author":"Boyar","year":"2017","journal-title":"ACM Comput. Surv."},{"issue":"110","key":"10.1016\/j.tcs.2026.115857_bib0033","article-title":"Computing with advice: when knowledge helps","volume":"2","author":"Dobrev","year":"2013","journal-title":"Bull. EATCS"},{"issue":"3","key":"10.1016\/j.tcs.2026.115857_bib0034","article-title":"Introduction to local certification","volume":"23","author":"Feuilloley","year":"2021","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115857_bib0035","series-title":"Structural information in distributed computing","author":"Ilcinkas","year":"2019"},{"key":"10.1016\/j.tcs.2026.115857_bib0036","series-title":"New ideas on labeling schemes","author":"Rotbart","year":"2016"},{"key":"10.1016\/j.tcs.2026.115857_bib0037","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2021.02.008","article-title":"Short labeling schemes for topology recognition in wireless tree networks","volume":"861","author":"Gorain","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115857_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2023.105010","article-title":"Deterministic size discovery and topology recognition in radio networks with short labels","volume":"292","author":"Ga\u0144czorz","year":"2023","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2026.115857_bib0039","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tcs.2021.02.004","article-title":"Finding the size and the diameter of a radio network using short labels","volume":"864","author":"Gorain","year":"2021","journal-title":"Theor. Comput. Sci."},{"issue":"14\u201315","key":"10.1016\/j.tcs.2026.115857_bib0040","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1016\/j.tcs.2010.01.004","article-title":"Fast radio broadcasting with advice","volume":"411","author":"Ilcinkas","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115857_bib0041","series-title":"The 31St ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019","first-page":"171","article-title":"Constant-Length labeling schemes for deterministic radio broadcast","author":"Ellen","year":"2019"},{"key":"10.1016\/j.tcs.2026.115857_bib0042","series-title":"Networked Systems - 8th International Conference, NETYS 2020","first-page":"146","article-title":"Wireless broadcast with short labels","volume":"12129","author":"Bu","year":"2020"},{"key":"10.1016\/j.tcs.2026.115857_bib0043","series-title":"SPAA \u201920: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","first-page":"213","article-title":"Constant-Length labelling schemes for faster deterministic radio broadcast","author":"Ellen","year":"2020"},{"key":"10.1016\/j.tcs.2026.115857_bib0044","article-title":"Optimal-Length labeling schemes for fast deterministic communication in radio networks","volume":"abs\/2410.07382","author":"Ga\u0144czorz","year":"2024","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.115857_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.113775","article-title":"Lower and upper bounds for deterministic convergecast with labeling schemes","volume":"952","author":"Bu","year":"2023","journal-title":"Theor Comput Sci"},{"issue":"2","key":"10.1016\/j.tcs.2026.115857_bib0046","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.tcs.2026.115857_bib0047","series-title":"Indistinguishability","first-page":"3","author":"Attiya","year":"2014"},{"key":"10.1016\/j.tcs.2026.115857_bib0048","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"1","key":"10.1016\/j.tcs.2026.115857_bib0049","article-title":"Symmetry breaking in graphs","volume":"3","author":"Albertson","year":"1996","journal-title":"Electron. J. Comb."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:37:00Z","timestamp":1774078620000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":49,"alternative-id":["S0304397526001167"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115857","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Labeling schemes for deterministic radio multi-broadcast","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115857","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115857"}}