PDF versions are NOT always up-to-date. Authors are listed according to the alphabetical order. Papers are sorted by date of first submission.
Papers listed here are significantly AI-assisted but responsibly processed and endorsed by human being(s)
Homomorphic-core phase transition threshold in Erdős–Rényi random graphs
with Deus ex machina
submitted
[arXiv] | [PDF]
Papers listed here are due to human effort with no or negligible AI involved
I have removed all the publication venues (except for papers in submission). The prevailing mindset of treating TCS conferences as competition arenas makes zero sense, and should have been making zero sense, especially in view of the current AI development. The idea is inspired by Oded Goldreich in one of his essay/opinion writing.
Planar Perfect Matching Counting is as Hard as Determinants
with Radu Curticapean
submitted
[arXiv] | [PDF]
Partition Rank and Algebraic Circuit Lower Bounds
with Cornelius Brand and Petteri Kaski
[conference] | [arXiv] | [PDF]
[PowerPoint]
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
with Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel and Tim Seppelt
[conference] | [arXiv] | [PDF]
[PowerPoint]
Sink-free orientations: a local sampler with applications
with Konrad Anand, Graham Freifeld, Heng Guo and Chunyang Wang
[conference] | [arXiv] | [PDF]
Can you link up with treewidth?
with Radu Curticapean, Simon Döring and Daniel Neuen
[journal] | [conference] | [arXiv] | [PDF]
[Slides] (only work with Adobe Acrobat)
Rapid mixing of the flip chain over non-crossing spanning trees
with Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo and Mark Jerrum
[conference] | [arXiv] | [PDF]
[PDF Poster]
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 and Heng Guo
[journal] | [conference] | [arXiv] | [PDF]
[PowerPoint]
Inapproximability of counting independent sets in linear hypergraphs
with Guoliang Qiu
[journal] | [arXiv] | [PDF]
Towards derandomising Markov chain Monte Carlo
with Weiming Feng, Heng Guo, Chunyang Wang and Yitong Yin
[journal] | [conference] | [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
[journal] | [conference] | [arXiv] | [PDF]
[PowerPoint]
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
with Weiming Feng and Heng Guo
[journal] | [arXiv] | [PDF]
Improved bounds for randomly colouring simple hypergraphs
with Weiming Feng and Heng Guo
[conference] | [arXiv] | [PDF]
[slides]
Inapproximability of counting hypergraph colourings
with Andreas Galanis and Heng Guo
[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
[conference] | [arXiv] | [PDF]
[slides]