Known for Kadison-Singer problem | Name Nikhil Srivastava | |
 | ||
Thesis Spectral Sparsification and Restricted Invertibility (2010) Fields Computer Science, Mathematics | ||
Notable awards Polya Prize (2014) | ||
Tcs talk nikhil srivastava 2013 10 23
Nikhil Srivastava has been an assistant professor of Mathematics at University of California, Berkeley since 2015. In July 2014, he was named a recipient of the Pólya Prize with Adam Marcus and Daniel Spielman.
Contents
- Tcs talk nikhil srivastava 2013 10 23
- Rmit 2014 prof nikhil srivastava microsoft research bangalore
- Education
- Awards
- References
Rmit 2014 prof nikhil srivastava microsoft research bangalore
Education
Nikhil Srivastava attended Union College in Schenectady, New York, graduating summa cum laude with a bachelor of science degree in mathematics and computer Science in 2005. He received a PhD in computer science from Yale University in 2010 (his dissertation was called "Spectral Sparsification and Restricted Invertibility").
Awards
In 2013, together with Adam Marcus and Daniel Spielman, he provided a positive solution to the Kadison–Singer problem, a result that was awarded the 2014 Pólya Prize.
He gave an invited lecture at the International Congress of Mathematicians in 2014.