Colin McQuillan

Affiliations:

University of Liverpool, UK

According to our database¹, Colin McQuillan authored at least 9 papers between 2011 and 2020.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2020

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

2015

Counting List Matrix Partitions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Approximating the partition function of planar two-state spin systems.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Mark Jerrum

Colin McQuillan

J. Comput. Syst. Sci., 2015

The complexity of approximating conservative counting CSPs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

2013

The computational complexity of approximation of partition functions.

[BibT_eX]

[DOI]

Colin McQuillan

PhD thesis, 2013

The expressibility of functions on the boolean domain, with applications to counting CSPs.

[BibT_eX]

[DOI]

J. ACM, 2013

Approximating Holant problems by winding

[BibT_eX]

[DOI]

Colin McQuillan

CoRR, 2013

2012

Degree two approximate Boolean #CSPs with variable weights

[BibT_eX]

[DOI]

Colin McQuillan

CoRR, 2012

2011

LSM is not generated by binary functions

[BibT_eX]

[DOI]

Colin McQuillan

CoRR, 2011

Colin McQuillan

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...