Daniel M. Kane
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Computational Mechanics top 10%
- Statistics and Probability top 5%
- Co-authors
- Jelani NelsonIlias DiakonikolasDavid P. WoodruffAlistair StewartPaul ValiantMihir BellareJoseph JaegerRaghu Meka
- Topics
- Machine Learning and Algorithms (30 papers)Complexity and Algorithms in Graphs (22 papers)Sparse and Compressive Sensing Techniques (10 papers)
- Cited by
- Computational MathematicsComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Partner nations
- United StatesUnited KingdomCanada
In The Last Decade
Daniel M. Kane
77 papers receiving 761 citations
Peers
Comparison fields: 5 of 77
- Artificial Intelligence 460
- Computational Theory and Mathematics 271
- Computer Networks and Communications 145
- Computational Mechanics 125
- Statistics and Probability 110
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-authorship network of co-authors of Daniel M. Kane
This figure shows the co-authorship network connecting the top 25 collaborators of Daniel M. Kane. A scholar is included among the top collaborators of Daniel M. Kane 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 Daniel M. Kane. Daniel M. Kane is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 1 | |
| 4 | The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model. | 1 |
| 5 | Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks | 1 |
| 6 | The Optimal Approximation Factor in Density Estimation. | 0 |
| 7 | Private Testing of Distributions via Sample Permutations | 3 |
| 8 | Sever: A Robust Meta-Algorithm for Stochastic Optimization | 17 |
| 9 | Robust Learning of Fixed-Structure Bayesian Networks | 7 |
| 10 | Testing Identity of Multidimensional Histograms | 1 |
| 11 | 4 | |
| 12 | 2 | |
| 13 | On Communication Complexity of Classification Problems | 1 |
| 14 | Labeling the complete bipartite graph with no zero cycles | 1 |
| 15 | 1 | |
| 16 | 5 | |
| 17 | A Short Implicant of CNFs with Relatively Many Satisfying Assignments. | 0 |
| 18 | Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching | 4 |
| 19 | 11 | |
| 20 | 5 |
About Daniel M. Kane
Daniel M. Kane is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory and Computational Theory and Mathematics, having authored 89 papers that have together received 841 indexed citations. Recurring topics across this work include Machine Learning and Algorithms (30 papers), Complexity and Algorithms in Graphs (22 papers) and Sparse and Compressive Sensing Techniques (10 papers). The work is most often cited by research in Computational Mathematics (18 citations), Computational Theory and Mathematics (271 citations) and Discrete Mathematics and Combinatorics (51 citations). Daniel M. Kane has collaborated with scholars based in United States, United Kingdom and Canada. Frequent co-authors include Jelani Nelson, Ilias Diakonikolas, David P. Woodruff, Alistair Stewart, Paul Valiant, Mihir Bellare, Joseph Jaeger, Raghu Meka, Ely Porat and Ryan Williams. Their work appears in journals such as Journal of Fluid Mechanics, Communications of the ACM and Journal of the ACM.
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.