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 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 • 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
Journal Article A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream • IEEE Transactions on Knowledge and Data Engineering • 28(6):1356-1368 Chung Y-Y, Tirthapura S, Woodruff DP
Preprint Learning-Augmented Sketching Offers Improved Performance for Privacy Preserving and Secure GWAS 2024.09.19.613975 Xu J, Zhu K, Cai J, Kockan C, Dokmai N, Cho H, Woodruff DP, Sahinalp SC
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
Journal Article True Randomness from Big Data • Scientific Reports • 6(1):33740 Papakonstantinou PA, Woodruff DP, Yang G
