Takip et
Tianyi Zhang
Tianyi Zhang
ETH Zürich
inf.ethz.ch üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Fully dynamic maximal independent set in expected poly-log update time
S Chechik, T Zhang
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
502019
Dynamic edge coloring with improved approximation
R Duan, H He, T Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
402019
Faster min-plus product for monotone instances
S Chi, R Duan, T Xie, T Zhang
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
322022
Dynamic low-stretch spanning trees in subpolynomial time
S Chechik, T Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
222020
Faster cut-equivalent trees in simple graphs
T Zhang
arXiv preprint arXiv:2106.03305, 2021
172021
Improved distance sensitivity oracles via tree partitioning
R Duan, T Zhang
Workshop on Algorithms and Data Structures, 349-360, 2017
162017
Streaming edge coloring with subquadratic palette size
S Chechik, D Mukhtar, T Zhang
arXiv preprint arXiv:2305.07090, 2023
132023
An improved algorithm for incremental DFS tree in undirected graphs
L Chen, R Duan, R Wang, H Zhang, T Zhang
arXiv preprint arXiv:1607.04913, 2016
132016
Nearly 2-approximate distance oracles in subquadratic time
S Chechik, T Zhang
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
122022
Incremental single source shortest paths in sparse digraphs
S Chechik, T Zhang
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
112021
Faster (∆+ 1)-edge coloring: Breaking the m√ n time barrier
S Bhattacharya, D Carmon, M Costa, S Solomon, T Zhang
65th IEEE Symposium on Foundations of Computer Science (FOCS) 1 (2), 3, 2024
102024
Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths
S Chechik, T Zhang
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
102023
Gomory-hu trees in quadratic time
T Zhang
arXiv preprint arXiv:2112.01042, 2021
82021
Constant-round near-optimal spanners in congested clique
S Chechik, T Zhang
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
42022
Vizing's Theorem in Near-Linear Time
S Assadi, S Behnezhad, S Bhattacharya, M Costa, S Solomon, T Zhang
arXiv preprint arXiv:2410.05240, 2024
32024
A Scaling Algorithm for Weighted -Factors in General Graphs
R Duan, H He, T Zhang
arXiv preprint arXiv:2003.07589, 2020
32020
Even Faster (Δ+ 1)-Edge Coloring via Shorter Multi-Step Vizing Chains
S Bhattacharya, M Costa, S Solomon, T Zhang
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
22025
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier
A Bukov, S Solomon, T Zhang
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
22025
Nearly Optimal Approximate Dual-Failure Replacement Paths
S Chechik, T Zhang
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
22024
Almost-Optimal Sublinear Additive Spanners
Z Tan, T Zhang
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 281-294, 2023
22023
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20