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
42 2019 Dynamic edge coloring with improved approximation R Duan, H He, T Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
28 2019 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
22 2022 Dynamic low-stretch spanning trees in subpolynomial time S Chechik, T Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
18 2020 Faster cut-equivalent trees in simple graphs T Zhang
arXiv preprint arXiv:2106.03305, 2021
16 2021 Improved distance sensitivity oracles via tree partitioning R Duan, T Zhang
Workshop on Algorithms and Data Structures, 349-360, 2017
14 2017 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
12 2016 Nearly 2-approximate distance oracles in subquadratic time S Chechik, T Zhang
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
10 2022 Incremental single source shortest paths in sparse digraphs S Chechik, T Zhang
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
10 2021 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
9 2023 Gomory-hu trees in quadratic time T Zhang
arXiv preprint arXiv:2112.01042, 2021
7 2021 Streaming edge coloring with subquadratic palette size S Chechik, D Mukhtar, T Zhang
arXiv preprint arXiv:2305.07090, 2023
3 2023 A Scaling Algorithm for Weighted -Factors in General Graphs R Duan, H He, T Zhang
arXiv preprint arXiv:2003.07589, 2020
3 2020 Almost-Optimal Sublinear Additive Spanners Z Tan, T Zhang
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 281-294, 2023
2 2023 Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees R Duan, H He, T Zhang
Latin American Symposium on Theoretical Informatics, 15-26, 2020
2 2020 Nearly Optimal Approximate Dual-Failure Replacement Paths S Chechik, T Zhang
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
1 2024 Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- Time Barrier A Bukov, S Solomon, T Zhang
arXiv preprint arXiv:2308.00793, 2023
1 2023 Constant approximation of min-distances in near-linear time S Chechik, T Zhang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
1 2022 Constant-Round Near-Optimal Spanners in Congested Clique S Chechik, T Zhang
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
1 2022 Faster Algorithms for Dual-Failure Replacement Paths S Chechik, T Zhang
arXiv preprint arXiv:2404.13907, 2024
2024