Jonathan A. Kelner

3.0k total citations
37 papers, 1.4k citations indexed

About

Jonathan A. Kelner is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Jonathan A. Kelner has authored 37 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Jonathan A. Kelner's work include Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Jonathan A. Kelner is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Jonathan A. Kelner collaborates with scholars based in United States, Israel and Canada. Jonathan A. Kelner's co-authors include Vivek K Goyal, Jelena Kovačević, Daniel A. Spielman, Zeyuan Allen Zhu, Aleksander Mądry, Lorenzo Orecchia, Aaron Sidford, Shang‐Hua Teng, David Steurer and Boaz Barak and has published in prestigious journals such as IEEE Transactions on Information Theory, Communications of the ACM and American Journal of Physics.

In The Last Decade

Jonathan A. Kelner

37 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jonathan A. Kelner United States 21 418 370 311 238 197 37 1.4k
Uwe Helmke Germany 24 604 1.4× 408 1.1× 165 0.5× 420 1.8× 153 0.8× 147 2.4k
Stéphane Boucheron France 12 159 0.4× 785 2.1× 207 0.7× 192 0.8× 123 0.6× 22 1.7k
Yuri Rabinovich Israel 14 631 1.5× 265 0.7× 172 0.6× 325 1.4× 71 0.4× 38 1.2k
Zlatko Drmač Croatia 16 515 1.2× 247 0.7× 103 0.3× 144 0.6× 92 0.5× 41 1.1k
Mark Rudelson United States 20 236 0.6× 455 1.2× 290 0.9× 169 0.7× 452 2.3× 46 2.3k
Nikhil Srivastava United States 13 415 1.0× 355 1.0× 143 0.5× 187 0.8× 148 0.8× 34 1.1k
M. Shub United States 18 974 2.3× 581 1.6× 307 1.0× 158 0.7× 123 0.6× 35 2.1k
Paul C. Shields United States 20 504 1.2× 869 2.3× 211 0.7× 256 1.1× 68 0.3× 70 1.9k
Ömer Eğecioǧlu United States 18 271 0.6× 289 0.8× 122 0.4× 256 1.1× 39 0.2× 111 1.1k
John L. Gustafson United States 18 479 1.1× 298 0.8× 194 0.6× 930 3.9× 78 0.4× 79 2.2k

Countries citing papers authored by Jonathan A. Kelner

Since Specialization
Citations

This map shows the geographic impact of Jonathan A. Kelner'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 Jonathan A. Kelner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jonathan A. Kelner more than expected).

Fields of papers citing papers by Jonathan A. Kelner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jonathan A. Kelner. 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 Jonathan A. Kelner. The network helps show where Jonathan A. Kelner may publish in the future.

Co-authorship network of co-authors of Jonathan A. Kelner

This figure shows the co-authorship network connecting the top 25 collaborators of Jonathan A. Kelner. A scholar is included among the top collaborators of Jonathan A. Kelner 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 Jonathan A. Kelner. Jonathan A. Kelner 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.
Cohen, Michael B., Jonathan A. Kelner, John Peebles, et al.. (2017). Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. DSpace@MIT (Massachusetts Institute of Technology). 410–419. 23 indexed citations
2.
Peng, Richard, Aaron Sidford, Michael B. Cohen, et al.. (2016). Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. DSpace@MIT (Massachusetts Institute of Technology). 21 indexed citations
3.
Barak, Boaz, Jonathan A. Kelner, & David Steurer. (2015). Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. 143–151. 47 indexed citations
4.
Kelner, Jonathan A., Yin Tat Lee, Lorenzo Orecchia, & Aaron Sidford. (2014). An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. arXiv (Cornell University). 217–226. 22 indexed citations
5.
Kelner, Jonathan A., Yin Tat Lee, Lorenzo Orecchia, & Aaron Sidford. (2013). An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. DSpace@MIT (Massachusetts Institute of Technology). 217–226. 55 indexed citations
6.
Anandkumar, Animashree, Avinatan Hassidim, & Jonathan A. Kelner. (2012). Topology discovery of sparse random graphs with few participants. Random Structures and Algorithms. 43(1). 16–48. 2 indexed citations
7.
Kelner, Jonathan A. & A. Levin. (2012). Spectral Sparsification in the Semi-streaming Setting. Theory of Computing Systems. 53(2). 243–262. 27 indexed citations
8.
Zhu, Zeyuan Allen, Saša Misailovíc, Jonathan A. Kelner, & Martin Rinard. (2012). Randomized accuracy-aware program transformations for efficient approximate computations. 441–454. 41 indexed citations
9.
Kelner, Jonathan A., Gary L. Miller, & Richard Peng. (2012). Faster approximate multicommodity flow using quadratically coupled flows. 1–18. 17 indexed citations
10.
Kelner, Jonathan A. & A. Levin. (2011). Spectral Sparsification in the Semi-Streaming Setting. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 9. 440–451. 10 indexed citations
11.
Kelner, Jonathan A. & Petar Maymounkov. (2010). Electric routing and concurrent flow cutting. Theoretical Computer Science. 412(32). 4123–4135. 8 indexed citations
12.
Kelner, Jonathan A., James R. Lee, Gregory N. Price, & Shang‐Hua Teng. (2009). Higher Eigenvalues of Graphs. 735–744. 6 indexed citations
13.
Lun, Desmond S., Graham N. Rockwell, Nicholas J. Guido, et al.. (2009). Large‐scale identification of genetic design strategies using local search. Molecular Systems Biology. 5(1). 296–296. 118 indexed citations
14.
Kelner, Jonathan A. & Evdokia Nikolova. (2007). On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. 472–482. 7 indexed citations
15.
Kelner, Jonathan A. & Evdokia Nikolova. (2007). On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. 2 indexed citations
16.
Kelner, Jonathan A.. (2006). Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus. SIAM Journal on Computing. 35(4). 882–902. 24 indexed citations
17.
Kelner, Jonathan A. & Daniel A. Spielman. (2005). A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version). Electronic colloquium on computational complexity. 2 indexed citations
18.
Goyal, Vivek K, Jonathan A. Kelner, & Jelena Kovačević. (2002). Multiple description vector quantization with a coarse lattice. IEEE Transactions on Information Theory. 48(3). 781–788. 44 indexed citations
19.
Goyal, Vivek K, Jelena Kovačević, & Jonathan A. Kelner. (2001). Quantized Frame Expansions with Erasures. Applied and Computational Harmonic Analysis. 10(3). 203–233. 309 indexed citations
20.
Allen, Philip B. & Jonathan A. Kelner. (1998). Evolution of a vibrational wave packet on a disordered chain. American Journal of Physics. 66(6). 497–506. 42 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

Breakdown of academic impact, for papers by Uwe Helmke Breakdown of academic impact, for papers by Stéphane Boucheron Breakdown of academic impact, for papers by Yuri Rabinovich Breakdown of academic impact, for papers by Zlatko Drmač Breakdown of academic impact, for papers by Mark Rudelson Breakdown of academic impact, for papers by Nikhil Srivastava Breakdown of academic impact, for papers by M. Shub Breakdown of academic impact, for papers by Paul C. Shields Breakdown of academic impact, for papers by Ömer Eğecioǧlu Breakdown of academic impact, for papers by John L. Gustafson
Rankless by CCL
2026