Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Daniel M.
    Last name: Kane
    DBLP: 52/6817
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 107  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Robustly Learning a Gaussian: Getting Optimal Error, Efficiently.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Journal article
    Daniel M. Kane, Carlo Sanna, Jeffrey Shallit.
    Waring's Theorem for Binary Powers.
    CoRR 2018, Volume 0 (0) 2018
    Conference paper
    Daniel M. Kane, Shachar Lovett, Sankeerth Rao.
    Labeling the complete bipartite graph with no zero cycles.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Sankeerth Rao.
    Labeling the complete bipartite graph with no zero cycles.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A Polynomial Restriction Lemma with Applications.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Near-Optimal Closeness Testing of Discrete Histogram Distributions.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Being Robust (in High Dimensions) Can Be Practical.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Robustly Learning a Gaussian: Getting Optimal Error, Efficiently.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang.
    Active classification with comparison queries.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Shay Moran.
    Near-optimal linear decision trees for k-SUM and related problems.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Shay Moran.
    Near-optimal linear decision trees for k-SUM and related problems.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang.
    Active classification with comparison queries.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Valentine Kabanets, Daniel M. Kane, Zhenjian Lu.
    A polynomial restriction lemma with applications.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Near-Optimal Closeness Testing of Discrete Histogram Distributions.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Being Robust (in High Dimensions) Can Be Practical.
    Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017 2017 (0) 2017
    Conference paper
    Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Testing Bayesian Networks.
    Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017 2017 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Learning Multivariate Log-concave Distributions.
    Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017 2017 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Learning Geometric Concepts with Nasty Noise.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Daniel M. Kane, Sushrut Karmalkar, Eric Price.
    Robust polynomial regression up to the information theoretic limit.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Sharp Bounds for Generalized Uniformity Testing.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Daniel M. Kane, R. Ryan Williams.
    The Orthogonal Vectors Conjecture for Branching Programs and Formulas.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Sharp Bounds for Generalized Uniformity Testing.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures.
    58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017 2017 (0) 2017
    Conference paper
    Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang.
    Active Classification with Comparison Queries.
    58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017 2017 (0) 2017
    Conference paper
    Daniel M. Kane, Roi Livni, Shay Moran, Amir Yehudayoff.
    On Communication Complexity of Classification Problems.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Show item 1 to 25 of 107  

    Your query returned 107 matches in the database.