The following pages link to David P. Woodruff (Q343862):
Displaying 42 items.
- Lower Bounds for Sparse Recovery (Q5417699) (← links)
- Near-optimal private approximation protocols via a black box transformation (Q5419144) (← links)
- Fast moment estimation in data streams in optimal space (Q5419145) (← links)
- Subspace embeddings for the L <sub>1</sub> -norm with applications (Q5419146) (← links)
- Revisiting the Efficiency of Malicious Two-Party Computation (Q5429384) (← links)
- On the Power of Adaptivity in Sparse Recovery (Q5495018) (← links)
- (1 + eps)-Approximate Sparse Recovery (Q5495019) (← links)
- How robust are linear sketches to adaptive inputs? (Q5495782) (← links)
- (Q5501255) (← links)
- Lower Bounds for Adaptive Sparse Recovery (Q5741755) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)
- Fast Algorithms for the Free Riders Problem in Broadcast Encryption (Q5756653) (← links)
- Perfect $L_p$ Sampling in a Data Stream (Q5858643) (← links)
- (Q5875452) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- (Q5875784) (← links)
- Pseudo-Deterministic Streaming. (Q5875786) (← links)
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners (Q5891744) (← links)
- Theory of Cryptography (Q5898358) (← links)
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners (Q5901180) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- The Product of Gaussian Matrices is Close to Gaussian (Q6070378) (← links)
- Low-rank approximation with <i> 1/𝜖 <sup>1/3</sup> </i> matrix-vector products (Q6083565) (← links)
- Streaming Complexity of SVMs (Q6084413) (← links)
- (Q6115400) (← links)
- (Q6126241) (← links)
- (Q6126334) (← links)
- (Q6138070) (← links)
- The Query Complexity of Mastermind with $\ell_p$ Distances (Q6325851) (← links)
- Distributed Low Rank Approximation of Implicit Functions of a Matrix (Q6511669) (← links)
- The \(\ell_p\)-subspace sketch problem in small dimensions with applications to support vector machines (Q6538562) (← links)
- Near-linear sample complexity for \(L_p\) polynomial regression (Q6538687) (← links)
- Optimal algorithms for linear algebra in the current matrix multiplication time (Q6538688) (← links)
- Online Lewis weight sampling (Q6538704) (← links)
- Recovery from non-decomposable distance oracles (Q6574979) (← links)
- Frequency estimation with one-sided error (Q6575103) (← links)
- Improved algorithms for low rank approximation from sparsity (Q6575169) (← links)
- Near-optimal algorithms for linear algebra in the current matrix multiplication time (Q6575198) (← links)
- Streaming algorithms with large approximation factors (Q6591863) (← links)
- Adaptive sketches for robust regression with importance sampling (Q6591881) (← links)
- Recovery from non-decomposable distance oracles (Q6610344) (← links)
