Authors: Dyer, M Greenhill, C

Citation: M. Dyer et C. Greenhill, The complexity of counting graph homomorphisms, RAND STR AL, 17(3-4), 2000, pp. 260-289

Authors: Greenhill, C

Citation: C. Greenhill, The complexity of counting colourings and independent sets in sparse graphs and hypergraphs, COMP COMPLE, 9(1), 2000, pp. 52-72

Authors: Dyer, M Greenhill, C

Citation: M. Dyer et C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables, THEOR COMP, 246(1-2), 2000, pp. 265-278

Authors: Dyer, M Greenhill, C

Citation: M. Dyer et C. Greenhill, On Markov chains for independent sets, J ALGORITHM, 35(1), 2000, pp. 17-49

Authors: Dyer, M Goldberg, LA Greenhill, C Jerrum, M Mitzenmacher, M

Citation: M. Dyer et al., An extension of path coupling and its application to the Glauber dynamics for graph colorings, SIAM J COMP, 30(6), 2000, pp. 1962-1975

Authors: Bubley, R Dyer, M Greenhill, C Jerrum, M

Citation: R. Bubley et al., On approximately counting colorings of small degree graphs, SIAM J COMP, 29(2), 1999, pp. 387-400