The Lovász Local Lemma as a Random Walk. - Dimitris Achlioptas; Fotis Iliopoulos (CoRR, 2014)

Focused Stochastic Local Search and the Lovász Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos (SODA, 2016)

Random Walks That Find Perfect Objects and the Lovász Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos (J. ACM, 2016)

Stochastic Control via Entropy Compression. - Dimitris Achlioptas; Fotis Iliopoulos; Nikos Vlassis (ICALP, 2017)

The Algorithmic LLL and the Witness Tree Lemma. - Fotis Iliopoulos (CoRR, 2017)

Commutative Algorithms Approximate the LLL-distribution. - Fotis Iliopoulos (APPROX-RANDOM, 2018)

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (CoRR, 2018)

Local Computation Algorithms for the Lovász Local Lemma. - Dimitris Achlioptas; Themis Gouleakis; Fotis Iliopoulos (CoRR, 2018)

Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (FOCS, 2019)

A Local Lemma for Focused Stochastic Algorithms. - Dimitris Achlioptas; Fotis Iliopoulos; Vladimir Kolmogorov (SIAM J. Comput., 2019)

Stochastic Local Search and the Lovasz Local Lemma. - Fotis Iliopoulos (2019)

Simple Local Computation Algorithms for the General Lovász Local Lemma. - Dimitris Achlioptas; Themis Gouleakis; Fotis Iliopoulos (SPAA, 2020)

Girth-reducibility and the algorithmic barrier for coloring. - Fotis Iliopoulos (CoRR, 2020)

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. - David G. Harris 001; Fotis Iliopoulos; Vladimir Kolmogorov (APPROX-RANDOM, 2021)

Improved Bounds for Coloring Locally Sparse Hypergraphs. - Fotis Iliopoulos (APPROX-RANDOM, 2021)

Group testing and local search: is there a computational-statistical gap? - Fotis Iliopoulos; Ilias Zadik (COLT, 2021)

Weighted Distillation with Unlabeled Examples. - Fotis Iliopoulos; Vasilis Kontonis; Cenk Baykal; Gaurav Menghani; Khoa Trinh; Erik Vee (NeurIPS, 2022)

Efficiently list-edge coloring multigraphs asymptotically optimally. - Fotis Iliopoulos; Alistair Sinclair (Random Struct. Algorithms, 2022)

Robust Active Distillation. - Cenk Baykal; Khoa Trinh; Fotis Iliopoulos; Gaurav Menghani; Erik Vee (ICLR, 2023)

SLaM: Student-Label Mixing for Distillation with Unlabeled Examples. - Vasilis Kontonis; Fotis Iliopoulos; Khoa Trinh; Cenk Baykal; Gaurav Menghani; Erik Vee (NeurIPS, 2023)

SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation. - Vasilis Kontonis; Fotis Iliopoulos; Khoa Trinh; Cenk Baykal; Gaurav Menghani; Erik Vee (CoRR, 2023)

LayerNAS: Neural Architecture Search in Polynomial Complexity. - Yicheng Fan; Dana Alon; Jingyue Shen; Daiyi Peng; Keshav Kumar; Yun Long; Xin Wang 016; Fotis Iliopoulos; Da-Cheng Juan; Erik Vee (CoRR, 2023)

Linear Projections of Teacher Embeddings for Few-Class Distillation. - Noel Loo; Fotis Iliopoulos; Wei Hu; Erik Vee (CoRR, 2024)