Sledovat
Yu Gao
Yu Gao
E-mailová adresa ověřena na: gatech.edu - Domovská stránka
Název
Citace
Citace
Rok
A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
902020
Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions
T Chu, Y Gao, R Peng, S Sachdeva, S Sawlani, J Wang
SIAM Journal on Computing, FOCS18-85-FOCS18-157, 2020
552020
Fully dynamic electrical flows: Sparse maxflow faster than Goldberg–Rao
Y Gao, Y Liu, R Peng
SIAM Journal on Computing, FOCS21-85-FOCS21-156, 2023
502023
On the complexity of sequence-to-graph alignment
C Jain, H Zhang, Y Gao, S Aluru
Journal of Computational Biology 27 (4), 640-654, 2020
482020
Fully dynamic spectral vertex sparsifiers and applications
D Durfee, Y Gao, G Goranci, R Peng
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
352019
Flowless: Extracting densest subgraphs without flow computations
D Boob, Y Gao, R Peng, S Sawlani, C Tsourakakis, D Wang, J Wang
Proceedings of The Web Conference 2020, 573-583, 2020
282020
A study of performance of optimal transport
Y Dong, Y Gao, R Peng, I Razenshteyn, S Sawlani
arXiv preprint arXiv:2005.01182, 2020
142020
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
132022
Deterministic graph cuts in subquadratic time: Sparse, balanced, and k-vertex
Y Gao, J Li, D Nanongkai, R Peng, T Saranurak, ...
arXiv preprint arXiv:1910.07950, 2019
122019
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
S Dong, Y Gao, G Goranci, YT Lee, R Peng, S Sachdeva, G Ye
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
92022
Fully dynamic effective resistances
D Durfee, Y Gao, G Goranci, R Peng
arXiv preprint arXiv:1804.04038, 2018
82018
Nearly tight bounds for sandpile transience on the grid
D Durfee, M Fahrbach, Y Gao, T Xiao
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
52018
Efficient Second-Order Shape-Constrained Function Fitting
D Durfee, Y Gao, AB Rao, S Wild
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
12019
Unit-Weight Laplacians are Complete for Linear Systems Modulo
J Chen, Y Gao, Y Huang, R Peng
arXiv e-prints, arXiv: 2109.12736, 2021
2021
Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors.
D Durfee, M Fahrbach, Y Gao, T Xiao
arXiv preprint arXiv:1704.04830, 2017
2017
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–15