{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:11:57Z","timestamp":1742397117467,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_54","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"483-492","source":"Crossref","is-referenced-by-count":19,"title":["A Randomized Algorithm for Gossiping in Radio Networks"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991) 290\u2013298.","journal-title":"Journal of Computer and System Sciences"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0196-6774(92)90015-5","volume":"13","author":"N. Alon","year":"1992","unstructured":"N. Alon, A. Bar-Noy, N. Linial and D. Peleg, Single round simulation of radio networks, Journal of Algorithms 13 (1992) 188\u2013210.","journal-title":"Journal of Algorithms"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992) 104\u2013126.","journal-title":"Journal of Computer and System Sciences"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993) 875\u2013887.","journal-title":"SIAM Journal on Computing"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Bruschi","year":"1997","unstructured":"D. Bruschi and M. del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997) pp. 129\u2013135","journal-title":"Distributed Computing"},{"unstructured":"B.S. Chlebus, L. G\u0151sieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861\u2013870.","key":"54_CR6"},{"doi-asserted-by":"crossref","unstructured":"M. Chlebus, L. G\u0151sieniec, A. \u00d6stlin and J.M. Robson, Deterministic broadcasting in radio networks, Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP\u20192000.","key":"54_CR7","DOI":"10.1007\/3-540-45022-X_60"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"I. Chlamtac and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (1985) 1240\u20131246.","journal-title":"IEEE Transactions on Communications"},{"doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. G\u0151sieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, 41st Annual IEEE Conference on Foundations of Computer Science, FOCS\u201900, 2000, pp. 575\u2013581.","key":"54_CR9","DOI":"10.1109\/SFCS.2000.892325"},{"doi-asserted-by":"crossref","unstructured":"K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact of knowledge on broadcasting time in radio networks, In Proc. 7th European Symp. on Algorithms (1999) 41\u201352","key":"54_CR10","DOI":"10.1007\/3-540-48481-7_5"},{"unstructured":"G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, unpublished manuscript, 1999.","key":"54_CR11"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1109\/18.720543","volume":"IT-44","author":"A. Ephremides","year":"1998","unstructured":"A. Ephremides and B. Hajek, Information theory and communication networks: an unconsummated union, IEEE Trans. on Inf. Theory, IT-44 (1998) 2416\u20132434.","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"IT-31","author":"R. Gallager","year":"1985","unstructured":"R. Gallager, A perspective on multiaccess communications, IEEE Trans. on Inf. Theory, IT-31 (1985) 124\u2013142.","journal-title":"IEEE Trans. on Inf. Theory"},{"unstructured":"I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms, 1995, pp. 577\u2013585.","key":"54_CR14"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.T. Hedetniemi","year":"1988","unstructured":"S.T. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communicatio nnetworks, Networks 18 (1988) 319\u2013349.","journal-title":"Networks"},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"IT-31","author":"J. Komlos","year":"1985","unstructured":"J. Komlos and A.G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. on Inf. Theory, IT-31 (1985) 302\u2013306.","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"54_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68530-8_24","volume-title":"Proc. 6th European Symposium on Algorithms","author":"E. Kranakis","year":"1998","unstructured":"E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, in Proc. 6th European Symposium on Algorithms, Venice, Italy, 1998, Springer LNCS 1461, pp. 283\u2013294."},{"key":"54_CR18","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"E. Kushilevitz and Y. Mansour, An O(Dlg(N\/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998) 702\u2013712.","journal-title":"SIAM Journal on Computing"},{"unstructured":"E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236\u2013243.","key":"54_CR19"},{"key":"54_CR20","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","volume":"IT-31","author":"J.L. Massey","year":"1985","unstructured":"J.L. Massey and P. Mathys, The collision channel without feedback, IEEE Trans. on Inf. Theory, IT-31 (1985) 192\u2013204.","journal-title":"IEEE Trans. on Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.","key":"54_CR21","DOI":"10.1017\/CBO9780511814075"},{"key":"54_CR22","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, New York, 1995."},{"unstructured":"D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript, 2000.","key":"54_CR23"},{"key":"54_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(93)E0176-Y","volume":"61","author":"K. Ravishankar","year":"1995","unstructured":"K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discr. Appl. Math. 61 (1995) 61\u201382.","journal-title":"Discr. Appl. Math"},{"key":"54_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1142\/S0129626496000121","volume":"6","author":"K. Ravishankar","year":"1996","unstructured":"K. Ravishankar and S. Singh, Gossiping on a ring with radios, Parallel Processing Letters 6 (1996), p. 115\u2013126.","journal-title":"Parallel Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"A. Sen and M.L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Ann. Joint Conference of the IEEE Computer and Communication Societies, 1996, pp. 1116\u20131124.","key":"54_CR26","DOI":"10.1109\/INFCOM.1996.493055"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T03:32:59Z","timestamp":1739849579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}