default search action
Tianyi Zhang 0008
Person information
- affiliation: Tel Aviv University, Israel
- affiliation: Tsinghua University, Beijing, China
Other persons with the same name
- Tianyi Zhang (aka: Tian-Yi Zhang) — disambiguation page
- Tianyi Zhang 0001
— Purdue University, USA (and 2 more)
- Tianyi Zhang 0002 — Hebei University, Baoding, China
- Tianyi Zhang 0003 — Zhejiang University, Hangzhou, China
- Tianyi Zhang 0004
- Tianyi Zhang 0005 — Stony Brook University, NY, USA
- Tianyi Zhang 0006
- Tianyi Zhang 0007 — ASAPP Inc. (and 1 more)
- Tianyi Zhang 0009
- Tianyi Zhang 0010
- Tianyi Zhang 0011
- Tianyi Zhang 0012
- Tianyi Zhang 0013
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Shiri Chechik, Doron Mukhtar, Tianyi Zhang:
Streaming Edge Coloring with Subquadratic Palette Size. ICALP 2024: 40:1-40:12 - [c17]Shiri Chechik, Tianyi Zhang:
Faster Algorithms for Dual-Failure Replacement Paths. ICALP 2024: 41:1-41:20 - [c16]Shiri Chechik, Tianyi Zhang:
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. ICALP 2024: 42:1-42:18 - [c15]Shiri Chechik, Tianyi Zhang:
Nearly Optimal Approximate Dual-Failure Replacement Paths. SODA 2024: 2568-2596 - [i9]Shiri Chechik, Tianyi Zhang:
Faster Algorithms for Dual-Failure Replacement Paths. CoRR abs/2404.13907 (2024) - 2023
- [c14]Shiri Chechik, Tianyi Zhang:
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. SODA 2023: 87-99 - [c13]Zihan Tan, Tianyi Zhang:
Almost-Optimal Sublinear Additive Spanners. STOC 2023: 281-294 - [i8]Zihan Tan, Tianyi Zhang:
Almost-Optimal Sublinear Additive Spanners. CoRR abs/2303.12768 (2023) - [i7]Shiri Chechik, Doron Mukhtar, Tianyi Zhang:
Streaming Edge Coloring with Subquadratic Palette Size. CoRR abs/2305.07090 (2023) - 2022
- [c12]Shiri Chechik, Tianyi Zhang:
Constant Approximation of Min-Distances in Near-Linear Time. FOCS 2022: 896-906 - [c11]Shiri Chechik, Tianyi Zhang:
Constant-Round Near-Optimal Spanners in Congested Clique. PODC 2022: 325-334 - [c10]Shiri Chechik, Tianyi Zhang:
Nearly 2-Approximate Distance Oracles in Subquadratic Time. SODA 2022: 551-580 - [c9]Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang:
Faster min-plus product for monotone instances. STOC 2022: 1529-1542 - [i6]Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang:
Faster Min-Plus Product for Monotone Instances. CoRR abs/2204.04500 (2022) - 2021
- [c8]Shiri Chechik, Tianyi Zhang:
Incremental Single Source Shortest Paths in Sparse Digraphs. SODA 2021: 2463-2477 - 2020
- [c7]Ran Duan, Haoqing He, Tianyi Zhang:
A Scaling Algorithm for Weighted f-Factors in General Graphs. ICALP 2020: 41:1-41:17 - [c6]Ran Duan, Haoqing He, Tianyi Zhang:
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. LATIN 2020: 15-26 - [c5]Shiri Chechik, Tianyi Zhang:
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. SODA 2020: 463-475 - [i5]Ran Duan, Haoqing He, Tianyi Zhang:
A Scaling Algorithm for Weighted f-Factors in General Graphs. CoRR abs/2003.07589 (2020)
2010 – 2019
- 2019
- [j1]Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li:
Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference. Mach. Learn. 108(8-9): 1701-1727 (2019) - [c4]Shiri Chechik, Tianyi Zhang:
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. FOCS 2019: 370-381 - [c3]Ran Duan, Haoqing He, Tianyi Zhang:
Dynamic Edge Coloring with Improved Approximation. SODA 2019: 1937-1945 - [i4]Shiri Chechik, Tianyi Zhang:
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. CoRR abs/1909.03445 (2019) - 2018
- [c2]Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang:
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT 2018: 16:1-16:12 - [i3]Zhize Li, Tianyi Zhang, Jian Li:
Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference. CoRR abs/1803.11159 (2018) - 2017
- [c1]Ran Duan, Tianyi Zhang
Improved Distance Sensitivity Oracles via Tree Partitioning. WADS 2017: 349-360 - [i2]Ran Duan, Haoqing He, Tianyi Zhang:
Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. CoRR abs/1712.09166 (2017) - 2016
- [i1]Ran Duan, Tianyi Zhang:
Improved distance sensitivity oracles via tree partitioning. CoRR abs/1605.04491 (2016)
Coauthor Index
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-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: