The following pages link to Richard Peng (Q487265):
Displaying 35 items.
- Faster spectral sparsification and numerical algorithms for SDD matrices (Q89555) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- A generalized Cheeger inequality (Q2693705) (← links)
- (Q2904768) (← links)
- L <sub>p</sub> Row Sampling by Lewis Weights (Q2941506) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- Uniform Sampling for Matrix Approximation (Q2989029) (← links)
- Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time (Q4575714) (← links)
- A Framework for Analyzing Resparsification Algorithms (Q4575880) (← links)
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
- Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds (Q5146852) (← links)
- Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts (Q5195102) (← links)
- Fully dynamic spectral vertex sparsifiers and applications (Q5212832) (← links)
- Iterative Refinement for <i>ℓ<sub>p</sub></i>-norm Regression (Q5236270) (← links)
- An efficient parallel solver for SDD linear systems (Q5259567) (← links)
- Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time (Q5259568) (← links)
- Sparsified Cholesky and multigrid solvers for connection laplacians (Q5361884) (← links)
- (Q5365147) (← links)
- Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball (Q5383974) (← links)
- Approximation algorithms for speeding up dynamic programming and denoising aCGH data (Q5406242) (← links)
- Faster approximate multicommodity flow using quadratically coupled flows (Q5415461) (← links)
- Approaching Optimality for Solving SDD Linear Systems (Q5419043) (← links)
- A Nearly-m log n Time Solver for SDD Linear Systems (Q5495033) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- Approximate Maximum Flow on Separable Undirected Graphs (Q5741792) (← links)
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5891737) (← links)
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5894040) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time (Q6575077) (← links)
- Distance queries over dynamic interval graphs (Q6577442) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6610339) (← links)
- Incremental approximate maximum flow on undirected graphs in subpolynomial update time (Q6645467) (← links)
