default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFotis Iliopoulos
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Noel Loo, Fotis Iliopoulos, Wei Hu, Erik Vee:
Linear Projections of Teacher Embeddings for Few-Class Distillation. CoRR abs/2409.20449 (2024)- 2023
- [c13]Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee:
Robust Active Distillation. ICLR 2023 - [c12]Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee:
SLaM: Student-Label Mixing for Distillation with Unlabeled Examples. NeurIPS 2023 - [i15]Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee:
SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation. CoRR abs/2302.03806 (2023) - [i14]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 abs/2304.11517 (2023) - 2022
- [j3]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. Random Struct. Algorithms 61(4): 724-753 (2022) - [c11]Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee:
Weighted Distillation with Unlabeled Examples. NeurIPS 2022 - [i13]Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee:
Robust Active Distillation. CoRR abs/2210.01213 (2022) - [i12]Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee:
Weighted Distillation with Unlabeled Examples. CoRR abs/2210.06711 (2022) - 2021
- [c10]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. APPROX-RANDOM 2021: 31:1-31:25 - [c9]Fotis Iliopoulos:
Improved Bounds for Coloring Locally Sparse Hypergraphs. APPROX-RANDOM 2021: 39:1-39:16 - [c8]Fotis Iliopoulos, Ilias Zadik:
Group testing and local search: is there a computational-statistical gap? COLT 2021: 2499-2551 - 2020
- [c7]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. SODA 2020: 2319-2336 - [c6]Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos:
Simple Local Computation Algorithms for the General Lovász Local Lemma. SPAA 2020: 1-10 - [i11]Fotis Iliopoulos:
Girth-reducibility and the algorithmic barrier for coloring. CoRR abs/2004.02066 (2020) - [i10]David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A new notion of commutativity for the algorithmic Lovász Local Lemma. CoRR abs/2008.05569 (2020) - [i9]Fotis Iliopoulos, Ilias Zadik:
Group testing and local search: is there a computational-statistical gap? CoRR abs/2011.05258 (2020)
2010 – 2019
- 2019
- [b1]Fotis Iliopoulos:
Stochastic Local Search and the Lovasz Local Lemma. University of California, Berkeley, USA, 2019 - [j2]Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov:
A Local Lemma for Focused Stochastic Algorithms. SIAM J. Comput. 48(5): 1583-1602 (2019) - [c5]Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. FOCS 2019: 725-744 - 2018
- [c4]Fotis Iliopoulos:
Commutative Algorithms Approximate the LLL-distribution. APPROX-RANDOM 2018: 44:1-44:20 - [i8]Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. CoRR abs/1805.02026 (2018) - [i7]Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov:
A Local Lemma for Focused Stochastic Algorithms. CoRR abs/1809.01537 (2018) - [i6]Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos:
Local Computation Algorithms for the Lovász Local Lemma. CoRR abs/1809.07910 (2018) - [i5]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. CoRR abs/1812.10309 (2018) - 2017
- [c3]Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis:
Stochastic Control via Entropy Compression. ICALP 2017: 83:1-83:13 - [i4]Fotis Iliopoulos:
The Algorithmic LLL and the Witness Tree Lemma. CoRR abs/1704.02796 (2017) - 2016
- [j1]Dimitris Achlioptas, Fotis Iliopoulos:
Random Walks That Find Perfect Objects and the Lovász Local Lemma. J. ACM 63(3): 22:1-22:29 (2016) - [c2]Dimitris Achlioptas, Fotis Iliopoulos:
Focused Stochastic Local Search and the Lovász Local Lemma. SODA 2016: 2024-2038 - [i3]Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis:
Stochastic Control via Entropy Compression. CoRR abs/1607.06494 (2016) - 2015
- [i2]Dimitris Achlioptas, Fotis Iliopoulos:
Focused Stochastic Local Search and the Lovász Local Lemma. CoRR abs/1507.07633 (2015) - 2014
- [c1]Dimitris Achlioptas, Fotis Iliopoulos:
Random Walks That Find Perfect Objects and the Lovasz Local Lemma. FOCS 2014: 494-503 - [i1]Dimitris Achlioptas, Fotis Iliopoulos:
The Lovász Local Lemma as a Random Walk. CoRR abs/1406.0242 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
