Showing results 1 to 11 of 11
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions Proceeding/Conference:Proceedings - 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023 | 2023 | ||
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs Proceeding/Conference:Leibniz International Proceedings in Informatics, LIPIcs | 2024 | ||
Approximate Counting for Spin Systems in Sub-Quadratic Time Proceeding/Conference:Leibniz International Proceedings in Informatics, LIPIcs | 2024 | ||
Fast sampling and counting K-SAT solutions in the local lemma regime Proceeding/Conference:Proceedings of the Annual ACM Symposium on Theory of Computing | 2020 | ||
Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime Journal:Journal of the ACM | 2021 | ||
Improved Bounds for Randomly Colouring Simple Hypergraphs Proceeding/Conference:Leibniz International Proceedings in Informatics, LIPIcs | 2022 | ||
Perfect sampling from spatial mixing Journal:Random Structures and Algorithms | 2022 | ||
Rapid mixing from spectral independence beyond the Boolean domain Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2021 | ||
Rapid Mixing from Spectral Independence beyond the Boolean Domain Journal:ACM Transactions on Algorithms | 2022 | ||
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields Journal:Information and Computation | 2023 | ||
Towards derandomising Markov chain Monte Carlo Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2023 |