Richard Peng

According to our database1, Richard Peng authored at least 79 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Vertex Sparsifiers for c-Edge Connectivity.
CoRR, 2019

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
CoRR, 2019

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.
CoRR, 2019

Flowless: Extracting Densest Subgraphs Without Flow Computations.
CoRR, 2019

Dynamic Optimality Refuted - For Tournament Heaps.
CoRR, 2019

Higher-Order Accelerated Methods for Faster Non-Smooth Optimization.
CoRR, 2019

Iterative Refinement for 𝓁p-norm Regression.
CoRR, 2019

Current Flow Group Closeness Centrality for Complex Networks?
Proceedings of the World Wide Web Conference, 2019

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Flows in almost linear time via adaptive preconditioning.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fully dynamic spectral vertex sparsifiers and applications.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Iterative Refinement for ℓp-norm Regression.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
High-Performance Graph Algorithms (Dagstuhl Seminar 18241).
Dagstuhl Reports, 2018

Constant Arboricity Spectral Sparsifiers.
CoRR, 2018

Fully Dynamic Effective Resistances.
CoRR, 2018

Incomplete nested dissection.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
SIAM J. Comput., 2017

On Computing Min-Degree Elimination Orderings.
CoRR, 2017

Offline Dynamic Higher Connectivity.
CoRR, 2017

Concave Flow on Small Depth Directed Networks.
CoRR, 2017

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

A Framework for Analyzing Resparsification Algorithms.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Density Independent Algorithms for Sparsifying k-Step Random Walks.
Proceedings of the Approximation, 2017

2016
Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices.
ACM Trans. Algorithms, 2016

Scalable Constrained Clustering: A Generalized Spectral Method.
CoRR, 2016

Sparsified Cholesky and multigrid solvers for connection laplacians.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Approximate Undirected Maximum Flows in O(mpolylog(n)) Time.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

An Empirical Study of Cycle Toggling Based Laplacian Solvers.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

On Fully Dynamic Graph Sparsifiers.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Simple and Scalable Constrained Clustering: a Generalized Spectral Method.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Sparsified Cholesky Solvers for SDD linear systems.
CoRR, 2015

Spectral Sparsification of Random-Walk Matrix Polynomials.
CoRR, 2015

Lp Row Sampling by Lewis Weights.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Improved Parallel Algorithms for Spanners and Hopsets.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Uniform Sampling for Matrix Approximation.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Approaching Optimality for Solving SDD Linear Systems.
SIAM J. Comput., 2014

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.
Theory Comput. Syst., 2014

Partitioning Well-Clustered Graphs with k-Means and Heat Kernel.
CoRR, 2014

A Note on Cut-Approximators and Approximating Undirected Max Flows.
CoRR, 2014

A Generalized Cheeger Inequality.
CoRR, 2014

Stretching Stretch.
CoRR, 2014

Preconditioning in Expectation.
CoRR, 2014

Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models.
CoRR, 2014

An efficient parallel solver for SDD linear systems.
Proceedings of the Symposium on Theory of Computing, 2014

Solving SDD linear systems in nearly mlog1/2n time.
Proceedings of the Symposium on Theory of Computing, 2014

Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Fully Dynamic $(1+ε)$-Approximate Matchings
CoRR, 2013

Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work.
CoRR, 2013

Parallel graph decompositions using random shifts.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Approximate Maximum Flow on Separable Undirected Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Runtime guarantees for regression problems.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Iterative Row Sampling.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Fully Dynamic (1+ e)-Approximate Matchings.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.
Internet Mathematics, 2012

Iterative Approaches to Row Sampling
CoRR, 2012

A fast solver for a class of linear systems.
Commun. ACM, 2012

Faster approximate multicommodity flow using quadratically coupled flows.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Faster and simpler width-independent parallel algorithms for positive semidefinite programming.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011
Approximation algorithms for speeding up dynamic programming and denoising aCGH data.
ACM Journal of Experimental Algorithmics, 2011

Electrical Flow Algorithms for Total Variation Minimization
CoRR, 2011

Solving SDD linear systems in time Õ(mlog nlog(1/ε))
CoRR, 2011

Linear-work greedy parallel approximate set cover and variants.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Nearly-m log n Time Solver for SDD Linear Systems.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Approximate Dynamic Programming for Fast Denoising of aCGH Data
CoRR, 2010

Approaching optimality for solving SDD systems
CoRR, 2010


  Loading...