受强制性开放获取政策约束的文章 - Yang P. Liu了解详情
可在其他位置公开访问的文章：27 篇
Maximum flow and minimum-cost flow in almost-linear time
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
强制性开放获取政策： US National Science Foundation, Swiss National Science Foundation, Natural …
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
强制性开放获取政策： US National Science Foundation, US Department of Defense, European Commission
Faster divergence maximization for faster maximum flow
YP Liu, A Sidford
arXiv preprint arXiv:2003.08929, 2020
强制性开放获取政策： US National Science Foundation, US Department of Defense
Faster energy maximization for faster maximum flow
YP Liu, A Sidford
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
A deterministic almost-linear time algorithm for minimum-cost flow
J Van Den Brand, L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, ...
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation, Swiss National Science Foundation, Natural …
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense, 国家自然科学基金委 …
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
Reproducibility and pseudo-determinism in log-space
O Grossman, YP Liu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
强制性开放获取政策： US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense, Austrian Science …
Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification
A Jambulapati, YP Liu, A Sidford
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 196-206, 2023
强制性开放获取政策： US National Science Foundation
Short cycles via low-diameter decompositions
YP Liu, S Sachdeva, Z Yu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
On the upper tail problem for random hypergraphs
YP Liu, Y Zhao
Random Structures & Algorithms 58 (2), 179-220, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, st Shortest Path, and Minimum-Cost Flow
L Chen, R Kyng, YP Liu, S Meierhans, M Probst Gutenberg
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1165-1173, 2024
强制性开放获取政策： Swiss National Science Foundation
Sparsifying sums of norms
A Jambulapati, JR Lee, YP Liu, A Sidford
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定