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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Online Edge Coloring via Tree Recurrences and Correlation Decay.
SIAM J. Comput., February, 2024

Parallel Repetition for 3-Player XOR Games.
CoRR, 2024

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
CoRR, 2024

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication.
CoRR, 2024

Sparsifying Generalized Linear Models.
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
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.
Commun. ACM, December, 2023

Parallel Repetition of k-Player Projection Games.
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

Dynamic Maxflow via Dynamic Interior Point Methods.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Vertex Sparsification for Edge Connectivity in Polynomial Time.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Sparsifying Sums of Norms.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Exponential Convergence of Sinkhorn Under Regularization Scheduling.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Exponential Convergence of Sinkhorn Under Regularization Scheduling.
CoRR, 2022

Improved iteration complexities for overconstrained <i>p</i>-norm regression.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Faster maxflow via improved dynamic spectral vertex sparsifiers.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

A Gaussian Fixed Point Random Walk.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.
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
On the upper tail problem for random hypergraphs.
Random Struct. Algorithms, 2021

Improved Iteration Complexities for Overconstrained p-Norm Regression.
CoRR, 2021

An Exponential Separation Between MA and AM Proofs of Proximity.
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

Discrepancy minimization via a self-balancing walk.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Vertex Sparsification for Edge Connectivity.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Minor Sparsifiers and the Distributed Laplacian Paradigm.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Faster Divergence Maximization for Faster Maximum Flow.
CoRR, 2020

Faster energy maximization for faster maximum flow.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Constant girth approximation for directed graphs in subquadratic time.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Vertex Sparsifiers for c-Edge Connectivity.
CoRR, 2019

Improved Girth Approximation and Roundtrip Spanners.
CoRR, 2019

Short Cycles via Low-Diameter Decompositions.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Parallel Reachability in Almost Linear Work and Square Root Depth.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Reproducibility and Pseudo-Determinism in Log-Space.
Electron. Colloquium Comput. Complex., 2018


  Loading...