Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Gunjan Kumar
Barbara Aquilani
angelo bovino
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Bernhard Spinnler
Home
/
Author
/
NIKHIL SRIVASTAVA
Author Info
Open Visualization
Name
Affiliation
Papers
NIKHIL SRIVASTAVA
Institute for Advanced Study, Princeton, NJ
18
Collaborators
Citations
PageRank
30
262
16.09
Referers
Referees
References
468
208
138
Search Limit
100
468
Publications (18 rows)
Collaborators (30 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Exponential lower bounds on spectrahedral representations of hyperbolicity cones.
0
0.34
2019
A matrix expander Chernoff bound.
2
0.37
2018
Approximating the Largest Root and Applications to Interlacing Families.
0
0.34
2018
On Non-Localization Of Eigenvectors Of High Girth Graphs
0
0.34
2018
Localization of Electrical Flows.
0
0.34
2018
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes.
1
0.88
2018
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification.
2
0.45
2018
Real Stability Testing.
0
0.34
2017
Matrix Concentration for Expander Walks.
1
0.35
2017
Spectral sparsification of graphs: theory and algorithms
27
1.12
2013
A new approach to computing maximum flows using electrical flows
16
0.88
2013
Zero-one rounding of singular vectors
1
0.35
2012
Voting with rubber bands, weights, and strings.
3
0.55
2012
Graph densification
2
0.39
2012
Graph Sparsification by Effective Resistances
172
7.05
2011
On the longest path algorithm for reconstructing trees from distance matrices
8
0.61
2007
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
22
0.87
2007
Tight bounds on plurality
5
0.54
2005
1