I agree that this site is using cookies. You can find further informations here.
X
Diakonikolas, Ilias
215  results:
Search for persons X
?
1

Testing Closeness of Multivariate Distributions via Ramsey ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Diakonikolas, Ilias ; Kane, Daniel M. ; Liu, Sihan - p. 340-347 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Super Non-singular Decompositions of Polynomials and Their ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Diakonikolas, Ilias ; Kane, Daniel M. ; Kontonis, Vasilis.. - p. 152-159 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Algorithmic high-dimensional robust statistics:

Diakonikolas, Ilias ; Kane, Daniel M. , 2023
Link: https://doi.org/10.1017/..
 
?
4

A Strongly Polynomial Algorithm for Approximate Forster Tra..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Diakonikolas, Ilias ; Tzamos, Christos ; Kane, Daniel M. - p. 1741-1754 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

Clustering mixture models in almost-linear time via list-de..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Diakonikolas, Ilias ; Kane, Daniel M. ; Kongsgaard, Daniel.. - p. 1262-1275 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

Robustly learning mixtures of k arbitrary Gaussians:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bakshi, Ainesh ; Diakonikolas, Ilias ; Jia, He... - p. 1234-1247 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

On the Complexity of Optimal Lottery Pricing and Randomized..:

Chen, Xi ; Diakonikolas, Ilias ; Orfanou, Anthi...
SIAM Journal on Computing.  51 (2022)  3 - p. 492-548 , 2022
Link: https://doi.org/10.1137/..
 
?
8

Learning general halfspaces with general Massart noise unde..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Diakonikolas, Ilias ; Kane, Daniel M. ; Kontonis, Vasilis.. - p. 874-885 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

Robustness meets algorithms:

Diakonikolas, Ilias ; Kamath, Gautam ; Kane, Daniel M....
Communications of the ACM.  64 (2021)  5 - p. 107-115 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Efficiently learning halfspaces with Tsybakov noise:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Diakonikolas, Ilias ; Kane, Daniel M. ; Kontonis, Vasilis.. - p. 88-101 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Optimal testing of discrete distributions with high probabi..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Diakonikolas, Ilias ; Gouleakis, Themis ; Kane, Daniel M... - p. 542-555 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Robustness meets algorithms:

Diakonikolas, Ilias ; Kamath, Gautam ; Kane, Daniel M....
Communications of the ACM.  64 (2021)  5 - p. 107-115 , 2021
Link: https://doi.org/10.1145/..
 
?
13

Outlier-Robust Clustering of Gaussians and Other Non-Spheri..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bakshi, Ainesh ; Diakonikolas, Ilias ; Hopkins, Samuel B.... - p. 149-159 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Small Covers for Near-Zero Sets of Polynomials and Learning..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Diakonikolas, Ilias ; Kane, Daniel M. - p. 184-195 , 2020
Link: https://doi.org/10.1109/..
 
?
15

High-dimensional robust mean estimation in nearly-linear ti..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Cheng, Yu ; Diakonikolas, Ilias ; Ge, Rong - p. 2755-2771 , 2019
Link: https://dl.acm.org/doi/1..
 
1-15