David Woodruff

Distributed Algorithms for Euclidean Clustering

Consistent Low-Rank Approximation

SVD Provably Denoises Nearest Neighbor Data

Learning-Augmented Moment Estimation on Time-Decay Models

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams

Sublinear Time Quantum Sensitivity Sampling

Better Bounds for the Distributed Experts Problem

Sketching Faster than Dimension Times Update Time

High Probability Streaming Lower Bounds for $F_2$ Estimation

JEPA-Reasoner: Generative Latent Space Reasoner

Efficient Attention via Pre-Scoring: Prioritizing Informative Keys in Transformers

Data Selection and Active Learning via Low-Rank Approximation

On Differential Privacy for Adaptively Solving Search Problems via Sketching

Streaming Algorithms For $\ell_p$ Flows and $\ell_p$ Regression

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph

Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity

Robust Sparsification via Sensitivity

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors

On Fine-Grained Distinct Element Estimation

LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures