{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985068,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2402837"],"award-info":[{"award-number":["CCF-2402837"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-231-0191"],"award-info":[{"award-number":["W911NF-231-0191"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733560","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"432-435","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1414-7268","authenticated-orcid":false,"given":"Dominick","family":"Banasik","sequence":"first","affiliation":[{"name":"Rochester Institute of Technology, Rochester, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1651-1987","authenticated-orcid":false,"given":"Varsha","family":"Dani","sequence":"additional","affiliation":[{"name":"Rochester Institute of Technology, Rochester, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2977-4109","authenticated-orcid":false,"given":"Fabien","family":"Dufoulon","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4630-1787","authenticated-orcid":false,"given":"Aayush","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, Texas, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2718-572X","authenticated-orcid":false,"given":"Thomas","family":"Hayes","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5833-6592","authenticated-orcid":false,"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, Texas, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-012-0175-7"},{"key":"e_1_3_2_1_2_1","volume-title":"Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection","author":"Bar-Yehuda Reuven","unstructured":"Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1989. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. In Distributed Algorithms, Jean-Claude Bermond and Michel Raynal (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 24\u201332."},{"key":"e_1_3_2_1_3_1","volume-title":"Conference version: ACM STOC","author":"Yi-Jun","year":"2019","unstructured":"Yi-Jun Changghaffari-podc2013, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, and Wei Zhan. 2019. Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15, 4 (2019), 49:1\u201349:31. Conference version: ACM STOC 2017.."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467950"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00426-w"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484257"},{"key":"e_1_3_2_1_8_1","volume-title":"Tight Bounds for MIS in Multichannel Radio Networks","author":"Daum Sebastian","unstructured":"Sebastian Daum and Fabian Kuhn. 2015. Tight Bounds for MIS in Multichannel Radio Networks. In Distributed Computing, Yoram Moses (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 573\u2013587."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594595"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594574"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_42"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884455"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484248"},{"key":"e_1_3_2_1_14_1","volume-title":"Average Awake Complexity of MIS and Matching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 45\u201355","author":"Ghaffari Mohsen","year":"2022","unstructured":"Mohsen Ghaffari and Julian Portmann. 2022. Average Awake Complexity of MIS and Matching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 45\u201355."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594587"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571833"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-010-0121-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHSS.2004.1392071"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073842"},{"key":"e_1_3_2_1_21_1","volume-title":"What Is the Use of Collision Detection (in Wireless Networks)?","author":"Schneider Johannes","unstructured":"Johannes Schneider and Roger Wattenhofer. 2010. What Is the Use of Collision Detection (in Wireless Networks)?. In Distributed Computing, Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 133\u2013147."},{"key":"e_1_3_2_1_22_1","volume-title":"Lecture Notes in Computer Science","volume":"4621","author":"Wagner Dorothea","year":"2007","unstructured":"Dorothea Wagner and Roger Wattenhofer (Eds.). 2007. Algorithms for Sensor and Ad Hoc Networks. Lecture Notes in Computer Science, Vol. 4621. Springer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2004.12.037"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733560","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:27Z","timestamp":1749824667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":23,"alternative-id":["10.1145\/3732772.3733560","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733560","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}