{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:21:02Z","timestamp":1772608862556,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T00:00:00Z","timestamp":1150848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,11,23]]},"DOI":"10.1007\/s00446-006-0007-8","type":"journal-article","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T09:34:37Z","timestamp":1150796077000},"page":"185-195","source":"Crossref","is-referenced-by-count":90,"title":["Optimal Deterministic Broadcasting in Known Topology Radio Networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"Alon N., Bar-Noy A., Linial N., Peleg D. (1991) A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290\u2013298","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda R., Goldreich O., Itai A. (1992) On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104\u2013126","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Bruschi","year":"1997","unstructured":"Bruschi D., Del Pinto M. (1997) Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10, 129\u2013135","journal-title":"Distrib. Comput."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac I., Kutten S. (1985) On broadcasting in radio networks \u2013 problem analysis and protocol design. IEEE Trans. Commun. 33, 1240\u20131246","journal-title":"IEEE Trans. Commun."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac I., Weinstein O. (1991) The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426\u2013433","journal-title":"IEEE Trans. Commun."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B. Chlebus","year":"2002","unstructured":"Chlebus B., G\u0105sieniec L., Gibbons A., Pelc A., Rytter W. (2002) Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 27\u201338","journal-title":"Distrib. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chlebus, B., G\u0105sieniec, L., \u00d6stlin, A., Robson, J.M. Deterministic radio broadcasting. In: Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP). LNCS vol. 1853, pp. 717\u2013728. Springer, Berlin Heidelberg New York. (2000)","DOI":"10.1007\/3-540-45022-X_60"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M. Chrobak","year":"2002","unstructured":"Chrobak M., G\u0105sieniec L., Rytter W. (2002) Fast broadcasting and gossiping in radio networks. J. Algorithms 43, 177\u2013189","journal-title":"J. Algorithms"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R. Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W. Broadcasting algorithms in radio networks with unknown topology. In: Proceedings of 44th Symposium on Foundations of Computer Science (FOCS), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(00)00178-2","volume":"79","author":"G. Marco De","year":"2001","unstructured":"De Marco G., Pelc A. (2001) Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79, 53\u201356","journal-title":"Inf. Process. Lett."},{"key":"7_CR12","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salvatipour, M.R. Combination can be hard: approximability of the Unique Coverage Problem. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M. Elkin","year":"2004","unstructured":"Elkin M., Kortsarz G. (2004) A logarithmic lower bound for radio broadcast. J. Algorithms 52, 8\u201325","journal-title":"J. Algorithms"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G. Polylogarithmic additive inapproximability of the radio broadcast problem. In: Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LNCS vol. 3122, pp. 105\u2013116. Springer, Berlin Heidelberg New York. (2004)","DOI":"10.1007\/978-3-540-27821-4_10"},{"key":"7_CR15","unstructured":"Elkin, M., Kortsarz, G. Improved schedule for radio broadcast. In: Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 222\u2013231 (2005)"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I. Gaber","year":"2003","unstructured":"Gaber I., Mansour Y. (2003) Centralized broadcast in multihop radio networks. J. Algorithms 46, 1\u201320","journal-title":"J. Algorithms"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Peleg, D., Xin, Q. Faster communication in known topology radio networks. In: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S089548010342464X","volume":"18","author":"D. Kowalski","year":"2004","unstructured":"Kowalski D., Pelc A. (2004) Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Math. 18, 332\u2013346","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"D. Kowalski","year":"2005","unstructured":"Kowalski D., Pelc A. (2005) Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43\u201357","journal-title":"Distrib. Comput."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz E., Mansour Y. (1998) An $$\\Omega(D \\log (N\/D))$$ lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702\u2013712","journal-title":"SIAM J. Comput."},{"key":"7_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani R., Raghavan P. (1995) Randomized Algorithms. Cambridge University Press, Cambridge"},{"key":"7_CR22","first-page":"117","volume":"63","author":"A.N. Strahler","year":"1952","unstructured":"Strahler A.N. (1952) Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, 117\u20131142","journal-title":"Bull. Geol. Soc. Amer."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0007-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0007-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0007-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0007-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,21]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11,23]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0007-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,21]]}}}