Conference Applications of the Shannon-Hartley theorem to data streams and sparse recovery 2012 • IEEE International Symposium on Information Theory - Proceedings • 2446-2450 Price E, Woodruff DP
Journal Article Fast approximation of matrix coherence and statistical leverage 2012 • Journal of machine learning research • 13:3475-3506 Drineas P, Magdon-Ismail M, Mahoney MW, Woodruff DP
Conference Fast approximation of matrix coherence and statistical leverage 2012 • Proceedings of the 29th International Conference on Machine Learning, ICML 2012 • 1:105-112 Drineas P, Magdon-Ismail M, Mahoney MW, Woodruff DP
Journal Article Lower bounds for local monotonicity reconstruction from transitive-closure spanners 2012 • SIAM Journal on Discrete Mathematics • 26(2):618-646 Bhattacharyya A, Grigorescu E, Jha M, Jung K, Raskhodnikova S, Woodruff DP
Conference On deterministic sketching and streaming for sparse recovery and norm estimation 2012 • Lecture Notes in Computer Science • 7408 LNCS:627-638 Nelson J, Nguyên HL, Woodruff DP
Conference Rectangle-efficient aggregation in spatial data streams 2012 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 283-294 Tirthapura S, Woodruff D
Conference Reusable low-error compressive sampling schemes through privacy 2012 • 2012 IEEE Statistical Signal Processing Workshop, SSP 2012 • 536-539 Gilbert AC, Hemenway B, Strauss MJ, Woodruff DP, Wootters M
Conference Space-efficient estimation of statistics over sub-sampled streams 2012 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 273-282 McGregor A, Pavan A, Tirthapura S, Woodruff D
Journal Article Sublinear optimization for machine learning 2012 • Journal of the ACM • 59(5): Clarkson KL, Hazan E, Woodruff DP
Preprint The Fast Cauchy Transform and Faster Robust Linear Regression 2012 Clarkson KL, Drineas P, Magdon-Ismail M, Mahoney MW, Meng X, Woodruff DP
Conference Tight bounds for distributed functional monitoring 2012 • Annual ACM Symposium on Theory of Computing • 941-959 Woodruff DP, Zhang Q
Journal Article Transitive-closure spanners 2012 • SIAM journal on computing (Print) • 41(6):1380-1425 Bhattacharyya A, Grigorescu E, Jung K, Raskhodnikova S, Woodruff DP
Conference (1 + ε)-approximate sparse recovery 2011 • Annual Symposium on Foundations of Computer Science • 295-304 Price E, Woodruff DP
Preprint Fast approximation of matrix coherence and statistical leverage 2011 Drineas P, Magdon-Ismail M, Mahoney MW, Woodruff DP
Conference Fast moment estimation in data streams in optimal space 2011 • Annual ACM Symposium on Theory of Computing • 745-754 Kane DM, Nelson J, Porat E, Woodruff DP
Conference Near-optimal private approximation protocols via a black box transformation 2011 • Annual ACM Symposium on Theory of Computing • 735-744 Woodruff DP
Conference On the power of adaptivity in sparse recovery 2011 • Annual Symposium on Foundations of Computer Science • 285-294 Indyk P, Price E, Woodruff DP
Conference Optimal bounds for johnson-lindenstrauss transforms and streaming problems with sub-constant error 2011 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1-10 Jayram TS, Woodruff D
Conference Optimal random sampling from distributed streams revisited 2011 • Lecture Notes in Computer Science • 6950 LNCS:283-297 Tirthapura S, Woodruff DP
Conference Steiner transitive-closure spanners of low-dimensional posets 2011 • Lecture Notes in Computer Science • 6755 LNCS(PART 1):760-772 Berman P, Bhattacharyya A, Grigorescu E, Raskhodnikova S, Woodruff DP, Yaroslavtsev G
Chapter Streaming algorithms with one-sided estimation 2011 • Lecture Notes in Computer Science • 6845 LNCS:436-447 Brody J, Woodruff DP
Conference Subspace embeddings for the L1-norm with applications 2011 • Annual ACM Symposium on Theory of Computing • 755-764 Sohler C, Woodruff DP
Chapter Tolerant algorithms 2011 • Lecture Notes in Computer Science • 6942 LNCS:736-747 Klein R, Penninger R, Sohler C, Woodruff DP
Conference 1-Pass relative-error L<inf>p</inf>-sampling with applications 2010 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1143-1160 Monemizadeh M, Woodruff DP
