Random walks that find perfect objects and the Lovász local lemma D Achlioptas, F Iliopoulos Journal of the ACM (JACM) 63 (3), 1-29, 2016 | 60 | 2016 |
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications D Achlioptas, F Iliopoulos, A Sinclair arXiv preprint arXiv:1805.02026, 2018 | 25* | 2018 |
Focused stochastic local search and the Lovász local lemma D Achlioptas, F Iliopoulos Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 20 | 2016 |
Commutative Algorithms Approximate the LLL distribution F Iliopoulos Approximation, Randomization, and Combinatorial Optimization 116, 44:1-44:20, 2017 | 14 | 2017 |
A local lemma for focused stochastic algorithms D Achlioptas, F Iliopoulos, V Kolmogorov SIAM Journal on Computing 48 (5), 1583-1602, 2019 | 11 | 2019 |
Stochastic Control via Entropy Compression D Achlioptas, F Iliopoulos, N Vlassis 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 5 | 2016 |
Simple Local Computation Algorithms for the General Lovász Local Lemma D Achlioptas, T Gouleakis, F Iliopoulos Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 4* | 2020 |
Efficiently list-edge coloring multigraphs asymptotically optimally F Iliopoulos, A Sinclair Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 3 | 2020 |
Group testing and local search: is there a computational-statistical gap? F Iliopoulos, I Zadik Conference on Learning Theory, 2499-2551, 2021 | 1 | 2021 |
A new notion of commutativity for the algorithmic Lov\'{a} sz Local Lemma DG Harris, F Iliopoulos, V Kolmogorov arXiv preprint arXiv:2008.05569, 2020 | 1 | 2020 |
Improved bounds for coloring locally sparse hypergraphs F Iliopoulos arXiv preprint arXiv:2004.02066, 2020 | 1 | 2020 |
Stochastic Local Search and the Lovasz Local Lemma F Iliopoulos University of California, Berkeley, 2019 | 1 | 2019 |