| A general model of web graphs C Cooper, A Frieze Random Structures & Algorithms 22 (3), 311-335, 2003 | 531 | 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 | 195 | 2007 |
| Multiple random walks in random regular graphs C Cooper, A Frieze, T Radzik SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010 | 152 | 2010 |
| Random deletion in a scale-free random graph process C Cooper, A Frieze, J Vera Internet Mathematics 1 (4), 463-483, 2004 | 133 | 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), 172879, 2015 | 129 | 2015 |
| 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 | 123 | 2004 |
| 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 | 122 | 2008 |
| On the distribution of rank of a random matrix over a finite field C Cooper Random Structures & Algorithms 17 (3‐4), 197-212, 2000 | 122 | 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 | 108 | 2014 |
| The cover time of random regular graphs C Cooper, A Frieze SIAM Journal on Discrete Mathematics 18 (4), 728-740, 2005 | 106 | 2005 |
| The cover time of sparse random graphs C Cooper, A Frieze Random Structures & Algorithms 30 (1‐2), 1-16, 2007 | 105 | 2007 |
| On the rank of random matrices C Cooper Random Structures & Algorithms 16 (2), 209-232, 2000 | 104 | 2000 |
| The cores of random hypergraphs with a given degree sequence C Cooper Random Structures & Algorithms 25 (4), 353-375, 2004 | 96 | 2004 |
| Crawling on simple models of web graphs C Cooper, A Frieze Internet Mathematics 1 (1), 57-90, 2004 | 96* | 2004 |
| 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 | 94 | 1988 |
| The power of two choices in distributed voting C Cooper, R Elsässer, T Radzik International Colloquium on Automata, Languages, and Programming, 435-446, 2014 | 91 | 2014 |
| Coalescing random walks and voting on connected graphs C Cooper, R Elsasser, H Ono, T Radzik SIAM Journal on Discrete Mathematics 27 (4), 1748-1758, 2013 | 84 | 2013 |
| Searching for black-hole faults in a network using multiple agents C Cooper, R Klasing, T Radzik International Conference On Principles Of Distributed Systems, 320-332, 2006 | 79 | 2006 |
| Mixing properties of the Swendsen–Wang process on classes of graphs C Cooper, AM Frieze Random Structures & Algorithms 15 (3‐4), 242-261, 1999 | 76 | 1999 |
| 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 | 76 | 1996 |
Alan FriezeCarnegie Mellon UniversityVerified email at random.math.cmu.edu
