{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:34:07Z","timestamp":1794357247560,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_56","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:36:37Z","timestamp":1214490997000},"page":"105-108","source":"Crossref","is-referenced-by-count":0,"title":["Broadcasting in Geometric Radio Networks"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"56_CR1_56","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 radio networks: an exponential gap between determinism and randomization. J.\u00a0Comput. Syst. Sci. 45, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"56_CR2_56","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, 129\u2013135 (1997)","journal-title":"Distrib. Comput."},{"key":"56_CR3_56","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. 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, 27\u201338 (2002)","journal-title":"Distrib. Comput."},{"key":"56_CR4_56","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Pelc, A.: Tradeoffs between knowledge and time of communication in geometric radio networks. Proc. 13th Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 59\u201366, Crete Greece, July 3\u20136, 2001","DOI":"10.1145\/378580.378590"},{"key":"56_CR5_56","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jda.2006.07.001","volume":"5","author":"A. Dessmark","year":"2007","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J.\u00a0Discret. Algorithms 5, 187\u2013201 (2007)","journal-title":"J. Discret. Algorithms"},{"key":"56_CR6_56","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0304-3975(01)00256-0","volume":"287","author":"K. Diks","year":"2002","unstructured":"Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theor. Comput. Sci. 287, 449\u2013471 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"56_CR7_56","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R. Gallager","year":"1985","unstructured":"Gallager, R.: A\u00a0Perspective on Multiaccess Channels. IEEE Trans. Inf. Theory 31, 124\u2013142 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"56_CR8_56","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. J.\u00a0Algorithms 39, 47\u201367 (2001)","journal-title":"J. Algorithms"},{"key":"56_CR9_56","doi-asserted-by":"crossref","unstructured":"Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PODC), pp. 334\u2013341, Las Vegas, July 17\u201320 2005","DOI":"10.1145\/1073814.1073879"},{"key":"56_CR10_56","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0166-218X(94)90193-7","volume":"53","author":"K. Ravishankar","year":"1994","unstructured":"Ravishankar, K., Singh, S.: Broadcasting on $$ { [0,L] } $$. Discret. Appl. Math. 53, 299\u2013319 (1994)","journal-title":"Discret. Appl. Math."},{"key":"56_CR11_56","doi-asserted-by":"crossref","unstructured":"Sen, A., Huson, M. L.: A\u00a0New Model for Scheduling Packet Radio Networks. Proc. 15th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM'96), pp.\u00a01116\u20131124, San Francisco, 24\u201328 March, 1996","DOI":"10.1109\/INFCOM.1996.493055"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:36Z","timestamp":1738254756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_56"}},"subtitle":["2001; Dessmark, Pelc"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_56","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}