| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Srikanta Tirthapura, David P. Woodruff |
Rectangle-efficient aggregation in spatial data streams.  |
PODS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff |
Space-efficient estimation of statistics over sub-sampled streams. |
PODS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Qin Zhang |
Tight bounds for distributed functional monitoring. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Price, David P. Woodruff |
(1+eps)-approximate Sparse Recovery |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, David P. Woodruff |
Fast approximation of matrix coherence and statistical leverage |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
Lower Bounds for Sparse Recovery |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff, Qin Zhang |
Tight Bounds for Distributed Functional Monitoring |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price, David P. Woodruff |
On the Power of Adaptivity in Sparse Recovery |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff |
Tolerant Algorithms. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, David P. Woodruff |
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanta Tirthapura, David P. Woodruff |
Optimal Random Sampling from Distributed Streams Revisited. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, David P. Woodruff |
Streaming Algorithms with One-Sided Estimation. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie |
The Complexity of Linear Dependence Problems in Vector Spaces. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Price, David P. Woodruff |
(1 + eps)-Approximate Sparse Recovery. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price, David P. Woodruff |
On the Power of Adaptivity in Sparse Recovery. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Sohler, David P. Woodruff |
Subspace embeddings for the L1-norm with applications. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff |
Fast moment estimation in data streams in optimal space. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
Near-optimal private approximation protocols via a black box transformation. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff |
Epistemic privacy. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
Steiner Transitive-Closure Spanners of d-Dimensional Posets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, Elad Hazan, David P. Woodruff |
Sublinear Optimization for Machine Learning |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff |
Fast Moment Estimation in Data Streams in Optimal Space |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Morteza Monemizadeh, David P. Woodruff |
1-Pass Relative-Error Lp-Sampling with Applications. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff |
Coresets and Sketches for High Dimensional Subspace Approximation Problems. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
On the Exact Space Complexity of Sketching and Streaming Small Norms. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
Lower Bounds for Sparse Recovery. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff |
Additive Spanners in Nearly Quadratic Time. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, Elad Hazan, David P. Woodruff |
Sublinear Optimization for Machine Learning. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jelani Nelson, David P. Woodruff |
Fast Manhattan sketches in data streams. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
data mining, clustering, streaming, sketching |
| 1 | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
An optimal algorithm for the distinct elements problem. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
distinct elements, data mining, streaming, query optimization |
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-Closure Spanners of the Hypercube and the Hypergrid. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jelani Nelson, David P. Woodruff |
A Near-Optimal Algorithm for L1-Difference |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff |
Frequency Moments. |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-closure spanners. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
The average-case complexity of counting distinct elements. |
ICDT |
2009 |
DBLP DOI BibTeX RDF |
distinct elements, data streams |
| 1 | T. S. Jayram, David P. Woodruff |
The Data Stream Space Complexity of Cascaded Norms. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff |
Efficient Sketches for Earth-Mover Distance, with Applications. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Earth-Mover Distance, streaming, embedding, sketching |
| 1 | Kenneth L. Clarkson, David P. Woodruff |
Numerical linear algebra in the streaming model. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
linear regression, low-rank approximation, matrix product |
| 1 | Jelani Nelson, David P. Woodruff |
Revisiting Norm Estimation in Data Streams |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-Closure Spanners |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff |
Corruption and Recovery-Efficient Locally Decodable Codes. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff |
Epistemic privacy. |
PODS |
2008 |
DBLP DOI BibTeX RDF |
positivstellensatz, privacy, auditing, query logs, disclosure, reasoning about knowledge, supermodularity |
| 1 | David P. Woodruff |
New Lower Bounds for General Locally Decodable Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff, Sergey Yekhanin |
A Geometric Approach to Information-Theoretic Private Information Retrieval. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, David P. Woodruff |
The communication and streaming complexity of computing the longest common and increasing subsequences. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
Revisiting the Efficiency of Malicious Two-Party Computation. |
EUROCRYPT |
2007 |
DBLP DOI BibTeX RDF |
malicious model, efficiency, expander graphs, secure function evaluation |
| 1 | Zulfikar Ramzan, David P. Woodruff |
Fast Algorithms for the Free Riders Problem in Broadcast Encryption. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff |
Revisiting the Efficiency of Malicious Two-Party Computation. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, David P. Woodruff |
Polylogarithmic Private Approximations and Efficient Matching. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zulfikar Ramzan, David P. Woodruff |
Fast Algorithms for the Free Riders Problem in Broadcast Encryption. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
Better Approximations for the Minimum Common Integer Partition Problem. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff |
Lower Bounds for Additive Spanners, Emulators, and More. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig Gentry, Zulfikar Ramzan, David P. Woodruff |
Explicit Exclusive Set Systems with Applications to Broadcast Encryption. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, David P. Woodruff |
Polylogarithmic Private Approximations and Efficient Matching |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff, Sergey Yekhanin |
A Geometric Approach to Information-Theoretic Private Information Retrieval |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff |
Practical Cryptography in High Dimensional Tori. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
torus-based cryptography, discrete-log based cryptography |
| 1 | David P. Woodruff, Sergey Yekhanin |
A Geometric Approach to Information-Theoretic Private Information Retrieval. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, David P. Woodruff |
Optimal approximations of the frequency moments of data streams. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
frequency moments, streaming algorithms |
| 1 | Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff |
Practical Cryptography in High Dimensional Tori. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff, Jessica Staddon |
Private Inference Control. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | David P. Woodruff |
Optimal space lower bounds for all frequency moments. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marten van Dijk, David P. Woodruff |
Asymptotically Optimal Communication for Torus-Based Cryptography. |
CRYPTO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanson Zhou, David P. Woodruff |
Clustering via Matrix Powering. (PDF / PS) |
PODS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Jessica Staddon |
Private inference control. |
ACM Conference on Computer and Communications Security |
2004 |
DBLP DOI BibTeX RDF |
oblivious transfer, private information retrieval, inference control |
| 1 | Piotr Indyk, David P. Woodruff |
Tight Lower Bounds for the Distinct Elements Problem. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Marten van Dijk |
Cryptography in an Unbounded Computational Model. |
EUROCRYPT |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")