{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:13:13Z","timestamp":1742386393888},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_16","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"173-184","source":"Crossref","is-referenced-by-count":23,"title":["Time Efficient Gossiping in Known Radio Networks"],"prefix":"10.1007","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"16_CR1","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 Journal on Computing\u00a022(4), 875\u2013887 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR2","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, 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"16_CR3","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., Ga\u0327sieniec, L., Lingas, A.: Gossiping with bounded size messages in adhoc 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)"},{"issue":"2","key":"16_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., Ga\u0327sieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks. Journal of Algorithms\u00a043(2), 177\u2013189 (2002)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed multi-broadcast in unknown radio networks. In: 20th ACM Symp. on Principles of Distributed Computing, PODC 2001, pp. 255\u2013264 (2001)","key":"16_CR5","DOI":"10.1145\/383962.384040"},{"doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting Algorithms in Radio Networks with Unknown Topology. In: 44th Symposium on Foundations of Computer Science, FOCS 2003, pp. 492\u2013501 (2003)","key":"16_CR6","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-48481-7_5","volume-title":"Algorithms - ESA\u201999","author":"K. Diks","year":"1999","unstructured":"Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 41\u201352. Springer, Heidelberg (1999)"},{"unstructured":"Gaber, I., Mansour, Y.: Broadcast in radio networks. In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 577\u2013585 (1995)","key":"16_CR8"},{"issue":"83","key":"16_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0020-0190(01)00312-X","volume":"2","author":"L. Ga\u0327sieniec","year":"2002","unstructured":"Ga\u0327sieniec, 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"},{"doi-asserted-by":"crossref","unstructured":"Ga\u0327sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, pp. 193\u2013205 (2002)","key":"16_CR10","DOI":"10.1007\/978-0-387-35608-2_17"},{"key":"16_CR11","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.\u00a02387, pp. 340\u2013349. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: 15th Annual Joint Conference of the IEEE Computer and Communication Societies, pp. 1116\u20131124 (1996)","key":"16_CR12","DOI":"10.1109\/INFCOM.1996.493055"},{"key":"16_CR13","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 Journal on Computing\u00a010, 701\u2013892 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"16_CR14","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(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica\u00a036(1), 93\u201396 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:56Z","timestamp":1605759656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}