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 99 of 99  
    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
    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, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Robust Estimators in High Dimensions without the Computational Intractability.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Learning Multivariate Log-concave Distributions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Daniel M. Kane, R. Ryan Williams.
    Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    The fourier transform of poisson multinomial distributions and its algorithmic applications.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Journal article
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Robust Learning of Fixed-Structure Bayesian Networks.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Efficient Robust Proper Learning of Log-concave Distributions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables.
    Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016 2016 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Properly Learning Poisson Binomial Distributions in Almost Polynomial Time.
    Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016 2016 (0) 2016
    Journal article
    Xue Chen, Daniel M. Kane, Eric Price, Zhao Song.
    Fourier-sparse interpolation without a frequency gap.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li 0001, Ankur Moitra, Alistair Stewart.
    Robust Estimators in High Dimensions without the Computational Intractability.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Xue Chen, Daniel M. Kane, Eric Price, Zhao Song.
    Fourier-Sparse Interpolation without a Frequency Gap.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Testing Bayesian Networks.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane.
    A New Approach for Testing Properties of Discrete Distributions.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane.
    A New Approach for Testing Properties of Discrete Distributions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane.
    A New Approach for Testing Properties of Discrete Distributions.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Testing Identity of Structured Distributions.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Daniel M. Kane.
    A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting.
    30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA 2015 (0) 2015
    Journal article
    Parikshit Gopalan, Daniel M. Kane, Raghu Meka.
    Pseudorandomness via the discrete Fourier transform.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Daniel M. Kane, R. Ryan Williams.
    Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart.
    Properly Learning Poisson Binomial Distributions in Almost Polynomial Time.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Daniel M. Kane, R. Ryan Williams.
    Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.
    IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 2015 (0) 2015
    Journal article
    Daniel M. Kane, Jelani Nelson.
    Sparser Johnson-Lindenstrauss Transforms.
    J. ACM 2014, Volume 61 (0) 2014
    Conference paper
    Daniel M. Kane.
    A Polylogarithmic PRG for Degree $2$ Threshold Functions in the Gaussian Setting.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Daniel M. Kane.
    The correct exponent for the Gotsman-Linial Conjecture.
    Computational Complexity 2014, Volume 23 (0) 2014
    Conference paper
    Daniel M. Kane.
    The average sensitivity of an intersection of half spaces.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Daniel M. Kane.
    A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length.
    IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 2014 (0) 2014
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin.
    Testing Identity of Structured Distributions.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Daniel M. Kane, Osamu Watanabe 0001.
    A Short Implicant of a CNF Formula with Many Satisfying Assignments.
    Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings 2014 (0) 2014
    Journal article
    Parikshit Gopalan, Daniel M. Kane, Raghu Meka.
    Pseudorandomness for concentration bounds and signed majorities.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Daniel M. Kane, Raghu Meka.
    A PRG for lipschitz functions of polynomials with applications to sparsest cut.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Journal article
    Daniel M. Kane.
    The Average Sensitivity of an Intersection of Half Spaces.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Daniel M. Kane, Adam R. Klivans, Raghu Meka.
    Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching.
    COLT 2013 - The 26th Annual Conference on Learning Theory, June 12-14, 2013, Princeton University, NJ, USA 2013 (0) 2013
    Conference paper
    Daniel M. Kane, Osamu Watanabe 0001.
    A Short Implicant of CNFs with Relatively Many Satisfying Assignments.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Conference paper
    Daniel M. Kane.
    The Correct Exponent for the Gotsman-Linial Conjecture.
    Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013 2013 (0) 2013
    Conference paper
    Daniel M. Kane.
    A Monotone Function Given By a Low-Depth Decision Tree That Is Not an Approximate Junta.
    Theory of Computing 2013, Volume 9 (0) 2013
    Conference paper
    Eric Blais, Daniel M. Kane.
    Tight Bounds for Testing k-Linearity.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Daniel M. Kane.
    A Structure Theorem for Poorly
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Daniel M. Kane.
    A Low-Depth Monotone Function that is not an Approximate Junta
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Daniel M. Kane.
    A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Daniel M. Kane.
    The Correct Exponent for the Gotsman-Linial Conjecture
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Daniel M. Kane, Raghu Meka.
    A PRG for Lipschitz Functions of Polynomials with Applications to Sparsest Cut
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Daniel M. Kane, Jelani Nelson.
    Sparser Johnson-Lindenstrauss transforms.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Daniel M. Kane.
    A Structure Theorem for Poorly Anticoncentrated Gaussian Chaoses and Applications to the Study of Polynomial Threshold Functions.
    53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012 (0) 2012
    Conference paper
    Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun 0001.
    Counting Arbitrary Subgraphs in Data Streams.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II 2012 (0) 2012
    Journal article
    Daniel M. Kane.
    A Small PRG for Polynomial Threshold Functions of Gaussians
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff.
    Fast moment estimation in data streams in optimal space.
    Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011 (0) 2011
    Conference paper
    Daniel M. Kane.
    The Gaussian Surface Area and Noise Sensitivity of Degree-
    Computational Complexity 2011, Volume 20 (0) 2011
    Conference paper
    Daniel M. Kane.
    k-Independent Gaussians Fool Polynomial Threshold Functions.
    Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011 2011 (0) 2011
    Conference paper
    Daniel M. Kane, Raghu Meka, Jelani Nelson.
    Almost Optimal Explicit Johnson-Lindenstrauss Families.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Daniel M. Kane, Samuel A. Kutin.
    Quantum interpolation of polynomials.
    Quantum Information Computation 2011, Volume 11 (0) 2011
    Conference paper
    Daniel M. Kane.
    A Small PRG for Polynomial Threshold Functions of Gaussians.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Daniel M. Kane, Jelani Nelson, David P. Woodruff.
    An optimal algorithm for the distinct elements problem.
    Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA 2010 (0) 2010
    Journal article
    Daniel M. Kane, Jelani Nelson.
    A Derandomized Sparse Johnson-Lindenstrauss Transform
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff.
    Fast Moment Estimation in Data Streams in Optimal Space
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Daniel M. Kane.
    The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions.
    Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010 2010 (0) 2010
    Conference paper
    Daniel M. Kane, Jelani Nelson, David P. Woodruff.
    On the Exact Space Complexity of Sketching and Streaming Small Norms.
    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 (0) 2010
    Journal article
    Daniel M. Kane, Jelani Nelson.
    A Derandomized Sparse Johnson-Lindenstrauss Transform.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson.
    Bounded Independence Fools Degree-2 Threshold Functions.
    51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA 2010 (0) 2010
    Journal article
    Daniel M. Kane.
    Unary Subset-Sum is in Logspace
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Daniel M. Kane, Jelani Nelson.
    A Sparser Johnson-Lindenstrauss Transform
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Daniel M. Kane.
    k-Independent Gaussians Fool Polynomial Threshold Functions
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson.
    Bounded Independence Fools Degree-2 Threshold Functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Conference paper
    Daniel M. Kane, Gregory N. Price, Erik D. Demaine.
    A Pseudopolynomial Algorithm for Alexandrov's Theorem.
    Computational Geometry, 08.03. - 13.03.2009 2009 (0) 2009
    Conference paper
    Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu.
    The geometry of binary search trees.
    Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 2009 (0) 2009
    Conference paper
    Daniel M. Kane, Gregory N. Price, Erik D. Demaine.
    A Pseudopolynomial Algorithm for Alexandrov's Theorem.
    Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Daniel M. Kane, Samuel A. Kutin.
    Quantum interpolation of polynomials
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson.
    Bounded Independence Fools Degree-2 Threshold Functions
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Daniel M. Kane.
    The Gaussian Surface Area and Noise Sensitivity of Degree-$d$ Polynomials
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung.
    Dynamic ham-sandwich cuts in the plane.
    Comput. Geom. 2009, Volume 42 (0) 2009
    Journal article
    Daniel M. Kane, Steven Sivek.
    On the S
    Electr. J. Comb. 2008, Volume 15 (0) 2008
    Conference paper
    Daniel M. Kane, Gregory N. Price, Erik D. Demaine.
    A Pseudopolynomial Algorithm for Alexandrov's Theorem
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung.
    Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
    CCCG 2005 (0) 2005
    Conference paper
    Timothy G. Abbott, Daniel M. Kane, Paul Valiant.
    On the Complexity of Two-PlayerWin-Lose Games.
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings 2005 (0) 2005
    Show item 1 to 99 of 99  

    Your query returned 99 matches in the database.