Conference Efficient Sketches for Earth-Mover Distance, with Applications 2009 • Annual Symposium on Foundations of Computer Science • 324-330 Andoni A, Ba KD, Indyk P, Woodruff D
Conference Numerical linear algebra in the streaming model 2009 • Annual ACM Symposium on Theory of Computing • 205-214 Clarkson KL, Woodruff DP
Conference The Data Stream Space Complexity of Cascaded Norms 2009 • Annual Symposium on Foundations of Computer Science • 765-774 Jayram TS, Woodruff DP
Conference Transitive-Closure Spanners 2009 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 932-941 Bhattacharyya A, Grigorescu E, Jung K, Raskhodnikova S, Woodruff DP
Conference Corruption and Recovery-Efficient Locally Decodable Codes 2008 • Lecture Notes in Computer Science • 5171:584-595 Woodruff D
Conference Epistemic privacy 2008 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 171-180 Evfimievski A, Fagin R, Woodruff DP
Preprint Transitive-Closure Spanners 2008 Bhattacharyya A, Grigorescu E, Jung K, Raskhodnikova S, Woodruff DP
Journal Article A Geometric Approach to Information-Theoretic Private Information Retrieval 2007 • SIAM journal on computing (Print) • 37(4):1046-1056 Woodruff D, Yekhanin S
Chapter Revisiting the Efficiency of Malicious Two-Party Computation 2007 • Lecture Notes in Computer Science • 4515:79-96 Woodruff DP
Conference The communication and streaming complexity of computing the longest common and increasing subsequences 2007 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 07-09-January-2007:336-345 Sun X, Woodruff DP
Conference Better Approximations for the Minimum Common Integer Partition Problem 2006 • Lecture Notes in Computer Science • 4110:248-259 Woodruff DP
Conference Explicit Exclusive Set Systems with Applications to Broadcast Encryption 2006 • Annual Symposium on Foundations of Computer Science • 27-38 Gentry C, Ramzan Z, Woodruff DP
Chapter Fast Algorithms for the Free Riders Problem in Broadcast Encryption 2006 • Lecture Notes in Computer Science • 4117:308-325 Ramzan Z, Woodruff DP
Conference Lower Bounds for Additive Spanners, Emulators, and More 2006 • Annual Symposium on Foundations of Computer Science • 389-398 Woodruff DP
Conference Polylogarithmic Private Approximations and Efficient Matching 2006 • Lecture Notes in Computer Science • 3876:245-264 Indyk P, Woodruff D
Conference A Geometric Approach to Information-Theoretic Private Information Retrieval 2005 • Proceedings of the Annual IEEE Conference on Computational Complexity • 275-284 Woodruff D, Yekhanin S
Conference Optimal approximations of the frequency moments of data streams 2005 • Annual ACM Symposium on Theory of Computing • 202-208 Indyk P, Woodruff D
Conference Practical Cryptography in High Dimensional Tori 2005 • Lecture Notes in Computer Science • 3494:234-250 van Dijk M, Granger R, Page D, Rubin K, Silverberg A, Stam M, Woodruff D
Chapter Asymptotically Optimal Communication for Torus-Based Cryptography 2004 • Lecture Notes in Computer Science • 3152:157-178 van Dijk M, Woodruff D
Conference Clustering via matrix powering 2004 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 136-142 Zhou H, Woodruff D
Conference Optimal Space Lower Bounds for all Frequency Moments 2004 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 15:160-168 Woodruff D
Conference Private inference control 2004 • Proceedings of the ACM Conference on Computer and Communications Security • 188-197 Woodruff D, Staddon J
