Nikhil Srivastava
3rd year PhD student
Computer Science Department
Yale University

Room 203, 51 Prospect St, New Haven CT 06520.

I am interested in spectral graph theory. My advisor is Prof. Dan Spielman.
This summer I am at Microsoft Research, India, being advised by Ravi Kannan.

CV [PDF]
Papers [DBLP]

1. Tight Bounds on Plurality (with Alan Taylor), IPL 96 (2005), 93-95. [PDF]
2. On the Longest Path Algorithm for Reconstructing Trees from Distance Matrices (with Lev Reyzin), IPL 101 (2007), 98-100. [PDF]
3. Learning and Verifying Graphs Using Queries, with a Focus on Edge Counting (with Lev Reyzin), ALT 2007. [PDF] [slides]
4. Graph Sparsification by Effective Resistances (with Daniel Spielman), STOC 2008. [arXiv] [slides]