| 2026 | ICALP | Streaming Complexity Separations for Dense and Sparse Graphs. | Yang P. Liu, Hoai-An Nguyen, Noah G. Singer, David P. Woodruff |
| 2026 | ISIT | Progress on the Courtade-Kumar Conjecture: Optimal High-Noise Entropy Bounds and Generalized Coordinate-wise Mutual Information. | Adel Javanmard, David P. Woodruff |
| 2026 | SODA | Online Learning with Limited Information in the Sliding Window Model. | Vladimir Braverman, Sumegha Garg, Chen Wang, David P. Woodruff, Samson Zhou |
| 2026 | SODA | L | Honghao Lin, Zhao Song, David P. Woodruff, Shenghao Xie, Samson Zhou |
| 2026 | STOC | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2026 | STOC | Adversarial Robustness on Insertion-Deletion Streams. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2025 | FOCS | Perfect Lp Sampling with Polylogarithmic Update Time. | William Swartworth, David P. Woodruff, Samson Zhou |
| 2025 | FOCS | Root Ridge Leverage Score Sampling for ℓp Subspace Approximation. | David P. Woodruff, Taisuke Yasuda |
| 2025 | ICALP | Guessing Efficiently for Constrained Subspace Approximation. | Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff |
| 2025 | ICALP | Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model. | Shiyuan Feng, William Swartworth, David P. Woodruff |
| 2025 | ICLR | Streaming Algorithms For ℓp Flows and ℓp Regression. | Amit Chakrabarti, Jeffrey Jiang, David P. Woodruff, Taisuke Yasuda |
| 2025 | ICLR | LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions. | Ravindran Kannan, Chiranjib Bhattacharyya, Praneeth Kacham, David P. Woodruff |
| 2025 | ICLR | Beyond Worst-Case Dimensionality Reduction for Sparse Vectors. | Sandeep Silwal, David P. Woodruff, Qiuyi Zhang |
| 2025 | ICML | On Fine-Grained Distinct Element Estimation. | Ilias Diakonikolas, Daniel Kane, Jasper C. H. Lee, Thanasis Pittas, David P. Woodruff, Samson Zhou |
| 2025 | ICML | Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures. | Alina Ene, Alessandro Epasto, Vahab Mirrokni, Hoai-An Nguyen, Huy L. Nguyen, David P. Woodruff, Peilin Zhong |
| 2025 | ICML | On Differential Privacy for Adaptively Solving Search Problems via Sketching. | Shiyuan Feng, Ying Feng, George Zhaoqi Li, Zhao Song, David P. Woodruff, Lichen Zhang |
| 2025 | ICML | Robust Sparsification via Sensitivity. | Chansophea Wathanak In, Yi Li, David P. Woodruff, Xuan Wu |
| 2025 | ICML | Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra. | Raphael A. Meyer, William J. Swartworth, David P. Woodruff |
| 2025 | SODA | Tight Sampling Bounds for Eigenvalue Approximation. | William Swartworth, David P. Woodruff |
| 2025 | STOC | Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2024 | EMNLP | GRASS: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients. | Aashiq Muhamed, Oscar Li, David P. Woodruff, Mona T. Diab, Virginia Smith |
| 2024 | FOCS | A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2024 | ICLR | Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms. | Yi Li, Honghao Lin, David P. Woodruff |
| 2024 | ICLR | HyperAttention: Long-context Attention in Near-Linear Time. | Insu Han, Rajesh Jayaram, Amin Karbasi, Vahab Mirrokni, David P. Woodruff, Amir Zandieh |
| 2024 | ICLR | Adaptive Regret for Bandits Made Possible: Two Queries Suffice. | Zhou Lu, Qiuyi Zhang, Xinyi Chen, Fred Zhang, David P. Woodruff, Elad Hazan |
| 2024 | ICML | Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. | Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder |
| 2024 | ICML | High-Dimensional Geometric Streaming for Nearly Low Rank Data. | Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong |
| 2024 | ICML | Fast White-Box Adversarial Streaming Without a Random Oracle. | Ying Feng, Aayush Jain, David P. Woodruff |
| 2024 | ICML | Learning Multiple Secrets in Mastermind. | Milind Prabhu, David P. Woodruff |
| 2024 | ICML | Fast Sampling-Based Sketches for Tensors. | William J. Swartworth, David P. Woodruff |
| 2024 | ICML | Reweighted Solutions for Weighted Low Rank Approximation. | David P. Woodruff, Taisuke Yasuda |
| 2024 | ICML | Coresets for Multiple ℓp Regression. | David P. Woodruff, Taisuke Yasuda |
| 2024 | PODS | Approximation Algorithms on Matrices - With Some Database Applications! | David P. Woodruff |
| 2024 | STOC | A New Information Complexity Measure for Multi-pass Streaming with Applications. | Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang |
| 2024 | STOC | Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond. | Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong |
| 2024 | STOC | Improving the Bit Complexity of Communication for Distributed Convex Optimization. | Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye |
| 2023 | AISTATS | Optimal Sketching Bounds for Sparse Linear Regression. | Tung Mai, Alexander Munteanu, Cameron Musco, Anup Rao, Chris Schwiegelshohn, David P. Woodruff |
| 2023 | COLT | ℓ | Yi Li, Honghao Lin, David P. Woodruff |
| 2023 | EuroCrypt | On Differential Privacy and Adaptive Data Analysis with Bounded Space. | Itai Dinur, Uri Stemmer, David P. Woodruff, Samson Zhou |
| 2023 | FOCS | Streaming Euclidean k-median and k-means with o(log n) Space. | Vincent Cohen-Addad, David P. Woodruff, Samson Zhou |
| 2023 | FOCS | Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. | Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff |
| 2023 | ICLR | Learning the Positions in CountSketch. | Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff |
| 2023 | ICLR | Robust Algorithms on Adaptive Inputs from Bounded Adversaries. | Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Fred Zhang, Qiuyi Zhang, Samson Zhou |
| 2023 | ICLR | Almost Linear Constant-Factor Sketching for $\ell_1$ and Logistic Regression. | Alexander Munteanu, Simon Omlor, David P. Woodruff |
| 2023 | ICML | Improved Algorithms for White-Box Adversarial Streams. | Ying Feng, David P. Woodruff |
| 2023 | ICML | Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization. | Ameya Velingker, Maximilian Vtsch, David P. Woodruff, Samson Zhou |
| 2023 | ICML | Sharper Bounds for ℓ | David P. Woodruff, Taisuke Yasuda |
| 2023 | SODA | The ℓ | Yi Li, Honghao Lin, David P. Woodruff |
| 2023 | SODA | Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. | Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Samson Zhou |
| 2023 | SODA | Near-Linear Sample Complexity for | Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff, Samson Zhou |
| 2023 | SODA | Online Lewis Weight Sampling. | David P. Woodruff, Taisuke Yasuda |
| 2023 | STOC | Optimal Eigenvalue Approximation via Sketching. | William Swartworth, David P. Woodruff |
| 2023 | STOC | New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. | David P. Woodruff, Taisuke Yasuda |
| 2022 | FOCS | Active Linear Regression for ℓp Norms and Beyond. | Cameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda |
| 2022 | FOCS | Testing Positive Semidefiniteness Using Linear Measurements. | Deanna Needell, William Swartworth, David P. Woodruff |
| 2022 | FOCS | High-Dimensional Geometric Streaming in Polynomial Space. | David P. Woodruff, Taisuke Yasuda |
| 2022 | ICLR | Triangle and Four Cycle Counting with Predictions in Graph Streams. | Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang |
| 2022 | ICLR | Learning-Augmented $k$-means Clustering. | Jon C. Ergun, Zhili Feng, Sandeep Silwal, David P. Woodruff, Samson Zhou |
| 2022 | ICLR | Fast Regression for Structured Inputs. | Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff, Samson Zhou |
| 2022 | ICML | Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. | Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, Honghao Lin, David P. Woodruff |
| 2022 | ICML | Sketching Algorithms and Lower Bounds for Ridge Regression. | Praneeth Kacham, David P. Woodruff |
| 2022 | ICML | Learning Augmented Binary Search Trees. | Honghao Lin, Tian Luo, David P. Woodruff |
| 2022 | ICML | Bounding the Width of Neural Networks via Coupled Initialization A Worst Case Analysis. | Alexander Munteanu, Simon Omlor, Zhao Song, David P. Woodruff |
| 2022 | ICML | Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time. | David P. Woodruff, Amir Zandieh |
| 2022 | PODS | The White-Box Adversarial Data Stream Model. | Mikls Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou |
| 2022 | PODS | Truly Perfect Samplers for Data Streams and Sliding Windows. | Rajesh Jayaram, David P. Woodruff, Samson Zhou |
| 2022 | RECOMB | A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World. | Agniva Chowdhury, Aritra Bose, Samson Zhou, David P. Woodruff, Petros Drineas |
| 2022 | SODA | Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. | Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff |
| 2022 | SODA | Frequency Estimation with One-Sided Error. | Piotr Indyk, Shyam Narayanan, David P. Woodruff |
| 2022 | SODA | Improved Algorithms for Low Rank Approximation from Sparsity. | David P. Woodruff, Taisuke Yasuda |
| 2022 | STOC | Low-rank approximation with | Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff |
| 2022 | STOC | Memory bounds for the experts problem. | Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, Samson Zhou |
| 2021 | COLT | Reduced-Rank Regression with Operator Norm Error. | Praneeth Kacham, David P. Woodruff |
| 2021 | COLT | Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing. | Yi Li, David P. Woodruff, Taisuke Yasuda |
| 2021 | COLT | Average-Case Communication Complexity of Statistical Problems. | Cyrus Rashtchian, David P. Woodruff, Peng Ye, Hanlin Zhu |
| 2021 | FOCS | Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators. | David P. Woodruff, Samson Zhou |
| 2021 | ICALP | A Very Sketchy Talk (Invited Talk). | David P. Woodruff |
| 2021 | ICALP | Separations for Estimating Large Frequency Moments on Data Streams. | David P. Woodruff, Samson Zhou |
| 2021 | ICLR | Learning a Latent Simplex in Input Sparsity Time. | Ainesh Bakshi, Chiranjib Bhattacharyya, Ravi Kannan, David P. Woodruff, Samson Zhou |
| 2021 | ICML | Fast Sketching of Polynomial Kernels of Polynomial Degree. | Zhao Song, David P. Woodruff, Zheng Yu, Lichen Zhang |
| 2021 | ICML | Dimensionality Reduction for the Sum-of-Distances Metric. | Zhili Feng, Praneeth Kacham, David P. Woodruff |
| 2021 | ICML | In-Database Regression in Input Sparsity Time. | Rajesh Jayaram, Alireza Samadian, David P. Woodruff, Peng Ye |
| 2021 | ICML | Streaming and Distributed Algorithms for Robust Column Subset Selection. | Shuli Jiang, Dennis Li, Irene Mengze Li, Arvind V. Mahankali, David P. Woodruff |
| 2021 | ICML | Single Pass Entrywise-Transformed Low Rank Approximation. | Yifei Jiang, Yi Li, Yiming Sun, Jiaxin Wang, David P. Woodruff |
| 2021 | ICML | Oblivious Sketching for Logistic Regression. | Alexander Munteanu, Simon Omlor, David P. Woodruff |
| 2021 | PODS | Subspace Exploration: Bounds on Projected Frequency Estimation. | Graham Cormode, Charlie Dickens, David P. Woodruff |
| 2021 | SODA | Optimal | Arvind V. Mahankali, David P. Woodruff |
| 2021 | UAI | Non-PSD matrix sketching with applications to regression and optimization. | Zhili Feng, Fred Roosta, David P. Woodruff |
| 2020 | AISTATS | Optimal Deterministic Coresets for Ridge Regression. | Praneeth Kacham, David P. Woodruff |
| 2020 | AISTATS | Automatic Differentiation of Sketched Regression. | Hang Liao, Barak A. Pearlmutter, Vamsi K. Potluru, David P. Woodruff |
| 2020 | FOCS | Robust and Sample Optimal Algorithms for PSD Low Rank Approximation. | Ainesh Bakshi, Nadiia Chepurko, David P. Woodruff |
| 2020 | FOCS | Near Optimal Linear Algebra in the Online and Sliding Window Models. | Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou |
| 2020 | FOCS | The Coin Problem with Applications to Data Streams. | Mark Braverman, Sumegha Garg, David P. Woodruff |
| 2020 | ICLR | Span Recovery for Deep Neural Networks with Applications to Input Obfuscation. | Rajesh Jayaram, David P. Woodruff, Qiuyi Zhang |
| 2020 | ICLR | Learning-Augmented Data Stream Algorithms. | Tanqiu Jiang, Yi Li, Honghao Lin, Yisong Ruan, David P. Woodruff |
| 2020 | ICML | Input-Sparsity Low Rank Approximation in Schatten Norm. | Yi Li, David P. Woodruff |
| 2020 | ICML | Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling. | David P. Woodruff, Amir Zandieh |
| 2020 | PODS | A Framework for Adversarially Robust Streaming Algorithms. | Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev |
| 2020 | WWW | LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew. | Cyrus Rashtchian, Aneesh Sharma, David P. Woodruff |
| 2020 | SODA | Oblivious Sketching of High-Degree Polynomial Kernels. | Thomas D. Ahle, Michael Kapralov, Jakob Bk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh |
| 2020 | SODA | Tight Bounds for the Subspace Sketch Problem with Applications. | Yi Li, Ruosong Wang, David P. Woodruff |
| 2020 | SODA | The Communication Complexity of Optimization. | Santosh S. Vempala, Ruosong Wang, David P. Woodruff |
| 2020 | STOC | Non-adaptive adaptive sampling on turnstile streams. | Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou |
| 2019 | AAAI | Sublinear Time Numerical Linear Algebra for Structured Matrices. | Xiaofei Shi, David P. Woodruff |
| 2019 | AISTATS | Conditional Sparse $L_p$-norm Regression With Optimal Probability. | John Hainline, Brendan Juba, Hai S. Le, David P. Woodruff |
| 2019 | COLT | Faster Algorithms for High-Dimensional Robust Covariance Estimation. | Yu Cheng, Ilias Diakonikolas, Rong Ge, David P. Woodruff |
| 2019 | COLT | Learning Two Layer Rectified Neural Networks in Polynomial Time. | Ainesh Bakshi, Rajesh Jayaram, David P. Woodruff |
| 2019 | COLT | Sample-Optimal Low-Rank Approximation of Distance Matrices. | Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff |
| 2019 | GI | On Coresets for Logistic Regression. | Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff |
| 2019 | ICALP | Robust Communication-Optimal Distributed Clustering Algorithms. | Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, David P. Woodruff |
| 2019 | ICALP | Querying a Matrix Through Matrix-Vector Products. | Xiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang |
| 2019 | ICALP | Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams. | David P. Woodruff, Guang Yang |
| 2019 | ICML | Faster Algorithms for Binary Matrix Factorization. | Ravi Kumar, Rina Panigrahy, Ali Rahimi, David P. Woodruff |
| 2019 | ICML | Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering. | Taisuke Yasuda, David P. Woodruff, Manuel Fernandez |
| 2019 | ICML | Dimensionality Reduction for Tukey Regression. | Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff |
| 2019 | PODS | Weighted Reservoir Sampling from Distributed Streams. | Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, David P. Woodruff |
| 2019 | RECOMB | Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave. | Can Kockan, Kaiyuan Zhu, Natnatee Dokmai, Nikolai Karpov, M. Oguzhan Klekci, David P. Woodruff, Sleyman Cenk Sahinalp |
| 2019 | SODA | Testing Matrix Rank, Optimally. | Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang |
| 2019 | SODA | A PTAS for ℓp-Low Rank Approximation. | Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff |
| 2019 | SODA | Relative Error Tensor Low Rank Approximation. | Zhao Song, David P. Woodruff, Peilin Zhong |
| 2019 | SODA | Tight Bounds for ℓp Oblivious Subspace Embeddings. | Ruosong Wang, David P. Woodruff |
| 2018 | AISTATS | Sketching for Kronecker Product Regression and P-splines. | Huaian Diao, Zhao Song, Wen Sun, David P. Woodruff |
| 2018 | FOCS | Perfect Lp Sampling in a Data Stream. | Rajesh Jayaram, David P. Woodruff |
| 2018 | FOCS | Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. | Christian Sohler, David P. Woodruff |
| 2018 | ICALP | Revisiting Frequency Moment Estimation in Random Order Streams. | Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang |
| 2018 | ICALP | High Probability Frequency Moment Sketches. | Sumit Ganguly, David P. Woodruff |
| 2018 | ICALP | Improved Algorithms for Adaptive Compressed Sensing. | Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang |
| 2018 | ICML | Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. | Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang |
| 2018 | ICML | Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms. | Graham Cormode, Charlie Dickens, David P. Woodruff |
| 2018 | KDD | An Empirical Evaluation of Sketching for Numerical Linear Algebra. | Yogesh Dahiya, Dimitris Konomis, David P. Woodruff |
| 2018 | PODS | Data Streams with Bounded Deletions. | Rajesh Jayaram, David P. Woodruff |
| 2018 | PODS | Distributed Statistical Estimation of Matrix Products with Applications. | David P. Woodruff, Qin Zhang |
| 2017 | ESA | Sketching for Geometric Problems (Invited Talk). | David P. Woodruff |
| 2017 | FOCS | Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. | Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh |
| 2017 | FOCS | Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices. | Cameron Musco, David P. Woodruff |
| 2017 | ICALP | Embeddings of Schatten Norms with Applications to Data Streams. | Yi Li, David P. Woodruff |
| 2017 | ICALP | Fast Regression with an $ell_infty$ Guarantee. | Eric Price, Zhao Song, David P. Woodruff |
| 2017 | ICML | Algorithms for $\ell_p$ Low-Rank Approximation. | Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff |
| 2017 | PODS | BPTree: An ℓ | Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff |
| 2017 | SODA | Low-Rank PSD Approximation in Input-Sparsity Time. | Kenneth L. Clarkson, David P. Woodruff |
| 2017 | SODA | Adaptive Matrix Vector Product. | Santosh S. Vempala, David P. Woodruff |
| 2017 | STOC | Low rank approximation with entrywise l | Zhao Song, David P. Woodruff, Peilin Zhong |
| 2016 | ESA | Stochastic Streams: Sample Complexity vs. Space Complexity. | Michael S. Crouch, Andrew McGregor, Gregory Valiant, David P. Woodruff |
| 2016 | ICALP | Optimal Approximate Matrix Product in Terms of Stable Rank. | Michael B. Cohen, Jelani Nelson, David P. Woodruff |
| 2016 | ICDE | Distributed low rank approximation of implicit functions of a matrix. | David P. Woodruff, Peilin Zhong |
| 2016 | ICDT | New Algorithms for Heavy Hitters in Data Streams (Invited Talk). | David P. Woodruff |
| 2016 | ICML | How to Fake Multiply by a Gaussian Matrix. | Michael Kapralov, Vamsi K. Potluru, David P. Woodruff |
| 2016 | KDD | Communication Efficient Distributed Kernel Principal Component Analysis. | Maria-Florina Balcan, Yingyu Liang, Le Song, David P. Woodruff, Bo Xie |
| 2016 | PODS | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. | Arnab Bhattacharyya, Palash Dey, David P. Woodruff |
| 2016 | PODS | Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. | Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang |
| 2016 | SODA | Nearly-optimal bounds for sparse recovery in generic norms, with applications to | Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff |
| 2016 | STOC | Optimal principal component analysis in distributed and streaming models. | Christos Boutsidis, David P. Woodruff, Peilin Zhong |
| 2016 | STOC | Beating CountSketch for heavy hitters in insertion streams. | Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff |
| 2016 | STOC | Communication lower bounds for statistical estimation problems via a distributed data processing inequality. | Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff |
| 2016 | STOC | On approximating functions of the singular values in a stream. | Yi Li, David P. Woodruff |
| 2016 | STOC | Weighted low rank approximations with provable guarantees. | Ilya P. Razenshteyn, Zhao Song, David P. Woodruff |
| 2016 | SPAA | Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff |
| 2015 | FOCS | Input Sparsity and Hardness for Robust Subspace Approximation. | Kenneth L. Clarkson, David P. Woodruff |
| 2015 | ICALP | Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2015 | ICALP | The Simultaneous Communication of Disjointness with Applications to Data Streams. | Omri Weinstein, David P. Woodruff |
| 2015 | PODS | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. | Dirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang |
| 2015 | SODA | Sketching for | Kenneth L. Clarkson, David P. Woodruff |
| 2014 | COLT | Principal Component Analysis and Higher Correlations for Distributed Data. | Ravi Kannan, Santosh S. Vempala, David P. Woodruff |
| 2014 | KDD | Improved testing of low rank matrices. | Yi Li, Zhengyu Wang, David P. Woodruff |
| 2014 | PODC | Beyond set disjointness: the communication complexity of finding the intersection. | Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev |
| 2014 | PODC | Spanners and sparsifiers in dynamic streams. | Michael Kapralov, David P. Woodruff |
| 2014 | PODS | Is min-wise hashing optimal for summarizing set intersection? | Rasmus Pagh, Morten Stckel, David P. Woodruff |
| 2014 | SODA | On Sketching Matrix Norms and the Top Singular Vector. | Yi Li, Huy L. Nguyen, David P. Woodruff |
| 2014 | SODA | An Optimal Lower Bound for Distinct Elements in the Message Passing Model. | David P. Woodruff, Qin Zhang |
| 2014 | STOC | Optimal CUR matrix decompositions. | Christos Boutsidis, David P. Woodruff |
| 2014 | STOC | Turnstile streaming algorithms might as well be linear sketches. | Yi Li, Huy L. Nguyen, David P. Woodruff |
| 2013 | COLT | Subspace Embeddings and \(\ell_p\)-Regression Using Exponential Random Variables. | David P. Woodruff, Qin Zhang |
| 2013 | SODA | The Fast Cauchy Transform and Faster Robust Linear Regression. | Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff |
| 2013 | SODA | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2013 | SODA | Lower Bounds for Adaptive Sparse Recovery. | Eric Price, David P. Woodruff |
| 2013 | STOC | Low rank approximation and regression in input sparsity time. | Kenneth L. Clarkson, David P. Woodruff |
| 2013 | STOC | How robust are linear sketches to adaptive inputs? | Moritz Hardt, David P. Woodruff |
| 2012 | ICDE | A General Method for Estimating Correlated Aggregates over a Data Stream. | Srikanta Tirthapura, David P. Woodruff |
| 2012 | ICML | Fast approximation of matrix coherence and statistical leverage. | Michael W. Mahoney, Petros Drineas, Malik Magdon-Ismail, David P. Woodruff |
| 2012 | ISIT | Applications of the Shannon-Hartley theorem to data streams and sparse recovery. | Eric Price, David P. Woodruff |
| 2012 | PODS | Space-efficient estimation of statistics over sub-sampled streams. | Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff |
| 2012 | PODS | Rectangle-efficient aggregation in spatial data streams. | Srikanta Tirthapura, David P. Woodruff |
| 2012 | STOC | Tight bounds for distributed functional monitoring. | David P. Woodruff, Qin Zhang |
| 2011 | ESA | Tolerant Algorithms. | Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff |
| 2011 | FOCS | On the Power of Adaptivity in Sparse Recovery. | Piotr Indyk, Eric Price, David P. Woodruff |
| 2011 | FOCS | (1 + eps)-Approximate Sparse Recovery. | Eric Price, David P. Woodruff |
| 2011 | ICALP | Steiner Transitive-Closure Spanners of Low-Dimensional Posets. | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
| 2011 | SODA | Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error. | T. S. Jayram, David P. Woodruff |
| 2011 | STOC | Fast moment estimation in data streams in optimal space. | Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff |
| 2011 | STOC | Subspace embeddings for the L | Christian Sohler, David P. Woodruff |
| 2011 | STOC | Near-optimal private approximation protocols via a black box transformation. | David P. Woodruff |
| 2010 | FOCS | Sublinear Optimization for Machine Learning. | Kenneth L. Clarkson, Elad Hazan, David P. Woodruff |
| 2010 | ICALP | Additive Spanners in Nearly Quadratic Time. | David P. Woodruff |
| 2010 | PODS | An optimal algorithm for the distinct elements problem. | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
| 2010 | PODS | Fast Manhattan sketches in data streams. | Jelani Nelson, David P. Woodruff |
| 2010 | SODA | Lower Bounds for Sparse Recovery. | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
| 2010 | SODA | Coresets and Sketches for High Dimensional Subspace Approximation Problems. | Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff |
| 2010 | SODA | On the Exact Space Complexity of Sketching and Streaming Small Norms. | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
| 2010 | SODA | 1-Pass Relative-Error L | Morteza Monemizadeh, David P. Woodruff |
| 2009 | FOCS | Efficient Sketches for Earth-Mover Distance, with Applications. | Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff |
| 2009 | FOCS | The Data Stream Space Complexity of Cascaded Norms. | T. S. Jayram, David P. Woodruff |
| 2009 | ICDT | The average-case complexity of counting distinct elements. | David P. Woodruff |
| 2009 | SODA | Transitive-closure spanners. | Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
| 2009 | STOC | Numerical linear algebra in the streaming model. | Kenneth L. Clarkson, David P. Woodruff |
| 2008 | PODS | Epistemic privacy. | Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff |
| 2007 | EuroCrypt | Revisiting the Efficiency of Malicious Two-Party Computation. | David P. Woodruff |
| 2007 | SODA | The communication and streaming complexity of computing the longest common and increasing subsequences. | Xiaoming Sun, David P. Woodruff |
| 2006 | CRYPTO | Fast Algorithms for the Free Riders Problem in Broadcast Encryption. | Zulfikar Ramzan, David P. Woodruff |
| 2006 | FOCS | Explicit Exclusive Set Systems with Applications to Broadcast Encryption. | Craig Gentry, Zulfikar Ramzan, David P. Woodruff |
| 2006 | FOCS | Lower Bounds for Additive Spanners, Emulators, and More. | David P. Woodruff |
| 2006 | TCC | Polylogarithmic Private Approximations and Efficient Matching. | Piotr Indyk, David P. Woodruff |
| 2005 | EuroCrypt | Practical Cryptography in High Dimensional Tori. | Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff |
| 2005 | STOC | Optimal approximations of the frequency moments of data streams. | Piotr Indyk, David P. Woodruff |
| 2004 | CCS | Private inference control. | David P. Woodruff, Jessica Staddon |
| 2004 | CRYPTO | Asymptotically Optimal Communication for Torus-Based Cryptography. | Marten van Dijk, David P. Woodruff |
| 2004 | PODS | Clustering via Matrix Powering. | Hanson Zhou, David P. Woodruff |
| 2004 | SODA | Optimal space lower bounds for all frequency moments. | David P. Woodruff |
| 2003 | FOCS | Tight Lower Bounds for the Distinct Elements Problem. | Piotr Indyk, David P. Woodruff |
| 2002 | EuroCrypt | Cryptography in an Unbounded Computational Model. | David P. Woodruff, Marten van Dijk |