Conference Optimal CUR matrix decompositions 2014 • Annual ACM Symposium on Theory of Computing • 353-362 Boutsidis C, Woodruff DP
Conference Principal component analysis and higher correlations for distributed data 2014 • Journal of machine learning research • 35:1040-1057 Kannan R, Vempala SS, Woodruff DP
Journal Article Sketching as a Tool for Numerical Linear Algebra 2014 • Foundations and Trends in Theoretical Computer Science • 10(1–2):1-157 Woodruff DP
Conference Spanners and sparsifiers in dynamic streams 2014 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 272-281 Kapralov M, Woodruff D
Journal Article Steiner transitive-closure spanners of low-dimensional posets 2014 • Combinatorica • 34(3):255-277 Berman P, Bhattacharyya A, Grigorescu E, Raskhodnikova S, Woodruff DP, Yaroslavtsev G
Conference Subspace embeddings for the polynomial kernel 2014 • Advances in Neural Information Processing Systems • 3(January):2258-2266 Avron H, Nguyên HL, Woodruff DP
Conference Turnstile streaming algorithms might as well be linear sketches 2014 • Annual ACM Symposium on Theory of Computing • 174-183 Li Y, Nguyen HL, Woodruff DP
Chapter A Tight Lower Bound for High Frequency Moment Estimation with Small Error 2013 • Lecture Notes in Computer Science • 8096:623-638 Li Y, Woodruff DP
Conference Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching 2013 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1738-1756 Molinaro M, Woodruff DP, Yaroslavtsev G
Conference How robust are linear sketches to adaptive inputs? 2013 • Annual ACM Symposium on Theory of Computing • 121-130 Hardt M, Woodruff DP
Conference Low rank approximation and regression in input sparsity time 2013 • Annual ACM Symposium on Theory of Computing • 81-90 Clarkson KL, Woodruff DP
Conference Lower Bounds for Adaptive Sparse Recovery 2013 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 652-663 Price E, Woodruff DP
Journal Article Multi-tuple deletion propagation 2013 • Proceedings of the VLDB Endowment • 6(13):1558-1569 Kimelfeld B, Vondrák J, Woodruff DP
Journal Article Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error 2013 • ACM Transactions on Algorithms (TALG) • 9(3):1-17 Jayram TS, Woodruff DP
Conference Sketching structured matrices for faster nonlinear regression 2013 • Advances in Neural Information Processing Systems Avron H, Sindhwani V, Woodruff DP
Conference Subspace embeddings and l<inf>p</inf>-regression using exponential random variables 2013 • Journal of machine learning research • 30:546-567 Woodruff DP, Zhang Q
Conference The Fast Cauchy Transform and Faster Robust Linear Regression 2013 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 466-477 Clarkson KL, Drineas P, Magdon-Ismail M, Mahoney MW, Meng X, Woodruff DP
Chapter When Distributed Computation Is Communication Expensive 2013 • Lecture Notes in Computer Science • 8205:16-30 Woodruff DP, Zhang Q
Conference A General Method for Estimating Correlated Aggregates Over a Data Stream 2012 • Proceedings - International Conference on Data Engineering • 162-173 Tirthapura S, Woodruff DP
Conference A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field 2012 • Journal of Computer Science and Technology • 27(4):678-686 Woodruff DP
Conference Applications of the Shannon-Hartley Theorem to Data Streams and Sparse Recovery 2012 • IEEE International Symposium on Information Theory - Proceedings • 1:2446-2450 Price E, Woodruff DP
