{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:00:06Z","timestamp":1784307606050,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"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":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451089","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1180-1193","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Efficient randomized distributed coloring in CONGEST"],"prefix":"10.1145","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[{"name":"Reykjavik University, Iceland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tigran","family":"Tonoyan","sequence":"additional","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Palette Sparsification Beyond (\\Delta +1) Vertex Coloring","volume":"6","author":"Alon N.","year":"2020","unstructured":"N. Alon and S. Assadi. 2020. Palette Sparsification Beyond (\\Delta +1) Vertex Coloring. In APPROX\/RANDOM. LZI LIPIcs. Pages 6:1\u20136:22.","journal-title":"APPROX\/RANDOM. LZI LIPIcs. Pages"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"S. Assadi Y. Chen and S. Khanna. 2019. Sublinear Algorithms for (\\Delta + 1) Vertex Coloring. In SODA. SIAM. Pages 767\u2013786.","DOI":"10.1137\/1.9781611975482.48"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch A. V. Goldberg M. Luby and S. A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In FOCS. IEEE Computer Society. Pages 364\u2013369.","DOI":"10.1109\/SFCS.1989.63504"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"P. Bamberger F. Kuhn and Y. Maus. 2020. Efficient Deterministic Distributed Coloring with Small Bandwidth. In PODC. ACM. Pages 243\u2013252.","DOI":"10.1145\/3382734.3404504"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027216.2027221"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"L. Barenboim and M. Elkin. 2013. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers.","DOI":"10.1007\/978-3-031-02009-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"L. Barenboim M. Elkin and U. Goldenberg. 2018. Locally-Iterative Distributed (\\(\\Delta \\)+ 1)-Coloring below Szegedy-Vishwanathan Barrier and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In PODC. ACM. Pages 437\u2013446.","DOI":"10.1145\/3212734.3212769"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903137"},{"key":"e_1_3_2_1_12_1","first-page":"4","article-title":"An Algorithmic Approach to the Lov\u00e1sz Local Lemma","volume":"2","author":"Beck J.","year":"1991","unstructured":"J. Beck. 1991. An Algorithmic Approach to the Lov\u00e1sz Local Lemma. I. Random Structures & Algorithms, 2, 4, 1991. Pages 343\u2013365.","journal-title":"I. Random Structures & Algorithms"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Derandomizing Local Distributed Algorithms under Bandwidth Restrictions","volume":"11","author":"Censor-Hillel K.","year":"2017","unstructured":"K. Censor-Hillel, M. Parter, and G. Schwartzman. 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. In DISC. LZI LIPIcs. Pages 11:1\u201311:16.","journal-title":"DISC. LZI LIPIcs. Pages"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Y.-J. Chang M. Fischer M. Ghaffari J. Uitto and Y. Zheng. 2019. The Complexity of (\\(\\Delta \\)+1) Coloring in Congested Clique Massively Parallel Computation and Centralized Local Computation. In PODC. ACM. Pages 471\u2013480.","DOI":"10.1145\/3293611.3331607"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1117537"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1249527"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"B. Doerr and F. Neumann. 2020. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization. Springer. Pages 1\u201387.","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"M. Elkin S. Pettie and H.-H. Su. 2015. (2\\(\\Delta -1\\))-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. In SODA. SIAM. Pages 355\u2013370.","DOI":"10.1137\/1.9781611973730.26"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud M. Heinrich and A. Kosowski. 2016. Local Conflict Coloring. In FOCS. IEEE Computer Society. Pages 625\u2013634.","DOI":"10.1109\/FOCS.2016.73"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Ghaffari. 2019. Distributed Maximal Independent Set Using Small Messages. In SODA. SIAM. Pages 805\u2013820.","DOI":"10.1137\/1.9781611975482.50"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"M. Ghaffari C. Grunau and V. Rozho\\v n. 2021. Improved Deterministic Network Decomposition. In SODA. SIAM. Pages 2904\u20132923.","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"M. Ghaffari D. G. Harris and F. Kuhn. 2018. On Derandomizing Local Distributed Algorithms. In FOCS. IEEE Computer Society. Pages 662\u2013673.","DOI":"10.1109\/FOCS.2018.00069"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. Ghaffari F. Kuhn and Y. Maus. 2017. On the Complexity of Local Distributed Graph Problems. In STOC. ACM. Pages 784\u2013797.","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"Coloring Fast Without Learning Your Neighbors","volume":"39","author":"Halld\u00f3rsson M. M.","year":"2020","unstructured":"M. M. Halld\u00f3rsson, F. Kuhn, Y. Maus, and A. Nolin. 2020. Coloring Fast Without Learning Your Neighbors' Colors. In DISC. LZI LIPIcs. Pages 39:1\u201339:17.","journal-title":"Colors. In DISC. LZI LIPIcs. Pages"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"M. M. Halld\u00f3rsson F. Kuhn Y. Maus and T. Tonoyan. 2020. Efficient Randomized Distributed Coloring in CONGEST.","DOI":"10.1145\/3406325.3451089"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178120"},{"key":"e_1_3_2_1_27_1","first-page":"5","article-title":"Simple Distributed \\Delta +1-Coloring of Graphs","volume":"70","year":"1999","unstructured":"\u00d6. Johansson. 1999. Simple Distributed \\Delta +1-Coloring of Graphs. Inform. Process. Lett., 70, 5, 1999. Pages 229\u2013232.","journal-title":"Inform. Process. Lett."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"F. Kuhn. 2020. Faster Deterministic Distributed Coloring Through Recursive List Coloring. In SODA. SIAM. Pages 1244\u20131259.","DOI":"10.1137\/1.9781611975994.76"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"C. Lenzen. 2013. Optimal Deterministic Routing and Sorting on the Congested Clique. In PODC. ACM. Pages 42\u201350.","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_30_1","volume-title":"Distributive Graph Algorithms \u2013 Global Solutions from Local Data","author":"Linial N.","unstructured":"N. Linial. 1987. Distributive Graph Algorithms \u2013 Global Solutions from Local Data. In FOCS. IEEE Computer Society. Pages 331\u2013335."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_32_1","first-page":"1","article-title":"Local Conflict Coloring Revisited","volume":"16","author":"Maus Y.","year":"2020","unstructured":"Y. Maus and T. Tonoyan. 2020. Local Conflict Coloring Revisited: Linial for Lists. In DISC. LZI LIPIcs. Pages 16:1\u201316:18.","journal-title":"Linial for Lists. In DISC. LZI LIPIcs. Pages"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"A. Panconesi and A. Srinivasan. 1992. Improved Distributed Algorithms for Coloring and Network Decomposition Problems. In STOC. ACM. Pages 581\u2013592.","DOI":"10.1145\/129712.129769"},{"key":"e_1_3_2_1_34_1","first-page":"1","article-title":"Randomized (\\Delta +1)-Coloring in O(\\qopname \\relax olog^* \\Delta ) Congested Clique Rounds","volume":"39","author":"Parter M.","year":"2018","unstructured":"M. Parter and H.-H. Su. 2018. Randomized (\\Delta +1)-Coloring in O(\\qopname \\relax olog^* \\Delta ) Congested Clique Rounds. In DISC. LZI LIPIcs. Pages 39:1\u201339:18.","journal-title":"DISC. LZI LIPIcs. Pages"},{"key":"e_1_3_2_1_35_1","first-page":"4","article-title":"\\(\u00f8mega \\), \\(\\Delta \\), and \\(\\chi \\)","volume":"27","author":"Reed B. A.","year":"1998","unstructured":"B. A. Reed. 1998. \\(\u00f8mega \\), \\(\\Delta \\), and \\(\\chi \\). J. Graph Theory, 27, 4, 1998. Pages 177\u2013212.","journal-title":"J. Graph Theory"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"V. Rozho\\v n and M. Ghaffari. 2020. Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. In STOC. ACM. Pages 350\u2013363.","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"J. Schneider and R. Wattenhofer. 2010. A New Technique for Distributed Symmetry Breaking. In PODC. ACM. Pages 257\u2013266.","DOI":"10.1145\/1835698.1835760"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":37,"alternative-id":["10.1145\/3406325.3451089","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451089","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}