Improved Distance Sensitivity Oracles via Tree Partitioning. - Ran Duan; Tianyi Zhang 008 (WADS, 2017)

Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. - Ran Duan; Haoqing He; Tianyi Zhang 008 (CoRR, 2017)

An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. - Lijie Chen 001; Ran Duan; Ruosong Wang; Hanrui Zhang 001; Tianyi Zhang 008 (SWAT, 2018)

Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference. - Zhize Li; Tianyi Zhang 008; Jian Li 015 (CoRR, 2018)

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. - Shiri Chechik; Tianyi Zhang 008 (FOCS, 2019)

Dynamic Edge Coloring with Improved Approximation. - Ran Duan; Haoqing He; Tianyi Zhang 008 (SODA, 2019)

Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference. - Zhize Li; Tianyi Zhang 008; Shuyu Cheng; Jun Zhu 001; Jian Li 015 (Mach. Learn., 2019)

A Scaling Algorithm for Weighted f-Factors in General Graphs. - Ran Duan; Haoqing He; Tianyi Zhang 008 (ICALP, 2020)

Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. - Ran Duan; Haoqing He; Tianyi Zhang 008 (LATIN, 2020)

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2020)

Deterministic Maximum Flows in Simple Graphs. - Tianyi Zhang 008 (ICALP, 2021)

Incremental Single Source Shortest Paths in Sparse Digraphs. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2021)

Constant Approximation of Min-Distances in Near-Linear Time. - Shiri Chechik; Tianyi Zhang 008 (FOCS, 2022)

Faster Cut-Equivalent Trees in Simple Graphs. - Tianyi Zhang 008 (ICALP, 2022)

Constant-Round Near-Optimal Spanners in Congested Clique. - Shiri Chechik; Tianyi Zhang 008 (PODC, 2022)

Nearly 2-Approximate Distance Oracles in Subquadratic Time. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2022)

Faster min-plus product for monotone instances. - Shucheng Chi; Ran Duan; Tianle Xie; Tianyi Zhang 008 (STOC, 2022)

Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2023)

Almost-Optimal Sublinear Additive Spanners. - Zihan Tan; Tianyi Zhang 008 (STOC, 2023)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. - Anton Bukov; Shay Solomon; Tianyi Zhang 008 (CoRR, 2023)

Towards Instance-Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (FOCS, 2024)

Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. - Sayan Bhattacharya; Din Carmon; Martín Costa; Shay Solomon; Tianyi Zhang 008 (FOCS, 2024)

A Lossless Deamortization for Dynamic Greedy Set Cover. - Shay Solomon; Amitai Uzrad; Tianyi Zhang 008 (FOCS, 2024)

Faster Algorithms for Dual-Failure Replacement Paths. - Shiri Chechik; Tianyi Zhang 008 (ICALP, 2024)

Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. - Shiri Chechik; Tianyi Zhang 008 (ICALP, 2024)

Streaming Edge Coloring with Subquadratic Palette Size. - Shiri Chechik; Doron Mukhtar; Tianyi Zhang 008 (ICALP, 2024)

Nearly Optimal Approximate Dual-Failure Replacement Paths. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2024)

Improved Streaming Edge Coloring. - Shiri Chechik; Hongyi Chen; Tianyi Zhang 008 (ICALP, 2025)

Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. - Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (SODA, 2025)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. - Anton Bukov; Shay Solomon; Tianyi Zhang 008 (SODA, 2025)

Vizing's Theorem in Near-Linear Time. - Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (STOC, 2025)

Approximate Light Spanners in Planar Graphs. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (CoRR, 2025)

Covering the Euclidean Plane by a Pair of Trees. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Tianyi Zhang 008 (CoRR, 2025)

A Tight Lower Bound for Doubling Spanners. - An La; Hung Le 001; Shay Solomon; Cuong Than; Vinayak; Shuang Yang; Tianyi Zhang 008 (CoRR, 2025)