Author of the publication

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs.

, and . SIAM J. Comput., 52 (2): 618-640 (April 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

Counting in hypergraphs via regularity inheritance.. Electron. Notes Discret. Math., (2015)Efficient algorithms for the Potts model on small-set expanders., , and . CoRR, (2020)Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs., and . ICALP, volume 198 of LIPIcs, page 62:1-62:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An algorithmic framework for colouring locally sparse graphs., , , and . CoRR, (2020)Computational thresholds for the fixed-magnetization Ising model., , , and . STOC, page 1459-1472. ACM, (2022)Statistical Physics Approaches to Unique Games., , , , and . CCC, volume 169 of LIPIcs, page 13:1-13:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)An Approximate Blow-up Lemma for Sparse Hypergraphs., , , , and . LAGOS, volume 195 of Procedia Computer Science, page 394-403. Elsevier, (2021)Algorithms for the ferromagnetic Potts model on expanders., , , , , and . FOCS, page 344-355. IEEE, (2022)A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs., , , and . ICALP, volume 297 of LIPIcs, page 35:1-35:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)