The following pages link to Twice-ramanujan sparsifiers (Q5172719):
Displaying 30 items.
- Controlling the least eigenvalue of a random Gram matrix (Q286141) (← links)
- Constructing all self-adjoint matrices with prescribed spectrum and diagonal (Q380995) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- Extracting a basis with fixed block inside a matrix (Q486196) (← links)
- Random approximation and the vertex index of convex bodies (Q515532) (← links)
- Quantitative Helly-type theorem for the diameter of convex sets (Q517461) (← links)
- An elementary proof of the restricted invertibility theorem (Q1760392) (← links)
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering (Q2056927) (← links)
- On the convergence of the extremal eigenvalues of empirical covariance matrices with dependence (Q2413247) (← links)
- On the sum of a Sobolev space and a weighted \(L_p\)-space (Q2437519) (← links)
- A few remarks on sampling of signals with small spectrum (Q2446185) (← links)
- Sobolev extension by linear operators (Q2862635) (← links)
- Deterministic algorithms for matrix completion (Q2925527) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- BRASCAMP–LIEB INEQUALITY AND QUANTITATIVE VERSIONS OF HELLY'S THEOREM (Q2970179) (← links)
- Tight embedding of subspaces of 𝐿_{𝑝} in ℓ_{𝑝}ⁿ for even 𝑝 (Q3104462) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Small Ball Probability for the Condition Number of Random Matrices (Q5115964) (← links)
- (Q5149239) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Feature Selection for Ridge Regression with Provable Guarantees (Q5380416) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- (Q5743376) (← links)
- (Q5743377) (← links)
- Constructive subsampling of finite frames with applications in optimal function recovery (Q6038824) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- On Sufficient Conditions in the Marchenko--Pastur Theorem (Q6153532) (← links)
- Randomized least-squares with minimal oversampling and interpolation in general spaces (Q6573780) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
