Nikhil Srivastava
5th year PhD student
Theory Group
Computer Science Department
Yale University

Room 203, 51 Prospect St, New Haven CT 06520.
first dot last at university dot edu

I am interested in spectral graph theory. My advisor is Prof. Dan Spielman.

CV [PDF]
Papers [DBLP]

  1. Tight Bounds on Plurality (with A. Taylor), IPL 96 (2005), 93-95. [PDF]
  2. On the Longest Path Algorithm for Reconstructing Trees from Distance Matrices (with L. Reyzin), IPL 101 (2007), 98-100. [PDF]
  3. Learning and Verifying Graphs Using Queries, with a Focus on Edge Counting (with L. Reyzin), ALT 2007. [PDF] [slides]
  4. Graph Sparsification by Effective Resistances (with D. Spielman), STOC 2008. Invited to SICOMP. [arXiv] [slides]
  5. Twice-Ramanujan Sparsifiers (with J. Batson and D. Spielman), STOC 2009. Invited to SICOMP. [arXiv] [slides]
  6. An Elementary Proof of the Restricted Invertibility Theorem (with D. Spielman), manuscript, 2009. [arXiv]