Twice-Ramanujan sparsifiers
From MaRDI portal
Recommendations
Cited in
(69)- Random projections for Bayesian regression
- The Marcinkiewicz-type discretization theorems
- Entropy numbers and Marcinkiewicz-type discretization
- Upper and lower bounds for matrix discrepancy
- Interlacing families. III: Sharper restricted invertibility estimates
- Four deviations suffice for rank 1 matrices
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- On the convergence of the extremal eigenvalues of empirical covariance matrices with dependence
- Zonoids and sparsification of quantum measurements
- Remarks on sampling discretization of integral norms of functions
- Faster cut sparsification of weighted graphs
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
- Graphs, vectors, and matrices
- Enhancing pure-pixel identification performance via preconditioning
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- On-line balancing of random inputs
- Approximation algorithms for \(D\)-optimal design
- Lunin's method for selecting large submatrices with small norm
- Covariance estimation for distributions with \({2+\varepsilon}\) moments
- Dimension reduction for finite trees in _1
- Minimum cuts and sparsification in hypergraphs
- Constructing linear-sized spectral sparsification in almost-linear time
- Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
- Restricted invertibility revisited
- Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
- On computationally tractable selection of experiments in measurement-constrained regression models
- Resilience: a criterion for learning in the presence of arbitrary outliers
- Shape simplification through graph sparsification
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Hamiltonian sparsification and gap-simulation
- Sparsification of Binary CSPs
- Optimal short cycle decomposition in almost linear time
- A Local Search Framework for Experimental Design
- A Spectral Approach to Network Design
- Twice-Ramanujan sparsifiers
- Twice-Ramanujan sparsifiers
- Integral norm discretization and related problems
- Sparsification of binary CSPs
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Towards resistance sparsifiers
- The legacy of Jean Bourgain in geometric functional analysis
- Continuous quantitative Helly-type results
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Comparison of matrix norm sparsification
- The algebraic structure of the densification and the sparsification tasks for CSPs
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- Universal sampling discretization
- Geometric bounds on the fastest mixing Markov chain
- Exact discretization, tight frames and recovery via D-optimal designs
- Better sparsifiers for directed Eulerian graphs
- Turning big data into tiny data: coresets for unsupervised learning problems
- Online Lewis weight sampling
- A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
- Zero-one laws for random feasibility problems
- Is the algorithmic Kadison-Singer problem hard?
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Accuracy and stability of CUR decompositions with oversampling
- Eldan's stochastic localization and the KLS conjecture: isoperimetry, concentration and mixing
- Sparsification of directed graphs via cut balance
- Sublinear time hypergraph sparsification via cut and edge sampling queries
- The structure of minimum vertex cuts
- Interlacing polynomial method for matrix approximation via generalized column and row selection
- Subset selection for matrices in spectral norm
- Efficient contractions of dynamic graphs -- with applications
- Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs
This page was built for publication: Twice-Ramanujan sparsifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910582)
