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
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
Preprint The White-Box Adversarial Data Stream Model 2022 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
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
Preprint A Simple Proof of a New Set Disjointness with Applications to Data Streams 2021 Kamath A, Price E, Woodruff DP
Conference A very sketchy talk 2021 • Leibniz International Proceedings in Informatics • 198: Woodruff DP
Preprint Active Linear Regression for $\ell_p$ Norms and Beyond 2021 Musco C, Musco C, Woodruff DP, Yasuda T
Preprint An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes 2021 Baweja A, Jia J, Woodruff DP
Conference Average-Case Communication Complexity of Statistical Problems 2021 • Proceedings of Machine Learning Research • 134:3859-3886 Rashtchian C, Woodruff DP, Ye P, Zhu H
Preprint Average-Case Communication Complexity of Statistical Problems 2021 Rashtchian C, Woodruff DP, Ye P, Zhu H
Conference Dimensionality Reduction for Sum-of-Distances Metric 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Peng Z, Kacham P, Woodruff DP
Conference Exponentially Improved Dimensionality Reduction for l<sub>1</sub>: Subspace Embeddings and Independence Testing 2021 • CONFERENCE ON LEARNING THEORY, VOL 134 • 134: Li Y, Woodruff DP, Yasuda T
Conference Fast Sketching of Polynomial Kernels of Polynomial Degree 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Song Z, Woodruff DP, Yu Z, Zhang L
Preprint Fast Sketching of Polynomial Kernels of Polynomial Degree 2021 Song Z, Woodruff DP, Yu Z, Zhang L
Conference Few-Shot Data-Driven Algorithms for Low Rank Approximation 2021 • Advances in Neural Information Processing Systems • 13:10678-10690 Indyk P, Wagner T, Woodruff DP
