Probabilistic Analysis of a Relaxation for the k-Median Problem. - Sang Ahn; Colin Cooper; Gérard Cornuéjols; Alan M. Frieze (Math. Oper. Res., 1988)

On the number of hamilton cycles in a random graph. - Colin Cooper; Alan M. Frieze (J. Graph Theory, 1989)

The limiting probability that alpha-in, ß-out is strongly connected. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 1990)

Pancyclic Hamilton cycles in random graphs. - Colin Cooper (Discret. Math., 1991)

On the Trickness of Sparse Random Graphs. - Colin Cooper (Comb. Probab. Comput., 1992)

1-Pancyclic Hamilton Cycles in Random Graphs. - Colin Cooper (Random Struct. Algorithms, 1992)

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

Hamilton Cycles in Random Regular Digraphs. - Colin Cooper; Alan M. Frieze; Michael Molloy 001 (Comb. Probab. Comput., 1994)

Probabilistic analysis of two k-cluster problems. - Colin Cooper (Discret. Appl. Math., 1994)

Hamilton Cycles in a Class of Random Directed Graphs. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 1994)

The Threshold for Hamilton Cycles in the Square of a Random Graph. - Colin Cooper (Random Struct. Algorithms, 1994)

Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. - Colin Cooper; Alan M. Frieze (Electron. J. Comb., 1995)

On the Connectivity of Random k-th Nearest Neighbour Graphs. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 1995)

The vapnik-chervonenkis dimension of a random graph. - Martin Anthony; Graham R. Brightwell; Colin Cooper (Discret. Math., 1995)

On the 2-Cyclic Property in 2-Regular Digraphs. - Colin Cooper (Random Struct. Algorithms, 1995)

Asymptotic Enumeration of Predicate-Junction Flowgraphs. - Colin Cooper (Comb. Probab. Comput., 1996)

Perfect Matchings in Random r-regular, s-uniform Hypergraphs. - Colin Cooper; Alan M. Frieze; Michael Molloy 001; Bruce A. Reed (Comb. Probab. Comput., 1996)

Asymptotics for dependent sums of random vectors. - Colin Cooper (Random Struct. Algorithms, 1999)

Mixing properties of the Swendsen-Wang process on classes of graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 1999)

Min-Wise Independent Linear Permutations. - Tom Bohman; Colin Cooper; Alan M. Frieze (Electron. J. Comb., 2000)

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. - Béla Bollobás; Colin Cooper; Trevor I. Fenner; Alan M. Frieze (J. Graph Theory, 2000)

On the distribution of rank of a random matrix over a finite field. - Colin Cooper (Random Struct. Algorithms, 2000)

On the rank of random matrices. - Colin Cooper (Random Struct. Algorithms, 2000)

Hamilton cycles in random graphs and directed graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2000)

Average-case complexity of shortest-paths problems in the vertex-potential model. - Colin Cooper; Alan M. Frieze; Kurt Mehlhorn; Volker Priebe (Random Struct. Algorithms, 2000)

A General Model of Undirected Web Graphs. - Colin Cooper; Alan M. Frieze (ESA, 2001)

On Markov Chains for Randomly H-Coloring a Graph. - Colin Cooper; Martin E. Dyer; Alan M. Frieze (J. Algorithms, 2001)

The union of two random permutations does not have a directed Hamilton cycle. - Colin Cooper (Random Struct. Algorithms, 2001)

Classifying Special Interest Groups in Web Graphs. - Colin Cooper (RANDOM, 2002)

A note on random 2-SAT with prescribed literal degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (SODA, 2002)

Crawling on web graphs. - Colin Cooper; Alan M. Frieze (STOC, 2002)

Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 2002)

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. - Colin Cooper; Alan M. Frieze; Bruce A. Reed (Comb. Probab. Comput., 2002)

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. - Colin Cooper; Alan M. Frieze; Bruce A. Reed; Oliver Riordan (Comb. Probab. Comput., 2002)

On Randomly Generated Intersecting Hypergraphs. - Tom Bohman; Colin Cooper; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó (Electron. J. Comb., 2003)

Crawling on Simple Models of Web Graphs. - Colin Cooper; Alan M. Frieze (Internet Math., 2003)

Random Deletion in a Scale-Free Random Graph Process. - Colin Cooper; Alan M. Frieze; Juan Vera 001 (Internet Math., 2003)

A general model of web graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2003)

Dominating Sets in Web Graphs. - Colin Cooper; Ralf Klasing; Michele Zito 001 (WAW, 2004)

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 2004)

The cores of random hypergraphs with a given degree sequence. - Colin Cooper (Random Struct. Algorithms, 2004)

Improved Duplication Models for Proteome Network Evolution. - Gürkan Bebek; Petra Berenbrink; Colin Cooper; Tom Friedetzky; Joseph H. Nadeau; Süleyman Cenk Sahinalp (Systems Biology and Regulatory Genomics, 2005)

The cover time of two classes of random graphs. - Colin Cooper; Alan M. Frieze (SODA, 2005)

Lower Bounds and Algorithms for Dominating Sets in Web Graphs. - Colin Cooper; Ralf Klasing; Michele Zito 001 (Internet Math., 2005)

The Cover Time of Random Regular Graphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2005)

Searching for Black-Hole Faults in a Network Using Multiple Agents. - Colin Cooper; Ralf Klasing; Tomasz Radzik (OPODIS, 2006)

Energy Efficient Randomized Communication in Unknown AdHoc Networks - Petra Berenbrink; Colin Cooper; Zengjian Hu (CoRR, 2006)

Distribution of Vertex Degree in Web-Graphs. - Colin Cooper (Comb. Probab. Comput., 2006)

Hamilton cycles in random lifts of graphs. - K. Burgin; Prasad Chebolu; Colin Cooper; Alan M. Frieze (Eur. J. Comb., 2006)

Dominating sets of random recursive trees. - Michele Zito 001; Colin Cooper (Electron. Notes Discret. Math., 2006)

The degree distribution of the generalized duplication model. - Gürkan Bebek; Petra Berenbrink; Colin Cooper; Tom Friedetzky; Joseph H. Nadeau; Süleyman Cenk Sahinalp (Theor. Comput. Sci., 2006)

The Cover Time of Random Digraphs. - Colin Cooper; Alan M. Frieze (APPROX-RANDOM, 2007)

Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. - Colin Cooper; Michele Zito 001 (PKDD, 2007)

Random 2-SAT with Prescribed Literal Degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (Algorithmica, 2007)

Sampling Regular Graphs and a Peer-to-Peer Network. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (Comb. Probab. Comput., 2007)

The cover time of the preferential attachment graph. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 2007)

The cover time of sparse random graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2007)

Random Walks on Random Graphs. - Colin Cooper; Alan M. Frieze (NanoNet, 2008)

A Spatial Web Graph Model with Local Influence Regions. - William Aiello; Anthony Bonato; Colin Cooper; Jeannette C. M. Janssen; Pawel Pralat (Internet Math., 2008)

The cover time of the giant component of a random graph. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2008)

A randomized algorithm for the joining protocol in dynamic distributed networks. - Colin Cooper; Ralf Klasing; Tomasz Radzik (Theor. Comput. Sci., 2008)

Martingales on Trees and the Empire Chromatic Number of Random Trees. - Colin Cooper; Andrew R. A. McGrae; Michele Zito 001 (FCT, 2009)

Multiple Random Walks and Interacting Particle Systems. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (ICALP (2), 2009)

The flip markov chain and a randomising P2P protocol. - Colin Cooper; Martin E. Dyer; Andrew J. Handley (PODC, 2009)

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. - Colin Cooper; Michele Zito 001 (Discret. Appl. Math., 2009)

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

Multiple Random Walks in Random Regular Graphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (SIAM J. Discret. Math., 2009)

Energy efficient randomised communication in unknown AdHoc networks. - Petra Berenbrink; Colin Cooper; Zengjian Hu (Theor. Comput. Sci., 2009)

Realistic Data for Testing Rule Mining Algorithms. - Colin Cooper; Michele Zito 001 (Encyclopedia of Data Warehousing and Mining, 2009)

The Cover Time of Cartesian Product Graphs. - Mohammed Amin Abdullah 001; Colin Cooper; Tomasz Radzik (IWOCA, 2010)

Speeding Up Random Walks with Neighborhood Exploration. - Petra Berenbrink; Colin Cooper; Robert Elsässer; Tomasz Radzik; Thomas Sauerwald (SODA, 2010)

Component structure induced by a random walk on a random graph - Colin Cooper; Alan M. Frieze (CoRR, 2010)

Scale Free Properties of Random k-Trees. - Colin Cooper; Ryuhei Uehara (Math. Comput. Sci., 2010)

An Efficient Sparse Regularity Concept. - Amin Coja-Oghlan; Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2010)

Random Walks with Look-Ahead in Scale-Free Random Graphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2010)

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. - Colin Cooper; Alan M. Frieze; Michael Krivelevich (SIAM J. Discret. Math., 2010)

Locating and repairing faults in a network with mobile agents. - Colin Cooper; Ralf Klasing; Tomasz Radzik (Theor. Comput. Sci., 2010)

Viral Processes by Random Walks on Random Regular Graphs. - Mohammed Amin Abdullah 001; Colin Cooper; Moez Draief (APPROX-RANDOM, 2011)

Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. - Colin Cooper (SIROCCO, 2011)

The Cover Times of Random Walks on Hypergraphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (SIROCCO, 2011)

Networks of random cycles. - Colin Cooper; Martin E. Dyer; Andrew J. Handley (SODA, 2011)

On the Imitation Strategy for Games on Graphs - Colin Cooper; Martin E. Dyer; Velumailum Mohanaraj (CoRR, 2011)

Derandomizing random walks in undirected graphs using locally fair exploration strategies. - Colin Cooper; David Ilcinkas; Ralf Klasing; Adrian Kosowski (Distributed Comput., 2011)

The cover time of random geometric graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2011)

Scale-free graphs of increasing degree. - Colin Cooper; Pawel Pralat (Random Struct. Algorithms, 2011)

Coalescing random walks and voting on graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (PODC, 2012)

A fast algorithm to find all high degree vertices in power law graphs. - Colin Cooper; Tomasz Radzik; Yiannis Siantos (WWW (Companion Volume), 2012)

Cover time of a random graph with given degree sequence. - Mohammed Amin Abdullah 001; Colin Cooper; Alan M. Frieze (Discret. Math., 2012)

Stationary distribution and cover time of random walks on random digraphs. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 2012)

Chains-into-bins processes. - Tugkan Batu; Petra Berenbrink; Colin Cooper (J. Discrete Algorithms, 2012)

Component structure of the vacant set induced by a random walk on a random graph. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2013)

Coalescing Random Walks and Voting on Connected Graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (SIAM J. Discret. Math., 2013)

The cover times of random walks on random uniform hypergraphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (Theor. Comput. Sci., 2013)

The Power of Two Choices in Distributed Voting. - Colin Cooper; Robert Elsässer; Tomasz Radzik (ICALP (2), 2014)

Random walks in recommender systems: exact computation and simulations. - Colin Cooper; Sang-Hyuk Lee; Tomasz Radzik; Yiannis Siantos (WWW (Companion Volume), 2014)

Some Typical Properties of the Spatial Preferred Attachment Model. - Colin Cooper; Alan M. Frieze; Pawel Pralat (Internet Math., 2014)

A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. - Colin Cooper; Tomasz Radzik; Yiannis Siantos (Internet Math., 2014)

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. - Colin Cooper; Alan M. Frieze; Eyal Lubetzky (Random Struct. Algorithms, 2014)

The height of random k-trees and related branching processes. - Colin Cooper; Alan M. Frieze; Ryuhei Uehara (Random Struct. Algorithms, 2014)

Estimating network parameters using random walks. - Colin Cooper; Tomasz Radzik; Yiannis Siantos (Soc. Netw. Anal. Min., 2014)

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. - Mohammed Amin Abdullah 001; Colin Cooper; Moez Draief (IWOCA, 2015)

Coalescing Walks on Rotor-Router Systems. - Colin Cooper; Tomasz Radzik; Nicolas Rivera; Takeharu Shiraga (SIROCCO, 2015)

Fast Consensus for Voting on General Expander Graphs. - Colin Cooper; Robert Elsässer; Tomasz Radzik; Nicolas Rivera; Takeharu Shiraga (DISC, 2015)

Long Paths in Random Apollonian Networks. - Colin Cooper; Alan M. Frieze (Internet Math., 2015)

Randomized diffusion for indivisible loads. - Petra Berenbrink; Colin Cooper; Tom Friedetzky; Tobias Friedrich 001; Thomas Sauerwald (J. Comput. Syst. Sci., 2015)

Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. - Petra Berenbrink; Colin Cooper; Tom Friedetzky (Random Struct. Algorithms, 2015)

Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics. - Fei Gao 009; Katarzyna Musial; Colin Cooper; Sophia Tsoka (Sci. Program., 2015)

The use of Biweight Mid Correlation to improve graph based portfolio construction. - Patrick Veenstra; Colin Cooper; Steve Phelps (CEEC, 2016)

Spectral clustering using the kNN-MST similarity graph. - Patrick Veenstra; Colin Cooper; Steve Phelps (CEEC, 2016)

The Linear Voting Model. - Colin Cooper; Nicolas Rivera (ICALP, 2016)

The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. - Colin Cooper; Tomasz Radzik; Nicolas Rivera (PODC, 2016)

On the Length of a Random Minimum Spanning Tree. - Colin Cooper; Alan M. Frieze; Nate Ince; Svante Janson; Joel Spencer (Comb. Probab. Comput., 2016)

Fast Low-Cost Estimation of Network Properties Using Random Walks. - Colin Cooper; Tomasz Radzik; Yiannis Siantos (Internet Math., 2016)

Rainbow Arborescence in Random Digraphs. - Deepak Bal; Patrick Bennett; Colin Cooper; Alan M. Frieze; Pawel Pralat (J. Graph Theory, 2016)

Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2016)

Multi-Agent Flag Coordination Games. - David Kohan Marzagão; Nicolas Rivera; Colin Cooper; Peter McBurney; Kathleen Steinhöfel (AAMAS, 2017)

Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. - Andreas Bilke; Colin Cooper; Robert Elsässer; Tomasz Radzik (PODC, 2017)

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. - Colin Cooper; Tomasz Radzik; Nicolas Rivera (SPAA, 2017)

Fast Plurality Consensus in Regular Expanders. - Colin Cooper; Tomasz Radzik; Nicolas Rivera; Takeharu Shiraga (DISC, 2017)

Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. - Andreas Bilke; Colin Cooper; Robert Elsässer; Tomasz Radzik (CoRR, 2017)

The covertime of a biased random walk on Gn, p. - Colin Cooper; Alan M. Frieze; Samantha Petti (CoRR, 2017)

Constructing self-stabilizing oscillators in population protocols. - Colin Cooper; Anissa Lamani; Giovanni Viglietta; Masafumi Yamashita; Yukiko Yamauchi (Inf. Comput., 2017)

The cover time of a biased random walk on Gn, p. - Colin Cooper; Alan M. Frieze; Samantha Petti (ANALCO, 2018)

The Cover Time of a Biased Random Walk on a Random Cubic Graph. - Colin Cooper; Alan M. Frieze; Tony Johansson (AofA, 2018)

An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data. - Colin Cooper; Ngoc Vu (WAW, 2018)

Threshold behaviour of discordant voting on the complete graph. - Colin Cooper; Nicolás Rivera (J. Discrete Algorithms, 2018)

Dispersion processes. - Colin Cooper; Andrew McDowell; Tomasz Radzik; Nicolas Rivera; Takeharu Shiraga (Random Struct. Algorithms, 2018)

Discordant Voting Processes on Finite Graphs. - Colin Cooper; Martin E. Dyer; Alan M. Frieze; Nicolás Rivera (SIAM J. Discret. Math., 2018)

On the Rank of a Random Binary Matrix. - Colin Cooper; Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2019)

Triangle-creation processes on cubic graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (CoRR, 2019)

The flip Markov chain for connected regular graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill; Andrew J. Handley (Discret. Appl. Math., 2019)

Minors of a random binary matroid. - Colin Cooper; Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2019)

On the Cover Time of Dense Graphs. - Colin Cooper; Alan M. Frieze; Wesley Pegden (SIAM J. Discret. Math., 2019)

New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. - Colin Cooper; Tomasz Radzik; Nicolas Rivera (ACM Trans. Parallel Comput., 2019)

A Triangle Process on Regular Graphs. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (IWOCA, 2021)

On early extinction and the effect of travelling in the SIR model. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Tomasz Radzik (UAI, 2022)

Distributed Averaging in Population Protocols. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Nicolás Rivera; Tomasz Radzik (CoRR, 2022)

Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2022)

Discrete Incremental Voting. - Colin Cooper; Tomasz Radzik; Takeharu Shiraga (OPODIS, 2023)

Distributed Averaging in Opinion Dynamics. - Petra Berenbrink; Colin Cooper; Cristina Gava; David Kohan Marzagão; Frederik Mallmann-Trenn; Tomasz Radzik; Nicolas Rivera (PODC, 2023)

Brief Announcement: Discrete Incremental Voting. - Colin Cooper; Tomasz Radzik; Takeharu Shiraga (PODC, 2023)

A Simple Model of Influence. - Colin Cooper; Nan Kang; Tomasz Radzik (WAW, 2023)

A triangle process on graphs with given degree sequence. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (CoRR, 2023)

A Simple Model of Influence: Details and Variants of Dynamics. - Colin Cooper; Nan Kang; Tomasz Radzik; Ngoc Vu (WAW, 2024)

WalkSAT is linear on random 2-SAT. - Petra Berenbrink; Amin Coja-Oghlan; Colin Cooper; Thorsten Götte; Lukas Hintze; Pavel Zakharov (CoRR, 2024)

Asynchronous 3-Majority Dynamics with Many Opinions. - Colin Cooper; Frederik Mallmann-Trenn; Tomasz Radzik; Nobutaka Shimizu; Takeharu Shiraga (SODA, 2025)

Triangle Processes on Graphs With Given Degree Sequence. - Colin Cooper; Martin E. Dyer; Catherine S. Greenhill (Random Struct. Algorithms, 2025)

Cover time of random subgraphs of the hypercube. - Colin Cooper; Alan M. Frieze; Wesley Pegden (CoRR, 2025)

Discrete incremental voting on expanders. - Colin Cooper; Tomasz Radzik; Takeharu Shiraga (Discret. Math., 2026)