Kun He received his Ph.D. degree from the Institute of Computing Technology, Chinese Academy of Sciences in 2019. Currently he is a researcher in Shenzhen Institute of Computing Sciences.
- Theoretic computer science, with an emphasis on probabilistic method and sampling.
- Kun He, Qian Li, Xiaoming Sun：Quantum Lovász Local Lemma: Shearer’s Bound Is Tight . ACM Symposium on the Theory of Computing(STOC 2019),Jun 23-26, 2019,Phoenix, Arizona, USA ：461-472
- Heng Guo, Kun He：Tight bounds for popping algorithms. RANDOM STRUCTURES & ALGORITHMS
- Kun He ,Xiaoming Sun：New versions of Lovasz Local Lemma and their applications. SCIENCE CHINA Information Sciences