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 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
Conference Improved Distributed Principal Component Analysis 2014 • Advances in Neural Information Processing Systems • 27: Balcan M-F, Kanchanapally V, Liang Y, Woodruff D
Preprint Improved Distributed Principal Component Analysis 2014 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
Conference Low rank approximation lower bounds in row-update streams 2014 • Advances in Neural Information Processing Systems • 2(January):1781-1789 Woodruff DP
Journal Article On deterministic sketching and streaming for sparse recovery and norm estimation 2014 • Linear Algebra and Its Applications • 441:152-167 Nelson J, Nguyẽn HL, Woodruff DP
Conference On Sketching Matrix Norms and the Top Singular Vector 2014 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1562-1581 Li Y, Nguyễn HL, Woodruff DP
Conference On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model 2014 • Lecture Notes in Computer Science • 8784:499-513 Li Y, Sun X, Wang C, Woodruff DP
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
