Go to content

Dr. Jiaheng Wang

E-Mail jiaheng.wang@ur.de

Room 532

Bajuwarenstraße 4

93053 Regensburg


Biography

Dr. Jiaheng Wang will start his employment at the Algorithms and Complexity Theory group at University of Regensburg in July 2024.

Link to Personal page


Publications

DBLP

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 and 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)


  1. Faculty of Informatics and Data Science

Chair of Algorithms and Complexity Theory


Secretary

+49 941 943-68525

sekretariat.curticapean@ur.de

Mo-Fr: 8.30-12.30 Uhr