Biography
Dr. Jiaheng Wang started his employment at the Algorithms and Complexity Theory group at University of Regensburg in July 2024.
Jiaheng Wang worked as a postdoctoral research associate at the University of Edinburgh from 2023 to 2024. Prior to this, he obtained his PhD degree in 2023 from the University of Edinburgh, supervised by Dr. Heng Guo. Even earlier, he obtained his BSc degree (summa cum laude) in 2020 from Peking University as a member of the Turing Class.
His main research interest is about counting problems and their connections with other topics beyond complexity theory, including statistic physics, polynomials and computational geometry.
Link to Personal page
Publications
Selected publications:
- Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang. Approximate counting for spin systems in sub-quadratic time. ICALP 2024. (19 pages)
- Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin. Towards derandomising Markov chain Monte Carlo. FOCS 2023. (64 pages)
- Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang. A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. Theoretics, Volumn 2, Article 8. (Preliminary version in SOSA 2023.) (5 pages)
- Andreas Galanis, Heng Guo, Jiaheng Wang. Inapproximability of counting hypergraph colourings. ACM Transactions on Computation Theory, 14(3-4):10. (29 pages)
