Ilias Diakonikolas, Ph.D.

Affiliations: 
2011 Computer Science Columbia University, New York, NY 
Area:
Algorithms, Complexity Theory, Combinatorial Optimization, Databases, Testing and Verification
Google:
"Ilias Diakonikolas"

Parents

Sign in to add mentor
Mihalis Yannakakis grad student 2011 Columbia
 (Approximation of Multiobjective Optimization Problems.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Johnson DS, Breslau L, Diakonikolas I, et al. (2020) Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs Operations Research. 68: 896-926
Canonne CL, Diakonikolas I, Kane DM, et al. (2020) Testing Bayesian Networks Ieee Transactions On Information Theory. 66: 3132-3170
Diakonikolas I, Kamath G, Kane D, et al. (2019) Robust Estimators in High-Dimensions Without the Computational Intractability Siam Journal On Computing. 48: 742-864
Chen X, Diakonikolas I, Paparas D, et al. (2018) The complexity of optimal multidimensional pricing for a unit-demand buyer Games and Economic Behavior. 110: 139-164
De A, Diakonikolas I, Servedio RA. (2017) The Inverse Shapley value problem Games and Economic Behavior. 105: 122-147
De A, Diakonikolas I, Servedio RA. (2016) A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry Siam Journal On Discrete Mathematics. 30: 1058-1094
Canonne CL, Diakonikolas I, Gouleakis T, et al. (2016) Testing shape restrictions of discrete distributions Leibniz International Proceedings in Informatics, Lipics. 47
Acharya J, Diakonikolas I, Hegde C, et al. (2015) Fast and Near Optimal Algorithms for Approximating Distributions by Histograms Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 31: 249-263
Chen X, Diakonikolas I, Orfanou A, et al. (2015) On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1464-1479
Diakonikolas I, Kane DM, Nikishkin V. (2015) Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1183-1202
See more...