Colin Cooper

King's College London

	2011
96		Mohammed Abdullah, Colin Cooper, Moez Draief: Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM 2011: 351-364
95		Colin Cooper: Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. SIROCCO 2011: 1-14
94		Colin Cooper, Alan M. Frieze, Tomasz Radzik: The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221
93		Colin Cooper, Alan M. Frieze: Component structure of the vacant set induced by a random walk on a random graph. SODA 2011: 1211-1221
92		Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald: Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439
91		Colin Cooper, Martin E. Dyer, Andrew J. Handley: Networks of random cycles. SODA 2011: 933-944
90		Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj: On the Imitation Strategy for Games on Graphs CoRR abs/1102.3879: (2011)
89		Colin Cooper, Alan M. Frieze: Stationary distribution and cover time of random walks on random digraphs CoRR abs/1103.4317: (2011)
88		Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing 24(2): 91-99 (2011)
87		Colin Cooper, Alan M. Frieze: The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011)
86		Colin Cooper, Pawel Pralat: Scale-free graphs of increasing degree. Random Struct. Algorithms 38(4): 396-421 (2011)
	2010
85		Tugkan Batu, Petra Berenbrink, Colin Cooper: Chains-into-Bins Processes. IWOCA 2010: 314-325
84		Mohammed Abdullah, Colin Cooper, Tomasz Radzik: The Cover Time of Cartesian Product Graphs. IWOCA 2010: 377-389
83		Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald: Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435
82		Colin Cooper, Alan M. Frieze: Component structure induced by a random walk on a random graph CoRR abs/1005.1564: (2010)
81		Tugkan Batu, Petra Berenbrink, Colin Cooper: Chains-into-Bins Processes CoRR abs/1005.2616: (2010)
80		Colin Cooper, Ryuhei Uehara: Scale Free Properties of Random k-Trees. Mathematics in Computer Science 3(4): 489-496 (2010)
79		Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An Efficient Sparse Regularity Concept. SIAM J. Discrete Math. 23(4): 2000-2034 (2010)
78		Colin Cooper, Alan M. Frieze, Michael Krivelevich: Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discrete Math. 24(2): 558-569 (2010)
77		Colin Cooper, Alan M. Frieze: Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discrete Math. 24(3): 1162-1176 (2010)
76		Colin Cooper, Ralf Klasing, Tomasz Radzik: Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411(14-15): 1638-1647 (2010)
	2009
75		Colin Cooper, Andrew R. A. McGrae, Michele Zito: Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT 2009: 74-83
74		Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410
73		Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422
72		Colin Cooper, Martin E. Dyer, Andrew J. Handley: The flip markov chain and a randomising P2P protocol. PODC 2009: 141-150
71		Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze: An efficient sparse regularity concept. SODA 2009: 207-216
70		Colin Cooper, Alan M. Frieze: The cover time of random geometric graphs. SODA 2009: 48-57
69		Colin Cooper, Michele Zito: Realistic Data for Testing Rule Mining Algorithms. Encyclopedia of Data Warehousing and Mining 2009: 1653-1658
68		Colin Cooper, Michele Zito: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. Discrete Applied Mathematics 157(9): 2010-2014 (2009)
67		Colin Cooper, Alan M. Frieze: Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. Random Struct. Algorithms 34(2): 300-304 (2009)
66		Colin Cooper, Alan M. Frieze, Tomasz Radzik: Multiple Random Walks in Random Regular Graphs. SIAM J. Discrete Math. 23(4): 1738-1761 (2009)
65		Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy efficient randomised communication in unknown AdHoc networks. Theor. Comput. Sci. 410(27-29): 2549-2561 (2009)
	2008
64		Colin Cooper, Alan M. Frieze: Random Walks on Random Graphs. NanoNet 2008: 95-106
63		Colin Cooper, Ralf Klasing, Tomasz Radzik: Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32
62		William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. Internet Mathematics 5(1): 175-196 (2008)
61		Colin Cooper, Alan M. Frieze: The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008)
60		Colin Cooper, Ralf Klasing, Tomasz Radzik: A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406(3): 248-262 (2008)
	2007
59		Colin Cooper, Alan M. Frieze: The Cover Time of Random Digraphs. APPROX-RANDOM 2007: 422-435
58		Colin Cooper, Michele Zito: Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD 2007: 398-405
57		Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy efficient randomised communication in unknown AdHoc networks. SPAA 2007: 250-259
56		William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107
55		Colin Cooper, Alan M. Frieze, Gregory B. Sorkin: Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (2007)
54		Colin Cooper, Martin E. Dyer, Catherine S. Greenhill: Sampling Regular Graphs and a Peer-to-Peer Network. Combinatorics, Probability & Computing 16(4): 557-593 (2007)
53		Colin Cooper, Alan M. Frieze: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2): 269-290 (2007)
52		Colin Cooper, Alan M. Frieze: The cover time of sparse random graphs. Random Struct. Algorithms 30(1-2): 1-16 (2007)
	2006
51		Colin Cooper, Ralf Klasing, Tomasz Radzik: Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332
50		Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy Efficient Randomized Communication in Unknown AdHoc Networks CoRR abs/cs/0612074: (2006)
49		Colin Cooper: Distribution of Vertex Degree in Web-Graphs. Combinatorics, Probability & Computing 15(5): 637-661 (2006)
48		Michele Zito, Colin Cooper: Dominating sets of random recursive trees. Electronic Notes in Discrete Mathematics 27: 107-108 (2006)
47		K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze: Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006)
46		Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp: The degree distribution of the generalized duplication model. Theor. Comput. Sci. 369(1-3): 239-249 (2006)
	2005
45		Colin Cooper, Alan M. Frieze: The cover time of two classes of random graphs. SODA 2005: 961-970
44		Colin Cooper, Martin E. Dyer, Catherine S. Greenhill: Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988
43		Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp: Improved Duplication Models for Proteome Network Evolution. Systems Biology and Regulatory Genomics 2005: 119-137
42		Colin Cooper, Ralf Klasing, Michele Zito: Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics 2(3): (2005)
41		Colin Cooper, Alan M. Frieze: The Cover Time of Random Regular Graphs. SIAM J. Discrete Math. 18(4): 728-740 (2005)
	2004
40		Colin Cooper, Ralf Klasing, Michele Zito: Dominating Sets in Web Graphs. WAW 2004: 31-43
39		Colin Cooper, Alan M. Frieze: The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Combinatorics, Probability & Computing 13(3): 319-337 (2004)
38		Colin Cooper: The cores of random hypergraphs with a given degree sequence. Random Struct. Algorithms 25(4): 353-375 (2004)
	2003
37		Colin Cooper, Alan M. Frieze: The cover time of sparse random graphs. SODA 2003: 140-147
36		Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10: (2003)
35		Colin Cooper, Alan M. Frieze: Crawling on Simple Models of Web Graphs. Internet Mathematics 1(1): (2003)
34		Colin Cooper, Alan M. Frieze, Juan Vera: Random Deletion in a Scale-Free Random Graph Process. Internet Mathematics 1(4): (2003)
33		Colin Cooper, Alan M. Frieze: A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003)
	2002
32		Colin Cooper: Classifying Special Interest Groups in Web Graphs. RANDOM 2002: 263-276
31		Colin Cooper, Alan M. Frieze, Gregory B. Sorkin: A note on random 2-SAT with prescribed literal degrees. SODA 2002: 316-320
30		Colin Cooper, Alan M. Frieze: Crawling on web graphs. STOC 2002: 419-427
29		Colin Cooper, Alan M. Frieze: Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Combinatorics, Probability & Computing 11(2): 129-133 (2002)
28		Colin Cooper, Alan M. Frieze, Bruce A. Reed: Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Combinatorics, Probability & Computing 11(3): 249-261 (2002)
27		Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan: Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Combinatorics, Probability & Computing 11(4): 323-341 (2002)
	2001
26		Colin Cooper, Alan M. Frieze: A General Model of Undirected Web Graphs. ESA 2001: 500-511
25		Colin Cooper, Martin E. Dyer, Alan M. Frieze: On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001)
24		Colin Cooper: The union of two random permutations does not have a directed Hamilton cycle. Random Struct. Algorithms 18(1): 95-98 (2001)
	2000
23		Tom Bohman, Colin Cooper, Alan M. Frieze: Min-Wise Independent Linear Permutations. Electr. J. Comb. 7: (2000)
22		Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)
21		Colin Cooper: On the rank of random matrices. Random Struct. Algorithms 16(2): 209-232 (2000)
20		Colin Cooper, Alan M. Frieze: Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000)
19		Colin Cooper: On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms 17(3-4): 197-212 (2000)
	1999
18		Colin Cooper: Asymptotics for dependent sums of random vectors. Random Struct. Algorithms 14(3): 267-292 (1999)
17		Colin Cooper, Alan M. Frieze: Mixing properties of the Swendsen-Wang process on classes of graphs. Random Struct. Algorithms 15(3-4): 242-261 (1999)
	1997
16		Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM 1997: 15-26
	1996
15		Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed: Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Combinatorics, Probability & Computing 5: 1-14 (1996)
14		Colin Cooper: Asymptotic Enumeration of Predicate-Junction Flowgraphs. Combinatorics, Probability & Computing 5: 215-226 (1996)
	1995
13		Colin Cooper, Alan M. Frieze: On the Connectivity of Random k-th Nearest Neighbour Graphs. Combinatorics, Probability & Computing 4: 343-362 (1995)
12		Martin Anthony, Graham Brightwell, Colin Cooper: The vapnik-chervonenkis dimension of a random graph. Discrete Mathematics 138(1-3): 43-56 (1995)
11		Colin Cooper, Alan M. Frieze: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electr. J. Comb. 2: (1995)
10		Colin Cooper: On the 2-Cyclic Property in 2-Regular Digraphs. Random Struct. Algorithms 6(4): 439-448 (1995)
	1994
9		Colin Cooper, Alan M. Frieze, Michael Molloy: Hamilton Cycles in Random Regular Digraphs. Combinatorics, Probability & Computing 3: 39-49 (1994)
8		Colin Cooper: Probabilistic analysis of two k-cluster problems. Discrete Applied Mathematics 50(1): 27-51 (1994)
7		Colin Cooper, Alan M. Frieze: Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory, Ser. B 62(1): 151-163 (1994)
6		Colin Cooper: The Threshold for Hamilton Cycles in the Square of a Random Graph. Random Struct. Algorithms 5(1): 25-32 (1994)
	1993
5		Colin Cooper: A Note on the Connectivity of 2-Regular Digraphs. Random Struct. Algorithms 4(4): 469-472 (1993)
	1992
4		Colin Cooper: On the Trickness of Sparse Random Graphs. Combinatorics, Probability & Computing 1: 303-309 (1992)
3		Colin Cooper: 1-Pancyclic Hamilton Cycles in Random Graphs. Random Struct. Algorithms 3(3): 277-288 (1992)
	1991
2		Colin Cooper: Pancyclic Hamilton cycles in random graphs. Discrete Mathematics 91(2): 141-148 (1991)
	1990
1		Colin Cooper, Alan M. Frieze: The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory, Ser. B 48(1): 117-134 (1990)

Coauthor Index

1	Mohammed Abdullah	[84] [96]
2	William Aiello	[56] [62]
3	Martin Anthony	[12]
4	Tugkan Batu	[81] [85]
5	Gürkan Bebek	[43] [46]
6	Petra Berenbrink	[43] [46] [50] [57] [65] [81] [83] [85] [92]
7	Tom Bohman	[23] [36]
8	Anthony Bonato	[56] [62]
9	Graham Brightwell	[12]
10	K. Burgin	[47]
11	Prasad Chebolu	[47]
12	Amin Coja-Oghlan	[71] [79]
13	Moez Draief	[96]
14	Martin E. Dyer	[25] [44] [54] [72] [90] [91]
15	Robert Elsässer	[83]
16	Tom Friedetzky	[43] [46] [92]
17	Tobias Friedrich	[92]
18	Alan M. Frieze	[1] [7] [9] [11] [13] [15] [16] [17] [20] [22] [23] [25] [26] [27] [28] [29] [30] [31] [33] [34] [35] [36] [37] [39] [41] [45] [47] [52] [53] [55] [59] [61] [64] [66] [67] [70] [71] [74] [77] [78] [79] [82] [87] [89] [93] [94]
19	Catherine S. Greenhill	[44] [54]
20	Andrew J. Handley	[72] [91]
21	Zengjian Hu	[50] [57] [65]
22	David Ilcinkas	[73] [88]
23	Jeannette C. M. Janssen (Jeannette Janssen)	[56] [62]
24	Ralf Klasing	[40] [42] [51] [60] [63] [73] [76] [88]
25	Adrian Kosowski	[73] [88]
26	Michael Krivelevich	[78]
27	Ryan Martin	[36]
28	Andrew R. A. McGrae	[75]
29	Kurt Mehlhorn	[16] [22]
30	Velumailum Mohanaraj	[90]
31	Michael Molloy (Michael S. O. Molloy)	[9] [15]
32	Joseph H. Nadeau	[43] [46]
33	Pawel Pralat	[56] [62] [86]
34	Volker Priebe	[16] [22]
35	Tomasz Radzik	[51] [60] [63] [66] [74] [76] [83] [84] [94]
36	Bruce A. Reed	[15] [27] [28]
37	Oliver Riordan	[27]
38	Miklós Ruszinkó	[36]
39	Süleyman Cenk Sahinalp	[43] [46]
40	Thomas Sauerwald	[83] [92]
41	Gregory B. Sorkin	[31] [55]
42	Ryuhei Uehara	[80]
43	Juan Vera	[34]
44	Michele Zito	[40] [42] [48] [58] [68] [69] [75]

Colors in the list of coauthors

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page