{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:51Z","timestamp":1750219851029,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Icelandic Research Fund","award":["217965"],"award-info":[{"award-number":["217965"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591095","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"455-465","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Coloring Fast with Broadcasts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2693-0470","authenticated-orcid":false,"given":"Maxime","family":"Flin","sequence":"first","affiliation":[{"name":"Reykjavik University, Reykjavik, Iceland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4213-9898","authenticated-orcid":false,"given":"Mohsen","family":"Ghaffari","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5774-8437","authenticated-orcid":false,"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[{"name":"Reykjavik University, Reykjavik, Iceland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-5037","authenticated-orcid":false,"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3952-0586","authenticated-orcid":false,"given":"Alexandre","family":"Nolin","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Kook Jin Ahn Sudipto Guha and Andrew McGregor. 2012. Graph sketches: sparsification spanners and subgraphs. In PODS. ACM 5--14. https:\/\/doi.org\/10.1145\/2213556.2213560","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.48"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Sepehr Assadi Gillat Kol and Rotem Oshman. 2020. Lower bounds for distributed sketching of maximal matchings and maximal independent sets. In PODC. ACM 79--88. https:\/\/doi.org\/10.1145\/3382734.3405732","DOI":"10.1145\/3382734.3405732"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00115"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Sepehr Assadi Pankaj Kumar and Parth Mittal. 2022b. Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \u0394-coloring. In STOC. ACM 234--247. https:\/\/doi.org\/10.1145\/3519935.3520005","DOI":"10.1145\/3519935.3520005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903137"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1233534"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1286955"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1249527"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Andrew Drucker Fabian Kuhn and Rotem Oshman. 2014. On the power of the congested clique model. In PODC. ACM 367--376. https:\/\/doi.org\/10.1145\/2611462.2611493","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.26"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch98"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Sebastian Forster and Tijn de Vos. 2022. The Laplacian Paradigm in the Broadcast Congested Clique. In PODC. ACM 335--344. https:\/\/doi.org\/10.1145\/3519270.3538436","DOI":"10.1145\/3519270.3538436"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.73"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00101"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451089"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113711"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Magn\u00fas M. Halld\u00f3rsson Fabian Kuhn Alexandre Nolin and Tigran Tonoyan. 2022a. Near-optimal distributed degree1 coloring. In STOC. ACM 450--463. https:\/\/doi.org\/10.1145\/3519935.3520023","DOI":"10.1145\/3519935.3520023"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Magn\u00fas M. Halld\u00f3rsson Alexandre Nolin and Tigran Tonoyan. 2022b. Overcoming congestion in distributed coloring. In PODC. ACM 26--36. https:\/\/doi.org\/10.1145\/3519270.3538438","DOI":"10.1145\/3519270.3538438"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178120"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00064-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01325-7_28"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2017.4"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00424-y"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250767"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.05.006"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1378762.1378763"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"V\u00e1clav Rozhovn and Mohsen Ghaffari. 2020. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In STOC. ACM 350--363. https:\/\/doi.org\/10.1145\/3357713.3384298","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Johannes Schneider and Roger Wattenhofer. 2010. A new technique for distributed symmetry breaking. In PODC. ACM 257--266. https:\/\/doi.org\/10.1145\/1835698.1835760","DOI":"10.1145\/1835698.1835760"}],"event":{"name":"SPAA '23: 35th 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":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:06Z","timestamp":1750178826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":39,"alternative-id":["10.1145\/3558481.3591095","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591095","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}