2009 |
27 | EE | David P. Woodruff:
The average-case complexity of counting distinct elements.
ICDT 2009: 284-295 |
26 | EE | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-closure spanners.
SODA 2009: 932-941 |
25 | EE | Jelani Nelson,
David P. Woodruff:
A Near-Optimal Algorithm for L1-Difference
CoRR abs/0904.2027: (2009) |
2008 |
24 | EE | David P. Woodruff:
Corruption and Recovery-Efficient Locally Decodable Codes.
APPROX-RANDOM 2008: 584-595 |
23 | EE | Alexandre V. Evfimievski,
Ronald Fagin,
David P. Woodruff:
Epistemic privacy.
PODS 2008: 171-180 |
22 | EE | Arnab Bhattacharyya,
Elena Grigorescu,
Kyomin Jung,
Sofya Raskhodnikova,
David P. Woodruff:
Transitive-Closure Spanners
CoRR abs/0808.1787: (2008) |
21 | EE | Jelani Nelson,
David P. Woodruff:
Revisiting Norm Estimation in Data Streams
CoRR abs/0811.3648: (2008) |
2007 |
20 | EE | David P. Woodruff:
Revisiting the Efficiency of Malicious Two-Party Computation.
EUROCRYPT 2007: 79-96 |
19 | EE | Xiaoming Sun,
David P. Woodruff:
The communication and streaming complexity of computing the longest common and increasing subsequences.
SODA 2007: 336-345 |
18 | EE | David P. Woodruff:
New Lower Bounds for General Locally Decodable Codes.
Electronic Colloquium on Computational Complexity (ECCC) 14(006): (2007) |
17 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval.
SIAM J. Comput. 37(4): 1046-1056 (2007) |
2006 |
16 | EE | David P. Woodruff:
Better Approximations for the Minimum Common Integer Partition Problem.
APPROX-RANDOM 2006: 248-259 |
15 | EE | Zulfikar Ramzan,
David P. Woodruff:
Fast Algorithms for the Free Riders Problem in Broadcast Encryption.
CRYPTO 2006: 308-325 |
14 | EE | Craig Gentry,
Zulfikar Ramzan,
David P. Woodruff:
Explicit Exclusive Set Systems with Applications to Broadcast Encryption.
FOCS 2006: 27-38 |
13 | EE | David P. Woodruff:
Lower Bounds for Additive Spanners, Emulators, and More.
FOCS 2006: 389-398 |
12 | EE | Piotr Indyk,
David P. Woodruff:
Polylogarithmic Private Approximations and Efficient Matching.
TCC 2006: 245-264 |
2005 |
11 | EE | Marten van Dijk,
Robert Granger,
Dan Page,
Karl Rubin,
Alice Silverberg,
Martijn Stam,
David P. Woodruff:
Practical Cryptography in High Dimensional Tori.
EUROCRYPT 2005: 234-250 |
10 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval.
IEEE Conference on Computational Complexity 2005: 275-284 |
9 | EE | Piotr Indyk,
David P. Woodruff:
Optimal approximations of the frequency moments of data streams.
STOC 2005: 202-208 |
8 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval
Electronic Colloquium on Computational Complexity (ECCC)(009): (2005) |
7 | EE | Piotr Indyk,
David P. Woodruff:
Polylogarithmic Private Approximations and Efficient Matching
Electronic Colloquium on Computational Complexity (ECCC)(117): (2005) |
2004 |
6 | EE | David P. Woodruff,
Jessica Staddon:
Private inference control.
ACM Conference on Computer and Communications Security 2004: 188-197 |
5 | EE | Marten van Dijk,
David P. Woodruff:
Asymptotically Optimal Communication for Torus-Based Cryptography.
CRYPTO 2004: 157-178 |
4 | EE | Hanson Zhou,
David P. Woodruff:
Clustering via Matrix Powering.
PODS 2004: 136-142 |
3 | EE | David P. Woodruff:
Optimal space lower bounds for all frequency moments.
SODA 2004: 167-175 |
2003 |
2 | EE | Piotr Indyk,
David P. Woodruff:
Tight Lower Bounds for the Distinct Elements Problem.
FOCS 2003: 283- |
2002 |
1 | EE | David P. Woodruff,
Marten van Dijk:
Cryptography in an Unbounded Computational Model.
EUROCRYPT 2002: 149-164 |