Catherine S. Greenhill

	2011
36		Catherine S. Greenhill: A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs. Electr. J. Comb. 18(1): (2011)
	2010
35		Catherine S. Greenhill, Svante Janson, Andrzej Rucinski: On the Number of Perfect Matchings in Random Lifts. Combinatorics, Probability & Computing 19(5-6): 791-817 (2010)
34		E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson: Asymptotic enumeration of correlation-immune boolean functions. Cryptography and Communications 2(1): 111-126 (2010)
	2009
33		E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson: Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptology ePrint Archive 2009: 460 (2009)
32		Catherine S. Greenhill, Brendan D. McKay: Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35(2): 222-249 (2009)
	2008
31		Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald: Expansion properties of a random regular graph after random vertex deletions. Eur. J. Comb. 29(5): 1139-1150 (2008)
30		E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay: Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory, Ser. A 115(1): 32-66 (2008)
29		Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless: The cycle structure of two rows in a random Latin square. Random Struct. Algorithms 33(3): 286-309 (2008)
	2007
28		Colin Cooper, Martin E. Dyer, Catherine S. Greenhill: Sampling Regular Graphs and a Peer-to-Peer Network. Combinatorics, Probability & Computing 16(4): 557-593 (2007)
	2006
27		Catherine S. Greenhill, Andrzej Rucinski: Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electr. J. Comb. 13(1): (2006)
26		Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang: Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory, Ser. A 113(2): 291-324 (2006)
25		Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald: The generalized acyclic edge chromatic number of random regular graphs. Journal of Graph Theory 53(2): 101-125 (2006)
	2005
24		Colin Cooper, Martin E. Dyer, Catherine S. Greenhill: Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988
23		Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan: Generation of simple quadrangulations of the sphere. Discrete Mathematics 305(1-3): 33-54 (2005)
22		Catherine S. Greenhill, Oleg Pikhurko: Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs and Combinatorics 21(4): 407-419 (2005)
	2004
21		Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Random Hypergraph Processes with Degree Restrictions. Graphs and Combinatorics 20(3): 319-332 (2004)
20		Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald: Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory, Ser. B 90(2): 195-222 (2004)
19		Martin E. Dyer, Catherine S. Greenhill: Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25(3): 346-352 (2004)
	2003
18		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2003)
17		Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Connectedness Of The Degree Bounded Star Process. Combinatorics, Probability & Computing 12(3): 269-283 (2003)
	2002
16		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum: Convergence Of The Iterated Prisoner's Dilemma Game. Combinatorics, Probability & Computing 11(2): 135-147 (2002)
15		Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald: Permutation Pseudographs And Contiguity. Combinatorics, Probability & Computing 11(3): 273-298 (2002)
14		Martin E. Dyer, Catherine S. Greenhill, Michael Molloy: Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms 20(1): 98-114 (2002)
	2000
13		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: On the relative complexity of approximate counting problems. APPROX 2000: 108-119
12		Martin E. Dyer, Catherine S. Greenhill: The complexity of counting graph homomorphisms (extended abstract). SODA 2000: 246-255
11		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher: An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA 2000: 616-624
10		Catherine S. Greenhill: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9(1): 52-72 (2000)
9		Martin E. Dyer, Catherine S. Greenhill: On Markov Chains for Independent Sets. J. Algorithms 35(1): 17-49 (2000)
8		Martin E. Dyer, Catherine S. Greenhill: The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000)
7		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher: An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. 30(6): 1962-1975 (2000)
6		Martin E. Dyer, Catherine S. Greenhill: Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. 246(1-2): 265-278 (2000)
	1999
5		Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum: On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. 29(2): 387-400 (1999)
	1998
4		Martin E. Dyer, Catherine S. Greenhill: A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP 1998: 339-350
3		Russ Bubley, Martin E. Dyer, Catherine S. Greenhill: Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. SODA 1998: 355-363
2		Martin E. Dyer, Catherine S. Greenhill: A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms 13(3-4): 285-317 (1998)
	1995
1		Catherine S. Greenhill: Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. J. Symb. Comput. 20(4): 419-429 (1995)

Coauthor Index

1	Gunnar Brinkmann	[23]
2	Russ Bubley	[3] [5]
3	E. Rodney Canfield	[30] [33] [34]
4	Nicholas J. Cavenagh	[29]
5	Colin Cooper	[24] [28]
6	Martin E. Dyer	[2] [3] [4] [5] [6] [7] [8] [9] [11] [12] [13] [14] [16] [18] [19] [24] [28]
7	Zhicheng Gao	[33] [34]
8	Stefanie Gerke	[25]
9	Leslie Ann Goldberg	[7] [11] [13] [16] [18]
10	Sam Greenberg	[23]
11	Fred B. Holt	[31]
12	Gabriel Istrate	[16]
13	Svante Janson	[15] [35]
14	Mark Jerrum	[5] [7] [11] [13] [16] [18]
15	Jeong Han Kim	[15] [20]
16	Brendan D. McKay	[23] [26] [30] [32] [33] [34]
17	Michael Mitzenmacher	[7] [11]
18	Michael Molloy (Michael S. O. Molloy)	[14]
19	Oleg Pikhurko	[22]
20	Robert W. Robinson	[33] [34]
21	Andrzej Rucinski	[17] [21] [27] [35]
22	Robin Thomas	[23]
23	Xiaoji Wang	[26]
24	Ian M. Wanless	[29]
25	Paul Wollan	[23]
26	Nicholas C. Wormald	[15] [17] [20] [21] [25] [31]

Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page