Yang P. Liu - RankMe

94 papers A* 31A 3Journal 59Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Improved Parallel Repetition for GHZ-Supported Games via Spreadness. CoRR Yang P. Liu, Shachar Lovett, Kunal Mittal
2026	J	`jnl`	Improved Parallel Repetition for GHZ-Supported Games via Spreadness. Electron. Colloquium Comput. Complex. Yang P. Liu, Shachar Lovett, Kunal Mittal
2026	A*	`conf`	Sparsifying Sums of Positive Semidefinite Matrices. SODA Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka
2025	J	`jnl`	Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization. CoRR Yang P. Liu, Richard Peng, Colin Tang, Albert Weng, Junzhao Yang
2025	J	`jnl`	An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. CoRR Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer, Kunal Mittal
2025	J	`jnl`	An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. Electron. Colloquium Comput. Complex. Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer, Kunal Mittal
2025	J	`jnl`	Approximate Spanning Tree Counting from Uncorrelated Edge Sets. CoRR Yang P. Liu, Richard Peng, Junzhao Yang
2025	J	`jnl`	Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method. CoRR Yang P. Liu
2025	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. J. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2025	A*	`conf`	On Inverse Theorems and Combinatorial Lines. FOCS Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2025	J	`jnl`	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. SIAM J. Comput. Nima Anari, Yang P. Liu, Thuy-Duong Vuong
2025	A*	`conf`	Parallel Repetition for 3-Player XOR Games. STOC Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2025	J	`jnl`	Parallel Repetition for 3-Player XOR Games. Electron. Colloquium Comput. Complex. Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2025	A*	`conf`	Quasipolynomial Bounds for the Corners Theorem. FOCS Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Quasipolynomial bounds for the corners theorem. CoRR Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Quasipolynomial bounds for the corners theorem. Electron. Colloquium Comput. Complex. Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Sparsifying Sums of Positive Semidefinite Matrices. CoRR Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka
2024	A*	`conf`	Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. FOCS Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
2024	J	`jnl`	Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
2024	A*	`conf`	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
2024	A*	`conf`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2024	J	`jnl`	On Approximability of Satisfiable CoRR Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	J	`jnl`	On Approximability of Satisfiable CoRR Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	J	`jnl`	On Approximability of Satisfiable k-CSPs: VI. Electron. Colloquium Comput. Complex. Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	J	`jnl`	On Approximability of Satisfiable k-CSPs: VII. Electron. Colloquium Comput. Complex. Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	A*	`conf`	On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. FOCS Yang P. Liu
2024	J	`jnl`	On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. CoRR Yang P. Liu
2024	J	`jnl`	Online Edge Coloring via Tree Recurrences and Correlation Decay. SIAM J. Comput. Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski
2024	J	`jnl`	Parallel Repetition for 3-Player XOR Games. CoRR Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2024	A	`conf`	Parallel Repetition of k-Player Projection Games. APPROX/RANDOM Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2024	J	`jnl`	Reasonable Bounds for Combinatorial Lines of Length Three. CoRR Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	J	`jnl`	Reasonable Bounds for Combinatorial Lines of Length Three. Electron. Colloquium Comput. Complex. Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024	A*	`conf`	Sparsifying Generalized Linear Models. STOC Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
2024	J	`jnl`	Unit Capacity Maxflow in Almost $m^{4/3}$ Time. SIAM J. Comput. Tarun Kathuria, Yang P. Liu, Aaron Sidford
2023	A*	`conf`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
2023	J	`jnl`	Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	A*	`conf`	Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. STOC Arun Jambulapati, Yang P. Liu, Aaron Sidford
2023	A*	`conf`	Dynamic Maxflow via Dynamic Interior Point Methods. STOC Jan van den Brand, Yang P. Liu, Aaron Sidford
2023	—	`conf`	Exponential Convergence of Sinkhorn Under Regularization Scheduling. ACDA Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
2023	J	`jnl`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	Parallel Repetition of k-Player Projection Games. CoRR Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2023	J	`jnl`	Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2023	A*	`conf`	Sparsifying Sums of Norms. FOCS Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
2023	J	`jnl`	Sparsifying Sums of Norms. CoRR Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
2023	J	`jnl`	Sparsifying generalized linear models. CoRR Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford
2023	A	`conf`	Vertex Sparsification for Edge Connectivity in Polynomial Time. ITCS Yang P. Liu
2022	A	`conf`	A Gaussian Fixed Point Random Walk. ITCS Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
2022	J	`jnl`	Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. CoRR Arun Jambulapati, Yang P. Liu, Aaron Sidford
2022	J	`jnl`	Dynamic Maxflow via Dynamic Interior Point Methods. CoRR Jan van den Brand, Yang P. Liu, Aaron Sidford
2022	J	`jnl`	Exponential Convergence of Sinkhorn Under Regularization Scheduling. CoRR Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami
2022	A*	`conf`	Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2022	A*	`conf`	Improved iteration complexities for overconstrained STOC Arun Jambulapati, Yang P. Liu, Aaron Sidford
2022	A*	`conf`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	A*	`conf`	Online edge coloring via tree recurrences and correlation decay. STOC Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
2022	A*	`conf`	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. FOCS Nima Anari, Yang P. Liu, Thuy-Duong Vuong
2022	J	`jnl`	Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. CoRR Nima Anari, Yang P. Liu, Thuy-Duong Vuong
2021	J	`jnl`	A Gaussian fixed point random walk. CoRR Yang P. Liu, Ashwin Sah, Mehtaab Sawhney
2021	J	`jnl`	An Exponential Separation Between MA and AM Proofs of Proximity. Comput. Complex. Tom Gur, Yang P. Liu, Ron D. Rothblum
2021	A*	`conf`	Discrepancy minimization via a self-balancing walk. STOC Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
2021	J	`jnl`	Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2021	A*	`conf`	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS Yu Gao, Yang P. Liu, Richard Peng
2021	J	`jnl`	Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR Yu Gao, Yang P. Liu, Richard Peng
2021	J	`jnl`	Improved Iteration Complexities for Overconstrained p-Norm Regression. CoRR Arun Jambulapati, Yang P. Liu, Aaron Sidford
2021	J	`jnl`	Minimum Cost Flows, MDPs, and 𝓁 CoRR Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2021	A*	`conf`	Minimum cost flows, MDPs, and ℓ STOC Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2021	A*	`conf`	Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2021	J	`jnl`	On the upper tail problem for random hypergraphs. Random Struct. Algorithms Yang P. Liu, Yufei Zhao
2021	J	`jnl`	Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
2021	A*	`conf`	Vertex Sparsification for Edge Connectivity. SODA Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2020	A*	`conf`	Constant girth approximation for directed graphs in subquadratic time. STOC Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
2020	J	`jnl`	Discrepancy Minimization via a Self-Balancing Walk. CoRR Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
2020	J	`jnl`	Faster Divergence Maximization for Faster Maximum Flow. CoRR Yang P. Liu, Aaron Sidford
2020	A*	`conf`	Faster energy maximization for faster maximum flow. STOC Yang P. Liu, Aaron Sidford
2020	J	`jnl`	Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2020	A*	`conf`	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. SODA Brian Axelrod, Yang P. Liu, Aaron Sidford
2020	A*	`conf`	Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. FOCS Tarun Kathuria, Yang P. Liu, Aaron Sidford
2020	J	`jnl`	Vertex Sparsification for Edge Connectivity in Polynomial Time. CoRR Yang P. Liu
2020	J	`jnl`	Vertex Sparsification for Edge Connectivity. CoRR Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2019	J	`jnl`	Faster Energy Maximization for Faster Maximum Flow. CoRR Yang P. Liu, Aaron Sidford
2019	J	`jnl`	Improved Girth Approximation and Roundtrip Spanners. CoRR Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
2019	J	`jnl`	Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. CoRR Brian Axelrod, Yang P. Liu, Aaron Sidford
2019	A*	`conf`	Parallel Reachability in Almost Linear Work and Square Root Depth. FOCS Yang P. Liu, Arun Jambulapati, Aaron Sidford
2019	J	`jnl`	Parallel Reachability in Almost Linear Work and Square Root Depth. CoRR Arun Jambulapati, Yang P. Liu, Aaron Sidford
2019	A*	`conf`	Reproducibility and Pseudo-Determinism in Log-Space. SODA Ofer Grossman, Yang P. Liu
2019	A*	`conf`	Short Cycles via Low-Diameter Decompositions. SODA Yang P. Liu, Sushant Sachdeva, Zejun Yu
2019	J	`jnl`	Vertex Sparsifiers for c-Edge Connectivity. CoRR Yang P. Liu, Richard Peng, Mark Sellke
2018	A*	`conf`	An Exponential Separation Between MA and AM Proofs of Proximity. ICALP Tom Gur, Yang P. Liu, Ron D. Rothblum
2018	J	`jnl`	An Exponential Separation Between MA and AM Proofs of Proximity. Electron. Colloquium Comput. Complex. Tom Gur, Yang P. Liu, Ron D. Rothblum
2018	J	`jnl`	Reproducibility and Pseudo-Determinism in Log-Space. CoRR Ofer Grossman, Yang P. Liu
2018	J	`jnl`	Reproducibility and Pseudo-Determinism in Log-Space. Electron. Colloquium Comput. Complex. Ofer Grossman, Yang P. Liu
2018	J	`jnl`	Short Cycles via Low-Diameter Decompositions. CoRR Yang P. Liu, Sushant Sachdeva, Zejun Yu