default search action
Yang P. Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]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): 87-110 (2024) - [c29]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. APPROX/RANDOM 2024: 54:1-54:16 - [c28]Jan van den Brand
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - [c27]Li Chen
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173 - [c26]Arun Jambulapati
Sparsifying Generalized Linear Models. STOC 2024: 1665-1675 - [i35]Yang P. Liu:
On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. CoRR abs/2403.02582 (2024) - [i34]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 abs/2407.10830 (2024) - [i33]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition for 3-Player XOR Games. CoRR abs/2408.09352 (2024) - 2023
- [j3]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - [c25]Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami:
Exponential Convergence of Sinkhorn Under Regularization Scheduling. ACDA 2023: 180-188 - [c24]Jan van den Brand
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - [c23]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying Sums of Norms. FOCS 2023: 1953-1962 - [c22]Yang P. Liu
Vertex Sparsification for Edge Connectivity in Polynomial Time. ITCS 2023: 83:1-83:15 - [c21]Arun Jambulapati, Yang P. Liu, Aaron Sidford:
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. STOC 2023: 196-206 - [c20]Jan van den Brand
Dynamic Maxflow via Dynamic Interior Point Methods. STOC 2023: 1215-1228 - [i32]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying Sums of Norms. CoRR abs/2305.09049 (2023) - [i31]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 abs/2309.16629 (2023) - [i30]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 abs/2311.03174 (2023) - [i29]Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford:
Sparsifying generalized linear models. CoRR abs/2311.18145 (2023) - [i28]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 abs/2311.18295 (2023) - [i27]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. CoRR abs/2312.04783 (2023) - [i26]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c19]Nima Anari, Yang P. Liu
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. FOCS 2022: 123-134 - [c18]Li Chen, Rasmus Kyng, Yang P. Liu
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS 2022: 612-623 - [c17]Yang P. Liu
A Gaussian Fixed Point Random Walk. ITCS 2022: 101:1-101:10 - [c16]Janardhan Kulkarni, Yang P. Liu
Online edge coloring via tree recurrences and correlation decay. STOC 2022: 104-116 - [c15]Arun Jambulapati, Yang P. Liu, Aaron Sidford:
Improved iteration complexities for overconstrained p-norm regression. STOC 2022: 529-542 - [c14]Jan van den Brand
Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC 2022: 543-556 - [i25]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 abs/2203.00671 (2022) - [i24]Nima Anari, Yang P. Liu, Thuy-Duong Vuong:
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. CoRR abs/2204.02570 (2022) - [i23]Jingbang Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami:
Exponential Convergence of Sinkhorn Under Regularization Scheduling. CoRR abs/2207.00736 (2022) - [i22]Arun Jambulapati, Yang P. Liu, Aaron Sidford:
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. CoRR abs/2209.10539 (2022) - [i21]Jan van den Brand, Yang P. Liu, Aaron Sidford:
Dynamic Maxflow via Dynamic Interior Point Methods. CoRR abs/2212.06315 (2022) - 2021
- [j2]Tom Gur
An Exponential Separation Between MA and AM Proofs of Proximity. Comput. Complex. 30(2): 12 (2021) - [j1]Yang P. Liu, Yufei Zhao:
On the upper tail problem for random hypergraphs. Random Struct. Algorithms 58(2): 179-220 (2021) - [c13]Yu Gao, Yang P. Liu, Richard Peng:
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS 2021: 516-527 - [c12]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS 2021: 989-999 - [c11]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - [c10]Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney:
Discrepancy minimization via a self-balancing walk. STOC 2021: 14-20 - [c9]Jan van den Brand
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. STOC 2021: 859-869 - [i20]Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak
Minimum Cost Flows, MDPs, and 𝓁1-Regression in Nearly Linear Time for Dense Instances. CoRR abs/2101.05719 (2021) - [i19]Yu Gao, Yang P. Liu, Richard Peng:
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR abs/2101.07233 (2021) - [i18]Yang P. Liu, Ashwin Sah, Mehtaab Sawhney:
A Gaussian fixed point random walk. CoRR abs/2104.07009 (2021) - [i17]Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR abs/2111.00721 (2021) - [i16]Arun Jambulapati, Yang P. Liu, Aaron Sidford:
Improved Iteration Complexities for Overconstrained p-Norm Regression. CoRR abs/2111.01848 (2021) - [i15]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 abs/2112.00722 (2021) - 2020
- [c8]Tarun Kathuria, Yang P. Liu, Aaron Sidford:
Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. FOCS 2020: 119-130 - [c7]Brian Axelrod, Yang P. Liu, Aaron Sidford:
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. SODA 2020: 837-853 - [c6]Yang P. Liu, Aaron Sidford:
Faster energy maximization for faster maximum flow. STOC 2020: 803-814 - [c5]Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford:
Constant girth approximation for directed graphs in subquadratic time. STOC 2020: 1010-1023 - [i14]Yang P. Liu, Aaron Sidford:
Faster Divergence Maximization for Faster Maximum Flow. CoRR abs/2003.08929 (2020) - [i13]Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney:
Discrepancy Minimization via a Self-Balancing Walk. CoRR abs/2006.14009 (2020) - [i12]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - [i11]Yang P. Liu:
Vertex Sparsification for Edge Connectivity in Polynomial Time. CoRR abs/2011.15101 (2020) - [i10]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR abs/2012.15675 (2020)
2010 – 2019
- 2019
- [c4]Yang P. Liu, Arun Jambulapati, Aaron Sidford:
Parallel Reachability in Almost Linear Work and Square Root Depth. FOCS 2019: 1664-1686 - [c3]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. SODA 2019: 606-620 - [c2]Yang P. Liu, Sushant Sachdeva, Zejun Yu:
Short Cycles via Low-Diameter Decompositions. SODA 2019: 2602-2615 - [i9]Arun Jambulapati, Yang P. Liu, Aaron Sidford:
Parallel Reachability in Almost Linear Work and Square Root Depth. CoRR abs/1905.08841 (2019) - [i8]Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford:
Improved Girth Approximation and Roundtrip Spanners. CoRR abs/1907.10779 (2019) - [i7]Brian Axelrod, Yang P. Liu, Aaron Sidford:
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization. CoRR abs/1909.00171 (2019) - [i6]Yang P. Liu, Richard Peng, Mark Sellke:
Vertex Sparsifiers for c-Edge Connectivity. CoRR abs/1910.10359 (2019) - [i5]Yang P. Liu, Aaron Sidford:
Faster Energy Maximization for Faster Maximum Flow. CoRR abs/1910.14276 (2019) - 2018
- [c1]Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. ICALP 2018: 73:1-73:15 - [i4]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. CoRR abs/1803.04025 (2018) - [i3]Yang P. Liu, Sushant Sachdeva, Zejun Yu:
Short Cycles via Low-Diameter Decompositions. CoRR abs/1810.05143 (2018) - [i2]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. Electron. Colloquium Comput. Complex. TR18 (2018) - [i1]Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. Electron. Colloquium Comput. Complex. TR18 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: