Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q6147350 | 2024-01-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q6147383 | 2024-01-15 | Paper |
Simple parallel algorithms for single-site dynamics | 2023-12-08 | Paper |
Sampling constraint satisfaction solutions in the local lemma regime | 2023-11-14 | Paper |
Rapid Mixing from Spectral Independence beyond the Boolean Domain | 2023-10-31 | Paper |
Perfect sampling from spatial mixing | 2023-10-17 | Paper |
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model | 2023-04-29 | Paper |
Deterministic counting Lov\'{a}sz local lemma beyond linear programming | 2022-12-30 | Paper |
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime | 2022-12-08 | Paper |
Towards derandomising Markov chain Monte Carlo | 2022-11-07 | Paper |
Optimal mixing for two-state anti-ferromagnetic spin systems | 2022-03-15 | Paper |
Optimal Mixing Time for the Ising Model in the Uniqueness Regime | 2021-11-04 | Paper |
Rapid mixing of Glauber dynamics via spectral independence for all degrees | 2021-05-31 | Paper |
Dynamic Sampling from Graphical Models | 2021-04-14 | Paper |
Fast sampling and counting 𝑘-SAT solutions in the local lemma regime | 2021-01-19 | Paper |
What can be sampled locally? | 2020-06-15 | Paper |
Dynamic sampling from graphical models | 2020-01-30 | Paper |
On Local Distributed Sampling and Counting | 2019-09-19 | Paper |
Approximate Counting via Correlation Decay on Planar Graphs | 2019-05-15 | Paper |
Correlation Decay up to Uniqueness in Spin Systems | 2019-05-15 | Paper |
Approximate Counting via Correlation Decay in Spin Systems | 2019-05-10 | Paper |
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model | 2019-05-07 | Paper |
Counting hypergraph matchings up to uniqueness threshold | 2019-05-02 | Paper |
Counting hypergraph matchings up to uniqueness threshold | 2018-04-19 | Paper |
Sampling in Potts Model on Sparse Random Graphs | 2018-04-19 | Paper |
Simple Average-case Lower Bounds for Approximate Near-neighbor from Isoperimetric Inequalities | 2017-12-19 | Paper |
What Can be Sampled Locally? | 2017-10-11 | Paper |
Spatial mixing and the connective constant: Optimal bounds | 2017-10-05 | Paper |
Spatial mixing and the connective constant: optimal bounds | 2017-06-22 | Paper |
Cell-Probe Proofs | 2015-09-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2934668 | 2014-12-18 | Paper |
Certificates in Data Structures | 2014-07-01 | Paper |
Spatial Mixing of Coloring Random Graphs | 2014-07-01 | Paper |
Improved FPTAS for Multi-spin Systems | 2013-10-04 | Paper |
Spatial mixing and approximation algorithms for graphs with bounded connective constant | 2013-08-08 | Paper |
Randomized load balancing by joining and splitting bins | 2012-07-20 | Paper |
Low-contention data structures | 2012-07-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579426 | 2010-08-06 | Paper |
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity | 2008-08-28 | Paper |
Deterministic counting Lov\'{a}sz local lemma beyond linear programming | 0001-01-03 | Paper |
A Sampling Lov\'{a}sz Local Lemma for Large Domain Sizes | 0001-01-03 | Paper |
Spectral Independence Beyond Total Influence on Trees and Related Graphs | 0001-01-03 | Paper |