{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:12Z","timestamp":1750309212478,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662816","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"523-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Massively Parallel Ruling Set Made Deterministic"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3404-1647","authenticated-orcid":false,"given":"Jeff","family":"Giliberti","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3848-1796","authenticated-orcid":false,"given":"Zahra","family":"Parsaeian","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","author":"Andoni Alexandr","year":"2013","unstructured":"Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev. 2013. Parallel algorithms for geometric graph problems. Proceedings of the forty-sixth annual ACM symposium on Theory of computing (2013). https:\/\/api.semanticscholar.org\/CorpusID:316401"},{"key":"e_1_3_2_1_2_1","volume-title":"Lower Bounds for Maximal Matchings and Maximal Independent Sets. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Balliu Alkida","year":"2019","unstructured":"Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mika\u00ebl Rabie, and Jukka Suomela. 2019. Lower Bounds for Maximal Matchings and Maximal Independent Sets. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019), 481--497. https:\/\/api.semanticscholar.org\/CorpusID:57721262"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3519935.3520027"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/20M1381770"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2903137"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_7_1","volume-title":"Pemmaraju","author":"Berns Andrew","year":"2012","unstructured":"Andrew Berns, James Hegeman, and Sriram V. Pemmaraju. 2012. Super-Fast Distributed Algorithms for Metric Facility Location. ArXiv abs\/1308.2473 (2012). https:\/\/api.semanticscholar.org\/CorpusID:124685"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2611462.2611512"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.4230\/LIPIcs.DISC.2023.11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/s00446-020-00376-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3293611.3331607"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3519935.3520055"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/3382734.3405751"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/3465084.3467903"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/3451992"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3465084.3467937"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.4230\/LIPIcs.DISC.2022.22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/3558481.3591081"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1281100.1281111"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/1.9781611974331.ch20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3212734.3212743"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/FOCS.2019.00097"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1137\/1.9781611975482.99"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-3-642-25591-5_39"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-662-45174-8_35"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1137\/1.9781611973075.76"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.4230\/LIPIcs.FSTTCS.2020.28"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1993806.1993812"},{"key":"e_1_3_2_1_29_1","volume-title":"Pemmaraju","author":"Kothapalli Kishore","year":"2012","unstructured":"Kishore Kothapalli and Sriram V. Pemmaraju. 2012. Super-Fast 3-Ruling Sets. In Foundations of Software Technology and Theoretical Computer Science. https:\/\/api.semanticscholar.org\/CorpusID:16038481"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/2742012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1016\/0022-0000(93)90033-S"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1016\/S0022-0000(05)80069-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/3406325.3451136"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/3519270.3538472"},{"key":"e_1_3_2_1_35_1","volume-title":"C (oct","author":"Schneider Johannes","year":"2013","unstructured":"Johannes Schneider, Michael Elkin, and Roger Wattenhofer. 2013. Symmetry breaking depending on the chromatic number or the neighborhood growth. 509, C (oct 2013), 40--50."}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"acronym":"PODC '24","name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France"},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":35,"alternative-id":["10.1145\/3662158.3662816","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662816","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}