Researcher Portfolio
Gouleakis, Themis
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons254978
External references
WorldCat
Search for Gouleakis, Themis
Google Scholar
Search for Gouleakis, Themis
Publications
: Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2023). Secretary and Online Matching Problems with Machine Learned Advice. Discrete Optimization, 48(2): 100778. doi:10.1016/j.disopt.2023.100778. [PubMan] : Anagnostides, I., Lenzen, C., Haeupler, B., Zuzic, G., & Gouleakis, T. (2022). Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. In C. Scheideler (Ed. ), 36th International Symposium on Distributed Computing (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.DISC.2022.6. [PubMan] : Anagnostides, I., Lenzen, C., Haeupler, B., Zuzic, G., & Gouleakis, T. (2021). Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. Retrieved from https://arxiv.org/abs/2109.05151. [PubMan] : Anagnostides, I., & Gouleakis, T. (2021). Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In S. Gilbert (Ed. ), 35th International Symposium on Distributed Computing (pp. 1-19). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.DISC.2021.5. [PubMan] : Diakonikolas, I., Gouleakis, T., Kane, D. M., Peebles, J., & Price, E. (2021). Optimal Testing of Discrete Distributions with High Probability. In S. Khuller, & V. Vassilevska Williams (Eds. ), STOC '21 (pp. 542-555). New York, NY: ACM. doi:10.1145/3406325.3450997. [PubMan] : Anagnostides, I., Gouleakis, T., & Marashian, A. (2021). Robust Learning under Strong Noise via SQs. In A. Banerjee, & K. Fukumizu (Eds. ), Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (pp. 3808-3816). PMLR. Retrieved from https://proceedings.mlr.press/v130/anagnostides21a.html. [PubMan] : Achlioptas, D., Gouleakis, T., & Iliopoulos, F. (2020). Simple Local Computation Algorithms for the General Lovász Local Lemma. In SPAA '20 (pp. 1-10). New York, NY: ACM. doi:10.1145/3350755.3400250. [PubMan] : Anagnostides, I., Gouleakis, T., & Marashian, A. (2020). Robust Learning under Strong Noise via SQs. Retrieved from https://arxiv.org/abs/2010.09106. [PubMan] : Diakonikolas, I., Gouleakis, T., Kane, D. M., Peebles, J., & Price, E. (2020). Optimal Testing of Discrete Distributions with High Probability. Retrieved from https://arxiv.org/abs/2009.06540. [PubMan] : Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2020). Secretary and Online Matching Problems with Machine Learned Advice. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, & H. Lin (Eds. ), Advances in Neural Information Processing Systems 33 (pp. 7933-7944). Curran Associates, Inc. [PubMan] : Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2020). Secretary and Online Matching Problems with Machine Learned Advice. Retrieved from https://arxiv.org/abs/2006.01026. [PubMan] : Diakonikolas, I., Gouleakis, T., & Tzamos, C. (2019). Distribution-Independent PAC Learning of Halfspaces with Massart Noise. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, & R. Garnett (Eds. ), Advances in Neural Information Processing Systems 32 (pp. 4749-4760). Curran Associates, Inc. Retrieved from https://proceedings.neurips.cc/paper/2019/file/358aee4cc897452c00244351e4d91f69-Paper.pdf. [PubMan]