Themis Gouleakis
Themis Gouleakis
Max Planck Institute for Informatics
Vahvistettu sähköpostiosoite verkkotunnuksessa mit.edu
Nimike
Viittaukset
Viittaukset
Vuosi
Improved massively parallel computation algorithms for mis, matching, and vertex cover
M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
862018
Testing shape restrictions of discrete distributions
CL Canonne, I Diakonikolas, T Gouleakis, R Rubinfeld
Theory of Computing Systems 62 (1), 4-62, 2018
722018
Collision-based testers are optimal for uniformity and closeness
I Diakonikolas, T Gouleakis, J Peebles, E Price
arXiv preprint arXiv:1611.03579, 2016
492016
Optimal Identity Testing with High Probability
I Diakonikolas, T Gouleakis, J Peebles, E Price
arXiv preprint arXiv:1708.02728, 2017
432017
Sublinear-time algorithms for counting star subgraphs via edge sampling
M Aliakbarpour, AS Biswas, T Gouleakis, J Peebles, R Rubinfeld, ...
Algorithmica 80 (2), 668-697, 2018
39*2018
Distribution-independent PAC learning of halfspaces with massart noise
I Diakonikolas, T Gouleakis, C Tzamos
arXiv preprint arXiv:1906.10075, 2019
372019
Efficient statistics, in high dimensions, from truncated samples
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
222018
Communication and memory efficient testing of discrete distributions
I Diakonikolas, T Gouleakis, DM Kane, S Rao
Conference on Learning Theory, 1070-1106, 2019
152019
Secretary and online matching problems with machine learned advice
A Antoniadis, T Gouleakis, P Kleer, P Kolev
arXiv preprint arXiv:2006.01026, 2020
142020
Computationally and statistically efficient truncated regression
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 955-960, 2019
122019
Sampling correctors
CL Canonne, T Gouleakis, R Rubinfeld
SIAM Journal on Computing 47 (4), 1373-1423, 2018
122018
Faster sublinear algorithms using conditional sampling
T Gouleakis, C Tzamos, M Zampetakis
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
72017
Algorithmic improvements of the Lovász local lemma via cluster expansion
D Achlioptas, T Gouleakis
IARCS Annual Conference on Foundations of Software Technology and …, 2012
52012
Optimal testing of discrete distributions with high probability
I Diakonikolas, T Gouleakis, DM Kane, J Peebles, E Price
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
42021
Towards Testing Monotonicity of Distributions Over General Posets
M Aliakbarpour, T Gouleakis, J Peebles, R Rubinfeld, A Yodpinyanee
Conference on Learning Theory, 34-82, 2019
42019
Certified computation from unreliable datasets
T Gouleakis, C Tzamos, M Zampetakis
Conference On Learning Theory, 3271-3294, 2018
32018
Local computation algorithms for the Lovász Local Lemma
D Achlioptas, T Gouleakis, F Iliopoulos
CoRR, abs/1809.07910, 2018
32018
Deterministic distributed algorithms and lower bounds in the hybrid model
I Anagnostides, T Gouleakis
arXiv preprint arXiv:2108.01740, 2021
12021
Simple Local Computation Algorithms for the General Lovász Local Lemma
D Achlioptas, T Gouleakis, F Iliopoulos
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
12020
Accelerated Distributed Laplacian Solvers via Shortcuts
I Anagnostides, T Gouleakis, C Lenzen
arXiv preprint arXiv:2109.05151, 2021
2021
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20