The SCEAS System
| |||||||

## Search the dblp DataBase
David P. Woodruff:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- David P. Woodruff
**Better Approximations for the Minimum Common Integer Partition Problem.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:248-259 [Conf] - 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] - 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] - Marten van Dijk, David P. Woodruff
**Asymptotically Optimal Communication for Torus-Based Cryptography.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:157-178 [Conf] - 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] - 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] - David P. Woodruff, Marten van Dijk
**Cryptography in an Unbounded Computational Model.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2002, pp:149-164 [Conf] - Piotr Indyk, David P. Woodruff
**Tight Lower Bounds for the Distinct Elements Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:283-0 [Conf] - 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] - David P. Woodruff
**Lower Bounds for Additive Spanners, Emulators, and More.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:389-398 [Conf] - Hanson Zhou, David P. Woodruff
**Clustering via Matrix Powering.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:136-142 [Conf] - David P. Woodruff
**Optimal space lower bounds for all frequency moments.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:167-175 [Conf] - 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] - Piotr Indyk, David P. Woodruff
**Polylogarithmic Private Approximations and Efficient Matching.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:245-264 [Conf] - 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] - 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] - David P. Woodruff
**Revisiting the Efficiency of Malicious Two-Party Computation.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2007, pp:79-96 [Conf] - 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] - 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] **Corruption and Recovery-Efficient Locally Decodable Codes.**[Citation Graph (, )][DBLP]**Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners.**[Citation Graph (, )][DBLP]**A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field.**[Citation Graph (, )][DBLP]**Efficient Sketches for Earth-Mover Distance, with Applications.**[Citation Graph (, )][DBLP]**The Data Stream Space Complexity of Cascaded Norms.**[Citation Graph (, )][DBLP]**Additive Spanners in Nearly Quadratic Time.**[Citation Graph (, )][DBLP]**The average-case complexity of counting distinct elements.**[Citation Graph (, )][DBLP]**An optimal algorithm for the distinct elements problem.**[Citation Graph (, )][DBLP]**Epistemic privacy.**[Citation Graph (, )][DBLP]**Fast Manhattan sketches in data streams.**[Citation Graph (, )][DBLP]**Transitive-closure spanners.**[Citation Graph (, )][DBLP]**Coresets and Sketches for High Dimensional Subspace Approximation Problems.**[Citation Graph (, )][DBLP]**On the Exact Space Complexity of Sketching and Streaming Small Norms.**[Citation Graph (, )][DBLP]**1-Pass Relative-Error L**[Citation Graph (, )][DBLP]_{p}-Sampling with Applications.**Lower Bounds for Sparse Recovery.**[Citation Graph (, )][DBLP]**Numerical linear algebra in the streaming model.**[Citation Graph (, )][DBLP]**Transitive-Closure Spanners**[Citation Graph (, )][DBLP]**Revisiting Norm Estimation in Data Streams**[Citation Graph (, )][DBLP]**A Near-Optimal Algorithm for L1-Difference**[Citation Graph (, )][DBLP]**Fast Moment Estimation in Data Streams in Optimal Space**[Citation Graph (, )][DBLP]**New Lower Bounds for General Locally Decodable Codes.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |