{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:33Z","timestamp":1760203053055},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_21","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"275-289","source":"Crossref","is-referenced-by-count":0,"title":["Faster Information Gathering in Ad-Hoc Radio Tree Networks"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[]},{"given":"Kevin P.","family":"Costello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"2","key":"21_CR1","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. Comput. Syst. Sci. 43(2), 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-013-9816-x","volume":"67","author":"AF Anta","year":"2013","unstructured":"Anta, A.F., Mosteiro, M.A., Munoz, J.R.: Unbounded contention resolution in multiple-access channels. Algorithmica 67(3), 295\u2013314 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D Bruschi","year":"1997","unstructured":"Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129\u2013135 (1997)","journal-title":"Distrib. Comput."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"BS Chlebus","year":"2002","unstructured":"Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 15(1), 27\u201338 (2002)","journal-title":"Distrib. Comput."},{"key":"21_CR5","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., Gasieniec, 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. 2380, pp. 377\u2013389. Springer, Heidelberg (2002)"},{"key":"21_CR6","unstructured":"Chrobak, M., Costello, K.: Faster information gathering in ad-hoc radio tree networks (2015). \n                    arXiv: 1512.02179"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-319-12691-3_11","volume-title":"Combinatorial Optimization and Applications","author":"M Chrobak","year":"2014","unstructured":"Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 129\u2013145. Springer, Heidelberg (2014)"},{"issue":"2","key":"21_CR8","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., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2), 177\u2013189 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/net.10109","volume":"43","author":"M Chrobak","year":"2004","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. Networks 43(2), 119\u2013124 (2004)","journal-title":"Networks"},{"issue":"1\u20133","key":"21_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1\u20133), 337\u2013364 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A Czumaj","year":"2006","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115\u2013143 (2006)","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"21_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u0151s","year":"1985","unstructured":"Erd\u0151s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                   others. Israel J. Math. 51(1\u20132), 79\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-11476-2_2","volume-title":"Structural Information and Communication Complexity","author":"L Gasieniec","year":"2010","unstructured":"Gasieniec, L.: On efficient gossiping in radio networks. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 2\u201314. Springer, Heidelberg (2010)"},{"key":"21_CR14","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 Gasieniec","year":"2004","unstructured":"Gasieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397\u2013407. Springer, Heidelberg (2004)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S089548010342464X","volume":"18","author":"DR Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Math. 18(2), 332\u2013346 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \n                    \n                      \n                    \n                    $$\\varOmega (D\\log (N\/D))$$\n                    \n                      \n                        \n                          \u03a9\n                          (\n                          D\n                          log\n                          (\n                          N\n                          \/\n                          D\n                          )\n                          )\n                        \n                      \n                    \n                   lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"key":"21_CR18","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: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340\u2013349. Springer, Heidelberg (2002)"},{"key":"21_CR19","unstructured":"De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 208\u2013217 (2008)"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1137\/140982763","volume":"44","author":"G Marco De","year":"2015","unstructured":"De Marco, G., Kowalski, D.R.: Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. SIAM J. Comput. 44(3), 868\u2013888 (2015)","journal-title":"SIAM J. Comput."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"De Marco, G., Kowalski, D.R.: Contention resolution in a non-synchronized multiple access channel. In: IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 525\u2013533 (2013)","DOI":"10.1109\/IPDPS.2013.68"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1130\/0016-7606(1952)63[1117:HAAOET]2.0.CO;2","volume":"63","author":"AN Strahler","year":"1952","unstructured":"Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, 1117\u20131142 (1952)","journal-title":"Bull. Geol. Soc. Amer."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0012-365X(01)00265-5","volume":"246","author":"XG Viennot","year":"2003","unstructured":"Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317\u2013329 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"21_CR24","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 \n                    \n                      \n                    \n                    $$O(n^{1.5})$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            n\n                            \n                              1.5\n                            \n                          \n                          )\n                        \n                      \n                    \n                   deterministic gossiping algorithm for radio networks. Algorithmica 36(1), 93\u201396 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:22:54Z","timestamp":1559406174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}