Colin Cooper - RankMe

190 papers A* 22A 5B 9C 14Journal 123Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A random forest process with a variable number of giant components in the threshold window. Discret. Appl. Math. Colin Cooper, Tomasz Radzik
2026	J	`jnl`	Discrete incremental voting on expanders. Discret. Math. Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2026	J	`jnl`	Undecided State Dynamics with Many Opinions. CoRR Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2025	A*	`conf`	Asynchronous 3-Majority Dynamics with Many Opinions. SODA Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2025	J	`jnl`	Cover time of random subgraphs of the hypercube. CoRR Colin Cooper, Alan M. Frieze, Wesley Pegden
2025	J	`jnl`	Hamilton Cycles in Random Digraphs with Minimum Degree at Least One. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2025	J	`jnl`	Triangle Processes on Graphs With Given Degree Sequence. Random Struct. Algorithms Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2025	J	`jnl`	WalkSAT is Linear on Random 2-SAT. SIAM J. Discret. Math. Petra Berenbrink, Amin Coja-Oghlan, Colin Cooper, Thorsten Götte, Lukas Hintze, Pavel Zakharov
2024	C	`conf`	A Simple Model of Influence: Details and Variants of Dynamics. WAW Colin Cooper, Nan Kang, Tomasz Radzik, Ngoc Vu
2024	J	`jnl`	Asynchronous 3-Majority Dynamics with Many Opinions. CoRR Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2024	J	`jnl`	Discrete Incremental Voting on Expanders. CoRR Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2024	J	`jnl`	WalkSAT is linear on random 2-SAT. CoRR Petra Berenbrink, Amin Coja-Oghlan, Colin Cooper, Thorsten Götte, Lukas Hintze, Pavel Zakharov
2023	C	`conf`	A Simple Model of Influence. WAW Colin Cooper, Nan Kang, Tomasz Radzik
2023	J	`jnl`	A simple model of influence. CoRR Colin Cooper, Nan Kang, Tomasz Radzik
2023	J	`jnl`	A triangle process on graphs with given degree sequence. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2023	A*	`conf`	Brief Announcement: Discrete Incremental Voting. PODC Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	B	`conf`	Discrete Incremental Voting. OPODIS Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	J	`jnl`	Discrete Incremental Voting. CoRR Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	A*	`conf`	Distributed Averaging in Opinion Dynamics. PODC Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera
2022	J	`jnl`	Distributed Averaging in Population Protocols. CoRR Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik
2022	A	`conf`	On early extinction and the effect of travelling in the SIR model. UAI Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik
2022	J	`jnl`	Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2021	C	`conf`	A Triangle Process on Regular Graphs. IWOCA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2020	J	`jnl`	A triangle process on regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2019	J	`jnl`	Minors of a random binary matroid. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. Colin Cooper, Tomasz Radzik, Nicolas Rivera
2019	J	`jnl`	On the Cover Time of Dense Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	On the Rank of a Random Binary Matrix. Electron. J. Comb. Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	A*	`conf`	On the rank of a random binary matrix. SODA Colin Cooper, Alan M. Frieze, Wesley Pegden
2019	J	`jnl`	The flip Markov chain for connected regular graphs. Discret. Appl. Math. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2019	J	`jnl`	Triangle-creation processes on cubic graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2018	C	`conf`	An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data. WAW Colin Cooper, Ngoc Vu
2018	J	`jnl`	Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
2018	J	`jnl`	Dispersion processes. Random Struct. Algorithms Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2018	J	`jnl`	On the cover time of dense graphs. CoRR Colin Cooper, Alan M. Frieze, Wesley Pegden
2018	C	`conf`	The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA Colin Cooper, Alan M. Frieze, Tony Johansson
2018	—	`conf`	The cover time of a biased random walk on ANALCO Colin Cooper, Alan M. Frieze, Samantha Petti
2018	J	`jnl`	The cover time of a biased random walk on a random cubic graph. CoRR Colin Cooper, Alan M. Frieze, Tony Johansson
2018	J	`jnl`	Threshold behaviour of discordant voting on the complete graph. J. Discrete Algorithms Colin Cooper, Nicolás Rivera
2017	A*	`conf`	Brief Announcement: Population Protocols for Leader Election and Exact Majority with PODC Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
2017	J	`jnl`	Constructing self-stabilizing oscillators in population protocols. Inf. Comput. Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2017	J	`jnl`	Dispersion processes. CoRR Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2017	A	`conf`	Fast Plurality Consensus in Regular Expanders. DISC Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2017	B	`conf`	Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA Colin Cooper, Tomasz Radzik, Nicolas Rivera
2017	A	`conf`	Multi-Agent Flag Coordination Games. AAMAS David Kohan Marzagão, Nicolas Rivera, Colin Cooper, Peter McBurney, Kathleen Steinhöfel
2017	J	`jnl`	Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
2017	J	`jnl`	The covertime of a biased random walk on G CoRR Colin Cooper, Alan M. Frieze, Samantha Petti
2017	J	`jnl`	The flip Markov chain for connected regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2016	A*	`conf`	Discordant Voting Processes on Finite Graphs. ICALP Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	J	`jnl`	Discordant voting processes on finite graphs. CoRR Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	J	`jnl`	Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2016	J	`jnl`	Fast plurality consensus in regular expanders. CoRR Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2016	J	`jnl`	On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
2016	J	`jnl`	Rainbow Arborescence in Random Digraphs. J. Graph Theory Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
2016	—	`conf`	Spectral clustering using the kNN-MST similarity graph. CEEC Patrick Veenstra, Colin Cooper, Steve Phelps
2016	A*	`conf`	The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC Colin Cooper, Tomasz Radzik, Nicolas Rivera
2016	A*	`conf`	The Linear Voting Model. ICALP Colin Cooper, Nicolas Rivera
2016	J	`jnl`	The coalescing-branching random walk on expanders and the dual epidemic process. CoRR Colin Cooper, Tomasz Radzik, Nicolas Rivera
2016	—	`conf`	The use of Biweight Mid Correlation to improve graph based portfolio construction. CEEC Patrick Veenstra, Colin Cooper, Steve Phelps
2016	J	`jnl`	Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2015	B	`conf`	Coalescing Walks on Rotor-Router Systems. SIROCCO Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2015	C	`conf`	Constructing Self-stabilizing Oscillators in Population Protocols. SSS Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2015	A	`conf`	Fast Consensus for Voting on General Expander Graphs. DISC Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2015	J	`jnl`	Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics. Sci. Program. Fei Gao, Katarzyna Musial, Colin Cooper, Sophia Tsoka
2015	J	`jnl`	Long Paths in Random Apollonian Networks. Internet Math. Colin Cooper, Alan M. Frieze
2015	J	`jnl`	Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Struct. Algorithms Petra Berenbrink, Colin Cooper, Tom Friedetzky
2015	J	`jnl`	Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
2015	C	`conf`	Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. IWOCA Mohammed Amin Abdullah, Colin Cooper, Moez Draief
2014	J	`jnl`	A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. Internet Math. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2014	J	`jnl`	Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Eyal Lubetzky
2014	J	`jnl`	Estimating network parameters using random walks. Soc. Netw. Anal. Min. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2014	—	`conf`	Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos
2014	J	`jnl`	Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. Colin Cooper, Alan M. Frieze, Pawel Pralat
2014	—	`conf`	The Power of Two Choices in Distributed Voting. ICALP (2) Colin Cooper, Robert Elsässer, Tomasz Radzik
2014	J	`jnl`	The Power of Two Choices in Distributed Voting. CoRR Colin Cooper, Robert Elsässer, Tomasz Radzik
2014	J	`jnl`	The height of random Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Ryuhei Uehara
2013	J	`jnl`	Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2013	J	`jnl`	Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2013	C	`conf`	Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW Colin Cooper, Tomasz Radzik, Yiannis Siantos
2013	J	`jnl`	The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2012	C	`conf`	A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	—	`conf`	A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	J	`jnl`	Chains-into-bins processes. J. Discrete Algorithms Tugkan Batu, Petra Berenbrink, Colin Cooper
2012	J	`jnl`	Coalescing random walks and voting on graphs CoRR Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	A*	`conf`	Coalescing random walks and voting on graphs. PODC Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	J	`jnl`	Cover time of a random graph with given degree sequence. Discret. Math. Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze
2012	—	`conf`	Estimating network parameters using random walks. CASoN Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	J	`jnl`	Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time CoRR Petra Berenbrink, Colin Cooper, Tom Friedetzky
2012	A*	`conf`	Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC Petra Berenbrink, Colin Cooper, Tom Friedetzky
2012	C	`conf`	Some Typical Properties of the Spatial Preferred Attachment Model. WAW Colin Cooper, Alan M. Frieze, Pawel Pralat
2012	J	`jnl`	Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory B Colin Cooper, Alan M. Frieze
2011	A*	`conf`	Component structure of the vacant set induced by a random walk on a random graph. SODA Colin Cooper, Alan M. Frieze
2011	J	`jnl`	Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2011	A*	`conf`	Networks of random cycles. SODA Colin Cooper, Martin E. Dyer, Andrew J. Handley
2011	J	`jnl`	On the Imitation Strategy for Games on Graphs CoRR Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj
2011	B	`conf`	Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. SIROCCO Colin Cooper
2011	A*	`conf`	Randomized Diffusion for Indivisible Loads. SODA Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
2011	J	`jnl`	Scale-free graphs of increasing degree. Random Struct. Algorithms Colin Cooper, Pawel Pralat
2011	J	`jnl`	Stationary distribution and cover time of random walks on random digraphs CoRR Colin Cooper, Alan M. Frieze
2011	B	`conf`	The Cover Times of Random Walks on Hypergraphs. SIROCCO Colin Cooper, Alan M. Frieze, Tomasz Radzik
2011	J	`jnl`	The cover time of random geometric graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2011	—	`conf`	Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM Mohammed Amin Abdullah, Colin Cooper, Moez Draief
2010	J	`jnl`	An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Chains-into-Bins Processes CoRR Tugkan Batu, Petra Berenbrink, Colin Cooper
2010	C	`conf`	Chains-into-Bins Processes. IWOCA Tugkan Batu, Petra Berenbrink, Colin Cooper
2010	J	`jnl`	Component structure induced by a random walk on a random graph CoRR Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Michael Krivelevich
2010	J	`jnl`	Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. Colin Cooper, Ralf Klasing, Tomasz Radzik
2010	J	`jnl`	Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2010	J	`jnl`	Scale Free Properties of Random Math. Comput. Sci. Colin Cooper, Ryuhei Uehara
2010	A*	`conf`	Speeding Up Random Walks with Neighborhood Exploration. SODA Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
2010	C	`conf`	The Cover Time of Cartesian Product Graphs. IWOCA Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik
2009	J	`jnl`	An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. Discret. Appl. Math. Colin Cooper, Michele Zito
2009	A*	`conf`	An efficient sparse regularity concept. SODA Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
2009	J	`jnl`	Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2009	—	`conf`	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2009	J	`jnl`	Energy efficient randomised communication in unknown AdHoc networks. Theor. Comput. Sci. Petra Berenbrink, Colin Cooper, Zengjian Hu
2009	B	`conf`	Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT Colin Cooper, Andrew R. A. McGrae, Michele Zito
2009	—	`conf`	Multiple Random Walks and Interacting Particle Systems. ICALP (2) Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	J	`jnl`	Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	—	`ch.`	Realistic Data for Testing Rule Mining Algorithms. Encyclopedia of Data Warehousing and Mining Colin Cooper, Michele Zito
2009	A*	`conf`	The cover time of random geometric graphs. SODA Colin Cooper, Alan M. Frieze
2009	A*	`conf`	The flip markov chain and a randomising P2P protocol. PODC Colin Cooper, Martin E. Dyer, Andrew J. Handley
2008	J	`jnl`	A Spatial Web Graph Model with Local Influence Regions. Internet Math. William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat
2008	J	`jnl`	A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. Colin Cooper, Ralf Klasing, Tomasz Radzik
2008	B	`conf`	Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO Colin Cooper, Ralf Klasing, Tomasz Radzik
2008	—	`conf`	Random Walks on Random Graphs. NanoNet Colin Cooper, Alan M. Frieze
2008	J	`jnl`	The cover time of the giant component of a random graph. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2007	C	`conf`	A Spatial Web Graph Model with Local Influence Regions. WAW William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat
2007	B	`conf`	Energy efficient randomised communication in unknown AdHoc networks. SPAA Petra Berenbrink, Colin Cooper, Zengjian Hu
2007	J	`jnl`	Random 2-SAT with Prescribed Literal Degrees. Algorithmica Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
2007	—	`conf`	Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD Colin Cooper, Michele Zito
2007	J	`jnl`	Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2007	—	`conf`	The Cover Time of Random Digraphs. APPROX-RANDOM Colin Cooper, Alan M. Frieze
2007	J	`jnl`	The cover time of sparse random graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2007	J	`jnl`	The cover time of the preferential attachment graph. J. Comb. Theory B Colin Cooper, Alan M. Frieze
2006	J	`jnl`	Distribution of Vertex Degree in Web-Graphs. Comb. Probab. Comput. Colin Cooper
2006	J	`jnl`	Dominating sets of random recursive trees. Electron. Notes Discret. Math. Michele Zito, Colin Cooper
2006	J	`jnl`	Energy Efficient Randomized Communication in Unknown AdHoc Networks CoRR Petra Berenbrink, Colin Cooper, Zengjian Hu
2006	J	`jnl`	Hamilton cycles in random lifts of graphs. Eur. J. Comb. K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze
2006	B	`conf`	Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS Colin Cooper, Ralf Klasing, Tomasz Radzik
2006	J	`jnl`	The degree distribution of the generalized duplication model. Theor. Comput. Sci. Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp
2005	—	`conf`	Improved Duplication Models for Proteome Network Evolution. Systems Biology and Regulatory Genomics Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp
2005	J	`jnl`	Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Math. Colin Cooper, Ralf Klasing, Michele Zito
2005	A*	`conf`	Sampling regular graphs and a peer-to-peer network. SODA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2005	J	`jnl`	The Cover Time of Random Regular Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze
2005	A*	`conf`	The cover time of two classes of random graphs. SODA Colin Cooper, Alan M. Frieze
2004	C	`conf`	Dominating Sets in Web Graphs. WAW Colin Cooper, Ralf Klasing, Michele Zito
2004	J	`jnl`	The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
2004	J	`jnl`	The cores of random hypergraphs with a given degree sequence. Random Struct. Algorithms Colin Cooper
2003	J	`jnl`	A general model of web graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2003	J	`jnl`	Crawling on Simple Models of Web Graphs. Internet Math. Colin Cooper, Alan M. Frieze
2003	J	`jnl`	On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó
2003	J	`jnl`	Random Deletion in a Scale-Free Random Graph Process. Internet Math. Colin Cooper, Alan M. Frieze, Juan Vera
2003	A*	`conf`	The cover time of sparse random graphs. SODA Colin Cooper, Alan M. Frieze
2002	A*	`conf`	A note on random 2-SAT with prescribed literal degrees. SODA Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
2002	—	`conf`	Classifying Special Interest Groups in Web Graphs. RANDOM Colin Cooper
2002	A*	`conf`	Crawling on web graphs. STOC Colin Cooper, Alan M. Frieze
2002	J	`jnl`	Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed
2002	J	`jnl`	Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
2001	A	`conf`	A General Model of Undirected Web Graphs. ESA Colin Cooper, Alan M. Frieze
2001	J	`jnl`	On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms Colin Cooper, Martin E. Dyer, Alan M. Frieze
2001	J	`jnl`	The union of two random permutations does not have a directed Hamilton cycle. Random Struct. Algorithms Colin Cooper
2000	J	`jnl`	Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
2000	J	`jnl`	Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least J. Graph Theory Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze
2000	J	`jnl`	Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
2000	J	`jnl`	Min-Wise Independent Linear Permutations. Electron. J. Comb. Tom Bohman, Colin Cooper, Alan M. Frieze
2000	J	`jnl`	On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms Colin Cooper
2000	J	`jnl`	On the rank of random matrices. Random Struct. Algorithms Colin Cooper
1999	J	`jnl`	Asymptotics for dependent sums of random vectors. Random Struct. Algorithms Colin Cooper
1999	J	`jnl`	Mixing properties of the Swendsen-Wang process on classes of graphs. Random Struct. Algorithms Colin Cooper, Alan M. Frieze
1997	—	`conf`	Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
1996	J	`jnl`	Asymptotic Enumeration of Predicate-Junction Flowgraphs. Comb. Probab. Comput. Colin Cooper
1996	J	`jnl`	Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
1995	J	`jnl`	Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electron. J. Comb. Colin Cooper, Alan M. Frieze
1995	J	`jnl`	On the 2-Cyclic Property in 2-Regular Digraphs. Random Struct. Algorithms Colin Cooper
1995	J	`jnl`	On the Connectivity of Random k-th Nearest Neighbour Graphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze
1995	J	`jnl`	The vapnik-chervonenkis dimension of a random graph. Discret. Math. Martin Anthony, Graham R. Brightwell, Colin Cooper
1994	J	`jnl`	Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Michael Molloy
1994	J	`jnl`	Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory B Colin Cooper, Alan M. Frieze
1994	J	`jnl`	Probabilistic analysis of two k-cluster problems. Discret. Appl. Math. Colin Cooper
1994	J	`jnl`	The Threshold for Hamilton Cycles in the Square of a Random Graph. Random Struct. Algorithms Colin Cooper
1993	J	`jnl`	A Note on the Connectivity of 2-Regular Digraphs. Random Struct. Algorithms Colin Cooper
1992	J	`jnl`	1-Pancyclic Hamilton Cycles in Random Graphs. Random Struct. Algorithms Colin Cooper
1992	J	`jnl`	On the Trickness of Sparse Random Graphs. Comb. Probab. Comput. Colin Cooper
1991	J	`jnl`	Pancyclic Hamilton cycles in random graphs. Discret. Math. Colin Cooper
1990	J	`jnl`	The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory B Colin Cooper, Alan M. Frieze
1989	J	`jnl`	On the number of hamilton cycles in a random graph. J. Graph Theory Colin Cooper, Alan M. Frieze
1988	J	`jnl`	Probabilistic Analysis of a Relaxation for the Math. Oper. Res. Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze