views: 108

# Daniel M. Kane

Assistant Professor

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Sign in to view more

Education

Sign in to view more

Bio

Mathematics, theoretical computer science, combinatorics, number theory, derandomization, Boolean functions
Kane has diverse research interests within mathematics and theoretical computer science, particularly in the areas of combinatorics, number theory, derandomization and Boolean functions. He has published papers on topics such as algorithms for big data, results on writing numbers as sums of primes and the structure of polynomials in many variables. He has won best paper or best student paper awards in the Conference on Computational Complexity, Foundations of Computer Science and the symposium on Principles of Database Systems. He also has experience as an instructor at Stanford and Harvard University and has helped train students for various mathematics contests, including as an instructor at the United States Math Olympiad Summer Program. He will split his teaching responsibilities between the departments of computer science and mathematics. He expects to teach classes on discrete mathematics, combinatorics, algorithms and number theory, and teach graduate courses on topics in these areas in addition to various areas of complexity theory such as the analysis of Boolean functions.
Capsule Bio:
Daniel Kane graduated from the Harvard University mathematics department in 2011. His thesis work covered a number of topic areas in number theory and theoretical computer science. After completing a three-year postdoc in the mathematics department at Stanford University with the support of an NSF postdoctoral research fellowship, he will begin his appointment as an assistant professor with a joint appointment in Mathematics and CSE at UCSD.

## Papers136 papers

Sort

By YearBy Citation

IEEE Transactions on Information Theory, no. 5 (2020): 3132-3170

COLT, (2019): 318-341

arXiv: Number Theory, no. 6 (2019): 1-16

NeurIPS, pp.10877-10888, (2019)

Cited by

**1**EIBibtexITCS, (2019)

NeurIPS, pp.10688-10699, (2019)

Cited by

**1**EIBibtexNeurIPS, pp.10473-10484, (2019)

Cited by

**1**EIBibtexIlgweon Kang, Fang Qiao, Dongwon Park,Daniel Kane,Evangeline F. Y. Young,Chung-Kuan Cheng,Ronald L. Graham

ACM Trans. Design Autom. Electr. Syst., no. 1 (2019)

COLT, (2019): 1070-1106

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (2019): 804-815

COLT, (2019): 1107-1131

Journal of the ACM, no. 3 (2019): 1-18

SIAM Journal on Computing, no. 2 (2019): 742-864

Proceedings of the Steklov Institute of Mathematics, no. 1 (2019): 105-108

COLT, (2019): 1449-1469

STOC, (2018)

STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 20..., (2018): 1047-1060

SODA '18: Symposium on Discrete Algorithms
New Orleans
Louisiana
January, 2018, (2018): 2683-2702

STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 20..., pp.554-563, (2018)

international conference on machine learning, (2018)

STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 20..., pp.735-748, (2018)

EIBibtex

Journal of Geometry and Physics, (2018): 49-74

Cited by

**2**BibtexSTOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 20..., (2018): 1061-1073

neural information processing systems, pp.10304-10316, (2018)

arXiv: Data Structures and Algorithms, (2018)

Electronic Colloquium on Computational Complexity (ECCC), (2018)

arXiv: Combinatorics, (2017)

Bibtex

Annals of Probability, no. 3 (2017): 1612-1679

Cited by

**2**BibtexFOCS, pp.73-84, (2017)

STOC, (2017)

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Electronic Colloquium on Computational Complexity (ECCC), (2017): 177

Electronic Colloquium on Computational Complexity (ECCC), (2017)

FOCS, (2017): 391-402

Electronic Colloquium on Computational Complexity (ECCC), (2017)

COLT, (2017): 711-727

COLT, (2017)

ICALP, (2017)

Electronic Colloquium on Computational Complexity (ECCC), (2017): 355-366

ICML, (2017): 999-1008

Electr. J. Comb., no. 2 (2017)

SIAM Journal on Computing, no. 4 (2017): 252-259

conference on learning theory, (2016)

Algorithmica, no. 4 (2016): 1203-1223

3DIC, pp.1-5, (2016)

STOC, (2016): 1060-1073

STOC '16: Symposium on Theory of Computing
Cambridge
MA
USA
June, 2016, pp.633-643, (2016)

CoRR, (2016)

FOCS, (2016): 741-750

IACR Cryptology ePrint Archive, (2016)

arXiv: Data Structures and Algorithms, (2016)

FOCS, (2016): 655-664

Electronic Colloquium on Computational Complexity (ECCC), (2016): 685-694

International Mathematics Research Notices, (2015)

IEEE Symposium on Foundations of Computer Science, (2015)

ACM Conference on Computer and Communications Security, (2015)

Conference on Computational Complexity, (2015): 567-581

Transactions of the American Mathematical Society, (2015)

CoRR, (2015)

Advances in Applied Mathematics, no. C (2015): 92-105

conference on learning theory, (2015)

IEEE Symposium on Foundations of Computer Science, (2015): 1183-1202

IEEE Conference on Computational Complexity, (2014): 217-228

STOC, no. 1 (2014): 437-440

CoRR, (2014)

no. 1 (2014): 2

COLT, pp.522-545, (2013)

Theory of Computing, (2013): 587-592

symposium on the theory of computing, (2013): 1-10

Electronic Colloquium on Computational Complexity (ECCC), (2013): 176

Journal of the ACM, pp.1195-1206, (2012)

ICALP (2), pp.598-609, (2012)

FOCS, pp.91-100, (2012)

APPROX-RANDOM, pp.435-446, (2012)

Quantum Information & Computation, no. 1 (2011): 95-103

APPROX-RANDOM, pp.628-639, (2011)

Journal of Number Theory, (2011): 32-43

Clinical Orthopaedics and Related Research, (2011): 252-261

On elliptic curves, the abc conjecture, and polynomial threshold functions, (2011)

Cited by

**5**EIBibtexClinical Orthopaedics and Related Research, (2011): 257-266

Computational Complexity - Selected papers from the 25th Annual IEEE Conference on Computational Com..., no. 2 (2011): 205-210

Clinical Orthopaedics and Related Research, (2011): 745-754

Canadian Mathematical Bulletin, pp.551-561, (2010)

Cited by

**4**BibtexView All