| CARVIEW |
Select Language
HTTP/2 200
server: GitHub.com
content-type: text/html; charset=utf-8
last-modified: Fri, 03 Oct 2025 17:48:41 GMT
access-control-allow-origin: *
etag: W/"68e00c79-5469"
expires: Tue, 30 Dec 2025 13:13:12 GMT
cache-control: max-age=600
content-encoding: gzip
x-proxy-cache: MISS
x-github-request-id: 8598:3ABDEF:A0A720:B48300:6953CD8E
accept-ranges: bytes
age: 0
date: Tue, 30 Dec 2025 13:03:12 GMT
via: 1.1 varnish
x-served-by: cache-bom-vanm7210098-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767099792.488635,VS0,VE214
vary: Accept-Encoding
x-fastly-request-id: 82a66e6d48d88c2783006b46af6bd48328f2c852
content-length: 5312
Yang P. Liu
Publications
-
Sparsifying Sums of Positive Semidefinite Matrices
Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka
SODA 2026
arXiv -
Quasipolynomial bounds for the corners theorem
Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
FOCS 2025, Best Paper
arXiv -
On Inverse Theorems and Combinatorial Lines
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
FOCS 2025
Merged version of CSPs VI, CSPs VII, and DHJ[3] papers below. -
Parallel Repetition for 3-Player XOR Games
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
STOC 2025
arXiv -
Reasonable Bounds for Combinatorial Lines of Length Three
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
Merged version accepted to FOCS 2025
arXiv -
On Approximability of Satisfiable k-CSPs: VII
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
Merged version accepted to FOCS 2025
arXiv -
On Approximability of Satisfiable k-CSPs: VI
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
Merged version accepted to FOCS 2025
arXiv -
On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
Yang P. Liu
FOCS 2024
arXiv -
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
FOCS 2024
arXiv -
Parallel Repetition for k-Player Projection Games
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
RANDOM 2024
Proceedings arXiv Slides -
On Further Questions Regarding Unit Fractions
Yang P. Liu, Mehtaab Sawhney
In submission
arXiv -
Sparsifying generalized linear models
Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
STOC 2024
Proceedings arXiv Slides Video
-
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
Li Chen, Rasmus Kyng, Yang P. Liu , Simon Meierhans, Maximilian Probst Gutenberg.
STOC 2024
Proceedings arXiv
-
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.
SODA 2024
Proceedings arXiv -
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
FOCS 2023
Proceedings arXiv -
Sparsifying Sums of Norms
Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
FOCS 2023, Invited to SICOMP Special Issue
Proceedings arXiv -
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
Arun Jambulapati, Yang P. Liu, Aaron Sidford
STOC 2023
Proceedings arXiv -
Dynamic Maxflow via Dynamic Interior Point Methods
Jan van den Brand, Yang P. Liu, Aaron Sidford
STOC 2023
Proceedings arXiv -
Vertex Sparsification for Edge Connectivity in Polynomial Time
Yang P. Liu
ITCS 2023
Proceedings arXiv -
Exponential Convergence of Sinkhorn Under Regularization Scheduling
Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
ACDA 2023
Proceedings arXiv -
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, SIAM Journal of Computing Special Issue
Journal Proceedings arXiv -
Maximum Flow and Minimum-Cost Flow in Almost Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
FOCS 2022, Best Paper, Journal of the ACM
Proceedings arXiv Slides Video -
Online Edge Coloring via Tree Recurrences and Correlation Decay
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
STOC 2022, SIAM Journal of Computing Special Issue
Journal Proceedings arXiv -
Improved Iteration Complexities for Overconstrained p-Norm Regression
Arun Jambulapati, Yang P. Liu, Aaron Sidford
STOC 2022
Proceedings arXiv -
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
STOC 2022
Proceedings arXiv -
A Gaussian Fixed Point Walk
Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
ITCS 2022, Best Student Paper
Proceedings arXiv Slides Video -
Arithmetic progressions in sumsets of sparse sets
Noga Alon, Ryan Alweiss, Yang P. Liu, Anders Martinsson, Shyam Narayanan
Integers
Journal arXiv -
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Yu Gao, Yang P. Liu, Richard Peng
FOCS 2021, SIAM Journal of Computing Special Issue
Journal Proceedings arXiv Slides Video -
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
FOCS 2021
Proceedings arXiv -
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, Di Wang
STOC 2021
Proceedings arXiv Video -
Discrepancy Minimization via a Self-Balancing Walk
Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
STOC 2021, Best Student Paper, SIAM Journal of Computing Special Issue
Journal Proceedings arXiv Slides Video -
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit,
Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
SODA 2021
Proceedings arXiv Video -
Faster Divergence Maximization for Faster Maximum Flow
Yang P. Liu, Aaron Sidford
FOCS 2020, SIAM Journal of Computing Special Issue
Journal Proceedings arXiv Slides Video -
Faster Energy Maximization for Faster Maximum Flow
Yang P. Liu, Aaron Sidford
STOC 2020
Proceedings arXiv Slides Video -
Constant Girth Approximation for Directed Graphs in Subquadratic Time
Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
STOC 2020
Proceedings arXiv Slides Video -
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
Brian Axelrod, Yang P. Liu, Aaron Sidford
SODA 2020
Proceedings arXiv -
On the upper tail problem for random hypergraphs
Yang P. Liu, Yufei Zhao
Random Structures & Algorithms
Journal arXiv -
Parallel Reachability in Almost Linear Work and Square Root Depth
Arun Jambulapati, Yang P. Liu, Aaron Sidford
FOCS 2019
Proceedings arXiv Slides Video -
Short Cycles via Low-Diameter Decompositions
Yang P. Liu, Sushant Sachdeva, Zejun Yu
SODA 2019
Proceedings arXiv Slides -
Reproducibility and Pseudo-Determinism in Log-Space
Ofer Grossman, Yang P. Liu
SODA 2019
Proceedings arXiv -
An Exponential Separation Between MA and AM Proofs of Proximity
Tom Gur, Yang P. Liu, Ron D. Rothblum
ICALP 2018, Computational Complexity
Journal Proceedings ECCC Slides -
The "Riemann Hypothesis" is True for Period Polynomials of Almost All Newforms
Yang P. Liu, Peter S. Park, Zhuo Qun Song
Res Math Sci (2016) 3: 31.
Journal arXiv -
Bounded Gaps Between Products of Distinct Primes
Yang P. Liu, Peter S. Park, Zhuo Qun Song
Res. number theory (2017) 3: 26.
Journal arXiv
2026
2025
2024
2023
2022
2021
2020
2019
Before 2019