Kuan Yang

Assistant Professor (tenure-track)
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University
Research Interests
I am broadly interested in theoretical computer science, (discrete) probability and combinatorics. Specifically, my current research focuses on the following topics:
  • algorithms for approximate counting and sampling;
  • analysis of Markov chains and their mixing times;
  • randomized algorithms in distributed computing.

Selected Publications
Counting solutions to random CNF formulas
with Andreas Galanis, Heng Guo and Leslie Ann Goldberg
ICALP 2020
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
with Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Štefankovič and Eric Vigoda
SIAM Journal on Discrete Mathematics, 34(1), 742–793. (Preliminary short version appeared in RANDOM 2018)
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree
with Andreas Galanis and Leslie Ann Goldberg
Electronic Journal of Probability 23 (2018), no.82, 1–43.
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
with Andreas Galanis and Leslie Ann Goldberg
Journal of Computer and System Sciences, 115:187–213, 2021. (Preliminary short version appeared in ICALP 2017)
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
with Pinyan Lu, Chihao Zhang and Minshen Zhu
SODA 2017
FPTAS for Hardcore and Ising Models on Hypergraphs
with Pinyan Lu and Chihao Zhang
STACS 2016

© John Hopcroft Center for Computer Science, Shanghai Jiao Tong University

邮箱:jhc@sjtu.edu.cn 电话:021-54740299