The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Catherine S. Greenhill: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    On the relative complexity of approximate counting problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:108-119 [Conf]
  2. Martin E. Dyer, Catherine S. Greenhill
    A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:339-350 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:355-363 [Conf]
  4. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
    Sampling regular graphs and a peer-to-peer network. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:980-988 [Conf]
  5. Martin E. Dyer, Catherine S. Greenhill
    The complexity of counting graph homomorphisms (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:246-255 [Conf]
  6. 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). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:616-624 [Conf]
  7. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    The Relative Complexity of Approximate Counting Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:471-500 [Journal]
  8. Catherine S. Greenhill
    The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:52-72 [Journal]
  9. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
    Convergence Of The Iterated Prisoner's Dilemma Game [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  10. Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
    Permutation Pseudographs And Contiguity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal]
  11. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Connectedness Of The Degree Bounded Star Process. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  12. Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
    Generation of simple quadrangulations of the sphere. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:33-54 [Journal]
  13. Catherine S. Greenhill, Oleg Pikhurko
    Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:407-419 [Journal]
  14. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Random Hypergraph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:319-332 [Journal]
  15. Martin E. Dyer, Catherine S. Greenhill
    On Markov Chains for Independent Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:1, pp:17-49 [Journal]
  16. Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
    Hamiltonian decompositions of random bipartite regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:195-222 [Journal]
  17. Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang
    Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:2, pp:291-324 [Journal]
  18. Catherine S. Greenhill
    Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:4, pp:419-429 [Journal]
  19. Martin E. Dyer, Catherine S. Greenhill
    The complexity of counting graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:260-289 [Journal]
  20. Martin E. Dyer, Catherine S. Greenhill
    Corrigendum: The complexity of counting graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:346-352 [Journal]
  21. Martin E. Dyer, Catherine S. Greenhill
    A more rapidly mixing Markov chain for graph colorings. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:285-317 [Journal]
  22. Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
    Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:98-114 [Journal]
  23. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
    On Approximately Counting Colorings of Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:387-400 [Journal]
  24. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1962-1975 [Journal]
  25. Martin E. Dyer, Catherine S. Greenhill
    Polynomial-time counting and sampling of two-rowed contingency tables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:246, n:1-2, pp:265-278 [Journal]
  26. Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
    The generalized acyclic edge chromatic number of random regular graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:101-125 [Journal]

  27. Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. [Citation Graph (, )][DBLP]


  28. Sampling Regular Graphs and a Peer-to-Peer Network. [Citation Graph (, )][DBLP]


  29. Expansion properties of a random regular graph after random vertex deletions. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002