{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:07:37Z","timestamp":1763467657794,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"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":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011806","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"266-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["A better wake-up in radio networks"],"prefix":"10.1145","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[{"name":"University of Colorado at Denver, Denver, CO"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbruecken, Germany and Uniwersytet Warszawski, Warszawa, Poland"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0022-0000(91)90015-W"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_3_1","volume-title":"Algorithmic Number Theory","author":"Bach E.","year":"1996","unstructured":"E. Bach , and J. Shallit , \" Algorithmic Number Theory ,\" Vol. I , 1996 , The MIT Press , Cambridge, Massachusetts . E. Bach, and J. Shallit, \"Algorithmic Number Theory,\" Vol. I, 1996, The MIT Press, Cambridge, Massachusetts."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/171540.171571"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1137\/0222055"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/s004460050030"},{"key":"e_1_3_2_1_7_1","first-page":"1240","volume":"33","author":"Chlamtac I.","year":"1985","unstructured":"I. Chlamtac , and S. Kutten , On broadcasting in radio networks -- problem analysis and protocol design, IEEE Transactions on Communications , 33 ( 1985 ) 1240 -- 1246 . I. Chlamtac, and S. Kutten, On broadcasting in radio networks -- problem analysis and protocol design, IEEE Transactions on Communications, 33 (1985) 1240--1246.","journal-title":"On broadcasting in radio networks -- problem analysis and protocol design, IEEE Transactions on Communications"},{"key":"e_1_3_2_1_8_1","first-page":"426","volume":"39","author":"Chlamtac I.","year":"1991","unstructured":"I. Chlamtac , and O. Weinstein , The wave expansion approach to broadcasting in multi-hop radio networks, IEEE Transactions on Communications , 39 ( 1991 ) 426 -- 433 . I. Chlamtac, and O. Weinstein, The wave expansion approach to broadcasting in multi-hop radio networks, IEEE Transactions on Communications, 39 (1991) 426--433.","journal-title":"The wave expansion approach to broadcasting in multi-hop radio networks, IEEE Transactions on Communications"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/s446-002-8028-1"},{"key":"e_1_3_2_1_10_1","first-page":"985","volume-title":"Proc., 15th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chrobak M.","year":"2004","unstructured":"M. Chrobak , L. Gasieniec , and D. Kowalski , The wake-up problem in multi-hop radio networks , in Proc., 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2004 , pp. 985 -- 993 . M. Chrobak, L. Gasieniec, and D. Kowalski, The wake-up problem in multi-hop radio networks, in Proc., 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 985--993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/S0196-6774(02)00004-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/383962.384040"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc., 12th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Clementi A.","year":"2001","unstructured":"A. Clementi , A. Monti , and R. Silvestri , Selective families, superimposed codes, and broadcasting on unknown radio networks , in Proc., 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2001 , 709--718. A. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in Proc., 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, 709--718."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/946243.946320"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/S0097539793254959"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1137\/S0895480100376022"},{"key":"e_1_3_2_1_17_1","first-page":"697","volume-title":"Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk P.","year":"2002","unstructured":"P. Indyk , Explicit constructions of selectors and related combinatorial structures, with applications , in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2002 , pp. 697 -- 704 . P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697--704."},{"key":"e_1_3_2_1_18_1","first-page":"697","volume-title":"Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk P.","year":"2002","unstructured":"P. Indyk , Explicit constructions of selectors and related combinatorial structures, with applications , in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2002 , pp. 697 -- 704 . P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697--704."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/571825.571833"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/646345.690046"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/645413.652128"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/646517.696314"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/872035.872045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1137\/S0097539794279109"},{"doi-asserted-by":"crossref","unstructured":"D. Peleg \"Distributed Computing. A Locality-Sensitive Approach \" 2000 SIAM Philadelphia Pennsylvania.   D. Peleg \"Distributed Computing. A Locality-Sensitive Approach \" 2000 SIAM Philadelphia Pennsylvania.","key":"e_1_3_2_1_25_1","DOI":"10.1137\/1.9780898719772"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/380752.380790"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/778415.778420"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC04","name":"PODC04: Principles of Distributed Computing 2004","location":"St. John's Newfoundland Canada"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:13:41Z","timestamp":1748895221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":27,"alternative-id":["10.1145\/1011767.1011806","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011806","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}