Zhidan Li 李至丹
Ph.D. candidate in Computer Science
John Hopcroft Center, Shanghai Jiao Tong University
I study approximate counting and sampling in theoretical computer science, with a focus on random structures and algorithms inspired by statistical physics.
I am advised by Kuan Yang. I received my B.E. in Computer Science from Shanghai Jiao Tong University in 2023 through the ACM Honor Class.
Recent publications
All publications-
Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold
Preprint
-
Fast Almost-Uniform Sampling of Random k-SAT Solutions
Preprint
-
Spatial mixing and deterministic approximate counting of multi-spin systems beyond bounded degree graphs
Preprint