default search action
Kun He 0011
Person information
- affiliation: University of Chinese Academy of Sciences. Beijing, China
Other persons with the same name
- Kun He — disambiguation page
- Kun He 0001
— Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
- Kun He 0002 — Institute of Automation, Chinese Academy of Sciences, Beijing, China
- Kun He 0003
- Kun He 0004 — Beijing University of Chemical Technology, Beijing, China
- Kun He 0005 — Nanjing University of Aeronautics and Astronautics, Jiangsu, China
- Kun He 0006 — CentraleSupélec, France (and 1 more)
- Kun He 0007
- Kun He 0008
- Kun He 0009 — The Australian National University, Canberra, Australia
- Kun He 0010 — National University of Defense Technology, Changsha, China
- Kun He 0012 — Peking University, Beijing, China
- Kun He 0013 — Tencent Corporation, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c9]Kun He, Kewen Wu, Kuan Yang:
Improved Bounds for Sampling Solutions of Random CNF Formulas. SODA 2023: 3330-3361 - [c8]Kun He, Qian Li, Xiaoming Sun
Moser-Tardos Algorithm: Beyond Shearer's Bound. SODA 2023: 3362-3387 - [c7]Kun He, Chunyang Wang, Yitong Yin:
Deterministic counting Lovász local lemma beyond linear programming. SODA 2023: 3388-3425 - 2022
- [c6]Kun He, Chunyang Wang, Yitong Yin:
Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time. FOCS 2022: 147-158 - [i12]Kun He, Chunyang Wang, Yitong Yin:
Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time. CoRR abs/2204.01520 (2022) - [i11]Kun He, Kewen Wu, Kuan Yang:
Improved Bounds for Sampling Solutions of Random CNF Formulas. CoRR abs/2207.11892 (2022) - [i10]Kun He, Chunyang Wang, Yitong Yin:
Deterministic counting Lovász local lemma beyond linear programming. CoRR abs/2212.14847 (2022) - 2021
- [c5]Weiming Feng, Kun He, Xiaoming Sun
Dynamic Inference in Probabilistic Graphical Models. ITCS 2021: 25:1-25:20 - [c4]Weiming Feng, Kun He, Yitong Yin:
Sampling constraint satisfaction solutions in the local lemma regime. STOC 2021: 1565-1578 - [i9]Kun He, Xiaoming Sun, Kewen Wu:
Perfect Sampling for (Atomic) Lovász Local Lemma. CoRR abs/2107.03932 (2021) - [i8]Kun He, Qian Li, Xiaoming Sun:
Moser-Tardos Algorithm: Beyond Shearer's Bound. CoRR abs/2111.06527 (2021) - 2020
- [j3]Wenfei Fan, Kun He, Qian Li, Yue Wang:
Graph algorithms: parallelization and scalability. Sci. China Inf. Sci. 63(10): 1-21 (2020) - [i7]Weiming Feng, Kun He, Yitong Yin:
Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. CoRR abs/2011.03915 (2020)
2010 – 2019
- 2019
- [j2]Shaojiang Wang, Kun He, Yicheng Pan
Rectangle Transformation Problem. Algorithmica 81(7): 2876-2898 (2019) - [j1]Kun He, Qian Li, Xiaoming Sun
A tighter relation between sensitivity complexity and certificate complexity. Theor. Comput. Sci. 762: 1-12 (2019) - [c3]Kun He, Qian Li, Xiaoming Sun
Quantum Lovász local lemma: Shearer's bound is tight. STOC 2019: 461-472 - [i6]Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin:
Dynamic MCMC Sampling. CoRR abs/1904.11807 (2019) - 2018
- [i5]Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász Local Lemma: Shearer's Bound is Tight. CoRR abs/1804.07055 (2018) - [i4]Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász Local Lemma: Shearer's Bound is Tight. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. COCOON 2017: 262-274 - [c1]Kun He, Liang Li, Xingwu Liu, Yuyi Wang, Mingji Xia:
Variable-Version Lovász Local Lemma: Beyond Shearer's Bound. FOCS 2017: 451-462 - [i3]Kun He, Liang Li, Xingwu Liu, Yuyi Wang, Mingji Xia:
Variable Version Lovász Local Lemma: Beyond Shearer's Bound. CoRR abs/1709.05143 (2017) - [i2]Shaojiang Wang, Kun He, Yicheng Pan, Mingji Xia:
Rectangle Transformation Problem. CoRR abs/1710.10924 (2017) - 2016
- [i1]Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation between Sensitivity and Certificate Complexity. CoRR abs/1609.04342 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: