Yang P. Liu

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Reasonable Bounds for Combinatorial Lines of Length Three	2024	Amey Bhangale Subhash Khot Yang P. Liu Dor Minzer
+ PDF Chat	On Approximability of Satisfiable $k$-CSPs: VI	2024	Amey Bhangale Subhash Khot Yang P. Liu Dor Minzer
+ PDF Chat	On Approximability of Satisfiable $k$-CSPs: VII	2024	Amey Bhangale Subhash Khot Yang P. Liu Dor Minzer
+ PDF Chat	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence	2024	Nima Anari Yang P. Liu Thuy-Duong Vuong
+ PDF Chat	Parallel Repetition for $3$-Player XOR Games	2024	Amey Bhangale Mark Braverman Subhash Khot Yang P. Liu Dor Minzer
+ PDF Chat	Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality	2024	Jan van den Brand Li Chen Rasmus Kyng Yang P. Liu Simon Meierhans Maximilian Probst Gutenberg Sushant Sachdeva
+	Sparsifying Generalized Linear Models	2024	Arun Jambulapati James R. Lee Yang P. Liu Aaron Sidford
+	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow	2024	Li. Chen Rasmus Kyng Yang P. Liu Simon Meierhans Maximilian Probst Gutenberg
+ PDF Chat	On further questions regarding unit fractions	2024	Yang P. Liu Mehtaab Sawhney
+ PDF Chat	On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication	2024	Yang P. Liu
+ PDF Chat	Online Edge Coloring via Tree Recurrences and Correlation Decay	2024	Janardhan Kulkarni Yang P. Liu Ashwin Sah Mehtaab Sawhney Jakub Tarnawski
+ PDF Chat	Discrepancy Minimization via a Self-Balancing Walk	2024	Ryan Alweiss Yang P. Liu Mehtaab Sawhney
+ PDF Chat	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time	2024	Jan van den Brand Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva Aaron Sidford
+	Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow	2023	Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva
+	Sparsifying Sums of Norms	2023	Arun Jambulapati James R. Lee Yang P. Liu Aaron Sidford
+ PDF Chat	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow	2023	Jan van den Brand Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva Aaron Sidford
+	Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification	2023	Arun Jambulapati Yang P. Liu Aaron Sidford
+	Dynamic Maxflow via Dynamic Interior Point Methods	2023	Jan van den Brand Yang P. Liu Aaron Sidford
+ PDF Chat	Exponential Convergence of Sinkhorn Under Regularization Scheduling	2023	Jingbang Chen Li Chen Yang P. Liu Richard Peng Arvind Ramaswami
+	Sparsifying sums of norms	2023	Arun Jambulapati James R. Lee Yang P. Liu Aaron Sidford
+	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow	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	2023	Jan van den Brand Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva Aaron Sidford
+	Sparsifying generalized linear models	2023	Arun Jambulapati James R. Lee Yang P. Liu Aaron Sidford
+	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow	2023	Li Chen Rasmus Kyng Yang P. Liu Simon Meierhans Maximilian Probst Gutenberg
+	Parallel Repetition of k-Player Projection Games	2023	Amey Bhangale Mark Braverman Subhash Khot Yang P. Liu Dor Minzer
+ PDF Chat	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time	2022	Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva
+ PDF Chat	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence	2022	Nima Anari Yang P. Liu Thuy-Duong Vuong
+ PDF Chat	Improved iteration complexities for overconstrained <i>p</i> -norm regression	2022	Arun Jambulapati Yang P. Liu Aaron Sidford
+ PDF Chat	Online edge coloring via tree recurrences and correlation decay	2022	Janardhan Kulkarni Yang P. Liu Ashwin Sah Mehtaab Sawhney Jakub Tarnawski
+ PDF Chat	Faster maxflow via improved dynamic spectral vertex sparsifiers	2022	Jan van den Brand Yu Gao Arun Jambulapati Yin Tat Lee Yang P. Liu Richard Peng Aaron Sidford
+ PDF Chat	Arithmetic progressions in sumsets of sparse sets	2022	Noga Alon Ryan Alweiss Yang P. Liu Anders Martinsson Shyam Narayanan
+	Unit Capacity Maxflow in Almost $m^{4/3}$ Time	2022	Tarun Kathuria Yang P. Liu Aaron Sidford
+ PDF Chat	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao	2022	Yu Gao Yang P. Liu Richard Peng
+ PDF Chat	Minor Sparsifiers and the Distributed Laplacian Paradigm	2022	Sebastian Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye
+	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time	2022	Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva
+	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence	2022	Nima Anari Yang P. Liu Thuy-Duong Vuong
+	Exponential Convergence of Sinkhorn Under Regularization Scheduling	2022	Jingbang Chen Yang P. Liu Richard Peng Arvind Ramaswami
+	Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification	2022	Arun Jambulapati Yang P. Liu Aaron Sidford
+	Dynamic Maxflow via Dynamic Interior Point Methods	2022	Jan van den Brand Yang P. Liu Aaron Sidford
+ PDF Chat	Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers	2021	Jan van den Brand Yu Gao Arun Jambulapati Yin Tat Lee Yang P. Liu Richard Peng Aaron Sidford
+	Minimum cost flows, MDPs, and ℓ <sub>1</sub> -regression in nearly linear time for dense instances	2021	Jan van den Brand Yin Tat Lee Yang P. Liu Thatchaphol Saranurak Aaron Sidford Zhao Song Di Wang
+ PDF Chat	Discrepancy minimization via a self-balancing walk	2021	Ryan Alweiss Yang P. Liu Mehtaab Sawhney
+	Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances	2021	Jan van den Brand Yin Tat Lee Yang P. Liu Thatchaphol Saranurak Aaron Sidford Zhao Song Di Wang
+	A Gaussian fixed point random walk	2021	Yang P. Liu Ashwin Sah Mehtaab Sawhney
+	Arithmetic progressions in sumsets of sparse sets	2021	Noga Alon Ryan Alweiss Yang P. Liu Anders Martinsson Shyam Narayanan
+	Improved Iteration Complexities for Overconstrained $p$-Norm Regression	2021	Arun Jambulapati Yang P. Liu Aaron Sidford
+	Online Edge Coloring via Tree Recurrences and Correlation Decay	2021	Janardhan Kulkarni Yang P. Liu Ashwin Sah Mehtaab Sawhney Jakub Tarnawski
+	Arithmetic Progressions in Sumsets of Sparse Sets	2021	Noga Alon Ryan Alweiss Yang P. Liu Anders Martinsson Shyam Narayanan
+	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao	2021	Yu Gao Yang P. Liu Richard Peng
+	Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers	2021	Jan van den Brand Yu Gao Arun Jambulapati Yin Tat Lee Yang P. Liu Richard Peng Aaron Sidford
+ PDF Chat	On the upper tail problem for random hypergraphs	2020	Yang P. Liu Yufei Zhao
+	Unit Capacity Maxflow in Almost Time	2020	Tarun Kathuria Yang P. Liu Aaron Sidford
+ PDF Chat	Constant girth approximation for directed graphs in subquadratic time	2020	Shiri Chechik Yang P. Liu Omer Rotem Aaron Sidford
+ PDF Chat	Faster energy maximization for faster maximum flow	2020	Yang P. Liu Aaron Sidford
+	Faster Divergence Maximization for Faster Maximum Flow	2020	Yang P. Liu Aaron Sidford
+	Vertex Sparsification for Edge Connectivity in Polynomial Time	2020	Yang P. Liu
+	Minor Sparsifiers and the Distributed Laplacian Paradigm	2020	Sebastian Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye
+	Vertex Sparsification for Edge Connectivity	2020	Parinya Chalermsook Syamantak Das Bundit Laekhanukit Yunbum Kook Yang P. Liu Richard Peng Mark Sellke Daniel Vaz
+	Discrepancy Minimization via a Self-Balancing Walk	2020	Ryan Alweiss Yang P. Liu Mehtaab Sawhney
+	Faster Divergence Maximization for Faster Maximum Flow	2020	Yang P. Liu Aaron Sidford
+ PDF Chat	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization	2019	Brian Axelrod Yang P. Liu Aaron Sidford
+ PDF Chat	Parallel Reachability in Almost Linear Work and Square Root Depth	2019	Yang P. Liu Arun Jambulapati Aaron Sidford
+	Faster Energy Maximization for Faster Maximum Flow	2019	Yang P. Liu Aaron Sidford
+	Vertex Sparsifiers for c-Edge Connectivity	2019	Yang P. Liu Richard Peng Mark Sellke
+	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization	2019	Brian Axelrod Yang P. Liu Aaron Sidford
+	Improved Girth Approximation and Roundtrip Spanners	2019	Shiri Chechik Yang P. Liu Omer Rotem Aaron Sidford
+	Constant Girth Approximation for Directed Graphs in Subquadratic Time	2019	Shiri Chechik Yang P. Liu Omer Rotem Aaron Sidford
+	Parallel Reachability in Almost Linear Work and Square Root Depth	2019	Arun Jambulapati Yang P. Liu Aaron Sidford
+ PDF Chat	Short Cycles via Low-Diameter Decompositions	2019	Yang P. Liu Sushant Sachdeva Zejun Yu
+	On the upper tail problem for random hypergraphs	2019	Yang P. Liu Yufei Zhao
+	Faster Energy Maximization for Faster Maximum Flow	2019	Yang P. Liu Aaron Sidford
+	Vertex Sparsifiers for c-Edge Connectivity	2019	Yang P. Liu Richard Peng Mark Sellke
+	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization	2019	Brian Axelrod Yang P. Liu Aaron Sidford
+	Constant Girth Approximation for Directed Graphs in Subquadratic Time	2019	Shiri Chechik Yang P. Liu Omer Rotem Aaron Sidford
+	Parallel Reachability in Almost Linear Work and Square Root Depth	2019	Arun Jambulapati Yang P. Liu Aaron Sidford
+	Short Cycles via Low-Diameter Decompositions	2018	Yang P. Liu Sushant Sachdeva Zejun Yu
+	Bounded Gaps Between Products of Distinct Primes	2016	Yang P. Liu Peter S. Park Zhuo Qun Song
+	The "Riemann Hypothesis" is True for Period Polynomials of Almost All Newforms	2016	Yang P. Liu Peter S. Park Zhuo Qun Song

Common Coauthors

Coauthor	Papers Together
Aaron Sidford	30
Richard Peng	18
Arun Jambulapati	14
Jan van den Brand	12
Sushant Sachdeva	10
Rasmus Kyng	10
Maximilian Probst Gutenberg	10
Mehtaab Sawhney	8
Ryan Alweiss	6
Aaron Sidford	6
Dor Minzer	5
Subhash Khot	5
Yin Tat Lee	5
Amey Bhangale	5
Ashwin Sah	4
Li Chen	4
Omer Rotem	4
Shiri Chechik	4
James R. Lee	4
Yu Gao	3
Jakub Tarnawski	3
Noga Alon	3
Shyam Narayanan	3
Simon Meierhans	3
Mark Sellke	3
Nima Anari	3
Janardhan Kulkarni	3
Anders Martinsson	3
Brian Axelrod	3
Mingquan Ye	2
Thatchaphol Saranurak	2
Tarun Kathuria	2
Yufei Zhao	2
Jingbang Chen	2
Zhuo Qun Song	2
Mark Braverman	2
Sebastian Forster	2
Arvind Ramaswami	2
Thuy-Duong Vuong	2
Peter S. Park	2
Yu Gao	2
Gramoz Goranci	2
Li Chen	2
Li Chen	2
Di Wang	2
Xiaorui Sun	2
Zhao Song	2
Thuy-Duong Vuong	1
Zejun Yu	1
Li. Chen	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations	2013	Jonathan A. Kelner Yin Tat Lee Lorenzo Orecchia Aaron Sidford	14
+ PDF Chat	Nearly Maximum Flows in Nearly Linear Time	2013	Jonah Sherman	14
+ PDF Chat	Computing Maximum Flow with Augmenting Electrical Flows	2016	Aleksander Mądry	14
+	Flows in almost linear time via adaptive preconditioning	2019	Rasmus Kyng Richard Peng Sushant Sachdeva Di Wang	13
+ PDF Chat	Faster energy maximization for faster maximum flow	2020	Yang P. Liu Aaron Sidford	13
+	Faster approximate lossy generalized flow via interior point algorithms	2008	Samuel I. Daitch Daniel A. Spielman	12
+ PDF Chat	Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs	2020	Kyriakos Axiotis Aleksander Mądry Adrian Vladu	12
+ PDF Chat	Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back	2013	Aleksander Mądry	12
+ PDF Chat	Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems	2004	Daniel A. Spielman Shang‐Hua Teng	12
+ PDF Chat	Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs	2020	Jan van den Brand Yin-Tat Lee Danupon Nanongkai Richard Peng Thatchaphol Saranurak Aaron Sidford Zhao Song Di Wang	11
+ PDF Chat	Solving linear programs in the current matrix multiplication time	2019	Michael B. Cohen Yin Tat Lee Zhao Song	11
+ PDF Chat	Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple	2016	Rasmus Kyng Sushant Sachdeva	10
+	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs	2011	Paul F. Christiano Jonathan A. Kelner Aleksander Mądry Daniel A. Spielman Shang‐Hua Teng	10
+	Sparsified Cholesky and multigrid solvers for connection laplacians	2016	Rasmus Kyng Yin Tat Lee Richard Peng Sushant Sachdeva Daniel A. Spielman	10
+ PDF Chat	A Nearly-m log n Time Solver for SDD Linear Systems	2011	Ioannis Koutis Gary L. Miller Richard Peng	10
+ PDF Chat	Solving tall dense linear programs in nearly linear time	2020	Jan van den Brand Yin Tat Lee Aaron Sidford Zhao Song	9
+ PDF Chat	Graph Sparsification by Effective Resistances	2011	Daniel A. Spielman Nikhil Srivastava	9
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	9
+ PDF Chat	A simple, combinatorial algorithm for solving SDD systems in nearly-linear time	2013	Jonathan A. Kelner Lorenzo Orecchia Aaron Sidford Zeyuan Allen Zhu	9
+	Solving Linear Programs with Sqrt(rank) Linear System Solves	2019	Yin Tat Lee Aaron Sidford	8
+ PDF Chat	An almost-linear time algorithm for uniform random spanning tree generation	2018	Aaron Schild	6
+ PDF Chat	Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems	2014	Daniel A. Spielman Shang‐Hua Teng	6
+	Faster Divergence Maximization for Faster Maximum Flow	2020	Yang P. Liu Aaron Sidford	6
+	A Deterministic Linear Program Solver in Current Matrix Multiplication Time	2019	Jan van den Brand	6
+	A new approach to computing maximum flows using electrical flows	2013	Yin Tat Lee Satish Rao Nikhil Srivastava	6
+	Sampling random spanning trees faster than matrix multiplication	2017	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva	6
+	Expander decomposition and pruning: faster, stronger, and simpler	2019	Thatchaphol Saranurak Di Wang	6
+	Unit Capacity Maxflow in Almost Time	2020	Tarun Kathuria Yang P. Liu Aaron Sidford	6
+	Path Finding Methods for Linear Programming: Solving Linear Programs in &#x00D5;(vrank) Iterations and Faster Algorithms for Maximum Flow	2014	Yin Tat Lee Aaron Sidford	6
+ PDF Chat	Faster approximate multicommodity flow using quadratically coupled flows	2012	Jonathan A. Kelner Gary L. Miller Richard Peng	5
+	Minimum cost flows, MDPs, and ℓ <sub>1</sub> -regression in nearly linear time for dense instances	2021	Jan van den Brand Yin Tat Lee Yang P. Liu Thatchaphol Saranurak Aaron Sidford Zhao Song Di Wang	5
+ PDF Chat	A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond	2020	Julia Chuzhoy Yu Gao Jason Li Danupon Nanongkai Richard Peng Thatchaphol Saranurak	5
+ PDF Chat	An efficient parallel solver for SDD linear systems	2014	Richard Peng Daniel A. Spielman	5
+ PDF Chat	Runtime guarantees for regression problems	2013	Hui Han Chin Aleksander Mądry Gary L. Miller Richard Peng	5
+	An homotopy method for l <sub>p</sub> regression provably beyond self-concordance and in input-sparsity time	2018	Sébastien Bubeck Michael B. Cohen Yin Tat Lee Yuanzhi Li	5
+ PDF Chat	Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems	2019	Deeksha Adil Sushant Sachdeva	5
+ PDF Chat	Efficient Inverse Maintenance and Faster Algorithms for Linear Programming	2015	Yin Tat Lee Aaron Sidford	5
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	4
+ PDF Chat	Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers	2020	Li Chen Gramoz Goranci Monika Henzinger Richard Peng Thatchaphol Saranurak	4
+ PDF Chat	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao	2022	Yu Gao Yang P. Liu Richard Peng	4
+ PDF Chat	Uniform Sampling for Matrix Approximation	2015	Michael B. Cohen Yin Tat Lee Cameron Musco Christopher Musco Richard Peng Aaron Sidford	4
+ PDF Chat	Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms	2021	Jan van den Brand	4
+ PDF Chat	Faster Sparse Minimum Cost Flow by Electrical Flow Localization	2022	Kyriakos Axiotis Aleksander Mądry Adrian Vladu	4
+	Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary	2020	Aaron Bernstein Jan van den Brand Maximilian Probst Gutenberg Danupon Nanongkai Thatchaphol Saranurak Aaron Sidford He Sun	4
+	Fully dynamic spectral vertex sparsifiers and applications	2019	David Durfee Yu Gao Gramoz Goranci Richard Peng	4
+	Fast moment estimation in data streams in optimal space	2011	Daniel M. Kane Jelani Nelson Ely Porat David P. Woodruff	4
+ PDF Chat	Faster Generation of Random Spanning Trees	2009	Jonathan A. Kelner Aleksander Mądry	4
+ PDF Chat	Improved distributed algorithms for exact shortest paths	2018	Mohsen Ghaffari Jason Li	4
+ PDF Chat	Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time	2017	Danupon Nanongkai Thatchaphol Saranurak Christian Wulff‐Nilsen	4
+ PDF Chat	A Faster Distributed Single-Source Shortest Paths Algorithm	2018	Sebastian Forster Danupon Nanongkai	4