NEWS
Free Institutional Consultancy Services
New Feature: Compare Your Institution with the Previous Year
Find a Professional: Explore Experts Across 197 Disciplines in 220 Countries!
Find a Professional
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
login
Login
person_add
Register
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
Compare & Choose
local_fire_department
Country Reports
person
Find a Professional
Nikhil Srivastava
University of California Berkeley - Berkeley / United States
Engineering & Technology / Computer Science
AD Scientific Index ID: 1737892
Registration, Add Profile,
Premium Membership
Print Your Certificate
Ranking &
Analysis
Job
Experiences (0)
Education
Information (0)
Published Books (0)
Book Chapters (0)
Articles (0)
Presentations (0)
Lessons (0)
Projects (0)
Subject Leaders
Editorship, Referee &
Scientific Board (0 )
Patents /
Designs (0)
Academic Grants
& Awards (0)
Artistic
Activities (0)
Certificate / Course
/ Trainings (0)
Association &
Society Memberships (0)
Contact, Office
& Social Media
person_outline
Nikhil Srivastava's MOST POPULAR ARTICLES
1-)
Graph sparsification by effective resistancesDA Spielman, N SrivastavaProceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 20089382008
2-)
Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problemAW Marcus, DA Spielman, N SrivastavaAnnals of Mathematics, 327-350, 20154492015
3-)
Twice-ramanujan sparsifiersJD Batson, DA Spielman, N SrivastavaProceedings of the forty-first annual ACM symposium on Theory of computing …, 20094312009
4-)
Interlacing families I: Bipartite Ramanujan graphs of all degreesA Marcus, DA Spielman, N Srivastava2013 IEEE 54th Annual Symposium on Foundations of computer science, 529-537, 20134782013
5-)
Spectral sparsification of graphs: theory and algorithmsJ Batson, DA Spielman, N Srivastava, SH TengCommunications of the ACM 56 (8), 87-94, 20132592013
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept