Lopsided Lova´sz Local Lemma and Latin transversals
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Using the incompressibility method to obtain local lemma results for Ramsey-type problems
Information Processing Letters
A constructive proof of the Lovász local lemma
Proceedings of the forty-first annual ACM symposium on Theory of computing
Conflict-free colourings of graphs and hypergraphs
Combinatorics, Probability and Computing
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Information Processing Letters
Bounds on Edge Colorings with Restrictions on the Union of Color Classes
SIAM Journal on Discrete Mathematics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A kolmogorov complexity proof of the lovász local lemma for satisfiability
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Streaming algorithms for 2-coloring uniform hypergraphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Bandwidth and low dimensional embedding
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Improved bounds on coloring of graphs
European Journal of Combinatorics
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An improvement of the lovász local lemma via cluster expansion
Combinatorics, Probability and Computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Probabilistic existence of rigid combinatorial structures
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Theoretical Computer Science
An asymptotically tight bound on the adaptable chromatic number
Journal of Graph Theory
Forbidden subgraph colorings and the oriented chromatic number
European Journal of Combinatorics
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Bandwidth and low dimensional embedding
Theoretical Computer Science
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Optimization Decomposition for Scheduling and System Configuration in Wireless Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The Lovász Local Lemma discovered by Erdős and Lovász in 1975 is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In 1991, József Beck was the first to demonstrate that a constructive variant can be given under certain more restrictive conditions, starting a whole line of research aimed at improving his algorithm's performance and relaxing its restrictions. In the present article, we improve upon recent findings so as to provide a method for making almost all known applications of the general Local Lemma algorithmic.