Conference Approximation algorithms for l<inf>0</inf>-low rank approximation 2017 • Advances in Neural Information Processing Systems • 2017-December:6649-6660 Bringmann K, Kolev P, Woodruff DP
Conference BPTree: An ℓ<inf>2</inf> heavy hitters algorithm using constant memory 2017 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • Part F127745:361-376 Braverman V, Chestnut SR, Ivkin N, Nelson J, Wang Z, 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 ℓ<inf>∞</inf> 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<inf>1</inf>-norm error? 2017 • Annual ACM Symposium on Theory of Computing • Part F128415: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): 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
Conference Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams 2017 • Annual Symposium on Foundations of Computer Science • 2017-October:475-486 Kapralov M, Nelson J, Pachocki J, Wang Z, Woodruff DP, Yahyazadeh M
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
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
Conference Sublinear time low-rank approximation of positive semidefinite matrices 2017 • Annual Symposium on Foundations of Computer Science • 2017-October:672-683 Musco C, Woodruff DP
Preprint Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices 2017 Musco C, Woodruff DP
Journal Article When distributed computation is communication expensive 2017 • Distributed Computing • 30(5):309-323 Woodruff DP, Zhang Q
Journal Article A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream 2016 • IEEE Transactions on Knowledge and Data Engineering • 28(6):1356-1368 Chung YY, Tirthapura S, Woodruff DP
Conference An optimal algorithm for ℓ<inf>1</inf>-heavy hitters in insertion streams and related problems 2016 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 26-June-01-July-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 • 19-21-June-2016:740-753 Braverman V, Ivkin N, Chestnut SR, 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
