The following pages link to David P. Woodruff (Q343862):
Displaying 50 items.
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world (Q2170129) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- On sketching quadratic forms (Q2800579) (← links)
- The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- A Tight Lower Bound for High Frequency Moment Estimation with Small Error (Q2851890) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error (Q2933656) (← links)
- (Q2934612) (← links)
- Computational Advertising: Techniques for Targeting Relevant Ads (Q2939794) (← links)
- Beyond set disjointness (Q2943615) (← links)
- Spanners and sparsifiers in dynamic streams (Q2943627) (← links)
- How does your crystal grow? A commentary on Burton, Cabrera and Frank (1951) ‘The growth of crystals and the equilibrium structure of their surfaces’ (Q2955748) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Certifying Equality With Limited Interaction. (Q2969646) (← links)
- Epistemic privacy (Q2999783) (← links)
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (Q3012848) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- Tolerant Algorithms (Q3092276) (← links)
- Optimal Random Sampling from Distributed Streams Revisited (Q3095333) (← links)
- On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation (Q3167432) (← links)
- Low-Rank Approximation and Regression in Input Sparsity Time (Q3177880) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- A Geometric Approach to Information-Theoretic Private Information Retrieval (Q3519387) (← links)
- Corruption and Recovery-Efficient Locally Decodable Codes (Q3541822) (← links)
- Optimal approximations of the frequency moments of data streams (Q3581423) (← links)
- Additive Spanners in Nearly Quadratic Time (Q3587400) (← links)
- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field (Q3588449) (← links)
- Better Approximations for the Minimum Common Integer Partition Problem (Q3595391) (← links)
- Nearly-optimal bounds for sparse recovery in generic norms, with applications to <i>k</i>-median sketching (Q4575601) (← links)
- Adaptive Matrix Vector Product (Q4575881) (← links)
- Low-Rank PSD Approximation in Input-Sparsity Time (Q4575882) (← links)
- Faster Kernel Ridge Regression Using Sketching and Preconditioning (Q4588937) (← links)
- Optimal Approximate Matrix Product in Terms of Stable Rank (Q4598143) (← links)
- Stochastic streams: sample complexity vs. space complexity (Q4606301) (← links)
- An Optimal Algorithm for ℓ <sub>1</sub> -Heavy Hitters in Insertion Streams and Related Problems (Q4629972) (← links)
- (Q4633906) (← links)
- (Q4636472) (← links)
- (Q4737241) (← links)
- Transitive-Closure Spanners (Q4910569) (← links)
- (Q4967174) (← links)
- Low rank approximation with entrywise l <sub>1</sub> -norm error (Q4978015) (← links)
- Matrix completion and related problems via strong duality (Q4993268) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
