{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:16Z","timestamp":1763468176330,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_34","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"492-506","source":"Crossref","is-referenced-by-count":5,"title":["Fast Structuring of Radio Networks Large for Multi-message Communications"],"prefix":"10.1007","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"34_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. of Computer and System Sc.\u00a043(2), 290\u2013298 (1991)","journal-title":"J. of Computer and System Sc."},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","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.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Computer and System Sc.\u00a045(1), 104\u2013126 (1992)","journal-title":"J. of Computer and System Sc."},{"issue":"4","key":"34_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 multi-hop radio networks. SIAM Journal on Computing\u00a022(4), 875\u2013887 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"12","key":"34_CR4","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 Transactions on Communications\u00a033(12), 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-007-9123-5","volume":"54","author":"B. Chlebus","year":"2009","unstructured":"Chlebus, B., Kowalski, D., Radzik, T.: Many-to-many communication in radio networks. Algorithmica\u00a054(1), 118\u2013139 (2009)","journal-title":"Algorithmica"},{"key":"34_CR6","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, pp. 377\u2013389. Springer, Heidelberg (2002)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"34_CR8","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.\u00a05869, pp. 2\u201314. Springer, Heidelberg (2010)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"34_CR10","series-title":"IFIP","first-page":"193","volume-title":"TCS 2002","author":"L. Gasieniec","year":"2002","unstructured":"Gasieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) TCS 2002. IFIP, vol.\u00a096, pp. 193\u2013205. Springer, Boston (2002)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Near-optimal leader election in multi-hop radio networks. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 748\u2013766 (2013)","DOI":"10.1137\/1.9781611973105.54"},{"key":"34_CR12","unstructured":"Ghaffari, M., Haeupler, B., Khabbazian, M.: A bound on the throughput of radio networks. ArXiv Preprint abs\/1302.0264 (2013)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B., Khabbazian, M.: Broadcast in radio networks with collision detection. In: Proc. ACM Symp. on Principles of Distributed Computing (2013)","DOI":"10.1145\/2484239.2484248"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proc. ACM Symp. on Theory of Computing, pp. 293\u2013302 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Khabbazian, M., Kowalski, D.: Time-efficient randomized multiple-message broadcast in radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 373\u2013380 (2011)","DOI":"10.1145\/1993806.1993884"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"issue":"3","key":"34_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 \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing\u00a027(3), 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11922377_11","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"F. Manne","year":"2006","unstructured":"Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known topology radio networks. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol.\u00a04235, pp. 125\u2013134. Springer, Heidelberg (2006)"},{"key":"34_CR19","unstructured":"Xin, Q.: Personal communication (May 2012)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:27Z","timestamp":1746026847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}