Preprint Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order 2016 Braverman V, Chestnut SR, Krauthgamer R, Li Y, Woodruff DP, Yang LF
Conference Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching 2016 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1:318-337 Backurs A, Indyk P, Razenshteyn I, Woodruff DP
Conference New algorithms for heavy hitters in data streams 2016 • Leibniz International Proceedings in Informatics • 48: Woodruff DP
Conference New characterizations in turnstile streams with applications 2016 • Leibniz International Proceedings in Informatics • 50:20:1-20:22 Ai Y, Hu W, Li Y, Woodruff DP
Conference On approximating functions of the singular values in a stream 2016 • Annual ACM Symposium on Theory of Computing • 726-739 Li Y, Woodruff DP
Conference On Sketching Quadratic Forms 2016 311-319 Andoni A, Chen J, Krauthgamer R, Qin B, Woodruff DP, Zhang Q
Conference Optimal approximate matrix product in terms of stable rank 2016 • Leibniz International Proceedings in Informatics • 55: Cohen MB, Nelson J, Woodruff DP
Conference Optimal principal component analysis in distributed and streaming models 2016 • Annual ACM Symposium on Theory of Computing • 236-249 Boutsidis C, Woodruff DP, Zhong P
Journal Article Space-Efficient Estimation of Statistics Over Sub-Sampled Streams 2016 • Algorithmica • 74(2):787-811 McGregor A, Pavan A, Tirthapura S, Woodruff DP
Conference Stochastic streams: Sample complexity vs. space complexity 2016 • Leibniz International Proceedings in Informatics • 57: Crouch M, McGregor A, Valiant G, Woodruff DP
Conference Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors 2016 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 261-276 Braverman V, Chestnut SR, Woodruff DP, Yang LF
Preprint Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors 2016 Braverman V, Chestnut SR, Woodruff DP, Yang LF
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
Conference Weighted low rank approximations with provable guarantees 2016 • Annual ACM Symposium on Theory of Computing • 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 • 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
