Author of the publication

Improved Distributed Algorithms for Random Colorings.

, , and . OPODIS, volume 286 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models., , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 283-298. PMLR, (2019)Spatial Mixing and Non-local Markov chains., , , and . SODA, page 1965-1980. SIAM, (2018)Sampling Random Colorings of Sparse Random Graphs., , , and . SODA, page 1759-1771. SIAM, (2018)Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region., , , and . SODA, page 2198-2207. SIAM, (2022)Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees., , , and . SODA, page 1646-1656. SIAM, (2010)Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees., , , , and . SODA, page 945-956. SIAM, (2011)Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction., , and . FOCS, page 1307-1318. IEEE, (2020)General upper bounds for covering numbers., , and . Ars Comb., (1996)Counting and Sampling Labeled Chordal Graphs in Polynomial Time., , and . ESA, volume 274 of LIPIcs, page 58:1-58:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Sampling binary contingency tables with a greedy start., , and . Random Struct. Algorithms, 30 (1-2): 168-205 (2007)