Publications

    2025
  1. Quasipolynomial bounds for the corners theorem
    Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
    FOCS 2025
    arXiv
  2. 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.
  3. Parallel Repetition for 3-Player XOR Games
    Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
    STOC 2025
    arXiv
    4. 2024
  4. Reasonable Bounds for Combinatorial Lines of Length Three
    Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
    Merged version accepted to FOCS 2025
    arXiv
  5. On Approximability of Satisfiable k-CSPs: VII
    Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
    Merged version accepted to FOCS 2025
    arXiv
  6. On Approximability of Satisfiable k-CSPs: VI
    Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
    Merged version accepted to FOCS 2025
    arXiv
  7. On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
    Yang P. Liu
    FOCS 2024
    arXiv
  8. 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
  9. Parallel Repetition for k-Player Projection Games
    Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
    RANDOM 2024
    Proceedings      arXiv      Slides
  10. On Further Questions Regarding Unit Fractions
    Yang P. Liu, Mehtaab Sawhney
    In submission
    arXiv
  11. Sparsifying generalized linear models
    Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
    STOC 2024
    Proceedings      arXiv      Slides      Video
  12. 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
  13. 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
    14. 2023
  14. 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
  15. Sparsifying Sums of Norms
    Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
    FOCS 2023, Invited to SICOMP Special Issue
    Proceedings      arXiv
  16. Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
    Arun Jambulapati, Yang P. Liu, Aaron Sidford
    STOC 2023
    Proceedings      arXiv
  17. Dynamic Maxflow via Dynamic Interior Point Methods
    Jan van den Brand, Yang P. Liu, Aaron Sidford
    STOC 2023
    Proceedings      arXiv
  18. Vertex Sparsification for Edge Connectivity in Polynomial Time
    Yang P. Liu
    ITCS 2023
    Proceedings      arXiv
  19. Exponential Convergence of Sinkhorn Under Regularization Scheduling
    Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
    ACDA 2023
    Proceedings      arXiv
    20. 2022
  20. 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
  21. 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
    Proceedings      arXiv      Slides      Video
  22. 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
  23. Improved Iteration Complexities for Overconstrained p-Norm Regression
    Arun Jambulapati, Yang P. Liu, Aaron Sidford
    STOC 2022
    Proceedings      arXiv
  24. 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
  25. A Gaussian Fixed Point Walk
    Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
    ITCS 2022, Best Student Paper
    Proceedings      arXiv      Slides      Video
  26. Arithmetic progressions in sumsets of sparse sets
    Noga Alon, Ryan Alweiss, Yang P. Liu, Anders Martinsson, Shyam Narayanan
    Integers
    Journal      arXiv
    27. 2021
  27. 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
  28. Minor Sparsifiers and the Distributed Laplacian Paradigm
    Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
    FOCS 2021
    Proceedings      arXiv
  29. 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
  30. 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
  31. 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
    32. 2020
  32. 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
  33. Faster Energy Maximization for Faster Maximum Flow
    Yang P. Liu, Aaron Sidford
    STOC 2020
    Proceedings      arXiv      Slides      Video
  34. Constant Girth Approximation for Directed Graphs in Subquadratic Time
    Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
    STOC 2020
    Proceedings      arXiv      Slides      Video
  35. Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
    Brian Axelrod, Yang P. Liu, Aaron Sidford
    SODA 2020
    Proceedings      arXiv
  36. On the upper tail problem for random hypergraphs
    Yang P. Liu, Yufei Zhao
    Random Structures & Algorithms
    Journal      arXiv
    37. 2019
  37. Parallel Reachability in Almost Linear Work and Square Root Depth
    Arun Jambulapati, Yang P. Liu, Aaron Sidford
    FOCS 2019
    Proceedings      arXiv      Slides      Video
  38. Short Cycles via Low-Diameter Decompositions
    Yang P. Liu, Sushant Sachdeva, Zejun Yu
    SODA 2019
    Proceedings      arXiv      Slides
  39. Reproducibility and Pseudo-Determinism in Log-Space
    Ofer Grossman, Yang P. Liu
    SODA 2019
    Proceedings      arXiv
    40. Before 2019
  40. 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
  41. 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
  42. Bounded Gaps Between Products of Distinct Primes
    Yang P. Liu, Peter S. Park, Zhuo Qun Song
    Res. number theory (2017) 3: 26.
    Journal      arXiv