Yang P. Liu

According to our database, Yang P. Liu authored at least 42 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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., February, 2024

Reasonable Bounds for Combinatorial Lines of Length Three.

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

On Approximability of Satisfiable k-CSPs: VI.

Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer

Electron. Colloquium Comput. Complex., 2024

Parallel Repetition for 3-Player XOR Games.

Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer

CoRR, 2024

Sparsifying Generalized Linear Models.

Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

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

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

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

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication.

Yang P. Liu

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

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

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.

Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva

Commun. ACM, December, 2023

Parallel Repetition of k-Player Projection Games.

Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer

Electron. Colloquium Comput. Complex., 2023

Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification.

Arun Jambulapati, Yang P. Liu, Aaron Sidford

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Dynamic Maxflow via Dynamic Interior Point Methods.

Jan van den Brand, Yang P. Liu, Aaron Sidford

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Vertex Sparsification for Edge Connectivity in Polynomial Time.

Yang P. Liu

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Sparsifying Sums of Norms.

Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

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

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Exponential Convergence of Sinkhorn Under Regularization Scheduling.

Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Exponential Convergence of Sinkhorn Under Regularization Scheduling.

Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami

CoRR, 2022

Improved iteration complexities for overconstrained <i>p</i>-norm regression.

Arun Jambulapati, Yang P. Liu, Aaron Sidford

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

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

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

A Gaussian Fixed Point Random Walk.

Yang P. Liu, Ashwin Sah, Mehtaab Sawhney

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.

Nima Anari, Yang P. Liu, Thuy-Duong Vuong

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

On the upper tail problem for random hypergraphs.

Yang P. Liu, Yufei Zhao

Random Struct. Algorithms, 2021

Improved Iteration Complexities for Overconstrained p-Norm Regression.

Arun Jambulapati, Yang P. Liu, Aaron Sidford

CoRR, 2021

An Exponential Separation Between MA and AM Proofs of Proximity.

Tom Gur, Yang P. Liu, Ron D. Rothblum

Comput. Complex., 2021

Minimum cost flows, MDPs, and ℓ₁-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

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Discrepancy minimization via a self-balancing walk.

Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Vertex Sparsification for Edge Connectivity.

Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao.

Yu Gao, Yang P. Liu, Richard Peng

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Minor Sparsifiers and the Distributed Laplacian Paradigm.

Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Faster Divergence Maximization for Faster Maximum Flow.

Yang P. Liu, Aaron Sidford

CoRR, 2020

Faster energy maximization for faster maximum flow.

Yang P. Liu, Aaron Sidford

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Constant girth approximation for directed graphs in subquadratic time.

Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization.

Brian Axelrod, Yang P. Liu, Aaron Sidford

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time.

Tarun Kathuria, Yang P. Liu, Aaron Sidford

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Vertex Sparsifiers for c-Edge Connectivity.

Yang P. Liu, Richard Peng, Mark Sellke

CoRR, 2019

Improved Girth Approximation and Roundtrip Spanners.

Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford

CoRR, 2019

Short Cycles via Low-Diameter Decompositions.

Yang P. Liu, Sushant Sachdeva, Zejun Yu

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Parallel Reachability in Almost Linear Work and Square Root Depth.

Yang P. Liu, Arun Jambulapati, Aaron Sidford

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Reproducibility and Pseudo-Determinism in Log-Space.

Ofer Grossman, Yang P. Liu

Electron. Colloquium Comput. Complex., 2018