{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:24Z","timestamp":1783576944762,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","funder":[{"name":"MUR (Italy) Department of Excellence 2023 - 2027","award":["PE0000013"],"award-info":[{"award-number":["PE0000013"]}]},{"name":"PNRR MIUR research project GAMING ``Graph Algorithms and MinINg for Green agents'","award":["CUP D13C24000430001"],"award-info":[{"award-number":["CUP D13C24000430001"]}]},{"name":"ANR projects DUCAT","award":["ANR-20-CE48-0006"],"award-info":[{"award-number":["ANR-20-CE48-0006"]}]},{"name":"ANR project ENEDISC","award":["ANR-24-CE48-7768-01"],"award-info":[{"award-number":["ANR-24-CE48-7768-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733499","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"417-427","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5293-8365","authenticated-orcid":false,"given":"Alkida","family":"Balliu","sequence":"first","affiliation":[{"name":"Gran Sasso Science Institute, L'Aquila, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4534-4803","authenticated-orcid":false,"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"IRIF, CNRS, Universit\u00e9 Paris Cit\u00e9, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6600-6443","authenticated-orcid":false,"given":"Dennis","family":"Olivetti","sequence":"additional","affiliation":[{"name":"Gran Sasso Science Institute, L'Aquila, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6782-7625","authenticated-orcid":false,"given":"Mika\u00ebl","family":"Rabie","sequence":"additional","affiliation":[{"name":"IRIF, CNRS, Universit\u00e9 Paris Cit\u00e9, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"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\/978-3-031-60603-8_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662773"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538419"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 35th Int. Symp. on Distributed Computing (DISC) (LIPIcs","volume":"19","author":"Barenboim Leonid","year":"2021","unstructured":"Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In Proc. 35th Int. Symp. on Distributed Computing (DISC) (LIPIcs, Vol. 209). 10:1\u201310:19."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3288599.3288601"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1158604"},{"key":"e_1_3_2_1_8_1","volume-title":"50th ACM Symposium on Theory of Computing (STOC). 445\u2013456","author":"Chang Yi-Jun","year":"2018","unstructured":"Yi-Jun Chang, Wenzheng Li, and Seth Pettie. 2018. An optimal distributed (\u0394+1)-coloring algorithm?. In 50th ACM Symposium on Theory of Computing (STOC). 445\u2013456."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405713"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341111"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_1_12_1","volume-title":"Distributed Coloring in the SLEEPING Model. CoRR abs\/2405.10058","author":"Dufoulon Fabien","year":"2024","unstructured":"Fabien Dufoulon, Pierre Fraigniaud, Mika\u00ebl Rabie, and Hening Zheng. 2024. Distributed Coloring in the SLEEPING Model. CoRR abs\/2405.10058 (2024)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594574"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.01.023"},{"key":"e_1_3_2_1_15_1","volume-title":"Average Awake Complexity of MIS and Matching. In 34th ACM Symposium on Parallelism in Algorithms and Architectures. 45\u201355","author":"Ghaffari Mohsen","year":"2022","unstructured":"Mohsen Ghaffari and Julian Portmann. 2022. Average Awake Complexity of MIS and Matching. In 34th ACM Symposium on Parallelism in Algorithms and Architectures. 45\u201355."},{"key":"e_1_3_2_1_16_1","volume-title":"Distributed MIS with Low Energy and Time Complexities. In ACM Symposium on Principles of Distributed Computing. 146\u2013156","author":"Ghaffari Mohsen","year":"2023","unstructured":"Mohsen Ghaffari and Julian Portmann. 2023. Distributed MIS with Low Energy and Time Complexities. In ACM Symposium on Principles of Distributed Computing. 146\u2013156."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520023"},{"key":"e_1_3_2_1_18_1","volume-title":"Awake-Efficient Distributed Algorithms for Maximal Independent Set. In 42nd IEEE International Conference on Distributed Computing Systems. 1338\u20131339","author":"Hourani Khalid","year":"2022","unstructured":"Khalid Hourani, Gopal Pandurangan, and Peter Robinson. 2022. Awake-Efficient Distributed Algorithms for Maximal Independent Set. In 42nd IEEE International Conference on Distributed Computing Systems. 1338\u20131339."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571833"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_31"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.49"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877942"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"}],"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.3733499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:45Z","timestamp":1749824805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":24,"alternative-id":["10.1145\/3732772.3733499","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733499","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"}}]}}