A Tighter Relation between Sensitivity and Certificate Complexity. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (CoRR, 2016)

Variable-Version Lovász Local Lemma: Beyond Shearer's Bound. - Kun He 011; Liang Li; Xingwu Liu; Yuyi Wang 001; Mingji Xia (FOCS, 2017)

Quantum Lovász Local Lemma: Shearer's Bound is Tight. - Kun He 011; Qian Li 012; Xiaoming Sun 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

Rectangle Transformation Problem. - Shaojiang Wang; Kun He 011; Yicheng Pan 001; Mingji Xia (Algorithmica, 2019)

Dynamic MCMC Sampling. - Weiming Feng 001; Kun He 011; Xiaoming Sun 001; Yitong Yin (CoRR, 2019)

A tighter relation between sensitivity complexity and certificate complexity. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (Theor. Comput. Sci., 2019)

Graph algorithms: parallelization and scalability. - Wenfei Fan; Kun He 011; Qian Li 012; Yue Wang (Sci. China Inf. Sci., 2020)

Dynamic Inference in Probabilistic Graphical Models. - Weiming Feng 001; Kun He 011; Xiaoming Sun 001; Yitong Yin (ITCS, 2021)

Sampling constraint satisfaction solutions in the local lemma regime. - Weiming Feng 001; Kun He 011; Yitong Yin (STOC, 2021)

Perfect Sampling for (Atomic) Lovász Local Lemma. - Kun He 011; Xiaoming Sun 001; Kewen Wu 001 (CoRR, 2021)

Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time. - Kun He 011; Chunyang Wang 003; Yitong Yin (FOCS, 2022)

Moser-Tardos Algorithm: Beyond Shearer's Bound. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (SODA, 2023)

Improved Bounds for Sampling Solutions of Random CNF Formulas. - Kun He 011; Kewen Wu 001; Kuan Yang 001 (SODA, 2023)

Deterministic counting Lovász local lemma beyond linear programming. - Kun He 011; Chunyang Wang 003; Yitong Yin (SODA, 2023)