By Professor Catherine Greenhill

Conference Papers

Cooper C; Dyer M; Greenhill C, 2021, 'A Triangle Process on Regular Graphs', in Flocchini P; Moura L (ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, ELECTR NETWORK, pp. 310 - 323, presented at 32nd International Workshop on Combinatorial Algorithms (IWOCA), ELECTR NETWORK, 05 July 2021 - 07 July 2021, http://dx.doi.org/10.1007/978-3-030-79987-8_22

Greenhill C; Mans B; Pourmiri A, 2020, 'Balanced allocation on dynamic hypergraphs', in Leibniz International Proceedings in Informatics, LIPIcs, http://dx.doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.11

Greenhill CS, 2015, 'The switch Markov chain for sampling irregular graphs', in The 26th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, San Diego, CA, USA, pp. 1565 - 1572, presented at 26th annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, USA, 04 January 2015 - 06 January 2015, http://dx.doi.org/10.1137/1.9781611973730.103

Dyer M; Greenhill CS, 2000, 'An extension of path coupling and its application to the Glauber dynamics for graph colourings (Extended abstract)', New York-Philadelphia, pp. 616 - 624, presented at 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 09 January 2000 - 11 January 2000

Dyer M; Greenhill C, 2000, 'The complexity of counting graph homomorphisms (extended abstract)', in PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SIAM, CA, SAN FRANCISCO, pp. 246 - 255, presented at 11th Annual ACM/SIAM Symposium on Discrete Algorithms, CA, SAN FRANCISCO, 09 January 2000 - 11 January 2000

Dyer M; Goldberg LA; Greenhill C; Jerrum M, 2000, 'On the relative complexity of approximate counting problems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 108 - 119, http://dx.doi.org/10.1007/3-540-44436-x_12

Bubley R; Dyer M; Greenhill CS, 1998, 'Beating the $2\Delta$ bound for approximately counting colourings: a computer-assisted proof of rapid mixing', in The 9th Annual ACM-SIAM Symposium on Discrete Algorithms, New York-Philidelphia, pp. 355 - 363, 25 January 1998 - 27 January 1998

Back to profile page