עקוב אחר
Catherine Greenhill
Catherine Greenhill
School of Mathematics and Statistics, UNSW Sydney
כתובת אימייל מאומתת בדומיין unsw.edu.au
כותרת
צוטט על ידי
צוטט על ידי
שנה
The complexity of counting graph homomorphisms‏
M Dyer, C Greenhill‏
Random Structures & Algorithms 17 (3‐4), 260-289, 2000‏
3042000
The relative complexity of approximate counting problems‏
M Dyer, LA Goldberg, C Greenhill, M Jerrum‏
Algorithmica 38, 471-500, 2004‏
2062004
On Markov chains for independent sets‏
M Dyer, C Greenhill‏
Journal of Algorithms 35 (1), 17-49, 2000‏
1882000
Sampling regular graphs and a peer-to-peer network‏
C Cooper, M Dyer, C Greenhill‏
Combinatorics Probability and Computing 16 (4), 557-593, 2007‏
1832007
Generation of simple quadrangulations of the sphere‏
G Brinkmann, S Greenberg, C Greenhill, BD McKay, R Thomas, P Wollan‏
Discrete mathematics 305 (1-3), 33-54, 2005‏
1212005
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs‏
C Greenhill‏
computational complexity 9, 52-72, 2000‏
1112000
A more rapidly mixing Markov chain for graph colorings‏
M Dyer, C Greenhill‏
Random Structures & Algorithms 13 (3‐4), 285-317, 1998‏
871998
Networks within networks: using multiple link types to examine network structure and identify key actors in a drug trafficking operation‏
DA Bright, C Greenhill, A Ritter, C Morselli‏
Global Crime 16 (3), 219-237, 2015‏
852015
Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sums‏
C Greenhill, BD McKay, X Wang‏
Journal of Combinatorial Theory, Series A 113 (2), 291-324, 2006‏
772006
The use of actor-level attributes and centrality measures to identify key actors: A case study of an Australian drug trafficking network‏
DA Bright, C Greenhill, M Reynolds, A Ritter, C Morselli‏
Journal of contemporary criminal justice 31 (3), 262-278, 2015‏
762015
Random walks on combinatorial objects‏
M Dyer, C Greenhill‏
London Mathematical Society Lecture Note Series, 101-136, 1999‏
671999
Criminal network vulnerabilities and adaptations‏
D Bright, C Greenhill, T Britz, A Ritter, C Morselli‏
Global Crime 18 (4), 424-441, 2017‏
642017
Polynomial-time counting and sampling of two-rowed contingency tables‏
M Dyer, C Greenhill‏
Theoretical Computer Science 246 (1-2), 265-278, 2000‏
622000
On approximately counting colorings of small degree graphs‏
R Bubley, M Dyer, C Greenhill, M Jerrum‏
SIAM Journal on Computing 29 (2), 387-400, 1999‏
621999
The switch Markov chain for sampling irregular graphs‏
C Greenhill‏
Proceedings of the twenty-sixth annual acm-siam symposium on discrete …, 2014‏
612014
On the chromatic number of a random hypergraph‏
M Dyer, A Frieze, C Greenhill‏
Journal of Combinatorial Theory, Series B 113, 68-122, 2015‏
572015
Asymptotic enumeration of dense 0–1 matrices with specified line sums‏
ER Canfield, C Greenhill, BD McKay‏
Journal of Combinatorial Theory, Series A 115 (1), 32-66, 2008‏
552008
A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs‏
C Greenhill‏
Electronic Journal of Combinatorics 18 (1), #P234, 2011‏
532011
An extension of path coupling and its application to the Glauber dynamics for graph colorings‏
M Dyer, LA Goldberg, C Greenhill, M Jerrum, M Mitzenmacher‏
SIAM Journal on Computing 30 (6), 1962-1975, 2001‏
492001
Beating the 2∆ bound for approximately counting colourings: a computer-assisted proof of rapid mixing‏
R Bubley, M Dyer, C Greenhill‏
9th Annual Symposium on Discrete Algorithms, ACM–SIAM, New York–Philadelphia …, 1998‏
481998
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20