Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Catherine S.
Last name:	Greenhill
DBLP:	g/CatherineSGreenhill
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 33  

Select a publication
Show	Title	Venue	Rating	Date
	E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson. Asymptotic enumeration of correlation-immune boolean functions.	Cryptography and Communications 2010, Volume 2	(0)	2010
	Catherine S. Greenhill, Brendan D. McKay. Random dense bipartite graphs and directed graphs with specified degrees.	Random Struct. Algorithms 2009, Volume 35	(0)	2009
	Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald. Expansion properties of a random regular graph after random vertex deletions.	Eur. J. Comb. 2008, Volume 29	(0)	2008
	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 2008, Volume 115	(0)	2008
	Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless. The cycle structure of two rows in a random Latin square.	Random Struct. Algorithms 2008, Volume 33	(0)	2008
	Colin Cooper, Martin E. Dyer, Catherine S. Greenhill. Sampling Regular Graphs and a Peer-to-Peer Network.	Combinatorics, Probability Computing 2007, Volume 16	(0)	2007
	Catherine S. Greenhill, Andrzej Rucinski. Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.	Electr. J. Comb. 2006, Volume 13	(0)	2006
	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 2006, Volume 113	(0)	2006
	Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald. The generalized acyclic edge chromatic number of random regular graphs.	Journal of Graph Theory 2006, Volume 53	(0)	2006
	Colin Cooper, Martin E. Dyer, Catherine S. Greenhill. Sampling regular graphs and a peer-to-peer network.	Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005	(0)	2005
	Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan. Generation of simple quadrangulations of the sphere.	Discrete Mathematics 2005, Volume 305	(0)	2005
	Catherine S. Greenhill, Oleg Pikhurko. Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.	Graphs and Combinatorics 2005, Volume 21	(0)	2005
	Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald. Random Hypergraph Processes with Degree Restrictions.	Graphs and Combinatorics 2004, Volume 20	(0)	2004
	Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald. Hamiltonian decompositions of random bipartite regular graphs.	J. Comb. Theory, Ser. B 2004, Volume 90	(0)	2004
	Martin E. Dyer, Catherine S. Greenhill. Corrigendum: The complexity of counting graph homomorphisms.	Random Struct. Algorithms 2004, Volume 25	(0)	2004
	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. The Relative Complexity of Approximate Counting Problems.	Algorithmica 2003, Volume 38	(0)	2003
	Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald. Connectedness Of The Degree Bounded Star Process.	Combinatorics, Probability Computing 2003, Volume 12	(0)	2003
	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum. Convergence Of The Iterated Prisoner's Dilemma Game	Combinatorics, Probability Computing 2002, Volume 11	(0)	2002
	Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald. Permutation Pseudographs And Contiguity.	Combinatorics, Probability Computing 2002, Volume 11	(0)	2002
	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 2002, Volume 20	(0)	2002
	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. On the relative complexity of approximate counting problems.	Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000	(0)	2000
	Martin E. Dyer, Catherine S. Greenhill. The complexity of counting graph homomorphisms (extended abstract).	SODA 2000	(0)	2000
	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	(0)	2000
	Catherine S. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs.	Computational Complexity 2000, Volume 9	(0)	2000
	Martin E. Dyer, Catherine S. Greenhill. On Markov Chains for Independent Sets.	J. Algorithms 2000, Volume 35	(0)	2000

Your query returned 33 matches in the database.