{"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":1772608862568,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T00:00:00Z","timestamp":1159488000000},"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":[[2007,2,21]]},"DOI":"10.1007\/s00446-006-0011-z","type":"journal-article","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T05:46:53Z","timestamp":1159422413000},"page":"289-300","source":"Crossref","is-referenced-by-count":35,"title":["Faster communication in known topology radio networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,29]]},"reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. In: Proceedings of the 5th Symposium on Principles of Distributed Computing, pp. 98\u2013107 (1986)","DOI":"10.1145\/41840.41849"},{"key":"11_CR3","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-problem analysis and protocol design. IEEE Trans. Commun. 33, 1240\u20131246","journal-title":"IEEE Trans. Commun."},{"key":"11_CR4","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":"11_CR5","doi-asserted-by":"crossref","unstructured":"Christersson, M., G\u0105sieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pp. 377\u2013389 (2002)","DOI":"10.1007\/3-540-45465-9_33"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Proceedings of the 7th European Symposium on Algorithms, pp. 41\u201352 (1999)","DOI":"10.1007\/3-540-48481-7_5"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 3122, pp. 105\u2013116 (2004)","DOI":"10.1007\/978-3-540-27821-4_10"},{"issue":"1","key":"11_CR8","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): Logarithmic inapproximability of the radio broadcast problem. J. Algorithms 52(1): 8\u201325","journal-title":"J. Algorithms"},{"key":"11_CR9","unstructured":"Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proceedings of the 16th ACM-SIAM on Discrete Algorithms, pp. 222\u2013231 (2005)"},{"issue":"1","key":"11_CR10","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): 1\u201320","journal-title":"J. Algorithms"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity. LNCS, vol. 3104, pp. 173\u2013184 (2004)","DOI":"10.1007\/978-3-540-27796-5_16"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 3122, pp. 171\u2013182 (2004)","DOI":"10.1007\/978-3-540-27821-4_16"},{"key":"11_CR13","unstructured":"Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known radio networks. In: Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, LNCS (to appear)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proceedings of the 15th Joint Conference of IEEE Computer and Communication Societies, pp. 1116\u20131124 (1996)","DOI":"10.1109\/INFCOM.1996.493055"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1130\/0016-7606(1952)63[1117:HAAOET]2.0.CO;2","volume":"63","author":"A.N. Strahler","year":"1952","unstructured":"Strahler A.N. (1952): Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Am. 63, 1117\u20131142","journal-title":"Bull. Geol. Soc. Am."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0012-365X(01)00265-5","volume":"246","author":"X.G. Viennot","year":"2002","unstructured":"Viennot X.G. (2002): A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317\u2013329","journal-title":"Discrete Math."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0011-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0011-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0011-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:36Z","timestamp":1559121996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0011-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,29]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,2,21]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0011-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,29]]}}}