{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:24:35Z","timestamp":1768307075799,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993884","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"373-380","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Time-efficient randomized multiple-message broadcast in radio networks"],"prefix":"10.1145","author":[{"given":"Majid","family":"Khabbazian","sequence":"first","affiliation":[{"name":"University of Winnipeg, Winnipeg, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method,\" (2ed)","author":"Alon N.","year":"2000","unstructured":"N. Alon and J.H. Spencer , \" The probabilistic method,\" (2ed) . New York : Wiley-Interscience ( 2000 ). N. Alon and J.H. Spencer, \"The probabilistic method,\" (2ed). New York: Wiley-Interscience (2000)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02259748"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/171540.171571"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222055"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676861"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s446-002-8028-1"},{"key":"e_1_3_2_1_8_1","first-page":"717","volume-title":"Proc., 27th International Colloquium on Automata, Languages and Programming (ICALP), 2000","author":"Chlebus B.S.","year":"1853","unstructured":"B.S. Chlebus , L. Gasieniec , A. Ostlin , and J.M. Robson , Deterministic radio broadcasting , in Proc., 27th International Colloquium on Automata, Languages and Programming (ICALP), 2000 , LNCS 1853 , pp. 717 -- 728 . B.S. Chlebus, L. Gasieniec, A. Ostlin, and J.M. Robson, Deterministic radio broadcasting, in Proc., 27th International Colloquium on Automata, Languages and Programming (ICALP), 2000, LNCS 1853, pp. 717 -- 728."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9123-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684427"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796560"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946320"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_57"},{"key":"e_1_3_2_1_15_1","first-page":"193","volume-title":"Proc., 2nd International Conference on Theoretical Computer Science (TCS)","author":"Gasieniec L.","year":"2002","unstructured":"L. Gasieniec , I. Potapov, Gossiping with unit messages in known radio networks , in Proc., 2nd International Conference on Theoretical Computer Science (TCS) , 2002 , pp. 193 -- 205 . L. Gasieniec, I. Potapov, Gossiping with unit messages in known radio networks, in Proc., 2nd International Conference on Theoretical Computer Science (TCS), 2002, pp. 193 -- 205."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860684.1860690"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0126-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702419339"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993884","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":19,"alternative-id":["10.1145\/1993806.1993884","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993884","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}