Jonathan A. Kelner
Impact in
- Computational Mathematics top 5%
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 20
- Advanced Graph Theory Research 10
- Topological and Geometric Data Analysis 4
-
- Algorithms and Data Compression 4
- Co-authors
- Vivek K Goyal (3 shared papers)Jelena Kovačević (3 shared papers)Daniel A. Spielman (4 shared papers)Lorenzo Orecchia (3 shared papers)Aleksander Mądry (2 shared papers)Zeyuan Allen Zhu (3 shared papers)Aaron Sidford (5 shared papers)Evdokia Nikolova (3 shared papers)
- Journals
- SIAM Journal on Computing (2 papers)ACM SIGPLAN Notices (1 paper)Applied and Computational Harmonic Analysis (1 paper)Theory of Computing Systems (1 paper)Geometric and Functional Analysis (1 paper)
- Partner nations
- United StatesIsraelGermany
In The Last Decade
Jonathan A. Kelner
39 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 100
- Computational Mathematics 37
- Computational Theory and Mathematics 540
- Applied Mathematics 215
- Signal Processing 228
- Computer Vision and Pattern Recognition 347
Countries citing papers authored by Jonathan A. Kelner
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
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-authors
The 25 scholars most cited alongside Jonathan A. Kelner, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 332 | |
| 2 | 2011 | 142 | |
| 3 | 2009 | 128 | |
| 4 | 2006 | 112 | |
| 5 | 2013 | 80 | |
| 6 | 2013 | 76 | |
| 7 | 2009 | 68 | |
| 8 | 2009 | 55 | |
| 9 | 2006 | 51 | |
| 10 | 2015 | 51 | |
| 11 | 2012 | 50 | |
| 12 | 2002 | 46 | |
| 13 | 2012 | 44 | |
| 14 | 1998 | 43 | |
| 15 | 2012 | 35 | |
| 16 | 2012 | 31 | |
| 17 | 2009 | 31 | |
| 18 | 2014 | 30 | |
| 19 | 2017 | 30 | |
| 20 | 2014 | 26 |
About Jonathan A. Kelner
Jonathan A. Kelner is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Geometry and Topology and Electrical and Electronic Engineering, having authored 39 papers that have together received 1.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (20 papers), Optimization and Search Problems (10 papers), Advanced Graph Theory Research (10 papers), Graph theory and applications (5 papers), Markov Chains and Monte Carlo Methods (5 papers), Algorithms and Data Compression (4 papers), Sparse and Compressive Sensing Techniques (4 papers) and Topological and Geometric Data Analysis (4 papers). The work is most often cited by research in Computational Mathematics (37 citations), Computational Theory and Mathematics (540 citations), Applied Mathematics (215 citations), Signal Processing (228 citations) and Computer Vision and Pattern Recognition (347 citations). Jonathan A. Kelner has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include Vivek K Goyal, Jelena Kovačević, Daniel A. Spielman, Lorenzo Orecchia, Aleksander Mądry, Zeyuan Allen Zhu, Aaron Sidford, Evdokia Nikolova, Shang‐Hua Teng and Paul F. Christiano. Their work appears in journals such as SIAM Journal on Computing, ACM SIGPLAN Notices, Applied and Computational Harmonic Analysis, Theory of Computing Systems and Geometric and Functional Analysis.
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.