Generate a tailored SOP for Dr. Pravesh Kothari. Improve your application with a focused, well-structured draft.
Pravesh K. Kothari is an Assistant Professor in the Department of Computer Science and the Department of Applied Mathematics at Princeton University. His research interests lie in combinatorial optimization, with a focus on spectral methods, semidefinite programming, random matrices, and robust statistics. Kothari's work is supported by several prestigious grants, including the NSF CAREER Award and the Alfred P. Sloan Fellowship. He has contributed significantly to the fields of algorithm design and proof complexity, working on problems related to efficient algorithms and lower bounds in coding theory. Kothari is actively mentoring several PhD students and postdoctoral researchers, while also being involved in leading workshops and talks in the academic community. His publications reflect deep insights into algorithmic thresholds and the intersection of randomization and combinatorial structures.
Princeton University • Princeton, NJ
GRE scores are not accepted. Ph.D. is the primary degree; students are not required to hold an M.S.E. prior to admission.