Search the dblp DataBase

Publications of Author

1. David P. Woodruff
   Better Approximations for the Minimum Common Integer Partition Problem. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2006, pp:248-259 [Conf]
   
2. David P. Woodruff, Jessica Staddon
   Private inference control. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Computer and Communications Security, 2004, pp:188-197 [Conf]
   
3. David P. Woodruff, Sergey Yekhanin
   A Geometric Approach to Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2005, pp:275-284 [Conf]
   
4. Marten van Dijk, David P. Woodruff
   Asymptotically Optimal Communication for Torus-Based Cryptography. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2004, pp:157-178 [Conf]
   
5. Zulfikar Ramzan, David P. Woodruff
   Fast Algorithms for the Free Riders Problem in Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2006, pp:308-325 [Conf]
   
6. Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff
   Practical Cryptography in High Dimensional Tori. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2005, pp:234-250 [Conf]
   
7. David P. Woodruff, Marten van Dijk
   Cryptography in an Unbounded Computational Model. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2002, pp:149-164 [Conf]
   
8. Piotr Indyk, David P. Woodruff
   Tight Lower Bounds for the Distinct Elements Problem. [Citation Graph (0, 0)][DBLP]
   FOCS, 2003, pp:283-0 [Conf]
   
9. Craig Gentry, Zulfikar Ramzan, David P. Woodruff
   Explicit Exclusive Set Systems with Applications to Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:27-38 [Conf]
   
10. David P. Woodruff
    Lower Bounds for Additive Spanners, Emulators, and More. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:389-398 [Conf]
    
11. Hanson Zhou, David P. Woodruff
    Clustering via Matrix Powering. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:136-142 [Conf]
    
12. David P. Woodruff
    Optimal space lower bounds for all frequency moments. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:167-175 [Conf]
    
13. Piotr Indyk, David P. Woodruff
    Optimal approximations of the frequency moments of data streams. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:202-208 [Conf]
    
14. Piotr Indyk, David P. Woodruff
    Polylogarithmic Private Approximations and Efficient Matching. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:245-264 [Conf]
    
15. David P. Woodruff, Sergey Yekhanin
    A Geometric Approach to Information-Theoretic Private Information Retrieval [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:009, pp:- [Journal]
    
16. Piotr Indyk, David P. Woodruff
    Polylogarithmic Private Approximations and Efficient Matching [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:117, pp:- [Journal]
    
17. David P. Woodruff
    Revisiting the Efficiency of Malicious Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:79-96 [Conf]
    
18. Xiaoming Sun, David P. Woodruff
    The communication and streaming complexity of computing the longest common and increasing subsequences. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:336-345 [Conf]
    
19. David P. Woodruff, Sergey Yekhanin
    A Geometric Approach to Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:4, pp:1046-1056 [Journal]
    
20. 
    Corruption and Recovery-Efficient Locally Decodable Codes. [Citation Graph (, )][DBLP]
    
    
21. 
    Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. [Citation Graph (, )][DBLP]
    
    
22. 
    A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. [Citation Graph (, )][DBLP]
    
    
23. 
    Efficient Sketches for Earth-Mover Distance, with Applications. [Citation Graph (, )][DBLP]
    
    
24. 
    The Data Stream Space Complexity of Cascaded Norms. [Citation Graph (, )][DBLP]
    
    
25. 
    Additive Spanners in Nearly Quadratic Time. [Citation Graph (, )][DBLP]
    
    
26. 
    The average-case complexity of counting distinct elements. [Citation Graph (, )][DBLP]
    
    
27. 
    An optimal algorithm for the distinct elements problem. [Citation Graph (, )][DBLP]
    
    
28. 
    Epistemic privacy. [Citation Graph (, )][DBLP]
    
    
29. 
    Fast Manhattan sketches in data streams. [Citation Graph (, )][DBLP]
    
    
30. 
    Transitive-closure spanners. [Citation Graph (, )][DBLP]
    
    
31. 
    Coresets and Sketches for High Dimensional Subspace Approximation Problems. [Citation Graph (, )][DBLP]
    
    
32. 
    On the Exact Space Complexity of Sketching and Streaming Small Norms. [Citation Graph (, )][DBLP]
    
    
33. 
    1-Pass Relative-Error L_p-Sampling with Applications. [Citation Graph (, )][DBLP]
    
    
34. 
    Lower Bounds for Sparse Recovery. [Citation Graph (, )][DBLP]
    
    
35. 
    Numerical linear algebra in the streaming model. [Citation Graph (, )][DBLP]
    
    
36. 
    Transitive-Closure Spanners [Citation Graph (, )][DBLP]
    
    
37. 
    Revisiting Norm Estimation in Data Streams [Citation Graph (, )][DBLP]
    
    
38. 
    A Near-Optimal Algorithm for L1-Difference [Citation Graph (, )][DBLP]
    
    
39. 
    Fast Moment Estimation in Data Streams in Optimal Space [Citation Graph (, )][DBLP]
    
    
40. 
    New Lower Bounds for General Locally Decodable Codes. [Citation Graph (, )][DBLP]