Pravesh K. Kothari
Pravesh K. Kothari
Verified email at cs.cmu.edu - Homepage
Title
Cited by
Cited by
Year
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
2812010
Differentially private online learning
P Jain, P Kothari, A Thakurta
Conference on Learning Theory, 24.1-24.34, 2012
2122012
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
1562019
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
108*2018
Efficient algorithms for outlier-robust regression
A Klivans, PK Kothari, R Meka
Conference on Learning Theory, COLT, 2018, 2018
1082018
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
782017
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
772017
Provable submodular minimization using Wolfe's algorithm
D Chakrabarty, P Jain, P Kothari
Advances in Neural Information Processing Systems 27, 802-809, 2014
612014
An analysis of the t-sne algorithm for data visualization
S Arora, W Hu, PK Kothari
Conference On Learning Theory, COLT 2018, 2018
532018
Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
PK Kothari, R Meka, P Raghavendra
SIAM Journal on Computing, STOC17-305-STOC17-332, 2021
502021
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
50*2015
Submodular functions are noise stable
M Cheraghchi, A Klivans, P Kothari, HK Lee
ACM SIAM Symposium on Discrete Algorithms, SODA 2012, 2011
502011
Learning coverage functions and private release of marginals
V Feldman, P Kothari
Conference on Learning Theory, 679-702, 2014
48*2014
Embedding hard learning problems into gaussian space
A Klivans, P Kothari
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
472014
List-decodable linear regression
S Karmalkar, AR Klivans, PK Kothari
Advances in Neural Information Processing Systems, 2019
412019
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
392015
Outlier-robust moment-estimation via sum-of-squares
PK Kothari, D Steurer
Symposium on Theory of Computing, STOC 2018, 2017
362017
Concurrency software testing with probabilistic bounds on finding bugs
SC Burckhardt, PK Kothari, MS Musuvathi, SG Nagarakatte
US Patent 8,930,907, 2015
332015
Semialgebraic Proofs and Efficient Algorithm Design.
N Fleming, P Kothari, T Pitassi
NOW the essence of knowledge, Foundations and Trends Series, 2019
302019
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
292018
The system can't perform the operation now. Try again later.
Articles 1–20