Kun He

Address: Room 841, Institute of Computing Technology, CAS
No.6 Kexueyuan South Road, Zhongguancun
Haidian District, Beijing 100190, China
Email: hekun@ict.ac.cn

Research Interests
Probabilistic method, counting and sampling
♦ Ph.D. in Computer Science 2015/09 -- 2019/07
Institute of Computing Technology (ICT), Chinese Academy of Sciences (CAS)
Advisor: Prof. Xiaoming Sun

♦ M.S. in Computer Science 2010/09 -- 2014/01
Institute of Computing Technology, Chinese Academy of Sciences

♦ B.E. in Computer Science 006/09 -- 2010/07
Wuhan University

♦ Weiming Feng, Kun He, Yitong Yin: Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. Accepted to 53rd Annual ACM Symposium on Theory of Computing (STOC 2021). [arXiv]

♦ Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin: Dynamic Inference in Probabilistic Graphical Models. In 12th Innovations in Theoretical Computer Science Conference, pp. 25:1–25:20. [arXiv]

♦ Heng Guo, Kun He: Tight bounds for popping algorithms. Random Structures & Algorithms, 57(2), pp. 371-392.

♦ Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang: Quantum Lovász local lemma: Shearer's bound is tight. In 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), pp. 461-472. [arXiv]

♦ Kun He, Qian Li, Xiaoming Sun: A tighter relation between sensitivity complexity and certificate complexity. Theoretical Computer Science, 762, pp. 1-12.

♦ Kun He, Liang Li, Xingwu Liu, Yuyi Wang and Mingji Xia: Variable Version Lovász Local Lemma: Beyond Shearer's Bound. In 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2017), pp. 451-462.

♦ Kun He, Qian Li, Xiaoming Sun: A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. In 23rd International Conference on Computing and Combinatorics Conference (COCOON 2017), pp. 262-274.