Richard Peng

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 116

Top Venues

CoRR

FOCS

STOC

SODA

Publications

Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. CoRR (2024)
Richard Peng, Santosh S. Vempala
Solving Sparse Linear Systems Faster than Matrix Multiplication. Commun. ACM 67 (7) (2024)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA (2024)
Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Richard Peng, Yixiang Fang, Chenhao Ma
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. CoRR (2024)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
Distance queries over dynamic interval graphs. Comput. Geom. 122 (2024)
Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. KDD (2024)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Algorithmica 85 (12) (2023)
Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
The Bit Complexity of Efficient Continuous Optimization. CoRR (2023)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR (2023)
Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang
Hardness of Graph-Structured Algebraic and Symbolic Problems. WADS (2023)
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. 52 (6) (2023)
Yiran Wu, Feiran Jia, Shaokun Zhang, Hangyu Li, Erkang Zhu, Yue Wang, Yin Tat Lee, Richard Peng, Qingyun Wu, Chi Wang
An Empirical Study on Challenging Math Problem Solving with GPT-4. CoRR (2023)
Jan Van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS (2023)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR (2023)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66 (12) (2023)
Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
Exponential Convergence of Sinkhorn Under Regularization Scheduling. ACDA (2023)
Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang
Towards Lightweight and Automated Representation Learning System for Networks. IEEE Trans. Knowl. Data Eng. 35 (9) (2023)
Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
The Bit Complexity of Efficient Continuous Optimization. FOCS (2023)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
Distance Queries over Dynamic Interval Graphs. ISAAC (2023)
Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang
Towards Lightweight and Automated Representation Learning System for Networks. CoRR (2023)
Zhiyi Huang, Chris Lambert, Zipei Nie, Richard Peng
Simpler Analyses of Union-Find. CoRR (2023)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. ITCS (2023)
Li Chen, Richard Peng, Di Wang
2-norm Flow Diffusion in Near-Linear Time. FOCS (2022)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS (2022)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR (2022)
Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
Exponential Convergence of Sinkhorn Under Regularization Scheduling. CoRR (2022)
Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
-Regression. CoRR (2022)
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR (2022)
Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC (2022)
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2022)
Richard Peng, Zhuoqing Song
Sparsified block elimination for directed laplacians. STOC (2022)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2021)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. CoRR (2021)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS (2021)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR (2021)
Richard Peng, Santosh S. Vempala
Solving Sparse Linear Systems Faster than Matrix Multiplication. SODA (2021)
Li Chen, Richard Peng, Di Wang
2-norm Flow Diffusion in Near-Linear Time. FOCS (2021)
Jiezhong Qiu, Laxman Dhulipala, Jie Tang, Richard Peng, Chi Wang
LightNE: A Lightweight Graph Processing System for Network Embedding. SIGMOD Conference (2021)
Richard Peng, Zhuoqing Song
Sparsified Block Elimination for Directed Laplacians. CoRR (2021)
Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
. CoRR (2021)
Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR (2021)
Li Chen, Richard Peng, Di Wang
-norm Flow Diffusion in Near-Linear Time. CoRR (2021)
Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng
Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$. CoRR (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
Faster Graph Embeddings via Coarsening. ICML (2020)
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR (2020)
David Durfee, John Peebles, Richard Peng, Anup B. Rao
Determinant-Preserving Sparsification of SDDM Matrices. SIAM J. Comput. 49 (4) (2020)
Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng, Jie Tang
A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices. NeurIPS (2020)
Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani
A Study of Performance of Optimal Transport. CoRR (2020)
Richard Peng, Santosh S. Vempala
Solving Sparse Linear Systems Faster than Matrix Multiplication. CoRR (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS (2020)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR (2020)
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR (2020)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS (2020)
Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. SODA (2020)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW (2020)
Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
Faster Graph Embeddings via Coarsening. CoRR (2020)
Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng, Jie Tang
Concentration Bounds for Co-occurrence Matrices of Markov Chains. CoRR (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
Iterative Refinement for ℓp-norm Regression. SODA (2019)
Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
Flows in almost linear time via adaptive preconditioning. STOC (2019)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR (2019)
Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. WADS (2019)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully Dynamic Spectral Vertex Sparsifiers and Applications. CoRR (2019)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR (2019)
David Durfee, Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. CoRR (2019)
Deeksha Adil, Richard Peng, Sushant Sachdeva
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. NeurIPS (2019)
Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang
Current Flow Group Closeness Centrality for Complex Networks? WWW (2019)
Deeksha Adil, Richard Peng, Sushant Sachdeva
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. CoRR (2019)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully dynamic spectral vertex sparsifiers and applications. STOC (2019)
Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
Flows in Almost Linear Time via Adaptive Preconditioning. CoRR (2019)
Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR (2019)
Brian Bullins, Richard Peng
Higher-Order Accelerated Methods for Faster Non-Smooth Optimization. CoRR (2019)
Yang P. Liu, Richard Peng, Mark Sellke
Vertex Sparsifiers for c-Edge Connectivity. CoRR (2019)
Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
-norm Regression. CoRR (2019)
J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
Dynamic Optimality Refuted - For Tournament Heaps. CoRR (2019)
Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang
Current Flow Group Closeness Centrality for Complex Networks. CoRR (2018)
Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS (2018)
Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng
Constant Arboricity Spectral Sparsifiers. CoRR (2018)
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. FOCS (2018)
Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR (2018)
Henning Meyerhenke, Richard Peng, Ilya Safro
High-Performance Graph Algorithms (Dagstuhl Seminar 18241). Dagstuhl Reports 8 (6) (2018)
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. CoRR (2018)
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR (2018)
Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
Incomplete nested dissection. STOC (2018)
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. FOCS (2018)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully Dynamic Effective Resistances. CoRR (2018)
Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
Incomplete Nested Dissection. CoRR (2018)
Meng He, Richard Peng, Yinzhan Xu
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO (2018)
Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva
A Framework for Analyzing Resparsification Algorithms. SODA (2017)
Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani
Density Independent Algorithms for Sparsifying k-Step Random Walks. CoRR (2017)
Richard Peng, He Sun, Luca Zanetti
Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. 46 (2) (2017)
Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
Offline Dynamic Higher Connectivity. CoRR (2017)
Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC (2017)
Tung Mai, Richard Peng, Anup B. Rao, Vijay V. Vazirani
Concave Flow on Small Depth Directed Networks. CoRR (2017)
David Durfee, John Peebles, Richard Peng, Anup B. Rao
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. FOCS (2017)
David Durfee, John Peebles, Richard Peng, Anup B. Rao
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. CoRR (2017)

Richard Peng.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard Peng