| Publication | Date of Publication | Type |
|---|
| Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics | 2025-01-14 | Paper |
| Learning hard-constrained models with one sample | 2024-11-28 | Paper |
Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
| Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region | 2024-07-19 | Paper |
| Fast sampling via spectral independence beyond bounded-degree graphs | 2024-06-24 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2024-06-24 | Paper |
| Approximating observables is as hard as counting | 2024-06-24 | Paper |
| Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788432 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Metastability of the Potts ferromagnet on random regular graphs
Communications in Mathematical Physics | 2023-06-23 | Paper |
| Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics | 2023-05-22 | Paper |
scientific article; zbMATH DE number 7650115 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Implementations and the independent set polynomial below the Shearer threshold
Theoretical Computer Science | 2022-11-17 | Paper |
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
SIAM Journal on Discrete Mathematics | 2022-09-21 | Paper |
Counting solutions to random CNF formulas
SIAM Journal on Computing | 2022-08-17 | Paper |
| The complexity of approximating the matching polynomial in the complex plane | 2022-07-21 | Paper |
| The complexity of approximating the complex-valued Potts model | 2022-07-18 | Paper |
The complexity of approximating the complex-valued Potts model
Computational Complexity | 2022-04-12 | Paper |
The Complexity of Approximating the Matching Polynomial in the Complex Plane
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
The Complexity of Approximating the Matching Polynomial in the Complex Plane
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Forum of Mathematics, Sigma | 2022-02-11 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
| Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region | 2021-05-04 | Paper |
Random walks on small world networks
ACM Transactions on Algorithms | 2021-05-03 | Paper |
The complexity of approximating the complex-valued Ising model on bounded degree graphs
(available as arXiv preprint) | 2021-05-01 | Paper |
Inapproximability of the independent set polynomial in the complex plane
SIAM Journal on Computing | 2020-10-26 | Paper |
Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
(available as arXiv preprint) | 2020-06-26 | Paper |
| scientific article; zbMATH DE number 7204480 (Why is no real title available?) | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7204479 (Why is no real title available?) | 2020-05-27 | Paper |
The complexity of approximating the complex-valued Potts model
(available as arXiv preprint) | 2020-05-03 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
A Complexity Trichotomy for Approximately Counting List H -Colorings
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Inapproximability of the independent set polynomial in the complex plane
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Approximation via Correlation Decay When Strong Spatial Mixing Fails
SIAM Journal on Computing | 2019-05-07 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
Random Structures & Algorithms | 2019-02-20 | Paper |
Fast algorithms at low temperatures via Markov chains
(available as arXiv preprint) | 2019-01-20 | Paper |
Uniqueness for the 3-state antiferromagnetic Potts model on the tree
Electronic Journal of Probability | 2018-10-25 | Paper |
Uniqueness for the 3-state antiferromagnetic Potts model on the tree
Electronic Journal of Probability | 2018-10-25 | Paper |
Amplifiers for the Moran process
Journal of the ACM | 2018-08-02 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
Journal of the ACM | 2018-08-02 | Paper |
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
(available as arXiv preprint) | 2018-04-22 | Paper |
Approximation via correlation decay when strong spatial mixing fails
(available as arXiv preprint) | 2017-12-19 | Paper |
Amplifiers for the Moran process
(available as arXiv preprint) | 2017-12-19 | Paper |
A complexity trichotomy for approximately counting list \(H\)-colourings
(available as arXiv preprint) | 2017-12-19 | Paper |
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
(available as arXiv preprint) | 2017-08-31 | Paper |
Ferromagnetic Potts model: refined \#BIS-hardness and related results
(available as arXiv preprint) | 2017-03-22 | Paper |
| \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2017-03-22 | Paper |
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
SIAM Journal on Computing | 2016-12-13 | Paper |
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs
Information and Computation | 2016-11-18 | Paper |
Approximately counting \(H\)-colorings is \(\#\)BIS-hard
SIAM Journal on Computing | 2016-06-01 | Paper |
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Approximately counting \(H\)-colourings is \(\#\mathrm{BIS}\)-hard
Automata, Languages, and Programming | 2015-10-27 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Random Structures & Algorithms | 2014-08-25 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Lecture Notes in Computer Science | 2011-08-17 | Paper |
