Colin Cooper

According to our database1, Colin Cooper authored at least 123 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
On the rank of a random binary matrix.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Dispersion processes.
Random Struct. Algorithms, 2018

Threshold behaviour of discordant voting on the complete graph.
J. Discrete Algorithms, 2018

An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

The Cover Time of a Biased Random Walk on a Random Cubic Graph.
Proceedings of the 29th International Conference on Probabilistic, 2018

The cover time of a biased random walk on Gn, p.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Fast Plurality Consensus in Regular Expanders.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Multi-Agent Flag Coordination Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk.
SIAM J. Discrete Math., 2016

Rainbow Arborescence in Random Digraphs.
Journal of Graph Theory, 2016

On the Length of a Random Minimum Spanning Tree.
Combinatorics, Probability & Computing, 2016

The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The Linear Voting Model.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Discordant Voting Processes on Finite Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics.
Scientific Programming, 2015

Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time.
Random Struct. Algorithms, 2015

Long Paths in Random Apollonian Networks.
Internet Mathematics, 2015

Fast Consensus for Voting on General Expander Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Constructing Self-stabilizing Oscillators in Population Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Coalescing Walks on Rotor-Router Systems.
Proceedings of the Structural Information and Communication Complexity, 2015

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
The height of random k-trees and related branching processes.
Random Struct. Algorithms, 2014

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two.
Random Struct. Algorithms, 2014

Random walks in recommender systems: exact computation and simulations.
Proceedings of the 23rd International World Wide Web Conference, 2014

The Power of Two Choices in Distributed Voting.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
The cover times of random walks on random uniform hypergraphs.
Theor. Comput. Sci., 2013

Coalescing Random Walks and Voting on Connected Graphs.
SIAM J. Discrete Math., 2013

Fast Low-Cost Estimation of Network Properties Using Random Walks.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

2012
Stationary distribution and cover time of random walks on random digraphs.
J. Comb. Theory, Ser. B, 2012

Cover time of a random graph with given degree sequence.
Discrete Mathematics, 2012

A fast algorithm to find all high degree vertices in power law graphs.
Proceedings of the 21st World Wide Web Conference, 2012

A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Some Typical Properties of the Spatial Preferred Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Coalescing random walks and voting on graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Estimating network parameters using random walks.
Proceedings of the Fourth International Conference on Computational Aspects of Social Networks, 2012

2011
Scale-free graphs of increasing degree.
Random Struct. Algorithms, 2011

Component structure of the vacant set induced by a random walk on a random graph.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Networks of random cycles.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Randomized Diffusion for Indivisible Loads.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

The Cover Times of Random Walks on Hypergraphs.
Proceedings of the Structural Information and Communication Complexity, 2011

Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful.
Proceedings of the Structural Information and Communication Complexity, 2011

Viral Processes by Random Walks on Random Regular Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence.
SIAM J. Discrete Math., 2010

Random Walks with Look-Ahead in Scale-Free Random Graphs.
SIAM J. Discrete Math., 2010

Scale Free Properties of Random k-Trees.
Mathematics in Computer Science, 2010

Speeding Up Random Walks with Neighborhood Exploration.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Chains-into-Bins Processes.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The Cover Time of Cartesian Product Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Realistic Data for Testing Rule Mining Algorithms.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Multiple Random Walks in Random Regular Graphs.
SIAM J. Discrete Math., 2009

Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439.
Random Struct. Algorithms, 2009

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.
Discrete Applied Mathematics, 2009

The cover time of random geometric graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

An efficient sparse regularity concept.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

The flip markov chain and a randomising P2P protocol.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Multiple Random Walks and Interacting Particle Systems.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Martingales on Trees and the Empire Chromatic Number of Random Trees.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
A randomized algorithm for the joining protocol in dynamic distributed networks.
Theor. Comput. Sci., 2008

The cover time of the giant component of a random graph.
Random Struct. Algorithms, 2008

Locating and Repairing Faults in a Network with Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2008

Random Walks on Random Graphs.
Proceedings of the Nano-Net - Third International ICST Conference, 2008

2007
The cover time of the preferential attachment graph.
J. Comb. Theory, Ser. B, 2007

Random 2-SAT with Prescribed Literal Degrees.
Algorithmica, 2007

A Spatial Web Graph Model with Local Influence Regions.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Energy efficient randomised communication in unknown AdHoc networks.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

The Cover Time of Random Digraphs.
Proceedings of the Approximation, 2007

2006
The degree distribution of the generalized duplication model.
Theor. Comput. Sci., 2006

Dominating sets of random recursive trees.
Electronic Notes in Discrete Mathematics, 2006

Hamilton cycles in random lifts of graphs.
Eur. J. Comb., 2006

Distribution of Vertex Degree in Web-Graphs.
Combinatorics, Probability & Computing, 2006

Searching for Black-Hole Faults in a Network Using Multiple Agents.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005
The Cover Time of Random Regular Graphs.
SIAM J. Discrete Math., 2005

Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Internet Mathematics, 2005

The cover time of two classes of random graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Sampling regular graphs and a peer-to-peer network.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Improved Duplication Models for Proteome Network Evolution.
Proceedings of the Systems Biology and Regulatory Genomics, 2005

2004
The cores of random hypergraphs with a given degree sequence.
Random Struct. Algorithms, 2004

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence.
Combinatorics, Probability & Computing, 2004

Dominating Sets in Web Graphs.
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2003
A general model of web graphs.
Random Struct. Algorithms, 2003

Random Deletion in a Scale-Free Random Graph Process.
Internet Mathematics, 2003

Crawling on Simple Models of Web Graphs.
Internet Mathematics, 2003

On Randomly Generated Intersecting Hypergraphs.
Electr. J. Comb., 2003

The cover time of sparse random graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.
Combinatorics, Probability & Computing, 2002

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity.
Combinatorics, Probability & Computing, 2002

Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs.
Combinatorics, Probability & Computing, 2002

Crawling on web graphs.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

A note on random 2-SAT with prescribed literal degrees.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Classifying Special Interest Groups in Web Graphs.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001
The union of two random permutations does not have a directed Hamilton cycle.
Random Struct. Algorithms, 2001

On Markov Chains for Randomly H-Coloring a Graph.
J. Algorithms, 2001

A General Model of Undirected Web Graphs.
Proceedings of the Algorithms, 2001

2000
Hamilton cycles in random graphs and directed graphs.
Random Struct. Algorithms, 2000

On the rank of random matrices.
Random Struct. Algorithms, 2000

On the distribution of rank of a random matrix over a finite field.
Random Struct. Algorithms, 2000

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k.
Journal of Graph Theory, 2000

Min-Wise Independent Linear Permutations.
Electr. J. Comb., 2000

1999
Mixing properties of the Swendsen-Wang process on classes of graphs.
Random Struct. Algorithms, 1999

Asymptotics for dependent sums of random vectors.
Random Struct. Algorithms, 1999

1997
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

1996
Perfect Matchings in Random r-regular, s-uniform Hypergraphs.
Combinatorics, Probability & Computing, 1996

Asymptotic Enumeration of Predicate-Junction Flowgraphs.
Combinatorics, Probability & Computing, 1996

1995
On the 2-Cyclic Property in 2-Regular Digraphs.
Random Struct. Algorithms, 1995

The vapnik-chervonenkis dimension of a random graph.
Discrete Mathematics, 1995

On the Connectivity of Random k-th Nearest Neighbour Graphs.
Combinatorics, Probability & Computing, 1995

Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Electr. J. Comb., 1995

1994
The Threshold for Hamilton Cycles in the Square of a Random Graph.
Random Struct. Algorithms, 1994

Hamilton Cycles in a Class of Random Directed Graphs.
J. Comb. Theory, Ser. B, 1994

Probabilistic analysis of two k-cluster problems.
Discrete Applied Mathematics, 1994

Hamilton Cycles in Random Regular Digraphs.
Combinatorics, Probability & Computing, 1994

1993
A Note on the Connectivity of 2-Regular Digraphs.
Random Struct. Algorithms, 1993

1992
1-Pancyclic Hamilton Cycles in Random Graphs.
Random Struct. Algorithms, 1992

On the Trickness of Sparse Random Graphs.
Combinatorics, Probability & Computing, 1992

1991
Pancyclic Hamilton cycles in random graphs.
Discrete Mathematics, 1991

1990
The limiting probability that alpha-in, ß-out is strongly connected.
J. Comb. Theory, Ser. B, 1990

1989
On the number of hamilton cycles in a random graph.
Journal of Graph Theory, 1989

1988
Probabilistic Analysis of a Relaxation for the k-Median Problem.
Math. Oper. Res., 1988


  Loading...