![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Themis Gouleakis
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i27]Davin Choo, Themis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya:
Online bipartite matching with imperfect advice. CoRR abs/2405.09784 (2024) - 2023
- [j6]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023) - [j5]Antonios Antoniadis
, Themis Gouleakis, Pieter Kleer
, Pavel Kolev:
Secretary and online matching problems with machine learned advice. Discret. Optim. 48(Part 2): 100778 (2023) - [c22]Themistoklis Gouleakis, Konstantinos Lakis, Golnoosh Shahkarami:
Learning-Augmented Algorithms for Online TSP on the Line. AAAI 2023: 11989-11996 - [c21]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn
, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA 2023: 12:1-12:17 - [c20]Davin Choo, Themistoklis Gouleakis, Arnab Bhattacharyya:
Active causal structure learning with advice. ICML 2023: 5838-5867 - [i26]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR abs/2305.02169 (2023) - [i25]Davin Choo, Themis Gouleakis, Arnab Bhattacharyya:
Active causal structure learning with advice. CoRR abs/2305.19588 (2023) - 2022
- [c19]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - [c18]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC 2022: 6:1-6:20 - [i24]Themis Gouleakis, Konstantinos Lakis
, Golnoosh Shahkarami:
Learning-Augmented Algorithms for Online TSP on the Line. CoRR abs/2206.00655 (2022) - 2021
- [c17]Ioannis Anagnostides, Themis Gouleakis, Ali Marashian:
Robust Learning under Strong Noise via SQs. AISTATS 2021: 3808-3816 - [c16]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal testing of discrete distributions with high probability. STOC 2021: 542-555 - [c15]Ioannis Anagnostides, Themis Gouleakis:
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. DISC 2021: 5:1-5:19 - [i23]Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis, Nikolas Patris:
Learning Augmented Online Facility Location. CoRR abs/2107.08277 (2021) - [i22]Ioannis Anagnostides, Themis Gouleakis:
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. CoRR abs/2108.01740 (2021) - [i21]Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen:
Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR abs/2109.05151 (2021) - 2020
- [c14]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. NeurIPS 2020 - [c13]Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos:
Simple Local Computation Algorithms for the General Lovász Local Lemma. SPAA 2020: 1-10 - [i20]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. CoRR abs/2006.01026 (2020) - [i19]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. CoRR abs/2009.06540 (2020) - [i18]Ioannis Anagnostides, Themis Gouleakis, Ali Marashian:
Robust Learning under Strong Noise via SQs. CoRR abs/2010.09106 (2020) - [i17]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. CoRR abs/2010.12000 (2020) - [i16]Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j4]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-Based Testers are Optimal for Uniformity and Closeness. Chic. J. Theor. Comput. Sci. 2019 (2019) - [c12]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. COLT 2019: 34-82 - [c11]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis
:
Computationally and Statistically Efficient Truncated Regression. COLT 2019: 955-960 - [c10]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao:
Communication and Memory Efficient Testing of Discrete Distributions. COLT 2019: 1070-1106 - [c9]Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos:
Distribution-Independent PAC Learning of Halfspaces with Massart Noise. NeurIPS 2019: 4751-4762 - [i15]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao:
Communication and Memory Efficient Testing of Discrete Distributions. CoRR abs/1906.04709 (2019) - [i14]Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos:
Distribution-Independent PAC Learning of Halfspaces with Massart Noise. CoRR abs/1906.10075 (2019) - [i13]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. CoRR abs/1907.03182 (2019) - 2018
- [b1]Themistoklis Gouleakis:
New directions in sublinear algorithms and testing properties of distributions. Massachusetts Institute of Technology, Cambridge, USA, 2018 - [j3]Maryam Aliakbarpour
, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee
:
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica 80(2): 668-697 (2018) - [j2]Clément L. Canonne
, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. Theory Comput. Syst. 62(1): 4-62 (2018) - [j1]Clément L. Canonne
, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. SIAM J. Comput. 47(4): 1373-1423 (2018) - [c8]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis
:
Certified Computation from Unreliable Datasets. COLT 2018: 3271-3294 - [c7]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos
, Manolis Zampetakis
:
Efficient Statistics, in High Dimensions, from Truncated Samples. FOCS 2018: 639-649 - [c6]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. ICALP 2018: 41:1-41:14 - [c5]Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC 2018: 129-138 - [i12]Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR abs/1802.08237 (2018) - [i11]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. CoRR abs/1809.03986 (2018) - [i10]Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos:
Local Computation Algorithms for the Lovász Local Lemma. CoRR abs/1809.07910 (2018) - 2017
- [c4]Themistoklis Gouleakis, Christos Tzamos
, Manolis Zampetakis
:
Faster Sublinear Algorithms using Conditional Sampling. SODA 2017: 1743-1757 - [i9]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. CoRR abs/1708.02728 (2017) - [i8]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Certified Computation in Crowdsourcing. CoRR abs/1709.03926 (2017) - [i7]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c3]Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. ITCS 2016: 93-102 - [c2]Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. STACS 2016: 25:1-25:14 - [i6]Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation. CoRR abs/1601.04233 (2016) - [i5]Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Faster Sublinear Algorithms using Conditional Sampling. CoRR abs/1608.04759 (2016) - [i4]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-based Testers are Optimal for Uniformity and Closeness. CoRR abs/1611.03579 (2016) - [i3]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-based Testers are Optimal for Uniformity and Closeness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. CoRR abs/1504.06544 (2015) - [i1]Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. CoRR abs/1507.03558 (2015) - 2012
- [c1]Dimitris Achlioptas, Themis Gouleakis:
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . FSTTCS 2012: 16-23
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-13 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint