Daniel M. Kane
Impact in
- Computational Mathematics top 5%
-
- Complexity and Algorithms in Graphs
Papers in
-
- Machine Learning and Algorithms 30
- Algorithms and Data Compression 11
- Cryptography and Data Security 8
- Coding theory and cryptography 5
-
- Complexity and Algorithms in Graphs 23
- Co-authors
- Jelani Nelson (8 shared papers)Ilias Diakonikolas (22 shared papers)David P. Woodruff (3 shared papers)Alistair Stewart (11 shared papers)Paul Valiant (1 shared paper)Joseph Jaeger (1 shared paper)Raghu Meka (3 shared papers)Ely Porat (1 shared paper)
- Journals
- Research in the Mathematical Sciences (2 papers)The Electronic Journal of Combinatorics (2 papers)Computational Complexity (2 papers)SIAM Journal on Computing (2 papers)The Annals of Probability (1 paper)
- Partner nations
- United StatesUnited KingdomHong Kong
In The Last Decade
Daniel M. Kane
76 papers receiving 782 citations
Peers
Comparison fields: 5 of 77
- Computational Mathematics 18
- Computational Theory and Mathematics 278
- Discrete Mathematics and Combinatorics 51
- Artificial Intelligence 480
- Statistics and Probability 112
Countries citing papers authored by Daniel M. Kane
This map shows the geographic impact of Daniel M. Kane'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 Daniel M. Kane with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel M. Kane more than expected).
Fields of papers citing papers by Daniel M. Kane
This network shows the impact of papers produced by Daniel M. Kane. 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 Daniel M. Kane. The network helps show where Daniel M. Kane may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel M. Kane, 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 90 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 146 | |
| 2 | 2014 | 102 | |
| 3 | Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016) | 2016 | 61 |
| 4 | 2010 | 43 | |
| 5 | 2005 | 42 | |
| 6 | 2017 | 36 | |
| 7 | 2011 | 34 | |
| 8 | 2015 | 27 | |
| 9 | 2010 | 22 | |
| 10 | 2023 | 19 | |
| 11 | 2008 | 17 | |
| 12 | Sever: A Robust Meta-Algorithm for Stochastic Optimization | 2018 | 17 |
| 13 | 2010 | 17 | |
| 14 | 2011 | 17 | |
| 15 | 2016 | 15 | |
| 16 | 2011 | 14 | |
| 17 | 2012 | 13 | |
| 18 | 2014 | 12 | |
| 19 | 2012 | 11 | |
| 20 | 2018 | 11 |
About Daniel M. Kane
Daniel M. Kane is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computational Mechanics, Discrete Mathematics and Combinatorics and Statistics and Probability, having authored 90 papers that have together received 863 indexed citations. Recurring topics across this work include Machine Learning and Algorithms (30 papers), Complexity and Algorithms in Graphs (23 papers), Algorithms and Data Compression (11 papers), Sparse and Compressive Sensing Techniques (10 papers), Cryptography and Data Security (8 papers), Analytic Number Theory Research (7 papers), Spatial Cognition and Navigation (6 papers) and Coding theory and cryptography (5 papers). The work is most often cited by research in Computational Mathematics (18 citations), Computational Theory and Mathematics (278 citations), Discrete Mathematics and Combinatorics (51 citations), Artificial Intelligence (480 citations) and Statistics and Probability (112 citations). Daniel M. Kane has collaborated with scholars based in United States, United Kingdom and Hong Kong. Frequent co-authors include Jelani Nelson, Ilias Diakonikolas, David P. Woodruff, Alistair Stewart, Paul Valiant, Joseph Jaeger, Raghu Meka, Ely Porat, Mihir Bellare and Ryan Williams. Their work appears in journals such as Research in the Mathematical Sciences, The Electronic Journal of Combinatorics, Computational Complexity, SIAM Journal on Computing and The Annals of Probability.
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.