On Model Checking Boolean BI. - Heng Guo 001; Hanpin Wang; Zhongyuan Xu; Yongzhi Cao (CSL, 2009)

The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). - Heng Guo 001; Pinyan Lu; Leslie G. Valiant (ICALP (1), 2011)

The Complexity of Weighted Boolean #CSP Modulo k. - Heng Guo 001; Sangxia Huang; Pinyan Lu; Mingji Xia (STACS, 2011)

Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. - Jin-Yi Cai; Xi Chen 001; Heng Guo 001; Pinyan Lu (COCOA, 2012)

A complete dichotomy rises from the capture of vanishing signatures: extended abstract. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (STOC, 2013)

Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. - Jin-Yi Cai; Leslie Ann Goldberg; Heng Guo 001; Mark Jerrum (CoRR, 2013)

The Complexity of Symmetric Boolean Parity Holant Problems. - Heng Guo 001; Pinyan Lu; Leslie G. Valiant (SIAM J. Comput., 2013)

The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (FOCS, 2014)

The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation. - Leslie Ann Goldberg; Heng Guo 001 (CoRR, 2014)

A Holant Dichotomy: Is the FKT Algorithm Universal? - Jin-Yi Cai; Zhiguo Fu; Heng Guo 001; Tyson Williams (FOCS, 2015)

Mapping the complexity of counting problems. - Heng Guo 001 (Bull. EATCS, 2016)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. - Jin-Yi Cai; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Mark Jerrum; Daniel Stefankovic; Eric Vigoda (J. Comput. Syst. Sci., 2016)

A Complete Dichotomy Rises from the Capture of Vanishing Signatures. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (SIAM J. Comput., 2016)

Holant Problems. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (Encyclopedia of Algorithms, 2016)

On the Complexity of Holant Problems. - Heng Guo 001; Pinyan Lu (The Constraint Satisfaction Problem, 2017)

Random cluster dynamics for the Ising model is rapidly mixing. - Heng Guo 001; Mark Jerrum (SODA, 2017)

The Complexity of Approximating complex-valued Ising and Tutte partition functions. - Leslie Ann Goldberg; Heng Guo 001 (Comput. Complex., 2017)

A simple FPRAS for bi-directed reachability. - Heng Guo 001; Mark Jerrum (CoRR, 2017)

Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond. - Heng Guo 001; Kaan Kara; Ce Zhang 001 (AISTATS, 2018)

Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. - Heng Guo 001; Mark Jerrum (ICALP, 2018)

Counting hypergraph colourings in the local lemma regime. - Heng Guo 001; Chao Liao; Pinyan Lu; Chihao Zhang 001 (STOC, 2018)

Holographic algorithms beyond matchgates. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (Inf. Comput., 2018)

Clifford gates in the Holant framework. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (Theor. Comput. Sci., 2018)

Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. - Heng Guo 001; Pinyan Lu (ACM Trans. Comput. Theory, 2018)

Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. - Mary Cryan; Heng Guo 001; Giorgos Mousa (FOCS, 2019)

Uniform Sampling Through the Lovász Local Lemma. - Heng Guo 001; Mark Jerrum; Jingcheng Liu 001 (J. ACM, 2019)

Counting Hypergraph Colorings in the Local Lemma Regime. - Heng Guo 001; Chao Liao; Pinyan Lu; Chihao Zhang 001 (SIAM J. Comput., 2019)

Approximation via Correlation Decay When Strong Spatial Mixing Fails. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Daniel Stefankovic (SIAM J. Comput., 2019)

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. - Heng Guo 001; Mark Jerrum (SIAM J. Comput., 2019)

Zeros of ferromagnetic 2-spin systems. - Heng Guo 001; Jingcheng Liu 001; Pinyan Lu (SODA, 2020)

Fast sampling and counting k-SAT solutions in the local lemma regime. - Weiming Feng 001; Heng Guo 001; Yitong Yin; Chihao Zhang 001 (STOC, 2020)

End-to-end Robustness for Sensing-Reasoning Machine Learning Pipelines. - Zhuolin Yang; Zhikuan Zhao; Hengzhi Pei; Boxin Wang; Bojan Karlas; Ji Liu 002; Heng Guo 001; Bo Li 026; Ce Zhang 001 (CoRR, 2020)

Local-to-Global Contraction in Simplicial Complexes. - Heng Guo 001; Giorgos Mousa (CoRR, 2020)

The complexity of planar Boolean #CSP with complex weights. - Heng Guo 001; Tyson Williams (J. Comput. Syst. Sci., 2020)

Tight bounds for popping algorithms. - Heng Guo 001; Kun He (Random Struct. Algorithms, 2020)

Counting vertices of integer polytopes defined by facets. - Heng Guo 001; Mark Jerrum (CoRR, 2021)

Approximately counting bases of bicircular matroids. - Heng Guo 001; Mark Jerrum (Comb. Probab. Comput., 2021)

Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime. - Weiming Feng 001; Heng Guo 001; Yitong Yin; Chihao Zhang 001 (J. ACM, 2021)

Counting Solutions to Random CNF Formulas. - Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Kuan Yang 001 (SIAM J. Comput., 2021)

Zeros of Holant Problems: Locations and Algorithms. - Heng Guo 001; Chao Liao; Pinyan Lu; Chihao Zhang 001 (ACM Trans. Algorithms, 2021)

Improved Bounds for Randomly Colouring Simple Hypergraphs. - Weiming Feng 001; Heng Guo 001; Jiaheng Wang 002 (APPROX/RANDOM, 2022)

Improving Certified Robustness via Statistical Learning with Logical Reasoning. - Zhuolin Yang; Zhikuan Zhao; Boxin Wang; Jiawei Zhang 002; Linyi Li 001; Hengzhi Pei; Bojan Karlas; Ji Liu 002; Heng Guo 001; Ce Zhang 001; Bo Li 026 (NeurIPS, 2022)

Sampling from the ferromagnetic Ising model with external fields. - Weiming Feng 001; Heng Guo 001; Jiaheng Wang 002 (CoRR, 2022)

Fast sampling of satisfying assignments from random k-SAT. - Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Andrés Herrera-Poyatos (CoRR, 2022)

A simple polynomial-time approximation algorithm for total variation distances between product distributions. - Weiming Feng 001; Heng Guo 001; Mark Jerrum; Jiaheng Wang 002 (CoRR, 2022)

FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. - Jin-Yi Cai; Zhiguo Fu; Heng Guo 001; Tyson Williams (Theory Comput. Syst., 2022)

Perfect sampling from spatial mixing. - Weiming Feng 001; Heng Guo 001; Yitong Yin (Random Struct. Algorithms, 2022)

Rapid Mixing from Spectral Independence beyond the Boolean Domain. - Weiming Feng 001; Heng Guo 001; Yitong Yin; Chihao Zhang 001 (ACM Trans. Algorithms, 2022)

Inapproximability of Counting Hypergraph Colourings. - Andreas Galanis; Heng Guo 001; Jiaheng Wang 002 (ACM Trans. Comput. Theory, 2022)

Towards derandomising Markov chain Monte Carlo. - Weiming Feng 001; Heng Guo 001; Chunyang Wang 003; Jiaheng Wang 002; Yitong Yin (FOCS, 2023)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. - Weiming Feng 001; Heng Guo 001; Mark Jerrum; Jiaheng Wang 002 (TheoretiCS, 2023)

Counting Vertices of Integral Polytopes Defined by Facets. - Heng Guo 001; Mark Jerrum (Discret. Comput. Geom., 2023)

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. - Weiming Feng 001; Heng Guo 001; Jiaheng Wang 002 (Inf. Comput., 2023)

Near-Linear Time Samplers for Matroid Independent Sets with Applications. - Xiaoyu Chen; Heng Guo 001; Xinyuan Zhang; Zongrui Zou (APPROX/RANDOM, 2024)

An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. - Weiming Feng 001; Heng Guo 001 (ICALP, 2024)

Deterministic counting from coupling independence. - Xiaoyu Chen; Weiming Feng 001; Heng Guo 001; Xinyuan Zhang; Zongrui Zou (CoRR, 2024)

Fast Sampling of Satisfying Assignments from Random ( boldsymbol{k} )-SAT with Applications to Connectivity. - Zongchen Chen; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Andrés Herrera-Poyatos; Nitya Mani; Ankur Moitra (SIAM J. Discret. Math., 2024)

Sink-Free Orientations: A Local Sampler with Applications. - Konrad Anand; Graham Freifeld; Heng Guo 001; Chunyang Wang 003; Jiaheng Wang 002 (APPROX/RANDOM, 2025)

Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees. - Konrad Anand; Weiming Feng 001; Graham Freifeld; Heng Guo 001; Mark Jerrum; Jiaheng Wang 002 (SoCG, 2025)

Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope. - Heng Guo 001; Vishvajeet N (ITCS, 2025)

Toward Derandomizing Markov Chain Monte Carlo. - Weiming Feng 001; Heng Guo 001; Chunyang Wang 003; Jiaheng Wang 002; Yitong Yin (SIAM J. Comput., 2025)

Approximate Counting for Spin Systems in Sub-Quadratic Time. - Konrad Anand; Weiming Feng 001; Graham Freifeld; Heng Guo 001; Jiaheng Wang 002 (TheoretiCS, 2025)