Colin Cooper
#180,957
Most Influential Person Now
Colin Cooper's AcademicInfluence.com Rankings
Colin Coopercomputer-science Degrees
Computer Science
#11438
World Rank
#12123
Historical Rank
Database
#8472
World Rank
#8871
Historical Rank

Download Badge
Computer Science
Colin Cooper's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Colin Cooper Influential?
(Suggest an Edit or Addition)Colin Cooper's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A general model of web graphs (2003) (386)
- Sampling regular graphs and a peer-to-peer network (2005) (149)
- The Cover Times of Random Walks on Hypergraphs (2011) (141)
- Multiple Random Walks in Random Regular Graphs (2009) (122)
- A Spatial Web Graph Model with Local Influence Regions (2007) (96)
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (2004) (93)
- Random Deletion in a Scale-Free Random Graph Process (2004) (90)
- The cover time of sparse random graphs (2003) (88)
- The Cover Time of Random Regular Graphs (2005) (86)
- Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics (2015) (85)
- On the distribution of rank of a random matrix over a finite field (2000) (85)
- The cores of random hypergraphs with a given degree sequence (2004) (80)
- On the rank of random matrices (2000) (78)
- Searching for Black-Hole Faults in a Network Using Multiple Agents (2006) (72)
- The Power of Two Choices in Distributed Voting (2014) (71)
- Random walks in recommender systems: exact computation and simulations (2014) (69)
- Coalescing Random Walks and Voting on Connected Graphs (2012) (69)
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs (1996) (67)
- The degree distribution of the generalized duplication model (2006) (65)
- A General Model of Undirected Web Graphs (2001) (64)
- Probabilistic Analysis of a Relaxation for the k-Median Problem (1986) (64)
- The cover time of the preferential attachment graph (2007) (62)
- Mixing properties of the Swendsen-Wang process on classes of graphs (1999) (59)
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity (2002) (51)
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs (2005) (50)
- The cover time of the giant component of a random graph (2008) (48)
- An efficient sparse regularity concept (2009) (43)
- Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time (2017) (43)
- Locating and repairing faults in a network with mobile agents (2008) (42)
- Fast Consensus for Voting on General Expander Graphs (2015) (41)
- The flip markov chain and a randomising P2P protocol (2009) (37)
- Estimating network parameters using random walks (2012) (35)
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids (2000) (34)
- Some Typical Properties of the Spatial Preferred Attachment Model (2012) (34)
- Speeding up random walks with neighborhood exploration (2010) (34)
- Fast Plurality Consensus in Regular Expanders (2016) (34)
- Crawling on Simple Models of Web Graphs (2004) (33)
- Hamilton cycles in random graphs and directed graphs (2000) (31)
- Multiple Random Walks and Interacting Particle Systems (2009) (31)
- Coalescing random walks and voting on graphs (2012) (31)
- Randomized diffusion for indivisible loads (2011) (30)
- Energy efficient randomised communication in unknown AdHoc networks (2006) (30)
- Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms (2010) (30)
- Crawling on web graphs (2002) (30)
- Min-Wise Independent Linear Permutations (2000) (30)
- Stationary distribution and cover time of random walks on random digraphs (2011) (30)
- Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases (2007) (30)
- Hamilton Cycles in Random Regular Digraphs (1994) (30)
- Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs (2002) (28)
- A Note on the Connectivity of 2-Regular Digraphs (1993) (28)
- Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful (2011) (28)
- Cover time of a random graph with given degree sequence (2012) (26)
- The vapnik-chervonenkis dimension of a random graph (1995) (26)
- The Threshold for Hamilton Cycles in the Square of a Random Graph (1994) (26)
- Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number (2002) (26)
- On Markov Chains for Randomly H-Coloring a Graph (2001) (25)
- Hamilton Cycles in a Class of Random Directed Graphs (1994) (24)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (2009) (24)
- Algorithms and Models for the Web-Graph (2004) (23)
- Average-case complexity of shortest-paths problems in the vertex-potential model (1997) (23)
- On the Length of a Random Minimum Spanning Tree (2012) (22)
- Distribution of Vertex Degree in Web-Graphs (2006) (20)
- A randomized algorithm for the joining protocol in dynamic distributed networks (2008) (20)
- On the number of hamilton cycles in a random graph (1989) (20)
- The Linear Voting Model (2016) (19)
- Corrigendum: Sampling regular graphs and a peer-to-peer network (2012) (19)
- Estimation of the number of “good” permutatio with applications to cryptography (1999) (19)
- Random 2-SAT with Prescribed Literal Degrees (2007) (19)
- The cover time of random geometric graphs (2009) (19)
- The cover times of random walks on random uniform hypergraphs (2013) (18)
- Scale Free Properties of Random k-Trees (2010) (18)
- Fast Low-Cost Estimation of Network Properties Using Random Walks (2013) (17)
- Component structure of the vacant set induced by a random walk on a random graph (2010) (17)
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k (2000) (15)
- Improved Duplication Models for Proteome Network Evolution (2005) (15)
- A note on random 2-SAT with prescribed literal degrees (2002) (15)
- Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. (2012) (14)
- Discordant voting processes on finite graphs (2016) (14)
- Hamilton cycles in random lifts of graphs (2006) (14)
- The flip Markov chain for connected regular graphs (2017) (14)
- On the rank of a random binary matrix (2018) (13)
- A fast algorithm to find all high degree vertices in power law graphs (2012) (13)
- On the Connectivity of Random k-th Nearest Neighbour Graphs (1995) (13)
- 1-Pancyclic Hamilton Cycles in Random Graphs (1992) (12)
- Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time (2017) (11)
- Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (2009) (11)
- The height of random k‐trees and related branching processes (2013) (11)
- Scale‐free graphs of increasing degree (2011) (11)
- The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process (2016) (11)
- Pancyclic Hamilton cycles in random graphs (1991) (10)
- An Upper Bound for the Number of Complete Mappings (1995) (10)
- Spectral clustering using the kNN-MST similarity graph (2016) (10)
- Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold (1995) (9)
- Random Walks on Random Graphs (2008) (9)
- 36th International Colloquium on Automata, Languages and Programming (2009) (9)
- Speeding Up Cover Time of Sparse Graphs Using Local Knowledge (2015) (9)
- Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk (2014) (9)
- Martingales on Trees and the Empire Chromatic Number of Random Trees (2009) (8)
- Viral Processes by Random Walks on Random Regular Graphs (2011) (8)
- Encyclopedia of Data Warehousing and Mining (2008) (7)
- Constructing self-stabilizing oscillators in population protocols (2015) (7)
- 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) (2002) (7)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (2015) (6)
- 20th Annual ACM-SIAM Symposium on Discrete Algorithms (2009) (6)
- Dominating Sets in Web Graphs (2004) (6)
- Random Vertex Deletion in a Scale Free Random Graph (2004) (6)
- On the Thickness of Sparse Random Graphs (1992) (6)
- Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (2017) (6)
- A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence (2014) (6)
- Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (2010) (6)
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (2014) (5)
- The union of two random permutations does not have a directed Hamilton cycle (2001) (5)
- On Randomly Generated Intersecting Hypergraphs (2003) (5)
- The cover time of a biased random walk on a random cubic graph (2018) (5)
- Long Paths in Random Apollonian Networks (2014) (5)
- Balanced allocations: balls-into-bins revisited and chains-into-bins (2007) (5)
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (2009) (5)
- Asymptotics for dependent sums of random vectors (1999) (5)
- Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings (2008) (4)
- Classifying Special Interest Groups in Web Graphs (2002) (4)
- The limiting probability that alpha-in, ß-out is strongly connected (1990) (4)
- Rainbow Arborescence in Random Digraphs (2014) (4)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France (2016) (4)
- The cover time of two classes of random graphs (2005) (4)
- The Cover Time of Cartesian Product Graphs (2010) (4)
- A note on the vacant set of random walks on the hypercube and other regular graphs of high degree (2014) (3)
- Random regular graphs of non-onstant degree (2000) (3)
- Multi-Agent Flag Coordination Games (2017) (3)
- A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence (2012) (3)
- Dispersion processes (2017) (3)
- An efficient regularity concept for sparse graphs and matrices (2009) (3)
- On the 2-Cyclic Property in 2-Regular Digraphs (1995) (3)
- Analyzing Two Competing Epidemic Processes-The Power of Influential Nodes - (2014) (2)
- The cover time of a biased random walk on Gn, p (2017) (2)
- Triangle-creation processes on cubic graphs (2019) (2)
- Estimating network parameters using random walks (2014) (2)
- 17th International Symposium on Fundamentals of Computation Theory (2009) (2)
- Chains-into-bins processes (2010) (2)
- An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data (2018) (2)
- Probabilistic analysis of two k-cluster problems (1994) (2)
- Random Walks with Look-Ahead in Scale-Free Random Graphs (2010) (2)
- The Cover Time of Random Digraphs (2007) (2)
- Automata, Languages and Programming, 36th International Colloquium , ICALP 2009 (2009) (2)
- Asymptotic Enumeration of Predicate-Junction Flowgraphs (1996) (2)
- The covertime of a biased random walk on $G_{n,p}$ (2017) (2)
- Minors of a random binary matroid (2016) (2)
- Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401–439 (2009) (2)
- Coalescing Walks on Rotor-Router Systems (2015) (1)
- Speeding up random walks by choosing unvisited edges or vertices ? (2012) (1)
- Realistic Data for Testing Rule Mining Algorithms (2009) (1)
- New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (2019) (1)
- Threshold behaviour of discordant voting on the complete graph (2018) (1)
- On the Imitation Strategy for Games on Graphs (2011) (1)
- The use of Biweight Mid Correlation to improve graph based portfolio construction (2016) (1)
- A triangle process on regular graphs (2020) (1)
- Algorithms and Models for the Web Graph (2012) (1)
- Deposited in DRO : 13 December 2013 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item (2014) (0)
- Knowledge Discovery in Databases: PKDD 2007, 11th European (2007) (0)
- C O ] 1 0 O ct 2 01 8 On the cover time of dense graphs (2018) (0)
- Dominating sets of random recursive trees (2006) (0)
- Combinatorics, Geometry and Probability: Hamilton Cycles in Random Regular Digraphs (1997) (0)
- On the cover time of dense graphs (2018) (0)
- A triangle process on graphs with given degree sequence (2023) (0)
- Randomized Diffusion for Indivisible Loads | Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics (2010) (0)
- A note on the rank of a sparse random matrix (2019) (0)
- C O ] 2 8 M ay 2 01 9 On the cover time of dense graphs (2019) (0)
- The over time of the preferential atta hment graph (2004) (0)
- Networks of random cycles (2011) (0)
- A pr 2 01 2 Coalescing random walks and voting on graphs (2012) (0)
- Oscillatory Population Protocols (2014) (0)
- Distributed Averaging in Population Protocols (2022) (0)
- Viral Processes by Random Walks on Random Graphs (2011) (0)
- The cover time of regular random graphs (2007) (0)
- Algorithms---ESA 2001 Aarhus (2001) (0)
- On early extinction and the effect of travelling in the SIR model (2022) (0)
- Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs (2021) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Colin Cooper?
Colin Cooper is affiliated with the following schools: