{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:10:30Z","timestamp":1737263430431,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_46","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"512-524","source":"Crossref","is-referenced-by-count":5,"title":["Deterministic Communication in Radio Networks with Large Labels"],"prefix":"10.1007","author":[{"given":"Leszek","family":"Ga\u015fieniec","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"46_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), pp. 290\u2013298.","journal-title":"Journal of Computer and System Sciences"},{"key":"46_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":"R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45 (1992), pp. 104\u2013126.","journal-title":"Journal of Computer and System Sciences"},{"key":"46_CR3","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), pp. 875\u2013887.","journal-title":"SIAM Journal on Computing"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Brusci","year":"1997","unstructured":"D. Brusci, 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"},{"issue":"3","key":"46_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, IEEE Trans. on Communications, 39(3), pp. 426\u2013433, 1991.","journal-title":"IEEE Trans. on Communications"},{"key":"46_CR6","unstructured":"B.S. Chlebus, L. Ga\u015fieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, (SODA\u20192000), pp. 861\u2013870."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"B. S. Chlebus, L. Gasieniec, A. Lingas, and A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, In Proc 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, (DIALM\u20192001), pp. 44\u201351.","DOI":"10.1145\/381448.381454"},{"key":"46_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/3-540-45022-X_60","volume-title":"Deterministic radio broadcasting","author":"B. S. Chlebus","year":"2000","unstructured":"B. S. Chlebus, L. Ga\u015fieniec, A. \u00d6stlin, and J.M. Robson, Deterministic radio broadcasting, In Proc 27th Int. Colloq. on Automata, Languages and Programming, (ICALP\u20192000), LNCS 1853, pp. 717\u2013728."},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"M. Christersson, L. Ga\u015fieniec, and A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, to appear in Proc 29th Int. Colloq. on Automata, Languages and Programming, (ICALP\u20192002), Malaga, July 2002.","DOI":"10.1007\/3-540-45465-9_33"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Ga\u015fieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, In Proc. 7th Annual Int. Computing and Combinatorics Conference, (COCOON\u20192001), pp. 483\u2013492.","DOI":"10.1007\/3-540-44679-6_54"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Ga\u015fieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, In Proc. 41st IEEE Symp. on Found. of Computer Science, (FOCS\u20192000), pp. 575\u2013581. A full version to appear in Journal of Algorithms.","DOI":"10.1109\/SFCS.2000.892325"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"A. E. F. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, 2001, pp. 709\u2013718.","DOI":"10.1145\/383962.384040"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"A.E. F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for faulttolerant broadcasting on wireless networks, In Proc. 9th Ann. European Symposium on Algorithms, (ESA\u20192001), pp 452\u2013463.","DOI":"10.1007\/3-540-44676-1_38"},{"issue":"2","key":"46_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(00)00178-2","volume":"79","author":"G. Marco De","year":"2001","unstructured":"G. De Marco, and A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters, 79(2), pp 53\u201356, (2001).","journal-title":"Information Processing Letters"},{"key":"46_CR15","unstructured":"L. Ga\u015fieniec & A. Lingas, On adaptive deterministic gossiping in ad-hoc radio networks, In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u20192002), January 2002, pp 689\u2013690."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"L. Ga\u015fieniec and I. Potapov, Gossiping with unit messages in known radio networks, to appear in Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.","DOI":"10.1007\/978-0-387-35608-2_17"},{"key":"46_CR17","unstructured":"P. Indyk, Explicit constructions of selectors and related combinatorial structures with applications, In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, (SODA\u20192002), January 2002, pp 697\u2013704."},{"key":"46_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 \u03a9(Dlog(N\/D)) lower bound for broadcast in radio networks, SIAM J. on Computing, 27 (1998), pp. 702\u2013712.","journal-title":"SIAM J. on Computing"},{"key":"46_CR19","unstructured":"D. Peleg, Deterministic radio broadcast with no topological knowledge, 2000, a manuscript."},{"key":"46_CR20","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, Discrete Applied Mathematics 61 (1995), pp 61\u201382.","journal-title":"Discrete Applied Mathematics"},{"key":"46_CR21","doi-asserted-by":"crossref","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, Par. Proc. Let. 6, (1996), pp 115\u2013126.","journal-title":"Par. Proc. Let."},{"key":"46_CR22","unstructured":"S. Tabbane, Handbook of Mobile Radio Networks, Artech House Publishers, 2000."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:47:42Z","timestamp":1737175662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}