Nikhil Srivastava

Nikhil is an associate 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 in 2015. He is currently interested in spectral graph theory, random matrices, the geometry of polynomials, mathematical physics, and numerical analysis. He runs a seminar on Discrete Analysis in Evans Hall on Fridays which is attended by both Math and CS graduate students, which all interested Simons visitors are welcome to visit. He is a co-winner of the SIAM Polya Prize, the NAS Held Prize, and the AMS Foias Prize.

Program Visits

Complexity and Linear Algebra, Fall 2025, Visiting Scientist and Program Organizer

Sublinear Algorithms, Summer 2024, Visiting Scientist

Geometric Methods in Optimization and Sampling, Fall 2021, Visiting Scientist

Summer Cluster in Quantum Computation, Summer 2021, Visiting Scientist

Probability, Geometry, and Computation in High Dimensions, Fall 2020, Visiting Scientist

Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion, Summer 2019, Visiting Scientist

Geometry of Polynomials, Spring 2019, Visiting Scientist

Lower Bounds in Computational Complexity, Fall 2018, Visiting Scientist

Foundations of Data Science, Fall 2018, Visiting Scientist

Summer Cluster: Challenges in Quantum Computation, Summer 2018, 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