| * | 2009 | |
|---|---|---|
| 7 | EE | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava: Twice-ramanujan sparsifiers. STOC 2009: 255-262 |
| 2008 | ||
| 6 | EE | Daniel A. Spielman, Nikhil Srivastava: Graph sparsification by effective resistances. STOC 2008: 563-568 |
| 5 | EE | Daniel A. Spielman, Nikhil Srivastava: Graph Sparsification by Effective Resistances CoRR abs/0803.0929: (2008) |
| 4 | EE | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava: Twice-Ramanujan Sparsifiers CoRR abs/0808.0163: (2008) |
| 2007 | ||
| 3 | EE | Lev Reyzin, Nikhil Srivastava: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT 2007: 285-297 |
| 2 | EE | Lev Reyzin, Nikhil Srivastava: On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett. 101(3): 98-100 (2007) |
| 2005 | ||
| 1 | EE | Nikhil Srivastava, Alan D. Taylor: Tight bounds on plurality. Inf. Process. Lett. 96(3): 93-95 (2005) |
| 1 | Joshua D. Batson | [4] [7] |
| 2 | Lev Reyzin | [2] [3] |
| 3 | Daniel A. Spielman | [4] [5] [6] [7] |
| 4 | Alan D. Taylor | [1] |