Chapter Revisiting the efficiency of malicious two-party computation 2007 • Lecture Notes in Computer Science • 4515 LNCS: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 LNCS:248-259 Woodruff DP
Conference Explicit exclusive set systems with applications to broadcast encryption 2006 • Annual Symposium on Foundations of Computer Science • 27-36 Gentry C, Ramzan Z, Woodruff DP
Chapter Fast algorithms for the free riders problem in broadcast encryption 2006 • Lecture Notes in Computer Science • 4117 LNCS: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 LNCS:245-264 Indykl 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 • 23: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
Conference Tight lower bounds for the distinct elements problem 2003 • Annual Symposium on Foundations of Computer Science • 283-288 Indyk P, Woodruff D
Conference Tight lower bounds for the distinct elements problem 2003 • Annual Symposium on Foundations of Computer Science • 2003-January:283-288 Indyk P, Woodruff D
Conference Cryptography in an unbounded computational model 2002 • Lecture Notes in Computer Science • 2332:149-164 Woodruff DP, Van Dijk M
Preprint A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World 2022.04.21.489052 Chowdhury A, Bose A, Zhou S, Woodruff DP, Drineas P
Preprint Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave 468355 Kockan C, Zhu K, Dokmai N, Karpov N, Kulekci MO, Woodruff DP, Sahinalp SC
