Yang P. Liu

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 68

Top Topics

Generalized Linear Models

Point Processes

Top Venues

Publications

Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
Sparsifying Generalized Linear Models. STOC (2024)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR (2024)
Yang P. Liu
On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. CoRR (2024)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA (2024)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski
Online Edge Coloring via Tree Recurrences and Correlation Decay. SIAM J. Comput. 53 (1) (2024)
Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC (2024)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR (2023)
Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
Sparsifying generalized linear models. CoRR (2023)
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
Parallel Repetition of k-Player Projection Games. CoRR (2023)
Jan Van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS (2023)
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR (2023)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66 (12) (2023)
Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
Exponential Convergence of Sinkhorn Under Regularization Scheduling. ACDA (2023)
Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
Sparsifying Sums of Norms. CoRR (2023)
Jan van den Brand, Yang P. Liu, Aaron Sidford
Dynamic Maxflow via Dynamic Interior Point Methods. STOC (2023)
Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
Sparsifying Sums of Norms. FOCS (2023)
Arun Jambulapati, Yang P. Liu, Aaron Sidford
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. STOC (2023)
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. (2023)
Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR (2023)
Yang P. Liu
Vertex Sparsification for Edge Connectivity in Polynomial Time. ITCS (2023)
Nima Anari, Yang P. Liu, Thuy-Duong Vuong
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. FOCS (2022)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS (2022)
Arun Jambulapati, Yang P. Liu, Aaron Sidford
-norm regression. STOC (2022)
Nima Anari, Yang P. Liu, Thuy-Duong Vuong
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. CoRR (2022)
Arun Jambulapati, Yang P. Liu, Aaron Sidford
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. CoRR (2022)
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR (2022)
Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
Exponential Convergence of Sinkhorn Under Regularization Scheduling. CoRR (2022)
Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
A Gaussian Fixed Point Random Walk. ITCS (2022)
Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC (2022)
Jan van den Brand, Yang P. Liu, Aaron Sidford
Dynamic Maxflow via Dynamic Interior Point Methods. CoRR (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2022)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
Online edge coloring via tree recurrences and correlation decay. STOC (2022)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2021)
Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
Discrepancy minimization via a self-balancing walk. STOC (2021)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS (2021)
Yu Gao, Yang P. Liu, Richard Peng
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR (2021)
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
-Regression in Nearly Linear Time for Dense Instances. CoRR (2021)
Yang P. Liu, Yufei Zhao
On the upper tail problem for random hypergraphs. Random Struct. Algorithms 58 (2) (2021)
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
-regression in nearly linear time for dense instances. STOC (2021)
Arun Jambulapati, Yang P. Liu, Aaron Sidford
Improved Iteration Complexities for Overconstrained p-Norm Regression. CoRR (2021)
Tom Gur, Yang P. Liu, Ron D. Rothblum
An Exponential Separation Between MA and AM Proofs of Proximity. Comput. Complex. 30 (2) (2021)
Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
A Gaussian fixed point random walk. CoRR (2021)
Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR (2021)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Tarun Kathuria, Yang P. Liu, Aaron Sidford
Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. FOCS (2020)
Yang P. Liu, Aaron Sidford
Faster Divergence Maximization for Faster Maximum Flow. CoRR (2020)
Brian Axelrod, Yang P. Liu, Aaron Sidford
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. SODA (2020)
Yang P. Liu
Vertex Sparsification for Edge Connectivity in Polynomial Time. CoRR (2020)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR (2020)
Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
Constant girth approximation for directed graphs in subquadratic time. STOC (2020)
Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
Discrepancy Minimization via a Self-Balancing Walk. CoRR (2020)
Yang P. Liu, Aaron Sidford
Faster energy maximization for faster maximum flow. STOC (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Yang P. Liu, Arun Jambulapati, Aaron Sidford
Parallel Reachability in Almost Linear Work and Square Root Depth. FOCS (2019)
Ofer Grossman, Yang P. Liu
Reproducibility and Pseudo-Determinism in Log-Space. SODA (2019)
Arun Jambulapati, Yang P. Liu, Aaron Sidford
Parallel Reachability in Almost Linear Work and Square Root Depth. CoRR (2019)
Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
Improved Girth Approximation and Roundtrip Spanners. CoRR (2019)
Brian Axelrod, Yang P. Liu, Aaron Sidford
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. CoRR (2019)
Yang P. Liu, Sushant Sachdeva, Zejun Yu
Short Cycles via Low-Diameter Decompositions. SODA (2019)
Yang P. Liu, Aaron Sidford
Faster Energy Maximization for Faster Maximum Flow. CoRR (2019)
Yang P. Liu, Richard Peng, Mark Sellke
Vertex Sparsifiers for c-Edge Connectivity. CoRR (2019)
Ofer Grossman, Yang P. Liu
Reproducibility and Pseudo-Determinism in Log-Space. CoRR (2018)
Tom Gur, Yang P. Liu, Ron D. Rothblum
An Exponential Separation Between MA and AM Proofs of Proximity. ICALP (2018)
Ofer Grossman, Yang P. Liu
Reproducibility and Pseudo-Determinism in Log-Space. Electron. Colloquium Comput. Complex. 25 (2018)
Yang P. Liu, Sushant Sachdeva, Zejun Yu
Short Cycles via Low-Diameter Decompositions. CoRR (2018)
Tom Gur, Yang P. Liu, Ron D. Rothblum
An Exponential Separation Between MA and AM Proofs of Proximity. Electron. Colloquium Comput. Complex. 25 (2018)