共 50 条
- [21] The Randomized Local Computation Complexity of the Lovasz Local Lemma PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 307 - 317
- [24] New Constructive Aspects of the Lovasz Local Lemma 2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 397 - 406
- [25] Improved Algorithmic Versions of the Lovasz Local Lemma PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 611 - 620
- [26] A Lower Bound for the Distributed Lovasz Local Lemma STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 479 - 488
- [29] Uniform Sampling through the Lovasz Local Lemma STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 342 - 355
- [30] Simple Local Computation Algorithms for the General Lovasz Local Lemma PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 1 - 10