Tianyi Zhang

According to our database, Tianyi Zhang authored at least 34 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A Tight Lower Bound for Doubling Spanners.

An La, Hung Le, Shay Solomon, Cuong Than, Vinayak, Shuang Yang, Tianyi Zhang

CoRR, August, 2025

Covering the Euclidean Plane by a Pair of Trees.

Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang

CoRR, August, 2025

Approximate Light Spanners in Planar Graphs.

Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang

CoRR, May, 2025

Vizing's Theorem in Near-Linear Time.

Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-<i>f</i> Time Barrier.

Anton Bukov, Shay Solomon, Tianyi Zhang

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains.

Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Improved Streaming Edge Coloring.

Shiri Chechik, Hongyi Chen, Tianyi Zhang

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Nearly Optimal Approximate Dual-Failure Replacement Paths.

Shiri Chechik, Tianyi Zhang

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Streaming Edge Coloring with Subquadratic Palette Size.

Shiri Chechik, Doron Mukhtar, Tianyi Zhang

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size.

Shiri Chechik, Tianyi Zhang

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Faster Algorithms for Dual-Failure Replacement Paths.

Shiri Chechik, Tianyi Zhang

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

A Lossless Deamortization for Dynamic Greedy Set Cover.

Shay Solomon, Amitai Uzrad, Tianyi Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier.

Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Towards Instance-Optimal Euclidean Spanners.

Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier.

Anton Bukov, Shay Solomon, Tianyi Zhang

CoRR, 2023

Almost-Optimal Sublinear Additive Spanners.

Zihan Tan, Tianyi Zhang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths.

Shiri Chechik, Tianyi Zhang

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Faster min-plus product for monotone instances.

Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Nearly 2-Approximate Distance Oracles in Subquadratic Time.

Shiri Chechik, Tianyi Zhang

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Constant-Round Near-Optimal Spanners in Congested Clique.

Shiri Chechik, Tianyi Zhang

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Faster Cut-Equivalent Trees in Simple Graphs.

Tianyi Zhang

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Constant Approximation of Min-Distances in Near-Linear Time.

Shiri Chechik, Tianyi Zhang

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Incremental Single Source Shortest Paths in Sparse Digraphs.

Shiri Chechik, Tianyi Zhang

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Deterministic Maximum Flows in Simple Graphs.

Tianyi Zhang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time.

Shiri Chechik, Tianyi Zhang

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees.

Ran Duan, Haoqing He, Tianyi Zhang

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A Scaling Algorithm for Weighted f-Factors in General Graphs.

Ran Duan, Haoqing He, Tianyi Zhang

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference.

Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li

Mach. Learn., 2019

Dynamic Edge Coloring with Improved Approximation.

Ran Duan, Haoqing He, Tianyi Zhang

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time.

Shiri Chechik, Tianyi Zhang

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference.

Zhize Li, Tianyi Zhang, Jian Li

CoRR, 2018

An Improved Algorithm for Incremental DFS Tree in Undirected Graphs.

Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees.

Ran Duan, Haoqing He, Tianyi Zhang

CoRR, 2017

Improved Distance Sensitivity Oracles via Tree Partitioning.

Ran Duan, Tianyi Zhang

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017