| 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 | 265 | 2010 |
| Differentially private online learning P Jain, P Kothari, A Thakurta Conference on Learning Theory, 24.1-24.34, 2012 | 171 | 2012 |
| 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 | 131 | 2019 |
| Efficient algorithms for outlier-robust regression A Klivans, PK Kothari, R Meka Conference on Learning Theory, COLT, 2018, 2018 | 81 | 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 | 77* | 2018 |
| 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 | 60 | 2017 |
| 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 | 57 | 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 | 52 | 2017 |
| Provable submodular minimization using Wolfe's algorithm D Chakrabarty, P Jain, P Kothari Advances in Neural Information Processing Systems 27, 802-809, 2014 | 49 | 2014 |
| Submodular functions are noise stable M Cheraghchi, A Klivans, P Kothari, HK Lee ACM SIAM Symposium on Discrete Algorithms, SODA 2012, 2011 | 48 | 2011 |
| 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 | 46 | 2017 |
| Learning coverage functions and private release of marginals V Feldman, P Kothari Conference on Learning Theory, 679-702, 2014 | 45* | 2014 |
| Embedding hard learning problems into gaussian space A Klivans, P Kothari Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 40 | 2014 |
| 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 | 39* | 2015 |
| Sum of squares lower bounds from pairwise independence B Barak, SO Chan, PK Kothari Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 37 | 2015 |
| Concurrency software testing with probabilistic bounds on finding bugs SC Burckhardt, PK Kothari, MS Musuvathi, SG Nagarakatte US Patent 8,930,907, 2015 | 33 | 2015 |
| Outlier-robust moment-estimation via sum-of-squares PK Kothari, D Steurer Symposium on Theory of Computing, STOC 2018, 2017 | 30 | 2017 |
| List-decodable linear regression S Karmalkar, A Klivans, P Kothari Advances in Neural Information Processing Systems, 7425-7434, 2019 | 29 | 2019 |
| Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation) B Barak, Z Brakerski, I Komargodski, PK Kothari Annual International Conference on the Theory and Applications of …, 2018 | 28 | 2018 |
| An analysis of the t-sne algorithm for data visualization S Arora, W Hu, PK Kothari Conference On Learning Theory, COLT 2018, 2018 | 28 | 2018 |
Boaz BarakHarvard UniversityVerified email at boazbarak.org
