Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second 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
On Dependency Graphs and the Lattice Gas
Combinatorics, Probability and Computing
A random construction for permutation codes and the covering radius
Designs, Codes and Cryptography
Asymptotically optimal frugal colouring
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A constructive proof of the general lovász local lemma
Journal of the ACM (JACM)
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory Series B
How many conflicts does it need to be unsatisfiable?
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
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
The local lemma is tight for SAT
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
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Theoretical Computer Science
| Hi-index | 0.00 |