Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiaheng Wang 0002
Person information
- affiliation (2020-): University of Edinburgh, UK
- affiliation (2016-2020): Peking University, Beijing, China
Other persons with the same name
- Jiaheng Wang — disambiguation page
- Jiaheng Wang 0001
![[0000-0002-9783-5471]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9783-5471")
— Southeast University, Nanjing, China - Jiaheng Wang 0003 — Zhejiang University, China
- Jiaheng Wang 0004 — Victoria University of Wellington, New Zealand
- Jiaheng Wang 0005 — University of Electronic Science and Technology of China, Chengdu, Sichuan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Guoliang Qiu, Jiaheng Wang:
Inapproximability of counting independent sets in linear hypergraphs. Inf. Process. Lett. 184: 106448 (2024)- [c5]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. ICALP 2024: 11:1-11:20 - 2023
- [j3]Weiming Feng, Heng Guo, Jiaheng Wang:
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. Inf. Comput. 294: 105066 (2023) - [j2]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023) - [c4]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. FOCS 2023: 1963-1990 - [c3]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA 2023: 343-347 - [i7]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. CoRR abs/2306.14867 (2023) - 2022
- [j1]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14(3-4): 1-33 (2022) - [c2]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved Bounds for Randomly Colouring Simple Hypergraphs. APPROX/RANDOM 2022: 25:1-25:17 - [i6]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved bounds for randomly colouring simple hypergraphs. CoRR abs/2202.05554 (2022) - [i5]Weiming Feng, Heng Guo, Jiaheng Wang:
Sampling from the ferromagnetic Ising model with external fields. CoRR abs/2205.01985 (2022) - [i4]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR abs/2208.00740 (2022) - [i3]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. CoRR abs/2211.03487 (2022) - 2021
- [i2]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of counting hypergraph colourings. CoRR abs/2107.05486 (2021) - 2020
- [c1]Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng:
On the Degree of Boolean Functions as Polynomials over ℤm. ICALP 2020: 100:1-100:19
2010 – 2019
- 2019
- [i1]Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng:
On the Degree of Boolean Functions as Polynomials over Zm. CoRR abs/1910.12458 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 03:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
