Daniel M. Kane
Affiliations: | 2011 | Harvard University, Cambridge, MA, United States |
Google:
"Daniel Kane"Parents
Sign in to add mentor| Barry C. Mazur | grad student | 2011 | Harvard | |
| (On Elliptic Curves, the ABC Conjecture, and Polynomial Threshold Functions.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Kane DM, Lovett S, Moran S. (2019) Near-optimal Linear Decision Trees for k-SUM and Related Problems Journal of the Acm. 66: 1-18 |
| Kane DM, Rhoades RC. (2019) A Proof Of Andrews’ Conjecture On Partitions With No Short Sequences Forum of Mathematics, Sigma. 7 |
| Kane DM, Sanna C, Shallit JO. (2019) Waring’s Theorem for Binary Powers Combinatorica. 39: 1335-1350 |
| Kane DM, Palmer J, Pelayo Á. (2018) Classifying Toric and Semitoric Fans by Lifting Equations from SL2(Z) Symmetry Integrability and Geometry-Methods and Applications. 14: 16 |
| Kane DM, Palmer J, Pelayo Á. (2018) Minimal models of compact symplectic semitoric manifolds Journal of Geometry and Physics. 125: 49-74 |
| Kane D. (2017) A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions Annals of Probability. 45: 1612-1679 |
| Kane D, Watanabe O. (2016) A Short Implicant of a CNF Formula with Many Satisfying Assignments Algorithmica. 1-21 |
| Gopalan P, Kane D, Meka R. (2015) Pseudorandomness via the Discrete Fourier Transform Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 903-922 |
| Kane DM. (2015) Small designs for path-connected spaces and path-connected homogeneous spaces Transactions of the American Mathematical Society. 367: 6387-6414 |
| Chern B, Diaconis P, Kane DM, et al. (2015) Central limit theorems for some set partition statistics Advances in Applied Mathematics. 70: 92-105 |