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 10 of 95  
    Select a publication
    Show Title Venue Rating Date
    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
    Show item 1 to 10 of 95  

    Your query returned 95 matches in the database.