Yang P. Liu
Yang P. Liu
Student, Stanford
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Faster energy maximization for faster maximum flow
YP Liu, A Sidford
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
352020
Faster divergence maximization for faster maximum flow
YP Liu, A Sidford
arXiv preprint arXiv:2003.08929, 2020
35*2020
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
232021
Parallel reachability in almost linear work and square root depth
YP Liu, A Jambulapati, A Sidford
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
122019
Reproducibility and pseudo-determinism in log-space
O Grossman, YP Liu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
122019
Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao
Y Gao, YP Liu, R Peng
arXiv preprint arXiv:2101.07233, 2021
102021
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
92020
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
82021
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
6*2020
Short cycles via low-diameter decompositions
YP Liu, S Sachdeva, Z Yu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
62019
On the upper tail problem for random hypergraphs
YP Liu, Y Zhao
Random Structures & Algorithms 58 (2), 179-220, 2021
52021
An exponential separation between MA and AM proofs of proximity
T Gur, YP Liu, RD Rothblum
computational complexity 30 (2), 1-44, 2021
42021
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
4*2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye
arXiv preprint arXiv:2012.15675, 2020
32020
Bounded gaps between products of distinct primes
Y Liu, PS Park, ZQ Song
Research in Number Theory 3 (1), 1-28, 2017
12017
A Gaussian fixed point random walk
YP Liu, A Sah, M Sawhney
arXiv preprint arXiv:2104.07009, 2021
2021
Vertex Sparsification for Edge Connectivity in Polynomial Time
YP Liu
arXiv preprint arXiv:2011.15101, 2020
2020
The “Riemann Hypothesis” is true for period polynomials of almost all newforms
Y Liu, PS Park, ZQ Song
Research in the Mathematical Sciences 3 (1), 1-11, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–18