{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T05:07:58Z","timestamp":1714799278924},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0020-0190(00)00178-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:16Z","timestamp":1027607296000},"page":"53-56","source":"Crossref","is-referenced-by-count":41,"title":["Faster broadcasting in unknown radio networks"],"prefix":"10.1016","volume":"79","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00178-2_BIB001","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. System Sci."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB002","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","article-title":"On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization","volume":"45","author":"Bar-Yehuda","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB003","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\/S0020-0190(00)00178-2_BIB004","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s004460050030","article-title":"Lower bounds for the broadcast problem in mobile radio networks","volume":"10","author":"Bruschi","year":"1997","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB005","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. Commun."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB006","series-title":"Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'2000","first-page":"861","article-title":"Deterministic broadcasting in unknown radio networks","author":"Chlebus","year":"2000"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB007","series-title":"Proc. 27th Internat. Coll. on Automata, Languages and Programming (ICALP'2000), July 2000, Geneva, Switzerland","first-page":"717","article-title":"Deterministic radio broadcasting","volume":"1853","author":"Chlebus","year":"2000"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB008","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Ga\u0327sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proc. 41st Symposium on Foundations of Computer Science (FOCS'2000), to appear","DOI":"10.1109\/SFCS.2000.892325"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB009","series-title":"Combinatorial Group Testing and its Applications","author":"Du","year":"1993"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Israel J. Math."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB011","series-title":"Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'95","first-page":"577","article-title":"Broadcast in radio networks","author":"Gaber","year":"1995"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB012","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","article-title":"A Perspective on multiaccess channels","volume":"31","author":"Gallager","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB013","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"Hwang","year":"1987","journal-title":"Studia Scient. Math. Hungarica"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB014","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","article-title":"An \u03a9(Dlog(N\/D)) lower bound for broadcast in radio networks","volume":"27","author":"Kushilevitz","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00178-2_BIB015","series-title":"Deterministic radio broadcast with no topological knowledge","author":"Peleg","year":"2000"},{"key":"10.1016\/S0020-0190(00)00178-2_BIB016","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0220002","article-title":"Deterministic sampling\u2014A new technique for fast pattern matching","volume":"20","author":"Vishkin","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:24:02Z","timestamp":1556439842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0020019000001782"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00178-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}