{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:34Z","timestamp":1725809254192},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_11","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"129-145","source":"Crossref","is-referenced-by-count":2,"title":["Information Gathering in Ad-Hoc Radio Networks with Tree Topology"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darek R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"A Alon","year":"2008","unstructured":"Alon, A., Spencer, J.: The Probabilistic Method. Wiley, Hoboken (2008)"},{"issue":"2","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. Comput. Syst. Sci. 43(2), 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM J. Comput. 22(4), 875\u2013887 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"11_CR4","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":"11_CR5","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."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-007-9123-5","volume":"54","author":"BS Chlebus","year":"2009","unstructured":"Chlebus, B.S., Kowalski, D.R., Radzik, T.: Many-to-many communication in radio networks. Algorithmica 54(1), 118\u2013139 (2009)","journal-title":"Algorithmica"},{"key":"11_CR7","unstructured":"Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology (2014). arXiv 1407.1521"},{"issue":"2","key":"11_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":"11_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":"11_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":"11_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"},{"key":"11_CR12","unstructured":"De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201908), pp. 208\u2013217 (2008)"},{"issue":"1\u20132","key":"11_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, 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                     others. Isr. J. Math. 51(1\u20132), 79\u201389 (1985)","journal-title":"Isr. J. Math."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1112\/jlms\/s1-16.4.212","volume":"16","author":"P Erd\u00f6s","year":"1941","unstructured":"Erd\u00f6s, P., Tur\u00e1n, P.: On a problem of Sidon in additive number theory and on some related problems. J. London Math. Soc. 16, 212\u2013215 (1941)","journal-title":"J. London Math. Soc."},{"key":"11_CR15","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 G\u0105sieniec","year":"2010","unstructured":"G\u0105sieniec, 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":"11_CR16","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":"11_CR17","doi-asserted-by":"crossref","unstructured":"Khabbazian, M., Kowalski, D.R.: Time-efficient randomized multiple-message broadcast in radio networks. In: Proceedings of the 30th Annual Symposium on Principles of Distributed Computing, PODC\u201911, pp. 373\u2013380 (2011)","DOI":"10.1145\/1993806.1993884"},{"issue":"2","key":"11_CR18","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":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"DR Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18(1), 43\u201357 (2005)","journal-title":"Distrib. Comput."},{"issue":"3","key":"11_CR20","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                      $$\\Omega (D\\log (N\/D)$$\n                     lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"key":"11_CR21","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":"11_CR22","first-page":"117","volume":"63","author":"A Strahler","year":"1952","unstructured":"Strahler, A.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, 117\u20131142 (1952)","journal-title":"Bull. Geol. Soc. Amer."},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publl. Math. de l\u2019I.H.E.S. 81, 73\u2013205 (1995)","journal-title":"Publl. Math. de l\u2019I.H.E.S."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0012-365X(01)00265-5","volume":"246","author":"X Viennot","year":"2003","unstructured":"Viennot, X.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317\u2013329 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-002-1010-5","volume":"36","author":"YX An","year":"2003","unstructured":"An, Y.X.: \n                      \n                        \n                      \n                      $$O(n^{1.5})$$\n                     deterministic gossiping algorithm for radio networks. Algorithmica 36(1), 93\u201396 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:33:14Z","timestamp":1559068394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}