Conference Lower Bounds on Adaptive Sensing for Matrix Recovery 2023 • Advances in Neural Information Processing Systems Kacham P, Woodruff DP
Conference Near-Linear Sample Complexity for L<i><sub>p</sub></i> Polynomial Regression 2023 • PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 3959-4025 Meyer RA, Musco C, Musco C, Woodruff DP, Zhou S
Conference Near-Optimal k-Clustering in the Sliding Window Model 2023 • Advances in Neural Information Processing Systems • 36: Woodruff DP, Zhong P, Zhou S
Conference New Subset Selection Algorithms for Low Rank Approximation: Offline and Online 2023 • Annual ACM Symposium on Theory of Computing • 1802-1813 Woodruff DR, Yasuda T
Chapter On Differential Privacy and Adaptive Data Analysis with Bounded Space 2023 • Lecture Notes in Computer Science • 14006:35-65 Dinur I, Stemmer U, Woodruff DP, Zhou S
Preprint On Differential Privacy and Adaptive Data Analysis with Bounded Space 2023 Dinur I, Stemmer U, Woodruff DP, Zhou S
Conference On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds 2023 • Advances in Neural Information Processing Systems • 36: Woodruff DP, Zhang F, Zhou S
Conference Online Lewis Weight Sampling 2023 • ACM Transactions on Algorithms (TALG) • 4622-4666 Woodruff DP, Yasuda T
Conference Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time 2023 • PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 4026-4049 Cherapanamjeri Y, Silwal S, Woodruff DP, Zhou S
Conference Optimal Eigenvalue Approximation via Sketching 2023 • Annual ACM Symposium on Theory of Computing • 145-155 Swartworth W, Woodruff DP
Conference Optimal Sketching Bounds for Sparse Linear Regression 2023 • Proceedings of Machine Learning Research • 206:11288-11316 Mai T, Munteanu A, Musco C, Rao AB, Schwiegelshohn C, Woodruff DP
Preprint Optimal Sketching Bounds for Sparse Linear Regression 2023 Mai T, Munteanu A, Musco C, Rao AB, Schwiegelshohn C, Woodruff DP
Conference Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming 2023 • Annual Symposium on Foundations of Computer Science • 1515-1550 Kacham P, Pagh R, Thorup M, Woodruff DP
Preprint Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming 2023 Kacham P, Pagh R, Thorup M, Woodruff DP
Journal Article Recovery From Non-Decomposable Distance Oracles 2023 • IEEE Transactions on Information Theory • 69(10):6443-6469 Hu Z, Li X, Woodruff DP, Zhang H, Zhang S
Conference Recovery from Non-Decomposable Distance Oracles 2023 • Leibniz International Proceedings in Informatics • 251: Hu Z, Li X, Woodruff DP, Zhang H, Zhang S
Conference ROBUST ALGORITHMS ON ADAPTIVE INPUTS FROM BOUNDED ADVERSARIES 2023 • 11th International Conference on Learning Representations Iclr 2023 Cherapanamjeri Y, Silwal S, Woodruff DP, Zhang F, Zhang Q, Zhou S
Preprint Robust Algorithms on Adaptive Inputs from Bounded Adversaries 2023 Cherapanamjeri Y, Silwal S, Woodruff DP, Zhang F, Zhang Q, Zhou S
Journal Article Separating <i>k</i>-Player from <i>t</i>-Player One-Way Communication, with Applications to Data Streams 2023 • Theory of Computing • 19: Du E, Mitzenmacher M, Woodruff D, Yang G
Conference Sharper Bounds for ℓp Sensitivity Sampling 2023 • Proceedings of Machine Learning Research • 202:37238-37272 Woodruff DP, Yasuda T
Conference Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming 2023 • Advances in Neural Information Processing Systems Dexter G, Drineas P, Woodruff DP, Yasuda T
Preprint Streaming Euclidean $k$-median and $k$-means with $o(\log n)$ Space 2023 Cohen-Addad V, Woodruff DP, Zhou S
Conference Streaming Euclidean <i>k</i>-median and <i>k</i>-means with <i>o</i>(<i>log n</i>) Space 2023 • Annual Symposium on Foundations of Computer Science • 883-908 Cohen-Addad V, Woodruff DP, Zhou S
