Conference Sublinear time orthogonal tensor decomposition 2016 • Advances in Neural Information Processing Systems • 793-801 Song Z, Woodruff DP, Zhang H
Journal Article The fast Cauchy transform and faster robust linear regression 2016 • SIAM journal on computing (Print) • 45(3):763-810 Clarkson KL, Drineas P, Magdon-Ismail M, Mahoney MW, Meng X, Woodruff DP
Conference Tight bounds for sketching the operator norm, schatten norms, and subspace embeddings 2016 • Leibniz International Proceedings in Informatics • 60: Li Y, Woodruff DP
Journal Article True Randomness from Big Data 2016 • Scientific Reports • 6: Papakonstantinou PA, Woodruff DP, Yang G
Conference Weighted low rank approximations with provable guarantees 2016 • Annual ACM Symposium on Theory of Computing • 19-21-June-2016:250-263 Razenshteyn I, Song Z, Woodruff DP
Journal Article A General Method for Estimating Correlated Aggregates Over a Data Stream 2015 • Algorithmica • 73(2):235-260 Tirthapura S, Woodruff DP
Conference Amplification of one-way information complexity via codes and noise sensitivity 2015 • Lecture Notes in Computer Science • 9134:960-972 Molinaro M, Woodruff DP, Yaroslavtsev G
Preprint Beating CountSketch for Heavy Hitters in Insertion Streams 2015 Braverman V, Chestnut SR, Ivkin N, Woodruff DP
Preprint Communication Efficient Distributed Kernel Principal Component Analysis 2015 Balcan M-F, Liang Y, Song L, Woodruff D, Xie B
Preprint Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality 2015 Braverman M, Garg A, Ma T, Nguyen HL, Woodruff DP
Conference Input Sparsity and Hardness for Robust Subspace Approximation 2015 • Annual Symposium on Foundations of Computer Science • 2015-December:310-329 Clarkson KL, Woodruff DP
Preprint Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching 2015 Backurs A, Indyk P, Price E, Razenshteyn I, Woodruff DP
Preprint On Sketching Quadratic Forms 2015 Andoni A, Chen J, Krauthgamer R, Qin B, Woodruff DP, Zhang Q
Preprint Optimal Principal Component Analysis in Distributed and Streaming Models 2015 Boutsidis C, Woodruff DP, Zhong P
Conference Sketching for M-estimators: A unified approach to robust regression 2015 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2015-January(January):921-939 Clarkson KL, Woodruff DP
Conference The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication 2015 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 31:199-212 Van Gucht D, Williams R, Woodruff DP, Zhang Q
Conference The simultaneous communication of disjointness with applications to data streams 2015 • Lecture Notes in Computer Science • 9134:1082-1093 Weinstein O, Woodruff DP
Conference Tight bounds for graph problems in insertion streams 2015 • Leibniz International Proceedings in Informatics • 40:435-448 Sun X, Woodruff DP
Conference An optimal lower bound for distinct elements in the message passing model 2014 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 718-733 Woodruff DP, Zhang Q
Conference Beyond set disjointness: The communication complexity of finding the intersection 2014 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 106-113 Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G
Conference Certifying equality with limited interaction 2014 • Leibniz International Proceedings in Informatics • 28:545-581 Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G
Preprint Improved Distributed Principal Component Analysis 2014 Balcan M-F, Kanchanapally V, Liang Y, Woodruff D
Conference Improved Distributed Principal Component Analysis 2014 • Advances in Neural Information Processing Systems • 27: Balcan M-F, Kanchanapally V, Liang Y, Woodruff D
Conference Improved testing of low rank matrices 2014 • Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining • 691-700 Li Y, Wang Z, Woodruff DP
Conference Is min-wise hashing optimal for summarizing set intersection? 2014 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 109-120 Pagh R, Stöckel M, Woodruff DP
