![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Yu Gao 0001
Person information
- affiliation: Georgia Institute of Technology, Atlanta, GA, USA
Other persons with the same name
- Yu Gao — disambiguation page
- Yu Gao 0002
— Institute of Software Chinese Academy of Sciences, Beijing, China
- Yu Gao 0003 — Evertz Microsystems, Burlington, ON, Canada (and 1 more)
- Yu Gao 0004
— Yangzhou University, Yangzhou, China
- Yu Gao 0005
— Tianjin University, TSchool of Electrical and Information Engineer, China
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i15]Jingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng, Yu Gao, Chenhao Ma:
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. CoRR abs/2402.05006 (2024) - [i14]Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Richard Peng, Yixiang Fang, Chenhao Ma:
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. CoRR abs/2406.00344 (2024) - 2023
- [j2]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. 52(6): S18-85 (2023) - [c11]Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang:
Hardness of Graph-Structured Algebraic and Symbolic Problems. WADS 2023: 232-246 - 2022
- [c10]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA 2022: 124-153 - [c9]Jan van den Brand
, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford:
Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC 2022: 543-556 - [i13]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR abs/2205.01562 (2022) - 2021
- [c8]Yu Gao, Yang P. Liu, Richard Peng:
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. FOCS 2021: 516-527 - [i12]Yu Gao, Yang P. Liu, Richard Peng:
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. CoRR abs/2101.07233 (2021) - [i11]Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng:
Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$. CoRR abs/2109.12736 (2021) - [i10]Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford:
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR abs/2112.00722 (2021) - 2020
- [j1]Chirag Jain, Haowen Zhang, Yu Gao, Srinivas Aluru:
On the Complexity of Sequence-to-Graph Alignment. J. Comput. Biol. 27(4): 640-654 (2020) - [c7]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS 2020: 1158-1167 - [c6]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW 2020: 573-583 - [i9]Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani:
A Study of Performance of Optimal Transport. CoRR abs/2005.01182 (2020)
2010 – 2019
- 2019
- [c5]Chirag Jain, Haowen Zhang, Yu Gao, Srinivas Aluru:
On the Complexity of Sequence to Graph Alignment. RECOMB 2019: 85-100 - [c4]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully dynamic spectral vertex sparsifiers and applications. STOC 2019: 914-925 - [c3]David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild
:
Efficient Second-Order Shape-Constrained Function Fitting. WADS 2019: 395-408 - [i8]David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild:
Efficient Second-Order Shape-Constrained Function Fitting. CoRR abs/1905.02149 (2019) - [i7]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully Dynamic Spectral Vertex Sparsifiers and Applications. CoRR abs/1906.10530 (2019) - [i6]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR abs/1910.07087 (2019) - [i5]Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR abs/1910.07950 (2019) - [i4]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs/1910.08025 (2019) - 2018
- [c2]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva
, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. FOCS 2018: 361-372 - [c1]David Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao:
Nearly Tight Bounds for Sandpile Transience on the Grid. SODA 2018: 605-624 - [i3]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully Dynamic Effective Resistances. CoRR abs/1804.04038 (2018) - [i2]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR abs/1805.12051 (2018) - 2017
- [i1]David Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao:
Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors. CoRR abs/1704.04830 (2017)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint