Yang P. Liu
Orcid: 0000-0001-6717-0539
According to our database1,
Yang P. Liu
authored at least 39 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
SIAM J. Comput., February, 2024
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
CoRR, 2024
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Commun. ACM, December, 2023
Electron. Colloquium Comput. Complex., 2023
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023
2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Comput. Complex., 2021
Minimum cost flows, MDPs, and ℓ<sub>1</sub>-regression in nearly linear time for dense instances.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Electron. Colloquium Comput. Complex., 2018