Tianyi Zhang - RankMe

52 papers A* 27B 2Journal 22Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Approximate Light Spanners in Planar Graphs. SODA Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2026	A*	`conf`	Covering the Euclidean Plane by a Pair of Trees. SODA Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2026	A*	`conf`	Vizing's Theorem in Deterministic Almost-Linear Time. SODA Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	A Tight Lower Bound for Doubling Spanners. CoRR An La, Hung Le, Shay Solomon, Cuong Than, Vinayak, Shuang Yang, Tianyi Zhang
2025	J	`jnl`	Approximate Light Spanners in Planar Graphs. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Approximating Euclidean Shallow-Light Trees. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Covering the Euclidean Plane by a Pair of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. SODA Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Improved Streaming Edge Coloring. ICALP Shiri Chechik, Hongyi Chen, Tianyi Zhang
2025	J	`jnl`	Improved Streaming Edge Coloring. CoRR Shiri Chechik, Hongyi Chen, Tianyi Zhang
2025	A*	`conf`	Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- SODA Anton Bukov, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	Vizing's Theorem in Deterministic Almost-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Vizing's Theorem in Near-Linear Time. STOC Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	A Lossless Deamortization for Dynamic Greedy Set Cover. FOCS Shay Solomon, Amitai Uzrad, Tianyi Zhang
2024	J	`jnl`	A Lossless Deamortization for Dynamic Greedy Set Cover. CoRR Shay Solomon, Amitai Uzrad, Tianyi Zhang
2024	J	`jnl`	Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. CoRR Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024	J	`jnl`	Faster (Δ + 1)-Edge Coloring: Breaking the m √n Time Barrier. CoRR Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. FOCS Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	Faster Algorithms for Dual-Failure Replacement Paths. ICALP Shiri Chechik, Tianyi Zhang
2024	J	`jnl`	Faster Algorithms for Dual-Failure Replacement Paths. CoRR Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Nearly Optimal Approximate Dual-Failure Replacement Paths. SODA Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. ICALP Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Streaming Edge Coloring with Subquadratic Palette Size. ICALP Shiri Chechik, Doron Mukhtar, Tianyi Zhang
2024	A*	`conf`	Towards Instance-Optimal Euclidean Spanners. FOCS Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	J	`jnl`	Towards Instance-Optimal Euclidean Spanners. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	J	`jnl`	Vizing's Theorem in Near-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2023	A*	`conf`	Almost-Optimal Sublinear Additive Spanners. STOC Zihan Tan, Tianyi Zhang
2023	J	`jnl`	Almost-Optimal Sublinear Additive Spanners. CoRR Zihan Tan, Tianyi Zhang
2023	A*	`conf`	Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. SODA Shiri Chechik, Tianyi Zhang
2023	J	`jnl`	Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. CoRR Anton Bukov, Shay Solomon, Tianyi Zhang
2023	J	`jnl`	Streaming Edge Coloring with Subquadratic Palette Size. CoRR Shiri Chechik, Doron Mukhtar, Tianyi Zhang
2022	A*	`conf`	Constant Approximation of Min-Distances in Near-Linear Time. FOCS Shiri Chechik, Tianyi Zhang
2022	A*	`conf`	Constant-Round Near-Optimal Spanners in Congested Clique. PODC Shiri Chechik, Tianyi Zhang
2022	A*	`conf`	Faster Cut-Equivalent Trees in Simple Graphs. ICALP Tianyi Zhang
2022	J	`jnl`	Faster Min-Plus Product for Monotone Instances. CoRR Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang
2022	A*	`conf`	Faster min-plus product for monotone instances. STOC Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang
2022	A*	`conf`	Nearly 2-Approximate Distance Oracles in Subquadratic Time. SODA Shiri Chechik, Tianyi Zhang
2021	A*	`conf`	Deterministic Maximum Flows in Simple Graphs. ICALP Tianyi Zhang
2021	A*	`conf`	Incremental Single Source Shortest Paths in Sparse Digraphs. SODA Shiri Chechik, Tianyi Zhang
2020	A*	`conf`	A Scaling Algorithm for Weighted f-Factors in General Graphs. ICALP Ran Duan, Haoqing He, Tianyi Zhang
2020	J	`jnl`	A Scaling Algorithm for Weighted f-Factors in General Graphs. CoRR Ran Duan, Haoqing He, Tianyi Zhang
2020	A*	`conf`	Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. SODA Shiri Chechik, Tianyi Zhang
2020	B	`conf`	Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. LATIN Ran Duan, Haoqing He, Tianyi Zhang
2019	A*	`conf`	Dynamic Edge Coloring with Improved Approximation. SODA Ran Duan, Haoqing He, Tianyi Zhang
2019	A*	`conf`	Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. FOCS Shiri Chechik, Tianyi Zhang
2019	J	`jnl`	Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. CoRR Shiri Chechik, Tianyi Zhang
2019	J	`jnl`	Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference. Mach. Learn. Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li
2018	—	`conf`	An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang
2018	J	`jnl`	Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference. CoRR Zhize Li, Tianyi Zhang, Jian Li
2017	B	`conf`	Improved Distance Sensitivity Oracles via Tree Partitioning. WADS Ran Duan, Tianyi Zhang
2017	J	`jnl`	Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. CoRR Ran Duan, Haoqing He, Tianyi Zhang
2016	J	`jnl`	Improved distance sensitivity oracles via tree partitioning. CoRR Ran Duan, Tianyi Zhang