Cooper, Colin - Department of Computer Science, King's College London

• Component structure induced by a random walk on a random graph.
• An analysis of the size of the optimal dominating sets in random recursive trees, using the
• RANDOM 2-SAT WITH PRESCRIBED LITERAL DEGREES COLIN COOPER, ALAN FRIEZE y , AND GREGORY B. SORKIN
• Derandomizing Random Walks in Undirected Graphs
• The degree distribution of the generalized duplication , P.Berenbrink2
• Locating and repairing faults in a network with mobile agents
• Dominating Sets in Web Graphs Colin Cooper 1 Ralf Klasing 2y Michele Zito 3
• Classifying special interest groups in web graphs. Colin Cooper
• A general model of web graphs Colin Cooper Alan Frieze y
• The cover time of sparse random graphs. Colin Cooper
• Random Walks with Look-ahead in Scale-free Random Colin Cooper
• A lower bound for the number of good permutations Colin Cooper
• The union of two random permutations does not have a directed Hamilton cycle
• Average-case complexity of shortest-paths problems in the vertex-potential model
• Random regular graphs of non-constant degree Colin Cooper Alan Frieze y Bruce Reed z
• A general model of undirected web graphs Colin Cooper 1 and Alan M. Frieze 2
• Distribution of vertex degree in web-graphs. Colin Cooper
• The cover time of random regular graphs Colin Cooper Alan Frieze y
• Cover time of a random graph with given degree sequence Mohammed Abdullah
• Distribution of vertex degree in web-graphs Colin Cooper y
• Random deletion in a scale free random graph process Colin Cooper
• Sampling regular graphs and a peer-to-peer network (Extended Abstract)
• The cover time of two classes of random graphs Colin Cooper
• The cores of random hypergraphs with a given degree sequence.
• On the rank of random matrices C. Cooper
• Multi-coloured Hamilton cycles in random edge-coloured graphs
• Asymptotic Enumeration of Predicate-Junction School of Mathematical Sciences
• Realistic synthetic data for testing association rule mining algorithms for market basket databases
• The size of the largest strongly connected component of a random digraph with a given degree sequence
• Crawling on simple models of web graphs Colin Cooper
• The cover time of sparse random graphs. Colin Cooper Alan Frieze y
• The cover time of random digraphs Colin Cooper
• The cover time of two classes of random graphs Colin Cooper Alan Frieze y
• Multiple random walks and interacting particle Colin Cooper
• Multiple random walks in random regular graphs Colin Cooper
• Scale-free graphs of increasing degree Colin Cooper
• The cover time of random geometric graphs Colin Cooper
• Random Walks on Random Graphs Colin Cooper1
• Energy Efficient Randomised Communication in Unknown AdHoc Petra Berenbrink
• The cover time of the giant component of a random Colin Cooper
• The cover time of the preferential attachment graph Colin Cooper
• Distribution of vertex degree in web-graphs Colin Cooper
• On Markov chains for randomly H-colouring a Colin Cooper
• On the distribution of rank of a random matrix over a finite field
• Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
• Asymptotics for dependent sums of random vectors. School of Mathematical Sciences
• An Upper Bound for the Number of Complete Mappings Colin Cooper
• Speeding up random walks with neighborhood exploration
• Scale free properties of random k-trees Colin Cooper
• Martingales on Trees and the Empire Chromatic Number of Random Trees
• Searching for Black-Hole Faults in a Network Using Multiple Agents
• A randomized algorithm for the joining protocol in dynamic distributed networks
• The cores of random hypergraphs with a given degree sequence.
• Hamilton Cycles in Random Lifts of Graphs A.M. Frieze
• Dominating Sets in Web Graphs Colin Cooper1