Kuan Yang   (杨 宽)

Email: kuan [dot] yang [at] sjtu [dot] edu [dot] cn

Room 1402, School of Software

John Hopcroft Center for Computer Science, Shanghai Jiao Tong University


  1. Improved Bounds for Sampling Solutions of Random CNF Formulas
    with K. He, and K. Wu.
    To appear in SODA 2023.

  2. Power law decay at criticality for the q-state antiferromagnetic Potts model on regular trees
    with C. Gu, and W. Wu.

  3. Counting solutions to random CNF formulas
    with A. Galanis, H. Guo, and L. Goldberg.
    SIAM Journal on Computing, 50(6): 1701-1738, 2021.

  4. Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
    with A. Galanis, and L. Goldberg.
    Journal of Computer and System Sciences, 115: 187-213, 2021.

  5. Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
    with A. Blanca, A. Galanis, L. Goldberg, D. Štefankovič, and E. Vigoda.
    SIAM Journal on Discrete Mathematics, 34(1): 742-793, 2020.

  6. Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree
    with A. Galanis, and L. Goldberg.
    Electronic Journal of Probability, 23: paper no. 82, 43 pp, 2018.

  7. An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
    with P. Lu, C. Zhang, and M. Zhu.
    ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017.

  8. FPTAS for Hardcore and Ising Models on Hypergraphs
    with P. Lu, and C. Zhang.
    Symposium on Theoretical Aspects of Computer Science (STACS), 2016.

  9. Graph metric with no proper inclusion between lines
    with X. Chen, G. Huzhang, and P. Miao.
    Discrete Applied Mathematics, 185: 59-70, 2015.