| 2026 | ICALP | Streaming Complexity Separations for Dense and Sparse Graphs. | Yang P. Liu, Hoai-An Nguyen, Noah G. Singer, David P. Woodruff |
| 2026 | SODA | Sparsifying Sums of Positive Semidefinite Matrices. | Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka |
| 2026 | STOC | Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method. | Yang P. Liu |
| 2025 | FOCS | On Inverse Theorems and Combinatorial Lines. | Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | FOCS | Quasipolynomial Bounds for the Corners Theorem. | Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney |
| 2025 | STOC | Parallel Repetition for 3-Player XOR Games. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2024 | FOCS | 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 |
| 2024 | FOCS | On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. | Yang P. Liu |
| 2024 | SODA | 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 |
| 2024 | STOC | 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 |
| 2024 | STOC | Sparsifying Generalized Linear Models. | Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford |
| 2023 | FOCS | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | FOCS | Sparsifying Sums of Norms. | Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford |
| 2023 | STOC | Dynamic Maxflow via Dynamic Interior Point Methods. | Jan van den Brand, Yang P. Liu, Aaron Sidford |
| 2023 | STOC | Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. | Arun Jambulapati, Yang P. Liu, Aaron Sidford |
| 2022 | FOCS | Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. | Nima Anari, Yang P. Liu, Thuy-Duong Vuong |
| 2022 | FOCS | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | STOC | 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 |
| 2022 | STOC | Improved iteration complexities for overconstrained | Arun Jambulapati, Yang P. Liu, Aaron Sidford |
| 2022 | STOC | Online edge coloring via tree recurrences and correlation decay. | Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski |
| 2021 | FOCS | Minor Sparsifiers and the Distributed Laplacian Paradigm. | Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye |
| 2021 | FOCS | Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. | Yu Gao, Yang P. Liu, Richard Peng |
| 2021 | SODA | Vertex Sparsification for Edge Connectivity. | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
| 2021 | STOC | Discrepancy minimization via a self-balancing walk. | Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney |
| 2021 | STOC | Minimum cost flows, MDPs, and ℓ | Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | FOCS | Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. | Tarun Kathuria, Yang P. Liu, Aaron Sidford |
| 2020 | SODA | Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. | Brian Axelrod, Yang P. Liu, Aaron Sidford |
| 2020 | STOC | Constant girth approximation for directed graphs in subquadratic time. | Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford |
| 2020 | STOC | Faster energy maximization for faster maximum flow. | Yang P. Liu, Aaron Sidford |
| 2019 | FOCS | Parallel Reachability in Almost Linear Work and Square Root Depth. | Yang P. Liu, Arun Jambulapati, Aaron Sidford |
| 2019 | SODA | Reproducibility and Pseudo-Determinism in Log-Space. | Ofer Grossman, Yang P. Liu |
| 2019 | SODA | Short Cycles via Low-Diameter Decompositions. | Yang P. Liu, Sushant Sachdeva, Zejun Yu |
| 2018 | ICALP | An Exponential Separation Between MA and AM Proofs of Proximity. | Tom Gur, Yang P. Liu, Ron D. Rothblum |