| A randomized scheduler with probabilistic guarantees of finding bugs S Burckhardt, P Kothari, M Musuvathi, S Nagarakatte ACM SIGARCH Computer Architecture News 38 (1), 167-178, 2010 | 339 | 2010 |
| A nearly tight sum-of-squares lower bound for the planted clique problem B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin SIAM Journal on Computing 48 (2), 687-735, 2019 | 287 | 2019 |
| Differentially private online learning P Jain, P Kothari, A Thakurta Conference on Learning Theory, 24.1-24.34, 2012 | 283 | 2012 |
| An analysis of the t-sne algorithm for data visualization S Arora, W Hu, PK Kothari Conference On Learning Theory, COLT 2018, 2018 | 226 | 2018 |
| Robust moment estimation and improved clustering via sum of squares PK Kothari, J Steinhardt, D Steurer Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 217* | 2018 |
| Efficient algorithms for outlier-robust regression A Klivans, PK Kothari, R Meka Conference on Learning Theory, COLT, 2018, 2018 | 186 | 2018 |
| The power of sum-of-squares for detecting hidden structures SB Hopkins, PK Kothari, A Potechin, P Raghavendra, T Schramm, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 162 | 2017 |
| Sum of squares lower bounds for refuting any CSP PK Kothari, R Mori, R O'Donnell, D Witmer Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 123 | 2017 |
| Semialgebraic Proofs and Efficient Algorithm Design. N Fleming, P Kothari, T Pitassi NOW the essence of knowledge, Foundations and Trends Series, 2019 | 98 | 2019 |
| List-decodable linear regression S Karmalkar, AR Klivans, PK Kothari Advances in Neural Information Processing Systems, 2019 | 92 | 2019 |
| Provable submodular minimization using Wolfe's algorithm D Chakrabarty, P Jain, P Kothari Advances in Neural Information Processing Systems 27, 2014 | 78 | 2014 |
| Robustly learning mixtures of k arbitrary Gaussians A Bakshi, I Diakonikolas, H Jia, DM Kane, PK Kothari, SS Vempala Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 77 | 2022 |
| Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs PK Kothari, R Meka, P Raghavendra Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 77* | 2017 |
| Outlier-robust moment-estimation via sum-of-squares PK Kothari, D Steurer Symposium on Theory of Computing, STOC 2018, 2017 | 69 | 2017 |
| Sos and planted clique: Tight analysis of MPW moments at all degrees and an optimal lower bound at degree four SB Hopkins, PK Kothari, A Potechin ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, 2015 | 68* | 2015 |
| Private robust estimation by stabilizing convex relaxations P Kothari, P Manurangsi, A Velingker Conference on Learning Theory, 723-777, 2022 | 65 | 2022 |
| Outlier-Robust Clustering of Non-Spherical Mixtures A Bakshi, P Kothari IEEE Foundations of Computer Science, FOCS 2020, 2020 | 64* | 2020 |
| Embedding hard learning problems into gaussian space A Klivans, P Kothari Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 59 | 2014 |
| Submodular functions are noise stable M Cheraghchi, A Klivans, P Kothari, HK Lee ACM SIAM Symposium on Discrete Algorithms, SODA 2012, 2011 | 58 | 2011 |
| Small-set expansion in shortcode graph and the 2-to-2 conjecture B Barak, PK Kothari, D Steurer Innovations in Theoretical Computer Science, ITCS, 2018 | 57 | 2018 |
David SteurerETH Zürich在 inf.ethz.ch 的电子邮件经过验证