Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . - Dimitris Achlioptas; Themis Gouleakis (FSTTCS, 2012)

Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation. - Maryam Aliakbarpour; Amartya Shankha Biswas; Themistoklis Gouleakis; John Peebles; Ronitt Rubinfeld; Anak Yodpinyanee (CoRR, 2016)

Faster Sublinear Algorithms using Conditional Sampling. - Themistoklis Gouleakis; Christos Tzamos; Manolis Zampetakis (SODA, 2017)

Certified Computation in Crowdsourcing. - Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (CoRR, 2017)

Sample-Optimal Identity Testing with High Probability. - Ilias Diakonikolas; Themis Gouleakis; John Peebles; Eric Price 001 (Electron. Colloquium Comput. Complex., 2017)

Certified Computation from Unreliable Datasets. - Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (COLT, 2018)

Efficient Statistics, in High Dimensions, from Truncated Samples. - Constantinos Daskalakis; Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (FOCS, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Christian Konrad 001; Slobodan Mitrovic; Ronitt Rubinfeld (PODC, 2018)

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. - Maryam Aliakbarpour; Amartya Shankha Biswas; Themis Gouleakis; John Peebles; Ronitt Rubinfeld; Anak Yodpinyanee (Algorithmica, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Slobodan Mitrovic; Ronitt Rubinfeld (CoRR, 2018)

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

Testing Shape Restrictions of Discrete Distributions. - Clément L. Canonne; Ilias Diakonikolas; Themis Gouleakis; Ronitt Rubinfeld (Theory Comput. Syst., 2018)

Sampling Correctors. - Clément L. Canonne; Themis Gouleakis; Ronitt Rubinfeld (SIAM J. Comput., 2018)

New directions in sublinear algorithms and testing properties of distributions. - Themistoklis Gouleakis (2018)

Towards Testing Monotonicity of Distributions Over General Posets. - Maryam Aliakbarpour; Themis Gouleakis; John Peebles; Ronitt Rubinfeld; Anak Yodpinyanee (COLT, 2019)

Computationally and Statistically Efficient Truncated Regression. - Constantinos Daskalakis; Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (COLT, 2019)

Communication and Memory Efficient Testing of Discrete Distributions. - Ilias Diakonikolas; Themis Gouleakis; Daniel M. Kane; Sankeerth Rao (COLT, 2019)

Distribution-Independent PAC Learning of Halfspaces with Massart Noise. - Ilias Diakonikolas; Themis Gouleakis; Christos Tzamos (NeurIPS, 2019)

Collision-Based Testers are Optimal for Uniformity and Closeness. - Ilias Diakonikolas; Themis Gouleakis; John Peebles; Eric Price 001 (Chic. J. Theor. Comput. Sci., 2019)

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

Optimal Testing of Discrete Distributions with High Probability. - Ilias Diakonikolas; Themis Gouleakis; Daniel Kane 001; John Peebles; Eric Price 001 (Electron. Colloquium Comput. Complex., 2020)

Robust Learning under Strong Noise via SQs. - Ioannis Anagnostides; Themis Gouleakis; Ali Marashian (AISTATS, 2021)

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. - Ioannis Anagnostides; Themis Gouleakis (DISC, 2021)

Learning Augmented Online Facility Location. - Dimitris Fotakis 001; Evangelia Gergatsouli; Themis Gouleakis; Nikolas Patris (CoRR, 2021)

Accelerated Distributed Laplacian Solvers via Shortcuts. - Ioannis Anagnostides; Themis Gouleakis; Christoph Lenzen 001 (CoRR, 2021)

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (PODC, 2022)

Learning-Augmented Algorithms for Online TSP on the Line. - Themistoklis Gouleakis; Konstantinos Lakis; Golnoosh Shahkarami (AAAI, 2023)

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. - Evripidis Bampis; Bruno Escoffier; Themis Gouleakis; Niklas Hahn 001; Kostas Lakis; Golnoosh Shahkarami; Michalis Xefteris (ESA, 2023)

Active causal structure learning with advice. - Davin Choo; Themistoklis Gouleakis; Arnab Bhattacharyya 001 (ICML, 2023)

Secretary and online matching problems with machine learned advice. - Antonios Antoniadis 001; Themis Gouleakis; Pieter Kleer; Pavel Kolev (Discret. Optim., 2023)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (Distributed Comput., 2023)

Online bipartite matching with imperfect advice. - Davin Choo; Themistoklis Gouleakis; Chun Kai Ling; Arnab Bhattacharyya 001 (ICML, 2024)

Learning multivariate Gaussians with imperfect advice. - Arnab Bhattacharyya 001; Davin Choo; Philips George John; Themis Gouleakis (CoRR, 2024)

Improved Bounds for Online Facility Location with Predictions. - Dimitris Fotakis 001; Evangelia Gergatsouli; Themistoklis Gouleakis; Nikolas Patris; Thanos Tolias (AAAI, 2025)

Learning High-dimensional Gaussians from Censored Data. - Arnab Bhattacharyya 001; Constantinos Daskalakis; Themis Gouleakis; Yuhao Wang (AISTATS, 2025)

Gaussian Mean Testing under Truncation. - Clément Louis Canonne; Themis Gouleakis; Yuhao Wang; Joy Qiping Yang (AISTATS, 2025)