Follow
Yang P. Liu
Yang P. Liu
Student, Stanford
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances
J van den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
922021
Maximum flow and minimum-cost flow in almost-linear time
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
arXiv preprint arXiv:2203.00671, 2022
882022
Faster divergence maximization for faster maximum flow
YP Liu, A Sidford
arXiv preprint arXiv:2003.08929, 2020
74*2020
Faster energy maximization for faster maximum flow
YP Liu, A Sidford
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
622020
Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao
Y Gao, YP Liu, R Peng
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
502022
Parallel reachability in almost linear work and square root depth
A Jambulapati, YP Liu, A Sidford
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
332019
Discrepancy minimization via a self-balancing walk
R Alweiss, YP Liu, M Sawhney
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
282021
Reproducibility and pseudo-determinism in log-space
O Grossman, YP Liu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
222019
Near-optimal approximate discrete and continuous submodular function minimization
B Axelrod, YP Liu, A Sidford
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
212020
Minor Sparsifiers and the Distributed Laplacian Paradigm
S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
152022
Vertex Sparsification for Edge Connectivity
P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
15*2021
Faster maxflow via improved dynamic spectral vertex sparsifiers
J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ...
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
132022
On the upper tail problem for random hypergraphs
YP Liu, Y Zhao
Random Structures & Algorithms 58 (2), 179-220, 2021
112021
Short cycles via low-diameter decompositions
YP Liu, S Sachdeva, Z Yu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
102019
Constant girth approximation for directed graphs in subquadratic time
S Chechik, YP Liu, O Rotem, A Sidford
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
8*2020
Improved iteration complexities for overconstrained p-norm regression
A Jambulapati, YP Liu, A Sidford
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
72022
An exponential separation between MA and AM proofs of proximity
T Gur, YP Liu, RD Rothblum
computational complexity 30 (2), 12, 2021
72021
A Gaussian fixed point random walk
YP Liu, A Sah, M Sawhney
arXiv preprint arXiv:2104.07009, 2021
52021
Online edge coloring via tree recurrences and correlation decay
J Kulkarni, YP Liu, A Sah, M Sawhney, J Tarnawski
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
42022
Vertex sparsification for edge connectivity in polynomial time
YP Liu
arXiv preprint arXiv:2011.15101, 2020
32020
The system can't perform the operation now. Try again later.
Articles 1–20