LSM is not generated by binary functions - Colin McQuillan (CoRR, 2011)

Degree two approximate Boolean #CSPs with variable weights - Colin McQuillan (CoRR, 2012)

Approximating Holant problems by winding - Colin McQuillan (CoRR, 2013)

The expressibility of functions on the boolean domain, with applications to counting CSPs. - Andrei A. Bulatov; Martin E. Dyer; Leslie Ann Goldberg; Mark Jerrum; Colin McQuillan (J. ACM, 2013)

The computational complexity of approximation of partition functions. - Colin McQuillan (2013)

The complexity of approximating conservative counting CSPs. - Xi Chen 001; Martin E. Dyer; Leslie Ann Goldberg; Mark Jerrum; Pinyan Lu; Colin McQuillan; David Richerby (J. Comput. Syst. Sci., 2015)

Approximating the partition function of planar two-state spin systems. - Leslie Ann Goldberg; Mark Jerrum; Colin McQuillan (J. Comput. Syst. Sci., 2015)

Counting List Matrix Partitions of Graphs. - Andreas Göbel 001; Leslie Ann Goldberg; Colin McQuillan; David Richerby; Tomoyuki Yamakami (SIAM J. Comput., 2015)

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. - Miriam Backens; Andrei Bulatov 001; Leslie Ann Goldberg; Colin McQuillan; Stanislav Zivný (J. Comput. Syst. Sci., 2020)