Follow
Li Chen
Li Chen
Verified email at andrew.cmu.edu - Homepage
Title
Cited by
Cited by
Year
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
2142022
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
L Chen, G Goranci, M Henzinger, R Peng, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
482020
A deterministic almost-linear time algorithm for minimum-cost flow
J Van Den Brand, L Chen, R Peng, R Kyng, YP Liu, MP Gutenberg, ...
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
172023
2-norm Flow Diffusion in Near-Linear Time
L Chen, R Peng, D Wang
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022
52022
Exponential convergence of sinkhorn under regularization scheduling
J Chen, L Chen, YP Liu, R Peng, A Ramaswami
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23 …, 2023
32023
A Simple Framework for Finding Balanced Sparse Cuts via APSP
L Chen, R Kyng, MP Gutenberg, S Sachdeva
Symposium on Simplicity in Algorithms (SOSA), 42-55, 2023
32023
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time
J van den Brand, L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, ...
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
12024
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, - Shortest Path, and Minimum-Cost Flow
L Chen, R Kyng, YP Liu, S Meierhans, MP Gutenberg
arXiv preprint arXiv:2311.18295, 2023
12023
High-accuracy multicommodity flows via iterative refinement
L Chen, M Ye
arXiv preprint arXiv:2304.11252, 2023
12023
Minimum Coverage Instrumentation
L Chen, E Hoag, K Lee, J Mestre, S Pupyrev
arXiv preprint arXiv:2208.13907, 2022
12022
On the power of learning-augmented BSTs
J Chen, L Chen
arXiv preprint arXiv:2211.09251, 2022
12022
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
Communications of the ACM 66 (12), 85-92, 2023
2023
Learning-Augmented B-Trees
X Cao, J Chen, L Chen, C Lambert, R Peng, D Sleator
arXiv preprint arXiv:2211.09251, 2022
2022
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m …
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
The system can't perform the operation now. Try again later.
Articles 1–14