| 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q6147346 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147349 | 2024-01-15 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2023-06-23 | Paper |
| Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics | 2023-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875505 | 2023-02-03 | Paper |
| Implementations and the independent set polynomial below the Shearer threshold | 2022-11-17 | Paper |
| The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs | 2022-09-21 | Paper |
| Counting Solutions to Random CNF Formulas | 2022-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091171 | 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 | 2022-04-12 | Paper |
| The Complexity of Approximating the Matching Polynomial in the Complex Plane | 2022-03-22 | Paper |
| Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2022-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009528 | 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 | 2021-05-03 | Paper |
| The complexity of approximating the complex-valued Ising model on bounded degree graphs | 2021-05-01 | Paper |
| Inapproximability of the Independent Set Polynomial in the Complex Plane | 2020-10-26 | Paper |
| Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems | 2020-10-23 | Paper |
| Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs | 2020-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111358 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111357 | 2020-05-27 | Paper |
| The complexity of approximating the complex-valued Potts model | 2020-05-03 | Paper |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 2020-03-26 | Paper |
| A Complexity Trichotomy for Approximately Counting List H -Colorings | 2019-12-06 | Paper |
| Inapproximability of the independent set polynomial in the complex plane | 2019-08-22 | Paper |
| Approximation via Correlation Decay When Strong Spatial Mixing Fails | 2019-05-07 | Paper |
| Swendsen‐Wang algorithm on the mean‐field Potts model | 2019-02-20 | Paper |
| Fast algorithms at low temperatures via Markov chains | 2019-01-20 | Paper |
| Uniqueness for the 3-state antiferromagnetic Potts model on the tree | 2018-10-25 | Paper |
| Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region | 2018-08-02 | Paper |
| Amplifiers for the Moran Process | 2018-08-02 | Paper |
| The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs | 2018-07-16 | Paper |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 2018-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598184 | 2017-12-19 | Paper |
| Amplifiers for the Moran Process | 2017-12-19 | Paper |
| A complexity trichotomy for approximately counting list H-colourings | 2017-12-19 | Paper |
| Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models | 2017-10-10 | Paper |
| Swendsen-Wang Algorithm on the Mean-Field Potts Model | 2017-08-31 | Paper |
| Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results | 2017-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969647 | 2017-03-22 | Paper |
| Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results | 2016-12-13 | Paper |
| The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs | 2016-11-18 | Paper |
| Approximately counting \(H\)-colorings is \(\#\)BIS-hard | 2016-06-01 | Paper |
| \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2016-04-18 | Paper |
| Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard | 2015-10-27 | Paper |
| Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region | 2015-06-26 | Paper |
| Improved inapproximability results for counting independent sets in the hard-core model | 2014-08-25 | Paper |
| Improved inapproximability results for counting independent sets in the hard-core model | 2011-08-17 | Paper |
