Pravesh Kothari

Pravesh Kothari is an Assistant Professor in the Department of Computer Science at Princeton University. He joined Princeton in 2024 after serving as an assistant professor at Carnegie Mellon University. His research focuses on algorithm design for average-case and beyond-average-case computational problems, with connections to semidefinite programming, spectral methods, and extremal combinatorics. Kothari's work has been recognized with the Presburger Award for contributions to theoretical computer science.

Pravesh K. Kothari is a researcher in Theoretical Computer Science, focusing on the development of algorithms and analysis of computational complexity. His work explores the intersection of optimization, learning theory, and algorithm design, with an emphasis on robust statistical methods and efficient algorithms for data analysis. Kothari's research includes the study of sum-of-squares methods for detecting hidden structures, outlier-robust regression, and differentially private online learning. His contributions span both theoretical and applied aspects of machine learning and computational complexity, with a focus on improving the efficiency and reliability of algorithms in the presence of noise and adversarial data.