Scholar
Jiaheng Wang
Google Scholar ID: sIplfzsAAAAJ
University of Regensburg
Citations & Impact
Citations
83
H-index
5
i10-index
5
Publications
12
Co-authors
11
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Please view this page for a list of research outputs.
Research Experience
- Currently a postdoctoral researcher at the Faculty of Informatics and Data Science, University of Regensburg, working in the Algorithms and Complexity Theory group led by Radu Curticapean. Previously, a Postdoctoral Research Associate (PDRA) at the School of Informatics, University of Edinburgh.
Education
- PhD: University of Edinburgh, supervised by Heng Guo; BSc (summa cum laude): Peking University, member of PKU’s Turing Class.
Background
- Research interests: several topics in theoretical computer science, including (randomized) algorithms and complexity of approximate counting, extremal/probabilistic combinatorics. The focus of recent research is on different aspects of approximate counting problems beyond (in)tractability.
Miscellany
- Erdős-Bacon-Sabbath number is infinity - not revealing the Erdős number here (it’s a constant). One of his life goals is to bound this number by a constant. If you add “misc” after the slash of this page’s URL then you could find some personal stuff like hobbies.
