{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:02:03Z","timestamp":1768276923422,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540488224","type":"print"},{"value":"9783540488248","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11922377_11","type":"book-chapter","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T11:21:13Z","timestamp":1165317673000},"page":"125-134","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Manne","sequence":"first","affiliation":[]},{"given":"Qin","family":"Xin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: Proc. 31st Symp. on Foundations of Computer Science, pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"key":"11_CR2","doi-asserted-by":"publisher","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.: A lower bound for radio broadcast. J. Computer and System Sciences\u00a043, 290\u2013298 (1991)","journal-title":"J. Computer and System Sciences"},{"key":"11_CR3","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: Proc. 5th Symp. on Principles of Distributed Computing, pp. 98\u2013107 (1986)","DOI":"10.1145\/41840.41849"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","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.: Fast broadcasting and gossiping in radio networks. J. of Algorithms\u00a043(2), 177\u2013189 (2002)","journal-title":"J. of Algorithms"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. on Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Trans. on Communications"},{"key":"11_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. Manuscript (2006)","DOI":"10.1007\/11940128_35"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symp. on Foundations of Computer Science, pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. In: Proc. INFOCOM (1987)","DOI":"10.1109\/TC.1987.1676861"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Proc. 7th European Symp. on Algorithms, pp. 41\u201352 (1999)","DOI":"10.1007\/3-540-48481-7_5"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-27821-4_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 105\u2013116. Springer, Heidelberg (2004)"},{"key":"11_CR12","unstructured":"Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (2005)"},{"key":"11_CR13","unstructured":"Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 577\u2013585 (1995)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45465-9_33","volume-title":"Automata, Languages and Programming","author":"M. Christersson","year":"2002","unstructured":"Christersson, M., G\u0105sieniec, L., Lingas, A.: Gossiping with bounded size messages in ad hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 377. Springer, Heidelberg (2002)"},{"issue":"83","key":"11_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0020-0190(01)00312-X","volume":"2","author":"L. G\u0105sieniec","year":"2002","unstructured":"G\u0105sieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters\u00a02(83), 89\u201394 (2002)","journal-title":"Information Processing Letters"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-540-27836-8_57","volume-title":"Automata, Languages and Programming","author":"L. Ga\u0327sieniec","year":"2004","unstructured":"Ga\u0327sieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic M2M multicast in radio networks. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 670\u2013682. Springer, Heidelberg (2004)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. 2nd IFIP Int. Conference on Theoretical Computer Science, pp. 193\u2013205 (2002)","DOI":"10.1007\/978-0-387-35608-2_17"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-27796-5_16","volume-title":"Structural Information and Communication Complexity","author":"L. G\u0105sieniec","year":"2004","unstructured":"G\u0105sieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 173\u2013184. Springer, Heidelberg (2004)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2005, pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-27810-8_34","volume-title":"Algorithm Theory - SWAT 2004","author":"L. G\u0105sieniec","year":"2004","unstructured":"G\u0105sieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 397\u2013407. Springer, Heidelberg (2004)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-27821-4_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"D. Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-45655-4_37","volume-title":"Computing and Combinatorics","author":"D. Liu","year":"2002","unstructured":"Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, p. 340. Springer, Heidelberg (2002)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proc. 15th Joint Conf. of IEEE Computer and Communication Societies, pp. 1116\u20131124 (1996)","DOI":"10.1109\/INFCOM.1996.493055"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. on Computing\u00a010, 701\u2013892 (1981)","journal-title":"SIAM J. on Computing"},{"key":"11_CR25","doi-asserted-by":"publisher","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.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer.\u00a063, 1117\u20131142 (1952)","journal-title":"Bull. Geol. Soc. Amer."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0012-365X(01)00265-5","volume":"246","author":"X.G. Viennot","year":"2002","unstructured":"Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Mathematics\u00a0246, 317\u2013329 (2002)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-002-1010-5","volume":"36","author":"Y. Xu","year":"2003","unstructured":"Xu, Y.: An O(n 1.5) deterministic gossiping algorithm for radio networks. Algorithmica\u00a036(1), 93\u201396 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11922377_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T12:26:35Z","timestamp":1628166395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11922377_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488224","9783540488248"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11922377_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}