Biography

I am Chunyang Wang (王淳扬), currently a project researcher (postdoc) in the National Institute of Informatics (NII, 国立情報学研究所), hosted by Prof. Yuichi Yoshida.

Prior to that, I received my Ph.D. degree in the Theory Group in the Department of Computer Science and Technology at Nanjing University, where I was fortunate to have Prof. Yitong Yin be my advisor.

My research interest lies in a broad aspect of computer science. Currently, I am focusing on algorithms for counting and sampling, as well as algorithmic stability.

Research Interests
  • Algorithms for counting and sampling
  • Computational phase transitions
  • Algorithmic stability
Education
  • BSc in Computer Science, 2016-2020

    Nanjing University (NJU)

  • Ph.D. in Computer Science, 2020-2025

    Nanjing University (NJU)

Publications

(2025). Local Gibbs sampling beyond local uniformity. to appear in the 37th ACM-SIAM Symposium on Discrete Algorithms (SODA 2026).

PDF Cite Poster Slides arXiv

(2025). Sink-free orientations: a local sampler with applications. in the 29th International Conference on Randomization and Computation (RANDOM 2025).

PDF Cite arXiv RANDOM_ver

(2025). Counting random k-SAT near the satisfiability threshold. in the 57th ACM Symposium on Theory of Computing (STOC 2025).

PDF Cite Slides arXiv STOC_ver

(2025). Phase Transitions via Complex Extensions of Markov Chains. in the 57th ACM Symposium on Theory of Computing (STOC 2025).

PDF Cite arXiv STOC_ver Yixiao's slides

(2024). A Sampling Lovász Local Lemma for Large Domain Sizes. in the 65th IEEE Symposium on Foundations of Computer Science (FOCS 2024).

PDF Cite Slides arXiv FOCS_ver talk

(2023). Towards derandomising Markov Chain Monte Carlo. in the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023)
SIAM Journal on Computing (SICOMP) 54(3): 775-813 (2025).

PDF Cite Slides arXiv FOCS_ver SICOMP_ver Weiming's slides Weiming's poster Heng's slides Heng's talk Jiaheng's slides

(2022). Deterministic counting Lovász local lemma beyond linear programming. in the 34th ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).

PDF Cite Slides arXiv SODA_ver

(2022). Sampling Lovász Local Lemma for General Constraint Satisfaction Solutions in Near-Linear Time. in the 63rd IEEE Symposium on Foundations of Computer Science (FOCS 2022).

PDF Cite Slides arXiv FOCS_ver

Contact

  • c_wang AT nii DOT ac DOT jp
  • 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430