Pravesh Kothari
Assistant Professor, Computer Science Department
Pravesh Kothari is broadly interested in theoretical computer science. His work clusters around two questions: "What structure in inputs makes efficient computation possible?" and "Can we formulate a picture of efficient computation and demarcate its boundaries based on the presence and absence of such structures?"
His research is generously supported by an NSF Career Award (2021-2026) on "The Nature of Average-Case Computation" and an award from the Google Research Scholar Program for Efficient Algorithms for Robust Machine Learning.