Prati
Yang P. Liu
Yang P. Liu
Student, Stanford
Potvrđena adresa e-pošte na stanford.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
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
712021
Faster divergence maximization for faster maximum flow
YP Liu, A Sidford
arXiv preprint arXiv:2003.08929, 2020
58*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
522020
Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao
Y Gao, YP Liu, R Peng
arXiv preprint arXiv:2101.07233, 2021
322021
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
232019
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
212021
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
162020
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
132022
Reproducibility and pseudo-determinism in log-space
O Grossman, YP Liu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
132019
On the upper tail problem for random hypergraphs
YP Liu, Y Zhao
Random Structures & Algorithms 58 (2), 179-220, 2021
102021
Short cycles via low-diameter decompositions
YP Liu, S Sachdeva, Z Yu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
82019
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
7*2021
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
7*2020
An exponential separation between MA and AM proofs of proximity
T Gur, YP Liu, RD Rothblum
computational complexity 30 (2), 1-44, 2021
52021
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
32022
A Gaussian fixed point random walk
YP Liu, A Sah, M Sawhney
arXiv preprint arXiv:2104.07009, 2021
32021
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
Vertex Sparsification for Edge Connectivity in Polynomial Time
YP Liu
arXiv preprint arXiv:2011.15101, 2020
22020
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
12022
Bounded gaps between products of distinct primes
Y Liu, PS Park, ZQ Song
Research in Number Theory 3 (1), 1-28, 2017
12017
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20