Jiaheng Wang

Contact

Address:
Department of Computer Science, University of Helsinki
Email: pw384 # hotmail # com
CV: [Here] (Last update: 01/04/2026 dd/mm/yyyy)
[Google Scholar] | [ORCID] | [dblp]

Hej!

I am currently a postdoctoral fellow at Helsinki Institute for Information Technology (HIIT) (a joint institute between University of Helsinki and Aalto University, see also HALT), hosted by Mikko Koivisto. Before that, I was a postdoctoral researcher at the Faculty of Informatics and Data Science, University of Regensburg, working in the Algorithms and Complexity Theory group (Lehrstuhl) led by Radu Curticapean, and a Postdoctoral Research Associate (PDRA) at the School of Informatics, University of Edinburgh. I obtained a PhD degree at the University of Edinburgh under the supervision of Heng Guo. Even earlier, I got a Bachelor of Science (summa cum laude) at Peking University and was a member of PKU’s Turing Class. Previous experience could be found in the CV provided above.

Misc


Research

My research interest lies in several topics in theoretical computer science. To be more precise, I enjoy problems with inspiring combinatorial structures and/or surprising computational hardness. That includes (randomised) algorithms and complexity of approximate counting, and extremal/probabilistic combinatorics.

The focus of my recent research is different aspects of approximate counting problems beyond (in)tractability, such as random structures, derandomisation, fine-grained perspective, parameterised counting, applications to other fields, and so on.

Please view this page for a list of research outputs.


Tools: Useful inequalities || mathcha
Job hunting: TCS Jobs || Math Jobs || DMANET
OA books / notes: UW CSE599 || MIT 18.225 || Levin-Peres || Arora-Barak || Friedli-Velenik
Good TCS websites: Complexity Zoo || Property Testing Review || FPT Wiki
Miscellaneous: Encyclopaedia Metallum