| A theoretical foundation of the target-decoy search strategy for false discovery rate control in proteomics K He, Y Fu, WF Zeng, L Luo, H Chi, C Liu, LY Qing, RX Sun, SM He arXiv preprint arXiv:1501.00537, 2015 | 42 | 2015 |
| Sampling constraint satisfaction solutions in the local lemma regime W Feng, K He, Y Yin Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 20 | 2021 |
| Tight bounds for popping algorithms H Guo, K He Random Structures & Algorithms 57 (2), 371-392, 2020 | 18 | 2020 |
| Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time K He, C Wang, Y Yin 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Perfect Sampling for (Atomic) Lov\'asz Local Lemma K He, X Sun, K Wu arXiv preprint arXiv:2107.03932, 2021 | 15 | 2021 |
| Improved Bounds for Sampling Solutions of Random CNF Formulas K He, K Wu, K Yang Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 12 | 2023 |
| A direct approach to false discovery rates by decoy permutations K He, M Li, Y Fu, F Gong, X Sun arXiv preprint arXiv:1804.08222, 2018 | 10 | 2018 |
| Variable-version Lovász local lemma: Beyond Shearer's bound K He, L Li, X Liu, Y Wang, M Xia 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 10 | 2017 |
| A tighter relation between sensitivity and certificate complexity K He, Q Li, X Sun arXiv preprint arXiv:1609.04342, 2016 | 10 | 2016 |
| Quantum Lovász local lemma: Shearer’s bound is tight K He, Q Li, X Sun, J Zhang Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 8 | 2019 |
| Deterministic counting Lovász local lemma beyond linear programming K He, C Wang, Y Yin Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |
| Null-free False Discovery Rate Control Using Decoy Permutations K He, M Li, Y Fu, F Gong, X Sun Acta Mathematicae Applicatae Sinica, English Series 38 (2), 235-253, 2022 | 5 | 2022 |
| Moser-Tardos Algorithm: Beyond Shearer's Bound K He, Q Li, X Sun Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 4 | 2023 |
| A tighter relation between sensitivity complexity and certificate complexity K He, Q Li, X Sun Theoretical Computer Science 762, 1-12, 2019 | 2 | 2019 |
| Dynamic inference in probabilistic graphical models W Feng, K He, X Sun, Y Yin arXiv preprint arXiv:1904.11807, 2019 | 1 | 2019 |
| Rectangle Transformation Problem S Wang, K He, Y Pan, M Xia Algorithmica 81, 2876-2898, 2019 | | 2019 |
