{"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":1750219851871,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"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":"German Research Foundation","award":["491819048"],"award-info":[{"award-number":["491819048"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591319","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"489-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2272-4483","authenticated-orcid":false,"given":"Marc","family":"Fuchs","sequence":"first","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}],"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"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_3_2_1","volume-title":"Proc. 41st Annual ACM Symp. on Theory of Computing (STOC). 111--120","author":"Barenboim Leonid","year":"2009","unstructured":"Leonid Barenboim and Michael Elkin. 2009. Distributed (delta1)-coloring in linear (in delta) time. In Proc. 41st Annual ACM Symp. on Theory of Computing (STOC). 111--120."},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0088-2"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027216.2027221"},{"key":"e_1_3_2_3_5_1","volume-title":"Proc. 37th ACM Symp. on Principles of Distributed Computing (PODC). 437--446","author":"Barenboim Leonid","year":"2018","unstructured":"Leonid Barenboim, Michael Elkin, and Uri Goldenberg. 2018. Locally-Iterative Distributed (\u0394 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In Proc. 37th ACM Symp. on Principles of Distributed Computing (PODC). 437--446."},{"key":"e_1_3_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903137"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188964"},{"key":"e_1_3_2_3_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.73"},{"key":"e_1_3_2_3_10_1","volume-title":"Proc. 62nd IEEE Symp. on Foundations of Computing (FOCS).","author":"Ghaffari Mohsen","year":"2021","unstructured":"Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Col- oring: Simpler, Faster, and without Network Decomposition. In Proc. 62nd IEEE Symp. on Foundations of Computing (FOCS)."},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451089"},{"key":"e_1_3_2_3_13_1","volume-title":"Near-Optimal Distributed Degree1 Coloring. CoRR abs\/2112.00604","author":"Halld\u00f3rsson Magn\u00fas M.","year":"2021","unstructured":"Magn\u00fas M. Halld\u00f3rsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan. 2021. Near-Optimal Distributed Degree1 Coloring. CoRR abs\/2112.00604 (2021)."},{"key":"e_1_3_2_3_14_1","volume-title":"Proc. 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA).","author":"Kuhn Fabian","year":"2009","unstructured":"Fabian Kuhn. 2009. Local Weak Coloring Algorithms and Implications on Deter- ministic Symmetry Breaking. In Proc. 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA)."},{"key":"e_1_3_2_3_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.76"},{"key":"e_1_3_2_3_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_3_17_1","first-page":"237","article-title":"On Decompositions of Graphs. Studia Sci","volume":"1","author":"Lov\u00e1sz L.","year":"1966","unstructured":"L. Lov\u00e1sz. 1966. On Decompositions of Graphs. Studia Sci. Math. Hungar. 1 (1966), 237--238.","journal-title":"Math. Hungar."},{"key":"e_1_3_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461804"},{"key":"e_1_3_2_3_19_1","volume-title":"Proc. 34th Symp. on Distributed Computing (DISC) (LIPIcs)","volume":"179","author":"Maus Yannic","year":"2020","unstructured":"Yannic Maus and Tigran Tonoyan. 2020. Local Conflict Coloring Revisited: Linial for Lists. In Proc. 34th Symp. on Distributed Computing (DISC) (LIPIcs), Vol. 179. 16:1--16:18."},{"key":"e_1_3_2_3_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404036"},{"key":"e_1_3_2_3_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0017"},{"key":"e_1_3_2_3_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_3_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167156"}],"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.3591319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:07Z","timestamp":1750178827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":23,"alternative-id":["10.1145\/3558481.3591319","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591319","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"}}]}}