Countries citing papers authored by Daniel M. Kane
Since
Specialization
Citations
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).
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.
Diakonikolas, Ilias, et al.. (2021). The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model.. eScholarship (California Digital Library). 1552–1584.1 indexed citations
5.
Diakonikolas, Ilias, et al.. (2020). Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks. eScholarship (California Digital Library). 1514–1539.1 indexed citations
6.
Bousquet, Olivier, Daniel M. Kane, & Shay Moran. (2019). The Optimal Approximation Factor in Density Estimation.. eScholarship (California Digital Library). 318–341.
7.
Diakonikolas, Ilias, et al.. (2019). Private Testing of Distributions via Sample Permutations. DSpace@MIT (Massachusetts Institute of Technology). 32. 10877–10888.3 indexed citations
8.
Diakonikolas, Ilias, Gautam Kamath, Daniel M. Kane, et al.. (2018). Sever: A Robust Meta-Algorithm for Stochastic Optimization. eScholarship (California Digital Library). 1596–1606.17 indexed citations
9.
Cheng, Yu, Ilias Diakonikolas, Daniel M. Kane, & Alistair Stewart. (2018). Robust Learning of Fixed-Structure Bayesian Networks. eScholarship (California Digital Library). 31. 10283–10295.7 indexed citations
10.
Diakonikolas, Ilias, Daniel M. Kane, & John Peebles. (2018). Testing Identity of Multidimensional Histograms. eScholarship (California Digital Library). 1107–1131.1 indexed citations
Kane, Daniel M., Roi Livni, Shay Moran, & Amir Yehudayoff. (2017). On Communication Complexity of Classification Problems. eScholarship (California Digital Library). 24. 177–1943.1 indexed citations
14.
Kane, Daniel M., et al.. (2017). Labeling the complete bipartite graph with no zero cycles. arXiv (Cornell University). 24. 33.1 indexed citations
Kane, Daniel M. & Osamu Watanabe. (2013). A Short Implicant of CNFs with Relatively Many Satisfying Assignments.. Electronic colloquium on computational complexity. 20. 176.
18.
Kane, Daniel M., Adam R. Klivans, & Raghu Meka. (2013). Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching. Conference on Learning Theory. 522–545.4 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.