Robust estimators in high-dimensions without the computational intractability I Diakonikolas, G Kamath, D Kane, J Li, A Moitra, A Stewart SIAM Journal on Computing 48 (2), 742-864, 2019 | 289 | 2019 |

Optimal Algorithms for Testing Closeness of Discrete Distributions SO Chan, I Diakonikolas, P Valiant, G Valiant SODA, 1193-1203, 2014 | 171 | 2014 |

Sever: A robust meta-algorithm for stochastic optimization I Diakonikolas, G Kamath, D Kane, J Li, J Steinhardt, A Stewart International Conference on Machine Learning, 1596-1606, 2019 | 162 | 2019 |

Being robust (in high dimensions) can be practical I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart International Conference on Machine Learning, 999-1008, 2017 | 151 | 2017 |

Bounded independence fools halfspaces I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola SIAM Journal on Computing (SICOMP), 3441-3462, 2010 | 124 | 2010 |

Bounded independence fools halfspaces I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola FOCS 2009, 171-180, 2009 | 124 | 2009 |

Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures I Diakonikolas, DM Kane, A Stewart 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2017 | 122 | 2017 |

Learning poisson binomial distributions C Daskalakis, I Diakonikolas, RA Servedio STOC 2012, 709-728, 2012 | 116 | 2012 |

Testing for concise representations I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ... FOCS 2007, 549-558, 2007 | 109 | 2007 |

A new approach for testing properties of discrete distributions I Diakonikolas, DM Kane 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 107 | 2016 |

Efficient density estimation via piecewise polynomial approximation SO Chan, I Diakonikolas, RA Servedio, X Sun STOC, 604-613, 2014 | 104 | 2014 |

Robustly learning a gaussian: Getting optimal error, efficiently I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 96 | 2018 |

Bounded independence fools degree-2 threshold functions I Diakonikolas, DM Kane, J Nelson FOCS 2010, 11-20, 2010 | 94 | 2010 |

Efficient algorithms and lower bounds for robust linear regression I Diakonikolas, W Kong, A Stewart Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 88 | 2019 |

Learning k-modal distributions via testing C Daskalakis, I Diakonikolas, RA Servedio SODA 2012, 1371-1385, 2012 | 86 | 2012 |

List-decodable robust mean estimation and learning mixtures of spherical Gaussians I Diakonikolas, DM Kane, A Stewart Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 83 | 2018 |

Testing Identity of Structured Distributions I Diakonikolas, DM Kane, V Nikishkin SODA 2015, 2014 | 83 | 2014 |

Testing -Modal Distributions: Optimal Algorithms via Reductions C Daskalakis, I Diakonikolas, RA Servedio, G Valiant, P Valiant SODA 2013, 2012 | 82 | 2012 |

Learning mixtures of structured distributions over discrete domains SO Chan, I Diakonikolas, X Sun, RA Servedio Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 76 | 2013 |

Small approximate Pareto sets for bi-objective shortest paths and other problems I Diakonikolas, M Yannakakis SIAM Journal on Computing (SICOMP) 39 (4), 1340-1371, 2009 | 75 | 2009 |