{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:09Z","timestamp":1750220349208,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1844887"],"award-info":[{"award-number":["CCF-1844887"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461830","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"162-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election"],"prefix":"10.1145","author":[{"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Duan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunhua","family":"Jiang","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,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":"publisher","DOI":"10.1007\/BF02259748"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/171540.171571"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341111"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405713"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087825"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.001"},{"key":"e_1_3_2_1_11_1","volume-title":"Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks. arXiv preprint arXiv:2104.09096","author":"Dani Varsha","year":"2021","unstructured":"Varsha Dani , Aayush Gupta , Thomas P. Hayes , and Seth Pettie . 2021. Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks. arXiv preprint arXiv:2104.09096 ( 2021 ). Varsha Dani, Aayush Gupta, Thomas P. Hayes, and Seth Pettie. 2021. Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks. arXiv preprint arXiv:2104.09096 (2021)."},{"volume-title":"Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN). 447--454","author":"Farach-Colton Mart\u00edn","key":"e_1_3_2_1_12_1","unstructured":"Mart\u00edn Farach-Colton , Rohan J. Fernandes , and Miguel A. Mosteiro . 2006. Lower Bounds for Clear Transmissions in Radio Networks . In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN). 447--454 . https:\/\/doi.org\/10.1007\/11682462_42 Mart\u00edn Farach-Colton, Rohan J. Fernandes, and Miguel A. Mosteiro. 2006. Lower Bounds for Clear Transmissions in Radio Networks. In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN). 447--454. https:\/\/doi.org\/10.1007\/11682462_42"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933121"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC). 51--57","author":"Jurdzi'nski Tomasz","year":"2002","unstructured":"Tomasz Jurdzi'nski , Miroslaw Kutyowski , and Jan Zatopia'nski . 2002 . Efficient algorithms for leader election in radio networks . In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC). 51--57 . https:\/\/doi.org\/10.1145\/571825.571833 Tomasz Jurdzi'nski, Miroslaw Kutyowski, and Jan Zatopia'nski. 2002. Efficient algorithms for leader election in radio networks. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC). 51--57. https:\/\/doi.org\/10.1145\/571825.571833"},{"key":"e_1_3_2_1_16_1","first-page":"11","article-title":"Weak communication in single-hop radio networks: adjusting algorithms to industrial standards","volume":"15","author":"Jurdzi'nski Tomasz","year":"2003","unstructured":"Tomasz Jurdzi'nski and Jan Zatopia'nski . 2003 . Weak communication in single-hop radio networks: adjusting algorithms to industrial standards . Concurrency and Computation: Practice and Experience , Vol. 15 , 11 -- 12 (2003), 1117--1131. Tomasz Jurdzi'nski and Jan Zatopia'nski. 2003. Weak communication in single-hop radio networks: adjusting algorithms to industrial standards. Concurrency and Computation: Practice and Experience, Vol. 15, 11--12 (2003), 1117--1131.","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1144-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0126-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40996-3_31"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1003864"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_18"},{"key":"e_1_3_2_1_23_1","first-page":"32","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"Tsybakov B. S.","year":"1978","unstructured":"B. S. Tsybakov and V. A. Mikhailov . 1978 . Free synchronous packet access in a broadcast channel with feedback . Problemy Peredachi Informatsii , Vol. 14 , 4 (1978), 32 -- 59 . B. S. Tsybakov and V. A. Mikhailov. 1978. Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Informatsii, Vol. 14, 4 (1978), 32--59.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461830","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3409964.3461830","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461830","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":24,"alternative-id":["10.1145\/3409964.3461830","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461830","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}