Richard Peng - RankMe

179 papers A* 50A 5B 8C 1Journal 107Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop. CoRR Noah Amsel, Yves Baumann, Paul Beckman, Peter Bürgisser, Chris Camaño, Tyler Chen, Edmond Chow, Anil Damle, Michal Derezinski, Mark Embree, Ethan N. Epperly, Robert D. Falgout, Mark Fornace, Anne Greenbaum, Chen Greif, Diana Halikias, Zhen Huang, Elias Jarlebring, Yiannis Koutis, Daniel Kressner, Rasmus Kyng, Jörg Liesen, Jackie Lok, Raphael A. Meyer, Yuji Nakatsukasa, Kate Pearce, Richard Peng, David Persson, Elizaveta Rebrova, Ryan Schneider, Rikhav Shah, Edgar Solomonik, Nikhil Srivastava, Alex Townsend, Robert J. Webber, Jess Williams
2025	J	`jnl`	Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization. CoRR Yang P. Liu, Richard Peng, Colin Tang, Albert Weng, Junzhao Yang
2025	J	`jnl`	Approximate Spanning Tree Counting from Uncorrelated Edge Sets. CoRR Yang P. Liu, Richard Peng, Junzhao Yang
2025	J	`jnl`	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. Proc. VLDB Endow. Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Qingyu Shi, Richard Peng, Yixiang Fang, Chenhao Ma
2025	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. J. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2025	J	`jnl`	Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. J. ACM Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Sushant Sachdeva, Richard Peng, Guanghao Ye
2025	J	`jnl`	Shortening the Path to Designing Efficient Graph Algorithms. Commun. ACM Richard Peng
2025	J	`jnl`	Solving Sparse Linear Systems Faster than Matrix Multiplication. J. ACM Richard Peng, Santosh S. Vempala
2024	J	`jnl`	Distance queries over dynamic interval graphs. Comput. Geom. Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2024	J	`jnl`	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. CoRR Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Richard Peng, Yixiang Fang, Chenhao Ma
2024	J	`jnl`	Entrywise Approximate Laplacian Solving. CoRR Jingbang Chen, Mehrdad Ghadiri, Hoai-An Nguyen, Richard Peng, Junzhao Yang
2024	J	`jnl`	Fast Algorithms for J. ACM Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2024	—	`conf`	Graph Convolutional Networks for Learning Laplace-Beltrami Operators. GRaM Yingying Wu, Roger Fu, Richard Peng, Qifeng Chen
2024	A*	`conf`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2024	A*	`conf`	Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. KDD Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma
2024	J	`jnl`	Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. CoRR Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma
2024	J	`jnl`	Solving Sparse Linear Systems Faster than Matrix Multiplication. Commun. ACM Richard Peng, Santosh S. Vempala
2023	A	`conf`	A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. ITCS Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2023	J	`jnl`	A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Algorithmica Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2023	A*	`conf`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	J	`jnl`	An Empirical Study on Challenging Math Problem Solving with GPT-4. CoRR Yiran Wu, Feiran Jia, Shaokun Zhang, Hangyu Li, Erkang Zhu, Yue Wang, Yin Tat Lee, Richard Peng, Qingyun Wu, Chi Wang
2023	B	`conf`	Distance Queries over Dynamic Interval Graphs. ISAAC Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2023	—	`conf`	Exponential Convergence of Sinkhorn Under Regularization Scheduling. ACDA Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
2023	J	`jnl`	Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
2023	B	`conf`	Hardness of Graph-Structured Algebraic and Symbolic Problems. WADS Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang
2023	J	`jnl`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	Simpler Analyses of Union-Find. CoRR Zhiyi Huang, Chris Lambert, Zipei Nie, Richard Peng
2023	A*	`conf`	The Bit Complexity of Efficient Continuous Optimization. FOCS Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
2023	J	`jnl`	The Bit Complexity of Efficient Continuous Optimization. CoRR Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
2023	J	`jnl`	Towards Lightweight and Automated Representation Learning System for Networks. CoRR Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang
2023	J	`jnl`	Towards Lightweight and Automated Representation Learning System for Networks. IEEE Trans. Knowl. Data Eng. Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang
2022	J	`jnl`	Exponential Convergence of Sinkhorn Under Regularization Scheduling. CoRR Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
2022	J	`jnl`	Fast Algorithms for 𝓁 CoRR Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2022	A*	`conf`	Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2022	A*	`conf`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	A*	`conf`	Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2022	J	`jnl`	Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2022	A*	`conf`	Sparsified block elimination for directed laplacians. STOC Richard Peng, Zhuoqing Song
2021	A*	`conf`	2-norm Flow Diffusion in Near-Linear Time. FOCS Li Chen, Richard Peng, Di Wang
2021	J	`jnl`	Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. CoRR Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2021	J	`jnl`	Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2021	A*	`conf`	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS Yu Gao, Yang P. Liu, Richard Peng
2021	J	`jnl`	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR Yu Gao, Yang P. Liu, Richard Peng
2021	—	`conf`	LightNE: A Lightweight Graph Processing System for Network Embedding. SIGMOD Conference Jiezhong Qiu, Laxman Dhulipala, Jie Tang, Richard Peng, Chi Wang
2021	A*	`conf`	Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2021	A*	`conf`	Solving Sparse Linear Systems Faster than Matrix Multiplication. SODA Richard Peng, Santosh S. Vempala
2021	J	`jnl`	Sparse Regression Faster than d CoRR Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
2021	J	`jnl`	Sparsified Block Elimination for Directed Laplacians. CoRR Richard Peng, Zhuoqing Song
2021	J	`jnl`	Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$. CoRR Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng
2021	A*	`conf`	Vertex Sparsification for Edge Connectivity. SODA Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2021	J	`jnl`	𝓁 CoRR Li Chen, Richard Peng, Di Wang
2020	A*	`conf`	A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2020	A*	`conf`	A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices. NeurIPS Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng, Jie Tang
2020	J	`jnl`	A Study of Performance of Optimal Transport. CoRR Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani
2020	A*	`conf`	Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2020	J	`jnl`	Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2020	J	`jnl`	Concentration Bounds for Co-occurrence Matrices of Markov Chains. CoRR Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng, Jie Tang
2020	J	`jnl`	Determinant-Preserving Sparsification of SDDM Matrices. SIAM J. Comput. David Durfee, John Peebles, Richard Peng, Anup B. Rao
2020	A*	`conf`	Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020	J	`jnl`	Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020	A*	`conf`	Faster Graph Embeddings via Coarsening. ICML Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
2020	J	`jnl`	Faster Graph Embeddings via Coarsening. CoRR Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
2020	A*	`conf`	Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
2020	J	`jnl`	Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2020	A*	`conf`	Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. SODA Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
2020	J	`jnl`	Solving Sparse Linear Systems Faster than Matrix Multiplication. CoRR Richard Peng, Santosh S. Vempala
2020	J	`jnl`	Vertex Sparsification for Edge Connectivity. CoRR Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2019	J	`jnl`	A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2019	A*	`conf`	Current Flow Group Closeness Centrality for Complex Networks? WWW Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang
2019	J	`jnl`	Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019	J	`jnl`	Dynamic Optimality Refuted - For Tournament Heaps. CoRR J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
2019	A*	`conf`	Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. NeurIPS Deeksha Adil, Richard Peng, Sushant Sachdeva
2019	J	`jnl`	Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. CoRR Deeksha Adil, Richard Peng, Sushant Sachdeva
2019	J	`jnl`	Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
2019	J	`jnl`	Flows in Almost Linear Time via Adaptive Preconditioning. CoRR Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
2019	A*	`conf`	Flows in almost linear time via adaptive preconditioning. STOC Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
2019	J	`jnl`	Fully Dynamic Spectral Vertex Sparsifiers and Applications. CoRR David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
2019	A*	`conf`	Fully dynamic spectral vertex sparsifiers and applications. STOC David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
2019	J	`jnl`	Higher-Order Accelerated Methods for Faster Non-Smooth Optimization. CoRR Brian Bullins, Richard Peng
2019	A*	`conf`	Iterative Refinement for ℓp-norm Regression. SODA Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2019	J	`jnl`	Iterative Refinement for 𝓁 CoRR Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2019	B	`conf`	Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. WADS Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
2019	J	`jnl`	Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. CoRR David Durfee, Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun
2019	J	`jnl`	Vertex Sparsifiers for c-Edge Connectivity. CoRR Yang P. Liu, Richard Peng, Mark Sellke
2018	J	`jnl`	Constant Arboricity Spectral Sparsifiers. CoRR Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng
2018	J	`jnl`	Current Flow Group Closeness Centrality for Complex Networks. CoRR Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang
2018	J	`jnl`	Fully Dynamic Effective Resistances. CoRR David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
2018	J	`jnl`	Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. CoRR Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2018	A*	`conf`	Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. FOCS Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2018	A*	`conf`	Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. FOCS Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
2018	J	`jnl`	Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
2018	J	`jnl`	High-Performance Graph Algorithms (Dagstuhl Seminar 18241). Dagstuhl Reports Henning Meyerhenke, Richard Peng, Ilya Safro
2018	J	`jnl`	Incomplete Nested Dissection. CoRR Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
2018	A*	`conf`	Incomplete nested dissection. STOC Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
2018	—	`conf`	Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO Meng He, Richard Peng, Yinzhan Xu
2018	A*	`conf`	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
2018	J	`jnl`	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
2017	A*	`conf`	A Framework for Analyzing Resparsification Algorithms. SODA Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva
2017	A*	`conf`	Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu
2017	J	`jnl`	Concave Flow on Small Depth Directed Networks. CoRR Tung Mai, Richard Peng, Anup B. Rao, Vijay V. Vazirani
2017	—	`conf`	Density Independent Algorithms for Sparsifying k-Step Random Walks. APPROX-RANDOM Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani
2017	J	`jnl`	Density Independent Algorithms for Sparsifying k-Step Random Walks. CoRR Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani
2017	A*	`conf`	Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. FOCS David Durfee, John Peebles, Richard Peng, Anup B. Rao
2017	J	`jnl`	Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. CoRR David Durfee, John Peebles, Richard Peng, Anup B. Rao
2017	J	`jnl`	Offline Dynamic Higher Connectivity. CoRR Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
2017	J	`jnl`	On Computing Min-Degree Elimination Orderings. CoRR Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
2017	J	`jnl`	Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. Richard Peng, He Sun, Luca Zanetti
2016	J	`jnl`	A Framework for Analyzing Resparsification Algorithms. CoRR Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva
2016	J	`jnl`	Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. CoRR Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu
2016	—	`conf`	An Empirical Study of Cycle Toggling Based Laplacian Solvers. CSC Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu
2016	J	`jnl`	An Empirical Study of Cycle Toggling Based Laplacian Solvers. CoRR Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, Shen Chen Xu
2016	A*	`conf`	Approximate Undirected Maximum Flows in SODA Richard Peng
2016	A*	`conf`	Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu
2016	J	`jnl`	Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. CoRR Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu
2016	J	`jnl`	Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices. ACM Trans. Algorithms Ioannis Koutis, Alex Levin, Richard Peng
2016	A*	`conf`	On Fully Dynamic Graph Sparsifiers. FOCS Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng
2016	J	`jnl`	On Fully Dynamic Graph Sparsifiers. CoRR Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng
2016	—	`conf`	SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling. NIPS Dehua Cheng, Richard Peng, Yan Liu, Ioakeim Perros
2016	J	`jnl`	Scalable Constrained Clustering: A Generalized Spectral Method. CoRR Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng
2016	A	`conf`	Simple and Scalable Constrained Clustering: a Generalized Spectral Method. AISTATS Mihai Cucuringu, Ioannis Koutis, Sanjay Chawla, Gary L. Miller, Richard Peng
2016	A*	`conf`	Sparsified Cholesky and multigrid solvers for connection laplacians. STOC Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
2015	A*	`conf`	Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. COLT Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2015	B	`conf`	Improved Parallel Algorithms for Spanners and Hopsets. SPAA Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu
2015	A*	`conf`	L STOC Michael B. Cohen, Richard Peng
2015	A*	`conf`	Partitioning Well-Clustered Graphs: Spectral Clustering Works! COLT Richard Peng, He Sun, Luca Zanetti
2015	A*	`conf`	Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu
2015	J	`jnl`	Sparsified Cholesky Solvers for SDD linear systems. CoRR Yin Tat Lee, Richard Peng, Daniel A. Spielman
2015	J	`jnl`	Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. CoRR Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
2015	J	`jnl`	Spectral Sparsification of Random-Walk Matrix Polynomials. CoRR Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2015	A	`conf`	Uniform Sampling for Matrix Approximation. ITCS Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford
2014	J	`jnl`	A Generalized Cheeger Inequality. CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2014	J	`jnl`	A Note on Cut-Approximators and Approximating Undirected Max Flows. CoRR Richard Peng
2014	A*	`conf`	An efficient parallel solver for SDD linear systems. STOC Richard Peng, Daniel A. Spielman
2014	J	`jnl`	Approaching Optimality for Solving SDD Linear Systems. SIAM J. Comput. Ioannis Koutis, Gary L. Miller, Richard Peng
2014	J	`jnl`	Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2014	J	`jnl`	Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. CoRR Richard Peng, He Sun, Luca Zanetti
2014	J	`jnl`	Preconditioning in Expectation. CoRR Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao
2014	J	`jnl`	Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models. CoRR Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2014	A*	`conf`	Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. SODA Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington
2014	A*	`conf`	Solving SDD linear systems in nearly STOC Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu
2014	J	`jnl`	Stretching Stretch. CoRR Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu
2014	J	`jnl`	Uniform Sampling for Matrix Approximation. CoRR Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford
2014	J	`jnl`	ℓ CoRR Michael B. Cohen, Richard Peng
2013	—	`—`	Algorithm Design Using Spectral Graph Theory. Richard Peng
2013	J	`jnl`	An Efficient Parallel Solver for SDD Linear Systems. CoRR Richard Peng, Daniel A. Spielman
2013	A*	`conf`	Approximate Maximum Flow on Separable Undirected Graphs. SODA Gary L. Miller, Richard Peng
2013	J	`jnl`	Fully Dynamic $(1+ε)$-Approximate Matchings CoRR Manoj Gupta, Richard Peng
2013	A*	`conf`	Fully Dynamic (1+ e)-Approximate Matchings. FOCS Manoj Gupta, Richard Peng
2013	A*	`conf`	Iterative Row Sampling. FOCS Mu Li, Gary L. Miller, Richard Peng
2013	J	`jnl`	Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work. CoRR Gary L. Miller, Richard Peng, Shen Chen Xu
2013	J	`jnl`	Parallel Graph Decompositions Using Random Shifts. CoRR Gary L. Miller, Richard Peng, Shen Chen Xu
2013	B	`conf`	Parallel graph decompositions using random shifts. SPAA Gary L. Miller, Richard Peng, Shen Chen Xu
2013	A	`conf`	Runtime guarantees for regression problems. ITCS Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng
2012	J	`jnl`	A fast solver for a class of linear systems. Commun. ACM Ioannis Koutis, Gary L. Miller, Richard Peng
2012	J	`jnl`	Approximate Maximum Flow on Separable Undirected Graphs CoRR Gary L. Miller, Richard Peng
2012	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2012	J	`jnl`	Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows. CoRR Jonathan A. Kelner, Gary L. Miller, Richard Peng
2012	J	`jnl`	Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming CoRR Richard Peng, Kanat Tangwongsan
2012	B	`conf`	Faster and simpler width-independent parallel algorithms for positive semidefinite programming. SPAA Richard Peng, Kanat Tangwongsan
2012	A*	`conf`	Faster approximate multicommodity flow using quadratically coupled flows. STOC Jonathan A. Kelner, Gary L. Miller, Richard Peng
2012	J	`jnl`	Faster spectral sparsification and numerical algorithms for SDD matrices CoRR Ioannis Koutis, Alex Levin, Richard Peng
2012	A	`conf`	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. STACS Ioannis Koutis, Alex Levin, Richard Peng
2012	J	`jnl`	Iterative Approaches to Row Sampling CoRR Gary L. Miller, Richard Peng
2011	A*	`conf`	A Nearly-m log n Time Solver for SDD Linear Systems. FOCS Ioannis Koutis, Gary L. Miller, Richard Peng
2011	A*	`conf`	Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2011	J	`jnl`	Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz
2011	J	`jnl`	Electrical Flow Algorithms for Total Variation Minimization CoRR Aleksander Madry, Gary L. Miller, Richard Peng
2011	B	`conf`	Linear-work greedy parallel approximate set cover and variants. SPAA Guy E. Blelloch, Richard Peng, Kanat Tangwongsan
2011	J	`jnl`	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs CoRR Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	B	`conf`	Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	J	`jnl`	Solving SDD linear systems in time Õ(mlog nlog(1/ε)) CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2010	A*	`conf`	Approaching Optimality for Solving SDD Linear Systems. FOCS Ioannis Koutis, Gary L. Miller, Richard Peng
2010	J	`jnl`	Approaching optimality for solving SDD systems CoRR Ioannis Koutis, Gary L. Miller, Richard Peng
2010	J	`jnl`	Approximate Dynamic Programming for Fast Denoising of aCGH Data CoRR Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
2010	C	`conf`	Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
2010	J	`jnl`	Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning CoRR Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis