 | 2012 |
| 30 |  | Daniel M. Kane,
Jelani Nelson:
Sparser Johnson-Lindenstrauss transforms.
SODA 2012: 1195-1206 |
| 29 |  | Daniel M. Kane:
A Structure Theorem for Poorly
CoRR abs/1204.0543: (2012) |
| 2011 |
| 28 |  | Daniel M. Kane,
Raghu Meka,
Jelani Nelson:
Almost Optimal Explicit Johnson-Lindenstrauss Families.
APPROX-RANDOM 2011: 628-639 |
| 27 |  | Daniel M. Kane:
A Small PRG for Polynomial Threshold Functions of Gaussians.
FOCS 2011: 257-266 |
| 26 |  | Daniel M. Kane:
k-Independent Gaussians Fool Polynomial Threshold Functions.
IEEE Conference on Computational Complexity 2011: 252-261 |
| 25 |  | Daniel M. Kane,
Jelani Nelson,
Ely Porat,
David P. Woodruff:
Fast moment estimation in data streams in optimal space.
STOC 2011: 745-754 |
| 24 |  | Daniel M. Kane:
A Small PRG for Polynomial Threshold Functions of Gaussians
CoRR abs/1104.1209: (2011) |
| 23 |  | Daniel M. Kane:
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions.
Computational Complexity 20(2): 389-412 (2011) |
| 22 |  | Daniel M. Kane,
Samuel A. Kutin:
Quantum interpolation of polynomials.
Quantum Information & Computation 11(1&2): 95-103 (2011) |
| 2010 |
| 21 |  | Ilias Diakonikolas,
Daniel M. Kane,
Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions.
FOCS 2010: 11-20 |
| 20 |  | Daniel M. Kane:
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions.
IEEE Conference on Computational Complexity 2010: 205-210 |
| 19 |  | Daniel M. Kane,
Jelani Nelson,
David P. Woodruff:
An optimal algorithm for the distinct elements problem.
PODS 2010: 41-52 |
| 18 |  | Daniel M. Kane,
Jelani Nelson,
David P. Woodruff:
On the Exact Space Complexity of Sketching and Streaming Small Norms.
SODA 2010: 1161-1178 |
| 17 |  | Daniel M. Kane,
Jelani Nelson:
A Derandomized Sparse Johnson-Lindenstrauss Transform
CoRR abs/1006.3585: (2010) |
| 16 |  | Daniel M. Kane,
Jelani Nelson,
Ely Porat,
David P. Woodruff:
Fast Moment Estimation in Data Streams in Optimal Space
CoRR abs/1007.4191: (2010) |
| 15 |  | Daniel M. Kane:
Unary Subset-Sum is in Logspace
CoRR abs/1012.1336: (2010) |
| 14 |  | Daniel M. Kane,
Jelani Nelson:
A Sparser Johnson-Lindenstrauss Transform
CoRR abs/1012.1577: (2010) |
| 13 |  | Daniel M. Kane:
k-Independent Gaussians Fool Polynomial Threshold Functions
CoRR abs/1012.1614: (2010) |
| 12 |  | Daniel M. Kane,
Jelani Nelson:
A Derandomized Sparse Johnson-Lindenstrauss Transform.
Electronic Colloquium on Computational Complexity (ECCC) 17: 98 (2010) |
| 2009 |
| 11 |  | Erik D. Demaine,
Dion Harmon,
John Iacono,
Daniel M. Kane,
Mihai Patrascu:
The geometry of binary search trees.
SODA 2009: 496-505 |
| 10 |  | Daniel M. Kane,
Gregory N. Price,
Erik D. Demaine:
A Pseudopolynomial Algorithm for Alexandrov's Theorem.
WADS 2009: 435-446 |
| 9 |  | Daniel M. Kane,
Samuel A. Kutin:
Quantum interpolation of polynomials
CoRR abs/0909.5683: (2009) |
| 8 |  | Ilias Diakonikolas,
Daniel M. Kane,
Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions
CoRR abs/0911.3389: (2009) |
| 7 |  | Daniel M. Kane:
The Gaussian Surface Area and Noise Sensitivity of Degree-$d$ Polynomials
CoRR abs/0912.2709: (2009) |
| 6 |  | Timothy 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.
Comput. Geom. 42(5): 419-428 (2009) |
| 5 |  | Ilias Diakonikolas,
Daniel M. Kane,
Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions.
Electronic Colloquium on Computational Complexity (ECCC) 16: 117 (2009) |
| 2008 |
| 4 |  | Daniel M. Kane,
Gregory N. Price,
Erik D. Demaine:
A Pseudopolynomial Algorithm for Alexandrov's Theorem
CoRR abs/0812.5030: (2008) |
| 3 |  | Daniel M. Kane,
Steven Sivek:
On the Sn-Modules Generated by Partitions of a Given Shape.
Electr. J. Comb. 15(1): (2008) |
| 2005 |
| 2 |  | 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: 61-64 |
| 1 |  | Timothy G. Abbott,
Daniel M. Kane,
Paul Valiant:
On the Complexity of Two-PlayerWin-Lose Games.
FOCS 2005: 113-122 |