Jiaheng Wang

27 papers A* 4A 3Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
CoRR
Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026 J jnl
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
Electron. Colloquium Comput. Complex.
Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2025 J jnl
Approximate Counting for Spin Systems in Sub-Quadratic Time.
TheoretiCS
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
2025 A conf
Can You Link Up With Treewidth?
STACS
Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2025 A* conf
Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees.
SoCG
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
2025 A conf
Sink-Free Orientations: A Local Sampler with Applications.
APPROX/RANDOM
Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang
2025 J jnl
Sink-free orientations: a local sampler with applications.
CoRR
Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang
2025 J jnl
Toward Derandomizing Markov Chain Monte Carlo.
SIAM J. Comput.
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
2024 A* conf
Approximate Counting for Spin Systems in Sub-Quadratic Time.
ICALP
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
2024 J jnl
Can You Link Up With Treewidth?
CoRR
Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2024 J jnl
Inapproximability of counting independent sets in linear hypergraphs.
Inf. Process. Lett.
Guoliang Qiu, Jiaheng Wang
2024 J jnl
Rapid mixing of the flip chain over non-crossing spanning trees.
CoRR
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
2023 — conf
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
SOSA
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2023 J jnl
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
TheoretiCS
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2023 J jnl
Approximate Counting for Spin Systems in Sub-Quadratic Time.
CoRR
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang
2023 J jnl
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields.
Inf. Comput.
Weiming Feng, Heng Guo, Jiaheng Wang
2023 A* conf
Towards derandomising Markov chain Monte Carlo.
FOCS
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
2022 J jnl
A simple polynomial-time approximation algorithm for total variation distances between product distributions.
CoRR
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2022 A conf
Improved Bounds for Randomly Colouring Simple Hypergraphs.
APPROX/RANDOM
Weiming Feng, Heng Guo, Jiaheng Wang
2022 J jnl
Improved bounds for randomly colouring simple hypergraphs.
CoRR
Weiming Feng, Heng Guo, Jiaheng Wang
2022 J jnl
Inapproximability of Counting Hypergraph Colourings.
ACM Trans. Comput. Theory
Andreas Galanis, Heng Guo, Jiaheng Wang
2022 J jnl
Inapproximability of counting independent sets in linear hypergraphs.
CoRR
Guoliang Qiu, Jiaheng Wang
2022 J jnl
Sampling from the ferromagnetic Ising model with external fields.
CoRR
Weiming Feng, Heng Guo, Jiaheng Wang
2022 J jnl
Towards derandomising Markov chain Monte Carlo.
CoRR
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin
2021 J jnl
Inapproximability of counting hypergraph colourings.
CoRR
Andreas Galanis, Heng Guo, Jiaheng Wang
2020 A* conf
On the Degree of Boolean Functions as Polynomials over ℤ
ICALP
Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng
2019 J jnl
On the Degree of Boolean Functions as Polynomials over Z
CoRR
Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng