The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Colin Cooper: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Colin Cooper, Alan M. Frieze
    A General Model of Undirected Web Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:500-511 [Conf]
  2. Colin Cooper, Ralf Klasing, Tomasz Radzik
    Searching for Black-Hole Faults in a Network Using Multiple Agents. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:320-332 [Conf]
  3. Colin Cooper
    Classifying Special Interest Groups in Web Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:263-276 [Conf]
  4. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:15-26 [Conf]
  5. 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]
  6. Colin Cooper, Alan M. Frieze
    The cover time of sparse random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:140-147 [Conf]
  7. Colin Cooper, Alan M. Frieze
    The cover time of two classes of random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:961-970 [Conf]
  8. Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
    A note on random 2-SAT with prescribed literal degrees. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:316-320 [Conf]
  9. Colin Cooper, Alan M. Frieze
    Crawling on web graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:419-427 [Conf]
  10. Colin Cooper, Ralf Klasing, Michele Zito
    Dominating Sets in Web Graphs. [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:31-43 [Conf]
  11. Tom Bohman, Colin Cooper, Alan M. Frieze
    Min-Wise Independent Linear Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  12. Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó
    On Randomly Generated Intersecting Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  13. Colin Cooper, Alan M. Frieze
    Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  14. Colin Cooper
    On the Trickness of Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:303-309 [Journal]
  15. Colin Cooper, Alan M. Frieze
    Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  16. Colin Cooper, Alan M. Frieze
    The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:319-337 [Journal]
  17. Colin Cooper, Alan M. Frieze
    On the Connectivity of Random k-th Nearest Neighbour Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:343-362 [Journal]
  18. Colin Cooper, Alan M. Frieze, Michael Molloy
    Hamilton Cycles in Random Regular Digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:39-49 [Journal]
  19. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
    Perfect Matchings in Random r-regular, s-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:1-14 [Journal]
  20. Colin Cooper, Alan M. Frieze, Bruce A. Reed
    Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal]
  21. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
    Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
  22. K. Burgin, P. Chebolu, Colin Cooper, Alan M. Frieze
    Hamilton cycles in random lifts of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1282-1293 [Journal]
  23. Colin Cooper, Martin E. Dyer, Alan M. Frieze
    On Markov Chains for Randomly H-Coloring a Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:117-134 [Journal]
  24. Colin Cooper, Alan M. Frieze
    The limiting probability that alpha-in, ß-out is strongly connected. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:117-134 [Journal]
  25. Colin Cooper, Alan M. Frieze
    Hamilton Cycles in a Class of Random Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:151-163 [Journal]
  26. Colin Cooper, Alan Frieze
    The cover time of the preferential attachment graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:2, pp:269-290 [Journal]
  27. Colin Cooper
    On the distribution of rank of a random matrix over a finite field. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:197-212 [Journal]
  28. Colin Cooper
    On the rank of random matrices. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:2, pp:209-232 [Journal]
  29. Colin Cooper
    The union of two random permutations does not have a directed Hamilton cycle. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:95-98 [Journal]
  30. Colin Cooper
    The cores of random hypergraphs with a given degree sequence. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:4, pp:353-375 [Journal]
  31. Colin Cooper
    1-Pancyclic Hamilton Cycles in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:277-288 [Journal]
  32. Colin Cooper
    A Note on the Connectivity of 2-Regular Digraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:4, pp:469-472 [Journal]
  33. Colin Cooper
    The Threshold for Hamilton Cycles in the Square of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:25-32 [Journal]
  34. Colin Cooper
    On the 2-Cyclic Property in 2-Regular Digraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:439-448 [Journal]
  35. Colin Cooper, Alan M. Frieze
    Hamilton cycles in random graphs and directed graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:369-401 [Journal]
  36. Colin Cooper, Alan M. Frieze
    A general model of web graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:3, pp:311-335 [Journal]
  37. Colin Cooper, Alan M. Frieze
    Mixing properties of the Swendsen-Wang process on classes of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:242-261 [Journal]
  38. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-case complexity of shortest-paths problems in the vertex-potential model. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:1, pp:33-46 [Journal]
  39. Colin Cooper, Alan M. Frieze
    The Cover Time of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:728-740 [Journal]
  40. Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp
    The degree distribution of the generalized duplication model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:239-249 [Journal]
  41. Colin Cooper, Alan Frieze
    The Cover Time of Random Digraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:422-435 [Conf]
  42. Colin Cooper, Michele Zito
    Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. [Citation Graph (0, 0)][DBLP]
    PKDD, 2007, pp:398-405 [Conf]
  43. Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp
    Improved Duplication Models for Proteome Network Evolution. [Citation Graph (0, 0)][DBLP]
    Systems Biology and Regulatory Genomics, 2005, pp:119-137 [Conf]
  44. Petra Berenbrink, Colin Cooper, Zengjian Hu
    Energy efficient randomised communication in unknown AdHoc networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:250-259 [Conf]
  45. Colin Cooper, Alan Frieze, Gregory B. Sorkin
    Random 2-SAT with Prescribed Literal Degrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:3, pp:249-265 [Journal]
  46. Petra Berenbrink, Colin Cooper, Zengjian Hu
    Energy Efficient Randomized Communication in Unknown AdHoc Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  47. Martin Anthony, Graham Brightwell, Colin Cooper
    The vapnik-chervonenkis dimension of a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:43-56 [Journal]

  48. Martingales on Trees and the Empire Chromatic Number of Random Trees. [Citation Graph (, )][DBLP]


  49. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]


  50. Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP]


  51. The flip markov chain and a randomising P2P protocol. [Citation Graph (, )][DBLP]


  52. Locating and Repairing Faults in a Network with Mobile Agents. [Citation Graph (, )][DBLP]


  53. The cover time of random geometric graphs. [Citation Graph (, )][DBLP]


  54. An efficient sparse regularity concept. [Citation Graph (, )][DBLP]


  55. Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]


  56. Random Walks on Random Graphs. [Citation Graph (, )][DBLP]


  57. Chains-into-Bins Processes [Citation Graph (, )][DBLP]


  58. Component structure induced by a random walk on a random graph [Citation Graph (, )][DBLP]


  59. Distribution of Vertex Degree in Web-Graphs. [Citation Graph (, )][DBLP]


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


  61. An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
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