Conference Approximation algorithms for l0-low rank approximation 2017 • Advances in Neural Information Processing Systems • 2017-December:6649-6660 Bringmann K, Kolev P, Woodruff DP
Conference Embeddings of schatten norms with applications to data streams 2017 • Leibniz International Proceedings in Informatics • 80: Li Y, Woodruff DP
Conference Fast regression with an ℓ∞ guarantee 2017 • Leibniz International Proceedings in Informatics • 80: Price E, Song Z, Woodruff DP
Journal Article Faster Kernel Ridge Regression Using Sketching and Preconditioning 2017 • SIAM Journal on Matrix Analysis and Applications • 38(4):1116-1138 Avron H, Clarkson KL, Woodruff DP
Conference Is input sparsity time possible for kernel low-rank approximation? 2017 • Advances in Neural Information Processing Systems • 2017-December:4436-4446 Musco C, Woodruff DP
Preprint Is Input Sparsity Time Possible for Kernel Low-Rank Approximation? 2017 Musco C, Woodruff DP
Conference Low rank approximation with entrywise l 1 -norm error 2017 • Annual ACM Symposium on Theory of Computing • 688-701 Song Z, Woodruff DP, Zhong P
Journal Article Low-Rank Approximation and Regression in Input Sparsity Time 2017 • Journal of the ACM • 63(6):1-45 Clarkson KL, Woodruff DP
Preprint Matrix Completion and Related Problems via Strong Duality 2017 Balcan M-F, Liang Y, Woodruff DP, Zhang H
Conference Near optimal sketching of low-rank tensor regression 2017 • Advances in Neural Information Processing Systems • 2017-December:3467-3477 Haupt J, Li X, Woodruff DP
Journal Article Optimal CUR Matrix Decompositions 2017 • SIAM journal on computing (Print) • 46(2):543-589 Boutsidis C, Woodruff DP
Preprint Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams 2017 Kapralov M, Nelson J, Pachocki J, Wang Z, Woodruff DP, Yahyazadeh M
Conference Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams 2017 • Annual Symposium on Foundations of Computer Science • 475-486 Kapralov M, Nelson J, Pachocki J, Wang Z, Woodruff DP, Yahyazadeh M
Preprint Robust Communication-Optimal Distributed Clustering Algorithms 2017 Awasthi P, Bakshi A, Balcan M-F, White C, Woodruff D
Conference Sharper bounds for regularized data fitting 2017 • Leibniz International Proceedings in Informatics • 81: Avron H, Clarkson KL, Woodruff DP
Conference Sketching for geometric problems 2017 • Leibniz International Proceedings in Informatics • 87: Woodruff DP
Preprint Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness 2017 Musco C, Netrapalli P, Sidford A, Ubaru S, Woodruff DP
Preprint Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices 2017 Musco C, Woodruff DP
Conference Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices 2017 • Annual Symposium on Foundations of Computer Science • 672-683 Musco C, Woodruff DP
Journal Article When distributed computation is communication expensive 2017 • Distributed Computing • 30(5):309-323 Woodruff DP, Zhang Q
Conference An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems 2016 385-400 Bhattacharyya A, Dey P, Woodruff DP
Conference Beating CountSketch for heavy hitters in insertion streams 2016 • Annual ACM Symposium on Theory of Computing • 740-753 Braverman V, Chestnut SR, Ivkin N, Woodruff DP
Preprint BPTree: an $\ell_2$ heavy hitters algorithm using constant memory 2016 Braverman V, Chestnut SR, Ivkin N, Nelson J, Wang Z, Woodruff DP
