The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Daniel M. Kane" ( http://dblp.L3S.de/Authors/Daniel_M._Kane )

  Author page on DBLP  Author page in RDF  Community of Daniel M. Kane in ASPL-2

Publication years (Num. hits)
2005-2010 (21) 2011-2012 (9)
Publication types (Num. hits)
article(17) inproceedings(13)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 30 publication records. Showing 30 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Daniel M. Kane A Structure Theorem for Poorly Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson Sparser Johnson-Lindenstrauss transforms. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel M. Kane, Samuel A. Kutin Quantum interpolation of polynomials. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel M. Kane The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. Search on Bibsonomy Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane A Small PRG for Polynomial Threshold Functions of Gaussians Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel M. Kane, Raghu Meka, Jelani Nelson Almost Optimal Explicit Johnson-Lindenstrauss Families. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane A Small PRG for Polynomial Threshold Functions of Gaussians. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane k-Independent Gaussians Fool Polynomial Threshold Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff Fast moment estimation in data streams in optimal space. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson A Derandomized Sparse Johnson-Lindenstrauss Transform. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane Unary Subset-Sum is in Logspace Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane k-Independent Gaussians Fool Polynomial Threshold Functions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff Fast Moment Estimation in Data Streams in Optimal Space Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson A Sparser Johnson-Lindenstrauss Transform Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson A Derandomized Sparse Johnson-Lindenstrauss Transform Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson, David P. Woodruff On the Exact Space Complexity of Sketching and Streaming Small Norms. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson Bounded Independence Fools Degree-2 Threshold Functions. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Jelani Nelson, David P. Woodruff An optimal algorithm for the distinct elements problem. Search on Bibsonomy PODS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF distinct elements, data mining, streaming, query optimization
1Daniel M. Kane The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson Bounded Independence Fools Degree-2 Threshold Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson Bounded Independence Fools Degree-2 Threshold Functions Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Daniel M. Kane The Gaussian Surface Area and Noise Sensitivity of Degree-$d$ Polynomials Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Daniel M. Kane, Samuel A. Kutin Quantum interpolation of polynomials Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Timothy G. Abbott, Michael 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. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu The geometry of binary search trees. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Gregory N. Price, Erik D. Demaine A Pseudopolynomial Algorithm for Alexandrov's Theorem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Steven Sivek On the Sn-Modules Generated by Partitions of a Given Shape. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
1Daniel M. Kane, Gregory N. Price, Erik D. Demaine A Pseudopolynomial Algorithm for Alexandrov's Theorem Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Timothy 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. Search on Bibsonomy CCCG The full citation details ... 2005 DBLP  BibTeX  RDF
1Timothy G. Abbott, Daniel M. Kane, Paul Valiant On the Complexity of Two-PlayerWin-Lose Games. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #30 of 30 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.