Pravesh K Kothari received his Ph. D. from the University of Texas at Austin in 2016 after a Bachelor's degree from Indian Institute of Technology, Kanpur. He is currently an Assistant Professor in the Computer Science Department at Princeton University. Earlier, from 2019-2023, he was an Assistant Professor in the Computer Science Department at Carnegie Mellon University. Dr. Kothari was a Research Instructor of Computer Science jointly hosted by the Institute for Advanced Study, Princeton and the Department of Computer Science at Princeton University from 2016-19. 
<br>
<br>
Dr. Kothari's research interests span several topics in theoretical computer science such as convex optimization and applications to  algorithm design,  algorithms and lower bounds for statistical estimation and average-case combinatorial optimization, and spectral methods and connections  to random matrix theory, coding theory and  extremal combinatorics.
<br>
<br>
Dr Kothari is a recipient of the Presburger Award (2024),  IIT Kanpur Young Alumnus Award (2023), Sloan Fellowship (2022),  NSF Career Award (2021), and Simons Award for Graduate students in Theoretical Computer Science (2014).