Perfect simulation of Las Vegas algorithms via local computation
From MaRDI portal
Cites work
- A constructive proof of the general Lovász local lemma
- A sampling Lovász local lemma for large domain sizes
- A time hierarchy theorem for the LOCAL model
- Approximate counting, the Lovász local lemma, and inference in graphical models
- Approximation via Correlation Decay When Strong Spatial Mixing Fails
- Distributed algorithms for the Lovász local lemma and graph coloring
- Distributed Computing: A Locality-Sensitive Approach
- Dynamic Sampling from Graphical Models
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Locality in Distributed Graph Algorithms
- Low diameter graph decompositions
- New bounds for the Moser-Tardos distribution
- New constructive aspects of the Lovász local lemma
- On derandomizing local distributed algorithms
- On the complexity of local distributed graph problems
- Optimal speedup of Las Vegas algorithms
- Perfect sampling from spatial mixing
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
- Probability and Computing
- Random generation of combinatorial structures from a uniform distribution
- Towards derandomising Markov chain Monte Carlo
- Uniform sampling through the Lovász local lemma
This page was built for publication: Perfect simulation of Las Vegas algorithms via local computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445589)