The following pages link to David P. Woodruff (Q343862):
Displaying 50 items.
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- Revisiting frequency moment estimation in random order streams (Q5002695) (← links)
- High Probability Frequency Moment Sketches (Q5002734) (← links)
- Improved Algorithms for Adaptive Compressed Sensing (Q5002771) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- (Q5009507) (← links)
- On Low-Risk Heavy Hitters and Sparse Recovery Schemes (Q5009511) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
- Querying a Matrix through Matrix-Vector Products (Q5035875) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5088943) (← links)
- (Q5091167) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- (Q5091258) (← links)
- (Q5111390) (← links)
- Embeddings of Schatten Norms with Applications to Data Streams (Q5111391) (← links)
- Non-adaptive adaptive sampling on turnstile streams (Q5145008) (← links)
- Oblivious Sketching of High-Degree Polynomial Kernels (Q5146770) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5146880) (← links)
- The Communication Complexity of Optimization (Q5146886) (← links)
- Efficient Sketches for Earth-Mover Distance, with Applications (Q5171183) (← links)
- The Data Stream Space Complexity of Cascaded Norms (Q5171206) (← links)
- Numerical linear algebra in the streaming model (Q5172714) (← links)
- (Q5214187) (← links)
- Testing Matrix Rank, Optimally (Q5236228) (← links)
- A PTAS for <i>ℓ<sub>p</sub></i>-Low Rank Approximation (Q5236230) (← links)
- Tight Bounds for <i>ℓ<sub>p</sub></i> Oblivious Subspace Embeddings (Q5236294) (← links)
- Relative Error Tensor Low Rank Approximation (Q5236363) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Turnstile streaming algorithms might as well be linear sketches (Q5259551) (← links)
- New Algorithms for Heavy Hitters in Data Streams (Invited Talk) (Q5276182) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311531) (← links)
- Tight Bounds for Graph Problems in Insertion Streams (Q5351915) (← links)
- Optimal principal component analysis in distributed and streaming models (Q5361833) (← links)
- Weighted low rank approximations with provable guarantees (Q5361834) (← links)
- On approximating functions of the singular values in a stream (Q5361874) (← links)
- Beating CountSketch for heavy hitters in insertion streams (Q5361876) (← links)
- Communication lower bounds for statistical estimation problems via a distributed data processing inequality (Q5361898) (← links)
- Sketching for <i>M</i>-Estimators: A Unified Approach to Robust Regression (Q5363041) (← links)
- (Q5365016) (← links)
- (Q5368755) (← links)
- An Optimal Lower Bound for Distinct Elements in the Message Passing Model (Q5384015) (← links)
- On Sketching Matrix Norms and the Top Singular Vector (Q5384076) (← links)
- Practical Cryptography in High Dimensional Tori (Q5385732) (← links)
- Sublinear optimization for machine learning (Q5395692) (← links)
- (Q5405231) (← links)
- Tight bounds for distributed functional monitoring (Q5415527) (← links)
- (Q5417655) (← links)
- (Q5417696) (← links)
- (Q5417697) (← links)
