Richard Peng

Available identifiers

zbMath Open peng.richardMaRDI QIDQ487265

List of research outcomes

Publication	Date of Publication	Type
Hardness of graph-structured algebraic and symbolic problems	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6147280	2024-01-15	Paper
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions	2023-12-19	Paper
A combinatorial cut-toggling algorithm for solving Laplacian linear systems	2023-12-13	Paper
Sparsified block elimination for directed laplacians	2023-12-08	Paper
A generalized Cheeger inequality	2023-03-24	Paper
Density Independent Algorithms for Sparsifying k-Step Random Walks	2021-07-28	Paper
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds	2021-02-02	Paper
Determinant-Preserving Sparsification of SDDM Matrices	2020-08-25	Paper
A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices	2020-08-06	Paper
Fully dynamic spectral vertex sparsifiers and applications	2020-01-30	Paper
Iterative Refinement for ℓp-norm Regression	2019-10-15	Paper
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts	2019-09-18	Paper
Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball	2019-06-20	Paper
Approximate Maximum Flow on Separable Undirected Graphs	2019-05-15	Paper
Faster spectral sparsification and numerical algorithms for SDD matrices	2018-10-30	Paper
Approximate Undirected Maximum Flows in O(mpolylog(n)) Time	2018-07-16	Paper
A Framework for Analyzing Resparsification Algorithms	2018-07-16	Paper
Sparsified Cholesky and multigrid solvers for connection laplacians	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5365147	2017-09-29	Paper
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs	2017-08-17	Paper
Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2017-05-30	Paper
Uniform Sampling for Matrix Approximation	2017-05-19	Paper
Runtime guarantees for regression problems	2017-05-16	Paper
L p Row Sampling by Lewis Weights	2015-08-21	Paper
An efficient parallel solver for SDD linear systems	2015-06-26	Paper
Solving SDD linear systems in nearly m log 1/2 n time	2015-06-26	Paper
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs	2015-01-19	Paper
A Nearly-m log n Time Solver for SDD Linear Systems	2014-07-30	Paper
Approaching Optimality for Solving SDD Linear Systems	2014-06-04	Paper
Faster approximate multicommodity flow using quadratically coupled flows	2014-05-13	Paper
Approximation algorithms for speeding up dynamic programming and denoising aCGH data	2014-04-01	Paper
Faster spectral sparsification and numerical algorithms for SDD matrices	2012-09-26	Paper
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning	2012-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q2904768	2012-08-23	Paper
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning	2011-01-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Richard Peng