Nikhil Srivastava

2.7k total citations
34 papers, 1.1k citations indexed

About

Nikhil Srivastava is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Numerical Analysis. According to data from OpenAlex, Nikhil Srivastava has authored 34 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 10 papers in Geometry and Topology and 9 papers in Numerical Analysis. Recurrent topics in Nikhil Srivastava's work include Graph theory and applications (10 papers), Fractional Differential Equations Solutions (9 papers) and Matrix Theory and Algorithms (8 papers). Nikhil Srivastava is often cited by papers focused on Graph theory and applications (10 papers), Fractional Differential Equations Solutions (9 papers) and Matrix Theory and Algorithms (8 papers). Nikhil Srivastava collaborates with scholars based in United States, India and Switzerland. Nikhil Srivastava's co-authors include Daniel A. Spielman, Joshua Batson, Adam W. Marcus, Vineet Kumar Singh, Shang‐Hua Teng, Yin Tat Lee, Satish Rao, Somveer Singh, Adam I. Marcus and Lev Reyzin and has published in prestigious journals such as Communications of the ACM, Communications in Mathematical Physics and Annals of Mathematics.

In The Last Decade

Nikhil Srivastava

31 papers receiving 1.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Nikhil Srivastava United States 13 415 355 187 180 169 34 1.1k
Jonathan A. Kelner United States 21 418 1.0× 370 1.0× 238 1.3× 172 1.0× 65 0.4× 37 1.4k
Alexander Barvinok United States 20 632 1.5× 289 0.8× 107 0.6× 168 0.9× 278 1.6× 63 1.5k
James R. Lee United States 17 668 1.6× 189 0.5× 254 1.4× 61 0.3× 169 1.0× 55 1.1k
Steven Roman United States 18 442 1.1× 309 0.9× 123 0.7× 65 0.4× 332 2.0× 41 2.0k
Josef Leydold Austria 17 303 0.7× 239 0.7× 116 0.6× 37 0.2× 195 1.2× 54 955
Van H. Vu United States 25 652 1.6× 296 0.8× 136 0.7× 50 0.3× 519 3.1× 70 1.7k
Assaf Naor United States 31 1.1k 2.7× 428 1.2× 352 1.9× 179 1.0× 608 3.6× 125 2.6k
Stéphane Boucheron France 12 159 0.4× 785 2.2× 192 1.0× 198 1.1× 59 0.3× 22 1.7k
Saugata Basu United States 15 1.3k 3.2× 352 1.0× 83 0.4× 387 2.1× 434 2.6× 76 1.9k
Harold R. Parks United States 12 294 0.7× 100 0.3× 59 0.3× 161 0.9× 260 1.5× 37 1.3k

Countries citing papers authored by Nikhil Srivastava

Since Specialization
Citations

This map shows the geographic impact of Nikhil Srivastava's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nikhil Srivastava with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nikhil Srivastava more than expected).

Fields of papers citing papers by Nikhil Srivastava

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nikhil Srivastava. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nikhil Srivastava. The network helps show where Nikhil Srivastava may publish in the future.

Co-authorship network of co-authors of Nikhil Srivastava

This figure shows the co-authorship network connecting the top 25 collaborators of Nikhil Srivastava. A scholar is included among the top collaborators of Nikhil Srivastava based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nikhil Srivastava. Nikhil Srivastava is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Srivastava, Nikhil, et al.. (2024). Computational Approach for Two-Dimensional Fractional Integro-Differential Equations. International Journal of Applied and Computational Mathematics. 10(5).
2.
Srivastava, Nikhil, et al.. (2024). Global Convergence of Hessenberg Shifted QR I: Exact Arithmetic. Foundations of Computational Mathematics. 25(5). 1561–1594.
3.
Ganguly, Shirshendu, et al.. (2023). Many Nodal Domains in Random Regular Graphs. Communications in Mathematical Physics. 401(2). 1291–1309.
4.
Srivastava, Nikhil, et al.. (2022). Computational algorithm for financial mathematical model based on European option. Mathematical sciences. 17(4). 467–490. 6 indexed citations
5.
Srivastava, Nikhil & Vineet Kumar Singh. (2022). L3 approximation of Caputo derivative and its application to time-fractional wave equation-(I). Mathematics and Computers in Simulation. 205. 532–557. 9 indexed citations
6.
Srivastava, Nikhil, et al.. (2022). Computational technique for multi-dimensional non-linear weakly singular fractional integro-differential equation. Chinese Journal of Physics. 80. 305–333. 5 indexed citations
7.
Rasmussen, Peter, et al.. (2021). Support of closed walks and second eigenvalue multiplicity of graphs. Research at the University of Copenhagen (University of Copenhagen). 396–407. 1 indexed citations
8.
Garg, Ankit, et al.. (2021). Scalar Poincaré implies matrix Poincaré. Electronic Communications in Probability. 26(none). 3 indexed citations
9.
Singh, Somveer, et al.. (2020). Wavelet approximation scheme for distributed order fractional differential equations. Computers & Mathematics with Applications. 80(8). 1985–2017. 26 indexed citations
10.
Marcus, Adam W., Daniel A. Spielman, & Nikhil Srivastava. (2018). Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. SIAM Journal on Computing. 47(6). 2488–2509. 9 indexed citations
11.
Garg, Ankit, Yin Tat Lee, Zhao Song, & Nikhil Srivastava. (2018). A matrix expander Chernoff bound. 1102–1114. 4 indexed citations
12.
Marcus, Adam W., Daniel A. Spielman, & Nikhil Srivastava. (2015). Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. 1358–1377. 10 indexed citations
13.
Marcus, Adam W., Daniel A. Spielman, & Nikhil Srivastava. (2015). Interlacing families II: Mixed characteristic polynomials and the Kadison--Singer problem. Annals of Mathematics. 327–350. 135 indexed citations
14.
Marcus, Adam W., Daniel A. Spielman, & Nikhil Srivastava. (2015). Interlacing families I: Bipartite Ramanujan graphs of all degrees. Annals of Mathematics. 307–325. 78 indexed citations
15.
Batson, Joshua, Daniel A. Spielman, & Nikhil Srivastava. (2014). Twice-Ramanujan Sparsifiers. SIAM Review. 56(2). 315–334. 33 indexed citations
16.
Batson, Joshua, Daniel A. Spielman, & Nikhil Srivastava. (2012). Twice-Ramanujan Sparsifiers. SIAM Journal on Computing. 41(6). 1704–1721. 101 indexed citations
17.
Hardt, Moritz, Nikhil Srivastava, & Madhur Tulsiani. (2012). Graph densification. 380–392. 5 indexed citations
18.
Spielman, Daniel A. & Nikhil Srivastava. (2011). Graph Sparsification by Effective Resistances. SIAM Journal on Computing. 40(6). 1913–1926. 248 indexed citations
19.
Reyzin, Lev & Nikhil Srivastava. (2006). On the longest path algorithm for reconstructing trees from distance matrices. Information Processing Letters. 101(3). 98–100. 8 indexed citations
20.
Srivastava, Nikhil & Alan D. Taylor. (2005). Tight bounds on plurality. Information Processing Letters. 96(3). 93–95. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026