Reproducibility and Pseudo-Determinism in Log-Space. - Ofer Grossman; Yang P. Liu (Electron. Colloquium Comput. Complex., 2018)

Parallel Reachability in Almost Linear Work and Square Root Depth. - Yang P. Liu; Arun Jambulapati; Aaron Sidford (FOCS, 2019)

Short Cycles via Low-Diameter Decompositions. - Yang P. Liu; Sushant Sachdeva; Zejun Yu (SODA, 2019)

Improved Girth Approximation and Roundtrip Spanners. - Shiri Chechik; Yang P. Liu; Omer Rotem; Aaron Sidford (CoRR, 2019)

Vertex Sparsifiers for c-Edge Connectivity. - Yang P. Liu; Richard Peng; Mark Sellke (CoRR, 2019)

Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. - Tarun Kathuria; Yang P. Liu; Aaron Sidford (FOCS, 2020)

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. - Brian Axelrod; Yang P. Liu; Aaron Sidford (SODA, 2020)

Constant girth approximation for directed graphs in subquadratic time. - Shiri Chechik; Yang P. Liu; Omer Rotem; Aaron Sidford (STOC, 2020)

Faster energy maximization for faster maximum flow. - Yang P. Liu; Aaron Sidford (STOC, 2020)

Faster Divergence Maximization for Faster Maximum Flow. - Yang P. Liu; Aaron Sidford (CoRR, 2020)

Minor Sparsifiers and the Distributed Laplacian Paradigm. - Sebastian Forster; Gramoz Goranci; Yang P. Liu; Richard Peng; Xiaorui Sun; Mingquan Ye (FOCS, 2021)

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. - Yu Gao 001; Yang P. Liu; Richard Peng (FOCS, 2021)

Vertex Sparsification for Edge Connectivity. - Parinya Chalermsook; Syamantak Das; Yunbum Kook; Bundit Laekhanukit; Yang P. Liu; Richard Peng; Mark Sellke; Daniel Vaz 001 (SODA, 2021)

Discrepancy minimization via a self-balancing walk. - Ryan Alweiss; Yang P. Liu; Mehtaab Sawhney (STOC, 2021)

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. - Jan van den Brand; Yin Tat Lee; Yang P. Liu; Thatchaphol Saranurak; Aaron Sidford; Zhao Song 002; Di Wang 005 (STOC, 2021)

An Exponential Separation Between MA and AM Proofs of Proximity. - Tom Gur; Yang P. Liu; Ron D. Rothblum (Comput. Complex., 2021)

Improved Iteration Complexities for Overconstrained p-Norm Regression. - Arun Jambulapati; Yang P. Liu; Aaron Sidford (CoRR, 2021)

On the upper tail problem for random hypergraphs. - Yang P. Liu; Yufei Zhao (Random Struct. Algorithms, 2021)

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. - Nima Anari; Yang P. Liu; Thuy-Duong Vuong (FOCS, 2022)

A Gaussian Fixed Point Random Walk. - Yang P. Liu; Ashwin Sah; Mehtaab Sawhney (ITCS, 2022)

Faster maxflow via improved dynamic spectral vertex sparsifiers. - Jan van den Brand; Yu Gao 001; Arun Jambulapati; Yin Tat Lee; Yang P. Liu; Richard Peng; Aaron Sidford (STOC, 2022)

Improved iteration complexities for overconstrained p-norm regression. - Arun Jambulapati; Yang P. Liu; Aaron Sidford (STOC, 2022)

Exponential Convergence of Sinkhorn Under Regularization Scheduling. - Jingbang Chen; Yang P. Liu; Richard Peng; Arvind Ramaswami (CoRR, 2022)

Exponential Convergence of Sinkhorn Under Regularization Scheduling. - Jingbang Chen; Li Chen 028; Yang P. Liu; Richard Peng; Arvind Ramaswami (ACDA, 2023)

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. - Jan van den Brand; Li Chen 028; Richard Peng; Rasmus Kyng; Yang P. Liu; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (FOCS, 2023)

Sparsifying Sums of Norms. - Arun Jambulapati; James R. Lee; Yang P. Liu; Aaron Sidford (FOCS, 2023)

Vertex Sparsification for Edge Connectivity in Polynomial Time. - Yang P. Liu (ITCS, 2023)

Dynamic Maxflow via Dynamic Interior Point Methods. - Jan van den Brand; Yang P. Liu; Aaron Sidford (STOC, 2023)

Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. - Arun Jambulapati; Yang P. Liu; Aaron Sidford (STOC, 2023)

Parallel Repetition of k-Player Projection Games. - Amey Bhangale; Mark Braverman; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (Commun. ACM, 2023)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg; Sushant Sachdeva (FOCS, 2024)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. - Yang P. Liu (FOCS, 2024)

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (SODA, 2024)

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg (STOC, 2024)

Sparsifying Generalized Linear Models. - Arun Jambulapati; James R. Lee; Yang P. Liu; Aaron Sidford (STOC, 2024)

On Approximability of Satisfiable k-CSPs: VI. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (CoRR, 2024)

On Approximability of Satisfiable k-CSPs: VII. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (CoRR, 2024)

On Approximability of Satisfiable k-CSPs: VI. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

On Approximability of Satisfiable k-CSPs: VII. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

Reasonable Bounds for Combinatorial Lines of Length Three. - Amey Bhangale; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2024)

Unit Capacity Maxflow in Almost $m^{4/3}$ Time. - Tarun Kathuria; Yang P. Liu; Aaron Sidford (SIAM J. Comput., 2024)

Online Edge Coloring via Tree Recurrences and Correlation Decay. - Janardhan Kulkarni; Yang P. Liu; Ashwin Sah; Mehtaab S. Sawhney; Jakub Tarnawski (SIAM J. Comput., 2024)

Parallel Repetition for 3-Player XOR Games. - Amey Bhangale; Mark Braverman; Subhash Khot; Yang P. Liu; Dor Minzer (Electron. Colloquium Comput. Complex., 2025)

Quasipolynomial bounds for the corners theorem. - Michael Jaber; Yang P. Liu; Shachar Lovett; Anthony Ostuni; Mehtaab Sawhney (Electron. Colloquium Comput. Complex., 2025)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets. - Yang P. Liu; Richard Peng; Junzhao Yang (CoRR, 2025)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method. - Yang P. Liu (CoRR, 2025)

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (J. ACM, 2025)

Sparsifying Sums of Positive Semidefinite Matrices. - Arpon Basu; Pravesh K. Kothari; Yang P. Liu; Raghu Meka (CoRR, 2025)