Site Maintenance will take place from 4:00 PM on 2024-04-29 to 9:00 AM on 2024-05-01.
Please do not make any content change during this time, otherwise all the changes will be lost.

Select Publications

Journal articles

Greenhill CS; Dyer M, 2004, 'Corrigendum: The complexity of counting graph homomorphisms (Vol 17, pg 260, 2000)', Random Structures and Algorithms, 25, pp. 346 - 352

Greenhill CS; Rucinski A; Wormald NC, 2004, 'Random hypergraph processes with degree restrictions', Graphs and Combinatorics, 20, pp. 319 - 332

Dyer M; Goldberg LA; Greenhill C; Jerrum M, 2003, 'The relative complexity of approximate counting problems', Algorithmica (New York), 38, pp. 471 - 500, http://dx.doi.org/10.1007/s00453-003-1073-y

Greenhill C; Ruciski A; Wormald N, 2003, 'Connectedness of the Degree Bounded Star Process', Combinatorics, Probability and Computing, 12, pp. 269 - 283, http://dx.doi.org/10.1017/S0963548302005357

Dyer M; Goldberg LA; Greenhill C; Istrate G; Jerrum M, 2002, 'Convergence of the iterated prisoner's dilemma game', Combinatorics Probability and Computing, 11, pp. 135 - 147, http://dx.doi.org/10.1017/S096354830100503X

Dyer M; Greenhill C; Molloy M, 2002, 'Very Rapid Mixing of the Glauber Dynamics for Proper Colorings on Bounded-Degree Graphs', Random Structures and Algorithms, 20, pp. 98 - 114, http://dx.doi.org/10.1002/rsa.10020

Greenhill C; Janson S; Kim J; Wormald N, 2002, 'Permutation Pseudographs and Contiguity', Combinatorics, Probability and Computing, 11, http://dx.doi.org/10.1017/S0963548301005065

Dyer M; Greenhill C, 2000, 'Polynomial-time counting and sampling of two-rowed contingency tables', Theoretical Computer Science, 246, pp. 265 - 278, http://dx.doi.org/10.1016/S0304-3975(99)00136-X

Dyer M; Leslie Goldberg A; Greenhill C; Jerrum M; Mitzenmacheru M, 2000, 'An extension of path coupling and its application to the glauber dynamics for graph colorings', SIAM Journal on Computing, 30, pp. 1962 - 1975, http://dx.doi.org/10.1137/s0097539700372708

Dyer M; Greenhill C, 2000, 'Complexity of counting graph homomorphisms', Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 246 - 255

Dyer M; Goldberg LA; Greenhill C; Jerrum M; Mitzenmacher M, 2000, 'Extension of path coupling and its application to the Glauber dynamics for graph colourings', Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 616 - 624

Dyer M; Greenhill C, 2000, 'On Markov Chains for Independent Sets', Journal of Algorithms, 35, pp. 17 - 49, http://dx.doi.org/10.1006/jagm.1999.1071

Greenhill C, 2000, 'The complexity of counting colourings and independent sets in sparse graphs and hypergraphs', Computational Complexity, 9, pp. 52 - 72, http://dx.doi.org/10.1007/PL00001601

Dyer M; Greenhill C, 2000, 'The complexity of counting graph homomorphisms', Random Structures and Algorithms, 17, pp. 260 - 289, http://dx.doi.org/10.1002/1098-2418(200010/12)17:3/4<260::aid-rsa5>3.0.co;2-w

Greenhill C, 1999, 'An algorithm for recognising the exterior square of a matrix', Linear and Multilinear Algebra, 46, pp. 213 - 244, http://dx.doi.org/10.1080/03081089908818615

Bubley R; Dyer M; Greenhill C; Jerrum M, 1999, 'On approximately counting colorings of small degree graphs', SIAM Journal on Computing, 29, pp. 387 - 400, http://dx.doi.org/10.1137/S0097539798338175

Dyer M; Greenhill C, 1998, 'A more rapidly mixing Markov chain for graph colorings', Random Structures and Algorithms, 13, pp. 285 - 317, http://dx.doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<285::aid-rsa6>3.0.co;2-r

Dyer M; Greenhill C, 1998, 'A genuinely polynomial-time algorithm for sampling two-rowed contingency tables', , pp. 339 - 350, http://dx.doi.org/10.1007/BFb0055065

Greenhill CS, 1995, 'Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions', Journal of Symbolic Computation, 20, pp. 419 - 429, http://dx.doi.org/10.1006/jsco.1995.1057

Greenhill CS; Street AP, 1995, 'Smallest defining sets of some small t-designs and relations to the Petersen graph', Utilitas Mathematica, 48, pp. 5 - 31

Greenhill CS, 1993, 'An algorithm for finding smallest defining sets of t-designs', Journal of Combinatorial Mathematics and Combinatorial Computing, 14, pp. 39 - 60


Back to profile page