Tianyi Zhang

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

2023

Streaming Edge Coloring with Subquadratic Palette Size.

[BibT_eX]

[DOI]

Doron Mukhtar

CoRR, 2023

Almost-Optimal Sublinear Additive Spanners.

[BibT_eX]

[DOI]

Zihan Tan

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.

[BibT_eX]

[DOI]

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

2022

Faster min-plus product for monotone instances.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Constant-Round Near-Optimal Spanners in Congested Clique.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2021

Incremental Single Source Shortest Paths in Sparse Digraphs.

[BibT_eX]

[DOI]

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

2020

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

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

[BibT_eX]

[DOI]

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

2019

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

[BibT_eX]

[DOI]

Mach. Learn., 2019

Dynamic Edge Coloring with Improved Approximation.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Zhize Li

Jian Li

CoRR, 2018

An Improved Algorithm for Incremental DFS Tree in Undirected Graphs.

[BibT_eX]

[DOI]

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

2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Improved Distance Sensitivity Oracles via Tree Partitioning.

[BibT_eX]

[DOI]