Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. A parallel algorithmic version of the local lemma;Alon;Random Structures and Algorithms,1991
2. Every 8-uniform 8-regular hypergraph is 2-colourable;Alon;Graphs Combin.,1988
3. The Probabilistic Method;Alon,1992
4. An algorithmic approach to the Lovász local lemma I;Beck;Random Structures and Algorithms,1991
5. Random Graphs;Bollobás,1985
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph r-hued colorings—A survey;Discrete Applied Mathematics;2022-11
2. Comparison of Two Convergence Criteria for the Variable-Assignment Lopsided Lovasz Local Lemma;The Electronic Journal of Combinatorics;2022-10-21
3. Quantum Lovász local lemma: Shearer’s bound is tight;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
4. Variable-Version Lovász Local Lemma: Beyond Shearer's Bound;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10
5. Lopsidependency in the Moser-Tardos Framework;ACM Transactions on Algorithms;2016-12-21