Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. - Catherine S. Greenhill (J. Symb. Comput., 1995)

A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. - Martin E. Dyer; Catherine S. Greenhill (ICALP, 1998)

Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. - Russ Bubley; Martin E. Dyer; Catherine S. Greenhill (SODA, 1998)

A more rapidly mixing Markov chain for graph colorings. - Martin E. Dyer; Catherine S. Greenhill (Random Struct. Algorithms, 1998)

On Approximately Counting Colorings of Small Degree Graphs. - Russ Bubley; Martin E. Dyer; Catherine S. Greenhill; Mark Jerrum (SIAM J. Comput., 1999)

The complexity of counting graph homomorphisms (extended abstract). - Martin E. Dyer; Catherine S. Greenhill (SODA, 2000)

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Mark Jerrum; Michael Mitzenmacher (SODA, 2000)

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. - Catherine S. Greenhill (Comput. Complex., 2000)

On Markov Chains for Independent Sets. - Martin E. Dyer; Catherine S. Greenhill (J. Algorithms, 2000)

An Algorithm for Recognising the Exterior Square of a Multiset. - Catherine S. Greenhill (LMS J. Comput. Math., 2000)

The complexity of counting graph homomorphisms. - Martin E. Dyer; Catherine S. Greenhill (Random Struct. Algorithms, 2000)

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Mark Jerrum; Michael Mitzenmacher (SIAM J. Comput., 2000)

Polynomial-time counting and sampling of two-rowed contingency tables. - Martin E. Dyer; Catherine S. Greenhill (Theor. Comput. Sci., 2000)

Convergence Of The Iterated Prisoner's Dilemma Game. - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Gabriel Istrate; Mark Jerrum (Comb. Probab. Comput., 2002)

Permutation Pseudographs And Contiguity. - Catherine S. Greenhill; Svante Janson; Jeong Han Kim; Nicholas C. Wormald (Comb. Probab. Comput., 2002)

Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. - Martin E. Dyer; Catherine S. Greenhill; Michael Molloy 001 (Random Struct. Algorithms, 2002)

Connectedness Of The Degree Bounded Star Process. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Comb. Probab. Comput., 2003)

The Relative Complexity of Approximate Counting Problems. - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Mark Jerrum (Algorithmica, 2004)

Random Hypergraph Processes with Degree Restrictions. - Catherine S. Greenhill; Andrzej Rucinski 001; Nicholas C. Wormald (Graphs Comb., 2004)

Hamiltonian decompositions of random bipartite regular graphs. - Catherine S. Greenhill; Jeong Han Kim; Nicholas C. Wormald (J. Comb. Theory B, 2004)

Corrigendum: The complexity of counting graph homomorphisms. - Martin E. Dyer; Catherine S. Greenhill (Random Struct. Algorithms, 2004)

Generation of simple quadrangulations of the sphere. - Gunnar Brinkmann; Sam Greenberg; Catherine S. Greenhill; Brendan D. McKay; Robin Thomas 001; Paul Wollan (Discret. Math., 2005)

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. - Catherine S. Greenhill; Oleg Pikhurko (Graphs Comb., 2005)

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. - Catherine S. Greenhill; Andrzej Rucinski 001 (Electron. J. Comb., 2006)

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. - Catherine S. Greenhill; Brendan D. McKay; Xiaoji Wang (J. Comb. Theory A, 2006)

The generalized acyclic edge chromatic number of random regular graphs. - Stefanie Gerke; Catherine S. Greenhill; Nicholas C. Wormald (J. Graph Theory, 2006)

Sampling Regular Graphs and a Peer-to-Peer Network. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (Comb. Probab. Comput., 2007)

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. - Catherine S. Greenhill; Brendan D. McKay (Adv. Appl. Math., 2008)

Expansion properties of a random regular graph after random vertex deletions. - Catherine S. Greenhill; Fred B. Holt; Nicholas C. Wormald (Eur. J. Comb., 2008)

Asymptotic enumeration of dense 0-1 matrices with specified line sums. - E. Rodney Canfield; Catherine S. Greenhill; Brendan D. McKay (J. Comb. Theory A, 2008)

The cycle structure of two rows in a random Latin square. - Nicholas J. Cavenagh; Catherine S. Greenhill; Ian M. Wanless (Random Struct. Algorithms, 2008)

Random dense bipartite graphs and directed graphs with specified degrees. - Catherine S. Greenhill; Brendan D. McKay (Random Struct. Algorithms, 2009)

Asymptotic enumeration of correlation-immune boolean functions. - E. Rodney Canfield; Zhicheng Gao; Catherine S. Greenhill; Brendan D. McKay; Robert W. Robinson (Cryptogr. Commun., 2010)

On the Number of Perfect Matchings in Random Lifts. - Catherine S. Greenhill; Svante Janson; Andrzej Rucinski 001 (Comb. Probab. Comput., 2010)

A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs. - Catherine S. Greenhill (Electron. J. Comb., 2011)

Making Markov chains less lazy - Catherine S. Greenhill (CoRR, 2012)

Heat-bath Markov chains have no negative eigenvalues - Catherine S. Greenhill; Mario Ullrich (CoRR, 2013)

Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. - Catherine S. Greenhill; Brendan D. McKay (SIAM J. Discret. Math., 2013)

On the Number of Spanning Trees in Random Regular Graphs. - Catherine S. Greenhill; Matthew Kwan 001; David Wind (Electron. J. Comb., 2014)

The switch Markov chain for sampling irregular graphs. - Catherine S. Greenhill (CoRR, 2014)

The switch Markov chain for sampling irregular graphs (Extended Abstract). - Catherine S. Greenhill (SODA, 2015)

On the chromatic number of a random hypergraph. - Martin E. Dyer; Alan M. Frieze; Catherine S. Greenhill (J. Comb. Theory B, 2015)

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. - Vladimir M. Blinovsky; Catherine S. Greenhill (Electron. J. Comb., 2016)

Asymptotic enumeration of sparse uniform hypergraphs with given degrees. - Vladimir M. Blinovsky; Catherine S. Greenhill (Eur. J. Comb., 2016)

Mixing of the Glauber dynamics for the ferromagnetic Potts model. - Magnus Bordewich; Catherine S. Greenhill; Viresh Patel (Random Struct. Algorithms, 2016)

The average number of spanning trees in sparse graphs with given degrees. - Catherine S. Greenhill; Mikhail Isaev; Matthew Kwan 001; Brendan D. McKay (Eur. J. Comb., 2017)

The switch Markov chain for sampling irregular graphs and digraphs. - Catherine S. Greenhill; Matteo Sfragara (Theor. Comput. Sci., 2018)

Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. - Pu Gao; Catherine S. Greenhill (Electron. J. Comb., 2019)

The mixing time of the swap (switch) Markov chains: a unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (CoRR, 2019)

Triangle-creation processes on cubic graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (CoRR, 2019)

The flip Markov chain for connected regular graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill; Andrew J. Handley (Discret. Appl. Math., 2019)

Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. - Haya S. Aldosari; Catherine S. Greenhill (Eur. J. Comb., 2019)

Hypergraph coloring up to condensation. - Peter J. Ayre; Amin Coja-Oghlan; Catherine S. Greenhill (Random Struct. Algorithms, 2019)

Rigid Colorings of Hypergraphs and Contiguity. - Peter J. Ayre; Catherine S. Greenhill (SIAM J. Discret. Math., 2019)

Balanced Allocation on Dynamic Hypergraphs. - Catherine S. Greenhill; Bernard Mans; Ali Pourmiri (APPROX-RANDOM, 2020)

On the Parameterised Complexity of Induced Multipartite Graph Parameters. - Ryan L. Mann; Luke Mathieson; Catherine S. Greenhill (CoRR, 2020)

A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. - Daniel Altman; Catherine S. Greenhill; Mikhail Isaev; Reshma Ramadurai (J. Comb. Theory B, 2020)

Generating graphs randomly. - Catherine S. Greenhill (BCC, 2021)

A Triangle Process on Regular Graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (IWOCA, 2021)

Subgraph counts for dense random graphs with specified degrees. - Catherine S. Greenhill; Mikhail Isaev; Brendan D. McKay (Comb. Probab. Comput., 2021)

Mixing time of the switch Markov chain and stable degree sequences. - Pu Gao; Catherine S. Greenhill (Discret. Appl. Math., 2021)

The average number of spanning hypertrees in sparse uniform hypergraphs. - Haya S. Aldosari; Catherine S. Greenhill (Discret. Math., 2021)

Sampling hypergraphs with given degrees. - Martin E. Dyer; Catherine S. Greenhill; Pieter Kleer; James Ross; Leen Stougie (Discret. Math., 2021)

Counting independent sets in graphs with bounded bipartite pathwidth. - Martin E. Dyer; Catherine S. Greenhill; Haiko Müller (Random Struct. Algorithms, 2021)

Lower Bounds on the Chromatic Number of Random Graphs. - Peter J. Ayre; Amin Coja-Oghlan; Catherine S. Greenhill (Comb., 2022)

Spanning trees in random regular uniform hypergraphs. - Catherine S. Greenhill; Mikhail Isaev; Gary Liang (Comb. Probab. Comput., 2022)

The mixing time of switch Markov chains: A unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (Eur. J. Comb., 2022)

A triangle process on graphs with given degree sequence. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (CoRR, 2023)

Degree sequences of sufficiently dense random uniform hypergraphs. - Catherine S. Greenhill; Mikhail Isaev; Tamás Makai; Brendan D. McKay (Comb. Probab. Comput., 2023)

Balanced allocation on hypergraphs. - Catherine S. Greenhill; Bernard Mans; Ali Pourmiri (J. Comput. Syst. Sci., 2023)

Decomposing random regular graphs into stars. - Michelle Delcourt; Catherine S. Greenhill; Mikhail Isaev; Bernard Lidický; Luke Postle (Eur. J. Comb., 2025)

Triangle Processes on Graphs With Given Degree Sequence. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (Random Struct. Algorithms, 2025)

The random k-SAT Gibbs uniqueness threshold revisited. - Arnab Chatterjee; Amin Coja-Oghlan; Catherine S. Greenhill; Vincent Pfenninger; Maurice Rolvien; Pavel Zakharov; Kostas Zampetakis (CoRR, 2025)