{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:39:17Z","timestamp":1773931157574,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"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":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594587","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"146-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributed MIS with Low Energy and Time Complexities"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4213-9898","authenticated-orcid":false,"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[{"name":"MIT, Cambridge, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8481-3986","authenticated-orcid":false,"given":"Julian","family":"Portmann","sequence":"additional","affiliation":[{"name":"ETH Zurich, Z\u00fcrich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538459"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461458"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_5_1","volume-title":"Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC","author":"Barenboim Leonid","year":"2021","unstructured":"Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021."},{"key":"e_1_3_2_1_6_1","volume-title":"Deterministic Logarithmic Completeness in the Distributed Sleeping Model. arXiv preprint arXiv:2108.01963","author":"Barenboim Leonid","year":"2021","unstructured":"Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. arXiv preprint arXiv:2108.01963 (2021)."},{"key":"e_1_3_2_1_7_1","unstructured":"Otakar Bor\u016fvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. (1926)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"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\/3055399.3055481"},{"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":"Proceedings of the 42nd Symposium on Principles of Distributed Computing.","author":"Dufoulon Fabien","year":"2023","unstructured":"Fabien Dufoulon, William K. Moses, Jr., and Gopal Pandurangan. 2023. Distributed MIS in O(log log n) Awake Complexity. In Proceedings of the 42nd Symposium on Principles of Distributed Computing. to appear."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch168"},{"key":"e_1_3_2_1_14_1","volume-title":"Spira","author":"Gallager Robert G.","year":"1983","unstructured":"Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. 1983. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and systems (TOPLAS) 5, 1 (1983), 66--77."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310485"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538566"},{"key":"e_1_3_2_1_20_1","volume-title":"Awake-Efficient Distributed Algorithms for Maximal Independent Set. In 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 1338--1339","author":"Hourani Khalid","year":"2022","unstructured":"Khalid Hourani, Gopal Pandurangan, and Peter Robinson. 2022. Awake-Efficient Distributed Algorithms for Maximal Independent Set. In 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 1338--1339."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571833"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_31"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.49"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_27_1","volume-title":"Randomized algorithms","author":"Motwani Rajeev","unstructured":"Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized algorithms. Cambridge university press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","location":"Orlando FL USA","acronym":"PODC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":28,"alternative-id":["10.1145\/3583668.3594587","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594587","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}