Colin Cooper
Colin Cooper
Professor in Computer Science, King's College London
Adresse e-mail validée de - Page d'accueil
Citée par
Citée par
A general model of web graphs
C Cooper, A Frieze
Random Structures & Algorithms 22 (3), 311-335, 2003
Sampling regular graphs and a peer-to-peer network
C Cooper, M Dyer, C Greenhill
Combinatorics, Probability and Computing 16 (4), 557-593, 2007
Multiple random walks in random regular graphs
C Cooper, A Frieze, T Radzik
SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010
Random deletion in a scale-free random graph process
C Cooper, A Frieze, J Vera
Internet Mathematics 1 (4), 463-483, 2004
On the distribution of rank of a random matrix over a finite field
C Cooper
Random Structures & Algorithms 17 (3‐4), 197-212, 2000
A spatial web graph model with local influence regions
W Aiello, A Bonato, C Cooper, J Janssen, P Prałat
Internet Mathematics 5 (1-2), 175-196, 2008
The size of the largest strongly connected component of a random digraph with a given degree sequence
C Cooper, A Frieze
Combinatorics, Probability and Computing 13 (3), 319-337, 2004
Link prediction methods and their accuracy for different social networks and network metrics
F Gao, K Musial, C Cooper, S Tsoka
Scientific programming 2015, 1-1, 2015
The cover time of sparse random graphs
C Cooper, A Frieze
Random Structures & Algorithms 30 (1‐2), 1-16, 2007
The cover time of random regular graphs
C Cooper, A Frieze
SIAM Journal on Discrete Mathematics 18 (4), 728-740, 2005
On the rank of random matrices
C Cooper
Random Structures & Algorithms 16 (2), 209-232, 2000
Random walks in recommender systems: exact computation and simulations
C Cooper, SH Lee, T Radzik, Y Siantos
Proceedings of the 23rd international conference on world wide web, 811-816, 2014
The cores of random hypergraphs with a given degree sequence
C Cooper
Random Structures & Algorithms 25 (4), 353-375, 2004
Crawling on web graphs
C Cooper, A Frieze
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
Probabilistic analysis of a relaxation for the k-median problem
S Ahn, C Cooper, G Cornuejols, A Frieze
Mathematics of Operations Research 13 (1), 1-31, 1988
The power of two choices in distributed voting
C Cooper, R Elsässer, T Radzik
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
The degree distribution of the generalized duplication model
G Bebek, P Berenbrink, C Cooper, T Friedetzky, J Nadeau, SC Sahinalp
Theoretical Computer Science 369 (1-3), 239-249, 2006
Searching for black-hole faults in a network using multiple agents
C Cooper, R Klasing, T Radzik
Principles of Distributed Systems: 10th International Conference, OPODIS …, 2006
Perfect matchings in random r-regular, s-uniform hypergraphs
C Cooper, A Frieze, M Molloy, B Reed
Combinatorics, Probability and Computing 5 (1), 1-14, 1996
The cover time of the preferential attachment graph
C Cooper, A Frieze
Journal of Combinatorial Theory, Series B 97 (2), 269-290, 2007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20