Kun He

Affiliations:
  • Renmin University of China, China


According to our database1, Kun He authored at least 17 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Phase transition of the Sinkhorn-Knopp algorithm.
CoRR, July, 2025

FPTAS for Holant Problems with Log-Concave Signatures.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Sampling Permutations Satisfying Constraints within and beyond the Local Lemma Regime.
CoRR, 2024

2023
Deterministic counting Lovász local lemma beyond linear programming.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Bounds for Sampling Solutions of Random CNF Formulas.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Moser-Tardos Algorithm: Beyond Shearer's Bound.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Perfect Sampling for (Atomic) Lovász Local Lemma.
CoRR, 2021

Sampling constraint satisfaction solutions in the local lemma regime.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Dynamic Inference in Probabilistic Graphical Models.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Graph algorithms: parallelization and scalability.
Sci. China Inf. Sci., 2020

2019
Dynamic MCMC Sampling.
CoRR, 2019

Rectangle Transformation Problem.
Algorithmica, 2019

Quantum Lovász local lemma: Shearer's bound is tight.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2017
Variable-Version Lovász Local Lemma: Beyond Shearer's Bound.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

A Tighter Relation Between Sensitivity Complexity and Certificate Complexity.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
A Tighter Relation between Sensitivity and Certificate Complexity.
CoRR, 2016


  Loading...