Themis Gouleakis

According to our database, Themis Gouleakis authored at least 32 papers between 2012 and 2024.

Collaborative distances:

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

2024

Online bipartite matching with imperfect advice.

Davin Choo, Themistoklis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts.

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis

Distributed Comput., December, 2023

Secretary and online matching problems with machine learned advice.

Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev

Discret. Optim., May, 2023

Active causal structure learning with advice.

Davin Choo, Themistoklis Gouleakis, Arnab Bhattacharyya

Proceedings of the International Conference on Machine Learning, 2023

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else.

Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Learning-Augmented Algorithms for Online TSP on the Line.

Themistoklis Gouleakis, Konstantinos Lakis, Golnoosh Shahkarami

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver.

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Accelerated Distributed Laplacian Solvers via Shortcuts.

Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen

CoRR, 2021

Learning Augmented Online Facility Location.

Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis, Nikolas Patris

CoRR, 2021

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model.

Ioannis Anagnostides, Themis Gouleakis

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Robust Learning under Strong Noise via SQs.

Ioannis Anagnostides, Themis Gouleakis, Ali Marashian

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Optimal Testing of Discrete Distributions with High Probability.

Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, John Peebles, Eric Price

Electron. Colloquium Comput. Complex., 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

Collision-Based Testers are Optimal for Uniformity and Closeness.

Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price

Chic. J. Theor. Comput. Sci., 2019

Distribution-Independent PAC Learning of Halfspaces with Massart Noise.

Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Communication and Memory Efficient Testing of Discrete Distributions.

Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao

Proceedings of the Conference on Learning Theory, 2019

Computationally and Statistically Efficient Truncated Regression.

Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis

Proceedings of the Conference on Learning Theory, 2019

Towards Testing Monotonicity of Distributions Over General Posets.

Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee

Proceedings of the Conference on Learning Theory, 2019

2018

New directions in sublinear algorithms and testing properties of distributions.

Themistoklis Gouleakis

PhD thesis, 2018

Sampling Correctors.

Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld

SIAM J. Comput., 2018

Testing Shape Restrictions of Discrete Distributions.

Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld

Theory Comput. Syst., 2018

Local Computation Algorithms for the Lovász Local Lemma.

Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos

CoRR, 2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.

Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld

CoRR, 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, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Efficient Statistics, in High Dimensions, from Truncated Samples.

Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Certified Computation from Unreliable Datasets.

Themis Gouleakis, Christos Tzamos, Manolis Zampetakis

Proceedings of the Conference On Learning Theory, 2018

2017

Sample-Optimal Identity Testing with High Probability.

Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price

Electron. Colloquium Comput. Complex., 2017

Certified Computation in Crowdsourcing.

Themis Gouleakis, Christos Tzamos, Manolis Zampetakis

CoRR, 2017

Faster Sublinear Algorithms using Conditional Sampling.

Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

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

2012

Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion .

Dimitris Achlioptas, Themis Gouleakis

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012