{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T05:15:10Z","timestamp":1714799710692},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0304-3975(01)00256-0","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T15:39:34Z","timestamp":1034177974000},"page":"449-471","source":"Crossref","is-referenced-by-count":30,"title":["The impact of information on broadcasting time in linear radio networks"],"prefix":"10.1016","volume":"287","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00256-0_BIB1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","article-title":"A lower bound for radio broadcast","volume":"43","author":"Alon","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","article-title":"On the time complexity of broadcast in multihop radio networks","volume":"45","author":"Bar-Yehuda","year":"1992","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0222055","article-title":"Multiple communication in multihop radio networks","volume":"22","author":"Bar-Yehuda","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB4","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","article-title":"On broadcasting in radio networks\u2014problem analysis and protocol design","volume":"33","author":"Chlamtac","year":"1985","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB5","unstructured":"B.S. Chlebus, L. Ga\u0327sieniec, A. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA\u20192000, 2000, pp. 861\u2013870."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB6","unstructured":"I. Gaber, Y. Mansour, Broadcast in radio networks, Proc. Sixth Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA\u201995, 1995, pp. 577\u2013585."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB7","unstructured":"E. Kranakis, D. Krizanc, A. Pelc, Fault-tolerant broadcasting in radio networks, Proc. Sixth European Symp. on Algorithms, ESA\u201998, Lecture Notes in Computer Science, Vol. 1461, Springer, Berlin, 1998, pp. 283\u2013294."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB8","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","article-title":"An \u03a9(D log (N\/D)) lower bound for broadcast in radio networks","volume":"27","author":"Kushilevitz","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB9","unstructured":"E. Kushilevitz, Y. Mansour, Computation in noisy radio networks, Proc. Ninth Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA\u201998, 1998, pp. 236\u2013243."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB10","series-title":"Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/S0304-3975(01)00256-0_BIB11","series-title":"Wireless Information Networks","author":"Pahlavan","year":"1995"},{"key":"10.1016\/S0304-3975(01)00256-0_BIB12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(94)90193-7","article-title":"Broadcasting on [0,L]","volume":"53","author":"Ravishankar","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00256-0_BIB13","doi-asserted-by":"crossref","unstructured":"A. Sen, M.L. Huson, A new model for scheduling packet radio networks, Proc. 15th Ann. Joint Conf. of the IEEE Computer and Communication Societies (IEEE INFOCOM\u201996), 1996, pp. 1116\u20131124.","DOI":"10.1109\/INFCOM.1996.493055"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002560?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002560?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:38:58Z","timestamp":1554781138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397501002560"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00256-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}