Nikhil is an assistant professor in the mathematics department at UC Berkeley. He received his PhD in computer science from Yale in 2010, advised by Daniel Spielman, and his BS from Union College in 2005. After postdocs at the IAS, Princeton, and MSRI, he spent two-and-a-half years as a researcher at Microsoft Research India, before coming to Berkeley. He is currently interested in algorithms, spectral graph theory, random matrices, and the geometry of polynomials.
- Geometry of Polynomials, Spring 2019. Visiting Scientist, Program Organizer and Workshop Organizer.
- Foundations of Data Science, Fall 2018. Visiting Scientist.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Scientist.
- Challenges in Quantum Computation, Summer 2018. Visiting Scientist.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist.
- Pseudorandomness, Spring 2017. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist.
- Theoretical Foundations of Big Data Analysis, Fall 2013. Research Fellow.