清华大学交叉信息研究院

张天翼
Email:


I am a fourth-year PhD student in Computer Science at Tsinghua University, advised by Ran Duan. I did my undergraduate study at Tsinghua University.

I am interested in combinatorial graph algorithms.

Publications

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
Shiri Chechik, Tianyi Zhang
Symposium on Discrete Algorithms (SODA 2020)

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
Shiri Chechik, Tianyi Zhang
Foundations of Computer Science (FOCS 2019), ArXiv

Dynamic Edge Coloring with Improved Approximation
Ran Duan, Haoqing He, Tianyi Zhang
Symposium on Discrete Algorithms (SODA 2019)

Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference
Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li
The Machine Learning Journal, 2019

Improved Algorithms for Maintaining DFS Tree in Undirected Graphs
Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '18)

Improved Distance Sensitivity Oracles via Tree Partitioning
Ran Duan, Tianyi Zhang
Algorithms and Data Structures Symposium (WADS 2017), ArXiv

Manuscripts

Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees
Ran Duan, Haoqing He, Tianyi Zhang
ArXiv

Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees
Ran Duan, Tianyi Zhang
ArXiv