Preprint Near-Linear Sample Complexity for $L_p$ Polynomial Regression 2022 Meyer RA, Musco C, Musco C, Woodruff DP, Zhou S
Preprint Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions 2022 Mahankali AV, Woodruff DP, Zhang Z
Conference Noisy Boolean Hidden Matching with Applications 2022 • Leibniz International Proceedings in Informatics • 215: Kapralov M, Musipatla A, Tardos J, Woodruff DP, Zhou S
Preprint Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time 2022 Cherapanamjeri Y, Silwal S, Woodruff DP, Zhou S
Conference Optimal Query Complexities for Dynamic Trace Estimation 2022 • Advances in Neural Information Processing Systems Woodruff DP, Zhang F, Zhang QR
Journal Article Preface 2022 • Leibniz International Proceedings in Informatics • 229:XV-XVI Bojańczyk M, Merelli E, Woodruff DP
Conference Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 Chepurko N, Clarkson KL, Horesh L, Lin H, Woodruff DP
Conference Sketching Algorithms and Lower Bounds for Ridge Regression 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 • 10539-10556 Kacham P, Woodruff DP
Conference Streaming Algorithms with Large Approximation Factors 2022 • Leibniz International Proceedings in Informatics • 245: Li Y, Lin H, Woodruff DP, Zhang Y
Preprint Streaming Algorithms with Large Approximation Factors 2022 Li Y, Lin H, Woodruff DP, Zhang Y
Preprint Testing Positive Semidefiniteness Using Linear Measurements 2022 Needell D, Swartworth W, Woodruff DP
Conference Testing Positive Semidefiniteness Using Linear Measurements 2022 • Annual Symposium on Foundations of Computer Science • 87-97 Needell D, Swartworth W, Woodruff DP
Preprint The White-Box Adversarial Data Stream Model 2022 Ajtai M, Braverman V, Jayram TS, Silwal S, Sun A, Woodruff DP, Zhou S
Conference The White-Box Adversarial Data Stream Model 2022 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 15-27 Ajtai M, Braverman V, Jayram TS, Silwal S, Sun A, Woodruff DP, Zhou S
Conference Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators 2022 • Annual Symposium on Foundations of Computer Science • 1183-1196 Woodruff DP, Zhou S
Journal Article Tight Bounds for ℓ1 Oblivious Subspace Embeddings 2022 • ACM Transactions on Algorithms (TALG) • 18(1):1-32 Wang R, Woodruff DP
Preprint Triangle and Four Cycle Counting with Predictions in Graph Streams 2022 Chen JY, Eden T, Indyk P, Lin H, Narayanan S, Rubinfeld R, Silwal S, Wagner T, Woodruff DP, Zhang M
Conference TRIANGLE AND FOUR CYCLE COUNTING WITH PREDICTIONS IN GRAPH STREAMS 2022 • ICLR 2022 - 10th International Conference on Learning Representations Chen JY, Indyk P, Narayanan S, Rubinfeld R, Silwal S, Lin H, Woodruff DP, Zhang M, Wagner T, Eden T
Conference Truly Perfect Samplers for Data Streams and Sliding Windows 2022 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 29-40 Jayaram R, Woodruff DP, Zhou S
Journal Article A Framework for Adversarially Robust Streaming Algorithms 2021 • SIGMOD Record • 50(1):6-13 Ben-Eliezer O, Jayaram R, Woodruff DP, Yogev E
Preprint A Simple Proof of a New Set Disjointness with Applications to Data Streams 2021 Kamath A, Price E, Woodruff DP
Conference A simple proof of a new set disjointness with applications to data streams 2021 • Leibniz International Proceedings in Informatics • 200: Kamath A, Price E, Woodruff DP
Conference A very sketchy talk 2021 • Leibniz International Proceedings in Informatics • 198: Woodruff DP
