Richard Peng
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
14
Active years
2010–2024
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | KDD | Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. | Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma |
| 2024 | SODA | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | FOCS | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | FOCS | The Bit Complexity of Efficient Continuous Optimization. | Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala |
| 2023 | ISAAC | Distance Queries over Dynamic Interval Graphs. | Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2023 | WADS | Hardness of Graph-Structured Algebraic and Symbolic Problems. | Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang |
| 2022 | FOCS | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | SODA | Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. | Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye |
| 2022 | STOC | Faster maxflow via improved dynamic spectral vertex sparsifiers. | Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford |
| 2022 | STOC | Sparsified block elimination for directed laplacians. | Richard Peng, Zhuoqing Song |
| 2021 | FOCS | 2-norm Flow Diffusion in Near-Linear Time. | Li Chen, Richard Peng, Di Wang |
| 2021 | FOCS | Minor Sparsifiers and the Distributed Laplacian Paradigm. | Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye |
| 2021 | FOCS | Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. | Yu Gao, Yang P. Liu, Richard Peng |
| 2021 | SIGMOD | LightNE: A Lightweight Graph Processing System for Network Embedding. | Jiezhong Qiu, Laxman Dhulipala, Jie Tang, Richard Peng, Chi Wang |
| 2021 | SODA | Vertex Sparsification for Edge Connectivity. | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
| 2021 | SODA | Solving Sparse Linear Systems Faster than Matrix Multiplication. | Richard Peng, Santosh S. Vempala |
| 2020 | FOCS | Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. | Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | FOCS | Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. | Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak |
| 2020 | FOCS | A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. | Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak |
| 2020 | ICML | Faster Graph Embeddings via Coarsening. | Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang |
| 2020 | WWW | Flowless: Extracting Densest Subgraphs Without Flow Computations. | Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang |
| 2020 | SODA | Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. | Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun |
| 2019 | WWW | Current Flow Group Closeness Centrality for Complex Networks? | Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang |
| 2019 | SODA | Iterative Refinement for ℓp-norm Regression. | Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva |
| 2019 | STOC | Fully dynamic spectral vertex sparsifiers and applications. | David Durfee, Yu Gao, Gramoz Goranci, Richard Peng |
| 2019 | STOC | Flows in almost linear time via adaptive preconditioning. | Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang |
| 2019 | WADS | Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. | Richard Peng, Bryce Sandlund, Daniel Dominic Sleator |
| 2018 | FOCS | Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. | Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang |
| 2018 | FOCS | Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. | Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford |
| 2018 | FOCS | Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. | Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu |
| 2018 | STOC | Incomplete nested dissection. | Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang |
| 2017 | FOCS | Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. | David Durfee, John Peebles, Richard Peng, Anup B. Rao |
| 2017 | SODA | A Framework for Analyzing Resparsification Algorithms. | Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva |
| 2017 | STOC | Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. | Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu |
| 2016 | AISTATS | Simple and Scalable Constrained Clustering: a Generalized Spectral Method. | Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng |
| 2016 | FOCS | On Fully Dynamic Graph Sparsifiers. | Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng |
| 2016 | FOCS | Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. | Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu |
| 2016 | SODA | Approximate Undirected Maximum Flows in | Richard Peng |
| 2016 | STOC | Sparsified Cholesky and multigrid solvers for connection laplacians. | Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | COLT | Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. | Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng |
| 2015 | COLT | Partitioning Well-Clustered Graphs: Spectral Clustering Works! | Richard Peng, He Sun, Luca Zanetti |
| 2015 | KDD | Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. | Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu |
| 2015 | STOC | L | Michael B. Cohen, Richard Peng |
| 2015 | SPAA | Improved Parallel Algorithms for Spanners and Hopsets. | Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu |
| 2014 | SODA | Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. | Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington |
| 2014 | STOC | Solving SDD linear systems in nearly | Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu |
| 2014 | STOC | An efficient parallel solver for SDD linear systems. | Richard Peng, Daniel A. Spielman |
| 2013 | FOCS | Fully Dynamic (1+ e)-Approximate Matchings. | Manoj Gupta, Richard Peng |
| 2013 | FOCS | Iterative Row Sampling. | Mu Li, Gary L. Miller, Richard Peng |
| 2013 | SODA | Approximate Maximum Flow on Separable Undirected Graphs. | Gary L. Miller, Richard Peng |
| 2013 | SPAA | Parallel graph decompositions using random shifts. | Gary L. Miller, Richard Peng, Shen Chen Xu |
| 2012 | STOC | Faster approximate multicommodity flow using quadratically coupled flows. | Jonathan A. Kelner, Gary L. Miller, Richard Peng |
| 2012 | STACS | Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. | Ioannis Koutis, Alex Levin, Richard Peng |
| 2012 | SPAA | Faster and simpler width-independent parallel algorithms for positive semidefinite programming. | Richard Peng, Kanat Tangwongsan |
| 2011 | FOCS | A Nearly-m log n Time Solver for SDD Linear Systems. | Ioannis Koutis, Gary L. Miller, Richard Peng |
| 2011 | SODA | Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. | Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis |
| 2011 | SPAA | Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. | Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan |
| 2011 | SPAA | Linear-work greedy parallel approximate set cover and variants. | Guy E. Blelloch, Richard Peng, Kanat Tangwongsan |
| 2010 | FOCS | Approaching Optimality for Solving SDD Linear Systems. | Ioannis Koutis, Gary L. Miller, Richard Peng |
| 2010 | WAW | Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. | Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis |