| Year |
Citation |
Score |
| 2020 |
Johnson DS, Breslau L, Diakonikolas I, Duffield NG, Gu Y, Hajiaghayi M, Karloff HJ, Resende MGC, Sen S. Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs Operations Research. 68: 896-926. DOI: 10.1287/Opre.2019.1956 |
0.442 |
|
| 2020 |
Canonne CL, Diakonikolas I, Kane DM, Stewart A. Testing Bayesian Networks Ieee Transactions On Information Theory. 66: 3132-3170. DOI: 10.1109/Tit.2020.2971625 |
0.347 |
|
| 2019 |
Diakonikolas I, Kamath G, Kane D, Li J, Moitra A, Stewart A. Robust Estimators in High-Dimensions Without the Computational Intractability Siam Journal On Computing. 48: 742-864. DOI: 10.1137/17M1126680 |
0.327 |
|
| 2018 |
Chen X, Diakonikolas I, Paparas D, Sun X, Yannakakis M. The complexity of optimal multidimensional pricing for a unit-demand buyer Games and Economic Behavior. 110: 139-164. DOI: 10.1016/J.Geb.2018.03.016 |
0.659 |
|
| 2017 |
De A, Diakonikolas I, Servedio RA. The Inverse Shapley value problem Games and Economic Behavior. 105: 122-147. DOI: 10.1016/J.Geb.2017.06.004 |
0.396 |
|
| 2016 |
De A, Diakonikolas I, Servedio RA. 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. DOI: 10.1137/130919143 |
0.412 |
|
| 2016 |
Canonne CL, Diakonikolas I, Gouleakis T, Rubinfeld R. Testing shape restrictions of discrete distributions Leibniz International Proceedings in Informatics, Lipics. 47. DOI: 10.1007/S00224-017-9785-6 |
0.451 |
|
| 2015 |
Acharya J, Diakonikolas I, Hegde C, Li J, Schmidt L. 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. DOI: 10.1145/2745754.2745772 |
0.353 |
|
| 2015 |
Chen X, Diakonikolas I, Orfanou A, Paparas D, Sun X, Yannakakis M. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1464-1479. DOI: 10.1109/FOCS.2015.93 |
0.649 |
|
| 2015 |
Diakonikolas I, Kane DM, Nikishkin V. Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1183-1202. DOI: 10.1109/FOCS.2015.76 |
0.364 |
|
| 2015 |
Daskalakis C, Diakonikolas I, Servedio RA. Learning Poisson Binomial Distributions Algorithmica. 72: 316-357. DOI: 10.1007/S00453-015-9971-3 |
0.409 |
|
| 2014 |
De A, Diakonikolas I, Feldman V, Servedio RA. Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces Journal of the Acm. 61. DOI: 10.1145/2590772 |
0.394 |
|
| 2014 |
Diakonikolas I, Raghavendra P, Servedio RA, Tan LY. Average sensitivity and noise sensitivity of polynomial threshold functions Siam Journal On Computing. 43: 231-253. DOI: 10.1137/110855223 |
0.37 |
|
| 2014 |
Daskalakis C, De A, Diakonikolas I, Moitra A, Servedio RA. A polynomial-time approximation scheme for fault-tolerant distributed storage Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 628-644. |
0.446 |
|
| 2014 |
Chan SO, Diakonikolas I, Valiant P, Valiant G. Optimal algorithms for testing closeness of discrete distributions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1193-1203. |
0.371 |
|
| 2014 |
Chen X, Diakonikolas I, Paparas D, Sun X, Yannakakis M. The complexity of optimal multidimensional pricing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1319-1328. |
0.653 |
|
| 2013 |
De A, Diakonikolas I, Servedio RA. Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Electronic Colloquium On Computational Complexity. 20: 172. DOI: 10.14288/1.0043373 |
0.395 |
|
| 2013 |
Diakonikolas I, Servedio RA. Improved Approximation of Linear Threshold Functions Computational Complexity. 22: 623-677. DOI: 10.1007/S00037-012-0045-5 |
0.343 |
|
| 2013 |
De A, Diakonikolas I, Servedio R. A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 376-387. DOI: 10.1007/978-3-642-39206-1_32 |
0.35 |
|
| 2013 |
Daskalakis C, Diakonikolas I, Servedio RA, Valiant G, Valiant P. Testing k-modal distributions: Optimal algorithms via reductions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1833-1852. |
0.307 |
|
| 2012 |
De A, Diakonikolas I, Servedio R. The inverse Shapley value problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 266-277. DOI: 10.1007/978-3-642-31594-7_23 |
0.309 |
|
| 2011 |
Diakonikolas I, Lee HK, Matulef K, Servedio RA, Wan A. Efficiently testing sparse GF(2) polynomials Algorithmica (New York). 61: 580-605. DOI: 10.1007/S00453-010-9426-9 |
0.393 |
|
| 2011 |
Diakonikolas I, O'Donnell R, Wu Y, Servedio RA. Hardness results for agnostically learning low-degree polynomial threshold functions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1590-1606. |
0.301 |
|
| 2010 |
Daskalakis C, Diakonikolas I, Yannakakis M. How good is the Chord algorithm? Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 978-991. DOI: 10.1137/13093875X |
0.598 |
|
| 2010 |
Diakonikolas I, Gopalan P, Jaiswal R, Servedio RA, Viola E. Bounded independence fools halfspaces Siam Journal On Computing. 39: 3441-3462. DOI: 10.1137/100783030 |
0.321 |
|
| 2009 |
Diakonikolas I, Yannakakis M. Small approximate pareto sets for biobjective shortest paths and other problems Siam Journal On Computing. 39: 1340-1371. DOI: 10.1137/080724514 |
0.654 |
|
| 2008 |
Diakonikolas I, Yannakakis M. Succinct approximate convex Pareto curves (extended abstract) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 74-83. |
0.662 |
|
| 2007 |
Diakonikolas I, Yannakakis M. Small approximate pareto sets for bi-objective shortest paths and other problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4627: 74-88. |
0.646 |
|
| Show low-probability matches. |