Fotis Iliopoulos

According to our database, Fotis Iliopoulos authored at least 22 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

LayerNAS: Neural Architecture Search in Polynomial Complexity.

Yicheng Fan, Dana Alon, Jingyue Shen, Daiyi Peng, Keshav Kumar, Yun Long, Xin Wang, Fotis Iliopoulos, Da-Cheng Juan, Erik Vee

CoRR, 2023

SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation.

Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee

CoRR, 2023

SLaM: Student-Label Mixing for Distillation with Unlabeled Examples.

Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Robust Active Distillation.

Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Efficiently list-edge coloring multigraphs asymptotically optimally.

Fotis Iliopoulos, Alistair Sinclair

Random Struct. Algorithms, 2022

Weighted Distillation with Unlabeled Examples.

Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Group testing and local search: is there a computational-statistical gap?

Fotis Iliopoulos, Ilias Zadik

Proceedings of the Conference on Learning Theory, 2021

Improved Bounds for Coloring Locally Sparse Hypergraphs.

Fotis Iliopoulos

Proceedings of the Approximation, 2021

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.

David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov

Proceedings of the Approximation, 2021

2020

Girth-reducibility and the algorithmic barrier for coloring.

Fotis Iliopoulos

CoRR, 2020

Simple Local Computation Algorithms for the General Lovász Local Lemma.

Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Stochastic Local Search and the Lovasz Local Lemma.

Fotis Iliopoulos

PhD thesis, 2019

A Local Lemma for Focused Stochastic Algorithms.

Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov

SIAM J. Comput., 2019

Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications.

Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Local Computation Algorithms for the Lovász Local Lemma.

Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos

CoRR, 2018

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma.

Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair

CoRR, 2018

Commutative Algorithms Approximate the LLL-distribution.

Fotis Iliopoulos

Proceedings of the Approximation, 2018

2017

The Algorithmic LLL and the Witness Tree Lemma.

Fotis Iliopoulos

CoRR, 2017

Stochastic Control via Entropy Compression.

Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Random Walks That Find Perfect Objects and the Lovász Local Lemma.

Dimitris Achlioptas, Fotis Iliopoulos

J. ACM, 2016

Focused Stochastic Local Search and the Lovász Local Lemma.

Dimitris Achlioptas, Fotis Iliopoulos

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2014

The Lovász Local Lemma as a Random Walk.

Dimitris Achlioptas, Fotis Iliopoulos

CoRR, 2014