PDF versions are always up-to-date. Authors are listed according to the alphabetical order. Papers are sorted by date of first submission.
The complexity of computing fermionants and flow-like structures in graphs, modulo p
with Isja Mannens
submitted
Approximate counting for spin systems in sub-quadratic time
with Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo
ICALP 2024, to appear
[arxiv] | [PDF] | [PowerPoint]
Inapproximability of counting independent sets in linear hypergraphs
with Guoliang Qiu
Information Processing Letters, Volume 184, Article 106448, 1-6, 2023
[journal] | [arxiv] | [PDF]
Towards derandomising Markov chain Monte Carlo
with Weiming Feng, Heng Guo, Chunyang Wang and Yitong Yin
FOCS 2023
[arxiv] | [PDF] | [PowerPoint]
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
with Weiming Feng, Heng Guo and Mark Jerrum
TheoretiCS, Volume 2 (2023), Article 8, 1-7 (preliminary version in SOSA 2023)
[journal] | [conference] | [arXiv] | [PDF] | [PowerPoint]
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
with Weiming Feng and Heng Guo
Information and Computation, Volume 294, Article 105066, 1-34, 2023
[journal] | [arXiv] | [PDF]
Improved bounds for randomly colouring simple hypergraphs
with Weiming Feng and Heng Guo
RANDOM 2022
[conference] | [arXiv] | [PDF] | [slides]
Inapproximability of counting hypergraph colourings
with Andreas Galanis and Heng Guo
ACM Transactions on Computation Theory, 14(3-4):10, 1-33, 2022
[journal] | [arXiv] | [PDF] | [slides]
On the degree of boolean functions as polynomials over \(\mathbb{Z}_m\)
with Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia and Yufan Zheng
ICALP 2020
[conference] | [arXiv] | [PDF] | [slides]