A complete dichotomy rises from the capture of vanishing signatures: extended abstract. - Jin-Yi Cai; Heng Guo 001; Tyson Williams (STOC, 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)

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

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)

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)

Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy. - Jin-Yi Cai; Michael Kowalczyk; Tyson Williams (ACM Trans. Comput. Theory, 2019)

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

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)