A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. | 0 | 0.34 | 2021 |
Group testing and local search - is there a computational-statistical gap? | 0 | 0.34 | 2021 |
Improved Bounds for Coloring Locally Sparse Hypergraphs. | 0 | 0.34 | 2021 |
Efficiently list-edge coloring multigraphs asymptotically optimally. | 0 | 0.34 | 2020 |
Simple Local Computation Algorithms for the General Lovasz Local Lemma | 0 | 0.34 | 2020 |
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications | 0 | 0.34 | 2019 |
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. | 0 | 0.34 | 2018 |
Local Computation Algorithms for the Lovász Local Lemma. | 0 | 0.34 | 2018 |
Commutative Algorithms Approximate the LLL-distribution. | 0 | 0.34 | 2018 |
A Local Lemma for Focused Stochastic Algorithms | 2 | 0.37 | 2018 |
Stochastic Control via Entropy Compression. | 0 | 0.34 | 2017 |
The Algorithmic LLL and the Witness Tree Lemma. | 0 | 0.34 | 2017 |
Focused Stochastic Local Search and the Lovász Local Lemma. | 3 | 0.38 | 2016 |
The Lovász Local Lemma as a Random Walk. | 0 | 0.34 | 2014 |
Random Walks That Find Perfect Objects and the Lovasz Local Lemma | 8 | 0.48 | 2014 |