Fotis Iliopoulos

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 29

Top Topics

Johnson Lindenstrauss

Neural Architecture

Top Venues

Publications

Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee
SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation. CoRR (2023)
Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee
SLaM: Student-Label Mixing for Distillation with Unlabeled Examples. NeurIPS (2023)
Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee
Robust Active Distillation. ICLR (2023)
Yicheng Fan, Dana Alon, Jingyue Shen, Daiyi Peng, Keshav Kumar, Yun Long, Xin Wang, Fotis Iliopoulos, Da-Cheng Juan, Erik Vee
LayerNAS: Neural Architecture Search in Polynomial Complexity. CoRR (2023)
Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee
Weighted Distillation with Unlabeled Examples. NeurIPS (2022)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. Random Struct. Algorithms 61 (4) (2022)
Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee
Weighted Distillation with Unlabeled Examples. CoRR (2022)
Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee
Robust Active Distillation. CoRR (2022)
Fotis Iliopoulos, Ilias Zadik
Group testing and local search: is there a computational-statistical gap? COLT (2021)
Fotis Iliopoulos
Improved Bounds for Coloring Locally Sparse Hypergraphs. APPROX-RANDOM (2021)
David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. APPROX-RANDOM (2021)
Fotis Iliopoulos
Girth-reducibility and the algorithmic barrier for coloring. CoRR (2020)
Fotis Iliopoulos, Ilias Zadik
Group testing and local search: is there a computational-statistical gap? CoRR (2020)
Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos
Simple Local Computation Algorithms for the General Lovász Local Lemma. SPAA (2020)
David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
A new notion of commutativity for the algorithmic Lovász Local Lemma. CoRR (2020)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. SODA (2020)
Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov
A Local Lemma for Focused Stochastic Algorithms. SIAM J. Comput. 48 (5) (2019)
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. FOCS (2019)
Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov
A Local Lemma for Focused Stochastic Algorithms. CoRR (2018)
Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos
Local Computation Algorithms for the Lovász Local Lemma. CoRR (2018)
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. CoRR (2018)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. CoRR (2018)
Fotis Iliopoulos
Commutative Algorithms Approximate the LLL-distribution. APPROX-RANDOM (2018)
Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis
Stochastic Control via Entropy Compression. ICALP (2017)
Fotis Iliopoulos
The Algorithmic LLL and the Witness Tree Lemma. CoRR (2017)
Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis
Stochastic Control via Entropy Compression. CoRR (2016)
Dimitris Achlioptas, Fotis Iliopoulos
Focused Stochastic Local Search and the Lovász Local Lemma. SODA (2016)
Dimitris Achlioptas, Fotis Iliopoulos
Random Walks That Find Perfect Objects and the Lovász Local Lemma. J. ACM 63 (3) (2016)
Dimitris Achlioptas, Fotis Iliopoulos
Focused Stochastic Local Search and the Lovász Local Lemma. CoRR (2015)
Dimitris Achlioptas, Fotis Iliopoulos
Random Walks That Find Perfect Objects and the Lovasz Local Lemma. FOCS (2014)
Dimitris Achlioptas, Fotis Iliopoulos
The Lovász Local Lemma as a Random Walk. CoRR (2014)