default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Cooper
Person information
- affiliation: King's College London
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c65]Colin Cooper, Nan Kang, Tomasz Radzik
, Ngoc Vu:
A Simple Model of Influence: Details and Variants of Dynamics. WAW 2024: 32-46- [i24]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting on Expanders. CoRR abs/2409.12615 (2024) - 2023
- [c64]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. OPODIS 2023: 10:1-10:22 - [c63]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera:
Distributed Averaging in Opinion Dynamics. PODC 2023: 211-221 - [c62]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Brief Announcement: Discrete Incremental Voting. PODC 2023: 278-281 - [c61]Colin Cooper, Nan Kang, Tomasz Radzik:
A Simple Model of Influence. WAW 2023: 164-178 - [i23]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on graphs with given degree sequence. CoRR abs/2301.08499 (2023) - [i22]Colin Cooper, Nan Kang, Tomasz Radzik:
A simple model of influence. CoRR abs/2305.07604 (2023) - [i21]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. CoRR abs/2305.15632 (2023) - 2022
- [j90]Colin Cooper, Alan M. Frieze:
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. 36(3): 2238-2257 (2022) - [c60]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik:
On early extinction and the effect of travelling in the SIR model. UAI 2022: 159-169 - [i20]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik:
Distributed Averaging in Population Protocols. CoRR abs/2211.17125 (2022) - 2021
- [c59]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A Triangle Process on Regular Graphs. IWOCA 2021: 310-323 - 2020
- [i19]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on regular graphs. CoRR abs/2012.12972 (2020)
2010 – 2019
- 2019
- [j89]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26(4): 4 (2019) - [j88]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254: 56-79 (2019) - [j87]Colin Cooper, Alan M. Frieze, Wesley Pegden:
Minors of a random binary matroid. Random Struct. Algorithms 55(4): 865-880 (2019) - [j86]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the Cover Time of Dense Graphs. SIAM J. Discret. Math. 33(3): 1374-1389 (2019) - [j85]Colin Cooper, Tomasz Radzik, Nicolas Rivera:
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. 6(3): 16:1-16:24 (2019) - [c58]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the rank of a random binary matrix. SODA 2019: 946-955 - [i18]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Triangle-creation processes on cubic graphs. CoRR abs/1905.04490 (2019) - 2018
- [j84]Colin Cooper, Nicolás Rivera:
Threshold behaviour of discordant voting on the complete graph. J. Discrete Algorithms 50: 10-22 (2018) - [j83]Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. Random Struct. Algorithms 53(4): 561-585 (2018) - [j82]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera:
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32(4): 2398-2420 (2018) - [c57]Colin Cooper, Alan M. Frieze, Samantha Petti:
The cover time of a biased random walk on Gn, p. ANALCO 2018: 158-167 - [c56]Colin Cooper, Alan M. Frieze, Tony Johansson:
The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA 2018: 16:1-16:12 - [c55]Colin Cooper, Ngoc Vu:
An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data. WAW 2018: 145-169 - [i17]Colin Cooper, Alan M. Frieze, Tony Johansson:
The cover time of a biased random walk on a random cubic graph. CoRR abs/1801.00760 (2018) - [i16]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the cover time of dense graphs. CoRR abs/1810.04772 (2018) - 2017
- [j81]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255: 336-351 (2017) - [c54]David Kohan Marzagão, Nicolas Rivera, Colin Cooper, Peter McBurney, Kathleen Steinhöfel:
Multi-Agent Flag Coordination Games. AAMAS 2017: 1442-1450 - [c53]Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. PODC 2017: 451-453 - [c52]Colin Cooper, Tomasz Radzik, Nicolas Rivera:
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA 2017: 305-312 - [c51]Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Plurality Consensus in Regular Expanders. DISC 2017: 13:1-13:16 - [i15]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. CoRR abs/1701.03856 (2017) - [i14]Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR abs/1705.01146 (2017) - [i13]Colin Cooper, Alan M. Frieze, Samantha Petti:
The covertime of a biased random walk on Gn, p. CoRR abs/1708.04908 (2017) - [i12]Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. CoRR abs/1712.03389 (2017) - 2016
- [j80]Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer:
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25(1): 89-107 (2016) - [j79]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. 12(4): 221-238 (2016) - [j78]Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat:
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83(3): 251-265 (2016) - [j77]Colin Cooper, Alan M. Frieze:
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. 30(1): 166-205 (2016) - [c50]Patrick Veenstra, Colin Cooper, Steve Phelps:
The use of Biweight Mid Correlation to improve graph based portfolio construction. CEEC 2016: 101-106 - [c49]Patrick Veenstra, Colin Cooper, Steve Phelps:
Spectral clustering using the kNN-MST similarity graph. CEEC 2016: 222-227 - [c48]Colin Cooper, Nicolas Rivera:
The Linear Voting Model. ICALP 2016: 144:1-144:12 - [c47]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant Voting Processes on Finite Graphs. ICALP 2016: 145:1-145:13 - [c46]Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC 2016: 461-467 - [i11]Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The coalescing-branching random walk on expanders and the dual epidemic process. CoRR abs/1602.05768 (2016) - [i10]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant voting processes on finite graphs. CoRR abs/1604.06884 (2016) - [i9]Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast plurality consensus in regular expanders. CoRR abs/1605.08403 (2016) - 2015
- [j76]Colin Cooper, Alan M. Frieze:
Long Paths in Random Apollonian Networks. Internet Math. 11(4-5): 308-318 (2015) - [j75]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81(1): 159-185 (2015) - [j74]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Struct. Algorithms 46(1): 36-54 (2015) - [j73]Fei Gao, Katarzyna Musial, Colin Cooper, Sophia Tsoka:
Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics. Sci. Program. 2015: 172879:1-172879:13 (2015) - [c45]Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. IWOCA 2015: 1-12 - [c44]Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Coalescing Walks on Rotor-Router Systems. SIROCCO 2015: 444-458 - [c43]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing Self-stabilizing Oscillators in Population Protocols. SSS 2015: 187-200 - [c42]Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Consensus for Voting on General Expander Graphs. DISC 2015: 248-262 - 2014
- [j72]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. 10(1-2): 116-136 (2014) - [j71]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. Internet Math. 10(1-2): 137-161 (2014) - [j70]Colin Cooper, Alan M. Frieze, Eyal Lubetzky:
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45(4): 627-674 (2014) - [j69]Colin Cooper, Alan M. Frieze, Ryuhei Uehara:
The height of random k-trees and related branching processes. Random Struct. Algorithms 45(4): 675-702 (2014) - [j68]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
Estimating network parameters using random walks. Soc. Netw. Anal. Min. 4(1): 168 (2014) - [c41]Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. ICALP (2) 2014: 435-446 - [c40]Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos:
Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) 2014: 811-816 - [i8]Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. CoRR abs/1404.7479 (2014) - 2013
- [j67]Colin Cooper, Alan M. Frieze:
Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms 42(2): 135-158 (2013) - [j66]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27(4): 1748-1758 (2013) - [j65]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509: 51-69 (2013) - [c39]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW 2013: 130-143 - 2012
- [j64]Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze:
Cover time of a random graph with given degree sequence. Discret. Math. 312(21): 3146-3163 (2012) - [j63]Colin Cooper, Alan M. Frieze:
Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory B 102(2): 329-362 (2012) - [j62]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-bins processes. J. Discrete Algorithms 14: 21-28 (2012) - [c38]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
Estimating network parameters using random walks. CASoN 2012: 33-40 - [c37]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC 2012: 29-36 - [c36]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. PODC 2012: 47-56 - [c35]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40 - [c34]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW 2012: 165-178 - [c33]Colin Cooper, Tomasz Radzik, Yiannis Siantos:
A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) 2012: 1007-1016 - [i7]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time. CoRR abs/1204.1939 (2012) - [i6]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. CoRR abs/1204.4106 (2012) - 2011
- [j61]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011) - [j60]Colin Cooper, Alan M. Frieze:
The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011) - [j59]Colin Cooper, Pawel Pralat:
Scale-free graphs of increasing degree. Random Struct. Algorithms 38(4): 396-421 (2011) - [c32]Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM 2011: 351-364 - [c31]Colin Cooper:
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. SIROCCO 2011: 1-14 - [c30]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221 - [c29]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439 - [c28]Colin Cooper, Martin E. Dyer, Andrew J. Handley:
Networks of random cycles. SODA 2011: 933-944 - [c27]Colin Cooper, Alan M. Frieze:
Component structure of the vacant set induced by a random walk on a random graph. SODA 2011: 1211-1221 - [i5]Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj:
On the Imitation Strategy for Games on Graphs. CoRR abs/1102.3879 (2011) - [i4]Colin Cooper, Alan M. Frieze:
Stationary distribution and cover time of random walks on random digraphs. CoRR abs/1103.4317 (2011) - 2010
- [j58]Colin Cooper, Ryuhei Uehara:
Scale Free Properties of Random k-Trees. Math. Comput. Sci. 3(4): 489-496 (2010) - [j57]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. 23(4): 2000-2034 (2010) - [j56]Colin Cooper, Alan M. Frieze, Michael Krivelevich:
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 24(2): 558-569 (2010) - [j55]Colin Cooper, Alan M. Frieze:
Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discret. Math. 24(3): 1162-1176 (2010) - [j54]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) - [c26]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-Bins Processes. IWOCA 2010: 314-325 - [c25]Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik:
The Cover Time of Cartesian Product Graphs. IWOCA 2010: 377-389 - [c24]Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 - [i3]Colin Cooper, Alan M. Frieze:
Component structure induced by a random walk on a random graph. CoRR abs/1005.1564 (2010) - [i2]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-Bins Processes. CoRR abs/1005.2616 (2010)
2000 – 2009
- 2009
- [j53]Colin Cooper, Michele Zito:
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. Discret. Appl. Math. 157(9): 2010-2014 (2009) - [j52]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) - [j51]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. 23(4): 1738-1761 (2009) - [j50]Petra Berenbrink, Colin Cooper, Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks. Theor. Comput. Sci. 410(27-29): 2549-2561 (2009) - [c23]Colin Cooper, Andrew R. A. McGrae, Michele Zito:
Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT 2009: 74-83 - [c22]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410 - [c21]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 - [c20]Colin Cooper, Martin E. Dyer, Andrew J. Handley:
The flip markov chain and a randomising P2P protocol. PODC 2009: 141-150 - [c19]Colin Cooper, Alan M. Frieze:
The cover time of random geometric graphs. SODA 2009: 48-57 - [c18]Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
An efficient sparse regularity concept. SODA 2009: 207-216 - [r1]Colin Cooper, Michele Zito:
Realistic Data for Testing Rule Mining Algorithms. Encyclopedia of Data Warehousing and Mining 2009: 1653-1658 - 2008
- [j49]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat:
A Spatial Web Graph Model with Local Influence Regions. Internet Math. 5(1): 175-196 (2008) - [j48]Colin Cooper, Alan M. Frieze:
The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008) - [j47]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) - [c17]Colin Cooper, Alan M. Frieze:
Random Walks on Random Graphs. NanoNet 2008: 95-106 - [c16]Colin Cooper, Ralf Klasing, Tomasz Radzik:
Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32 - 2007
- [j46]Colin Cooper, Alan M. Frieze, Gregory B. Sorkin:
Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (2007) - [j45]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16(4): 557-593 (2007) - [j44]Colin Cooper, Alan M. Frieze:
The cover time of the preferential attachment graph. J. Comb. Theory B 97(2): 269-290 (2007) - [j43]Colin Cooper, Alan M. Frieze:
The cover time of sparse random graphs. Random Struct. Algorithms 30(1-2): 1-16 (2007) - [c15]Colin Cooper, Alan M. Frieze:
The Cover Time of Random Digraphs. APPROX-RANDOM 2007: 422-435 - [c14]Colin Cooper, Michele Zito:
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD 2007: 398-405 - [c13]Petra Berenbrink, Colin Cooper, Zengjian Hu:
Energy efficient randomised communication in unknown AdHoc networks. SPAA 2007: 250-259 - [c12]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 - 2006
- [j42]Colin Cooper:
Distribution of Vertex Degree in Web-Graphs. Comb. Probab. Comput. 15(5): 637-661 (2006) - [j41]K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze:
Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006) - [j40]Michele Zito, Colin Cooper:
Dominating sets of random recursive trees. Electron. Notes Discret. Math. 27: 107-108 (2006) - [j39]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) - [c11]Colin Cooper, Ralf Klasing, Tomasz Radzik:
Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332 - [i1]Petra Berenbrink, Colin Cooper, Zengjian Hu:
Energy Efficient Randomized Communication in Unknown AdHoc Networks. CoRR abs/cs/0612074 (2006) - 2005
- [j38]Colin Cooper, Ralf Klasing, Michele Zito:
Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Math. 2(3): 275-300 (2005) - [j37]Colin Cooper, Alan M. Frieze:
The Cover Time of Random Regular Graphs. SIAM J. Discret. Math. 18(4): 728-740 (2005) - [c10]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 - [c9]Colin Cooper, Alan M. Frieze:
The cover time of two classes of random graphs. SODA 2005: 961-970 - [c8]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988 - 2004
- [j36]Colin Cooper, Alan M. Frieze:
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Comb. Probab. Comput. 13(3): 319-337 (2004) - [j35]Colin Cooper:
The cores of random hypergraphs with a given degree sequence. Random Struct. Algorithms 25(4): 353-375 (2004) - [c7]Colin Cooper, Ralf Klasing, Michele Zito:
Dominating Sets in Web Graphs. WAW 2004: 31-43 - 2003
- [j34]Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó:
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003) - [j33]Colin Cooper, Alan M. Frieze:
Crawling on Simple Models of Web Graphs. Internet Math. 1(1): 57-90 (2003) - [j32]Colin Cooper, Alan M. Frieze, Juan Vera:
Random Deletion in a Scale-Free Random Graph Process. Internet Math. 1(4): 463-483 (2003) - [j31]Colin Cooper, Alan M. Frieze:
A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003) - [c6]Colin Cooper, Alan M. Frieze:
The cover time of sparse random graphs. SODA 2003: 140-147 - 2002
- [j30]Colin Cooper, Alan M. Frieze:
Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. Comb. Probab. Comput. 11(2): 129-133 (2002) - [j29]Colin Cooper, Alan M. Frieze, Bruce A. Reed:
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. Comb. Probab. Comput. 11(3): 249-261 (2002) - [j28]Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11(4): 323-341 (2002) - [c5]Colin Cooper:
Classifying Special Interest Groups in Web Graphs. RANDOM 2002: 263-276 - [c4]Colin Cooper, Alan M. Frieze, Gregory B. Sorkin:
A note on random 2-SAT with prescribed literal degrees. SODA 2002: 316-320 - [c3]Colin Cooper, Alan M. Frieze:
Crawling on web graphs. STOC 2002: 419-427 - 2001
- [j27]Colin Cooper, Martin E. Dyer, Alan M. Frieze:
On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001) - [j26]Colin Cooper:
The union of two random permutations does not have a directed Hamilton cycle. Random Struct. Algorithms 18(1): 95-98 (2001) - [c2]Colin Cooper, Alan M. Frieze:
A General Model of Undirected Web Graphs. ESA 2001: 500-511 - 2000
- [j25]Tom Bohman, Colin Cooper, Alan M. Frieze:
Min-Wise Independent Linear Permutations. Electron. J. Comb. 7 (2000) - [j24]Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze:
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. J. Graph Theory 34(1): 42-59 (2000) - [j23]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) - [j22]Colin Cooper:
On the rank of random matrices. Random Struct. Algorithms 16(2): 209-232 (2000) - [j21]Colin Cooper, Alan M. Frieze:
Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000) - [j20]Colin Cooper:
On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms 17(3-4): 197-212 (2000)
1990 – 1999
- 1999
- [j19]Colin Cooper:
Asymptotics for dependent sums of random vectors. Random Struct. Algorithms 14(3): 267-292 (1999) - [j18]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
- [c1]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
- [j17]Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed:
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. Comb. Probab. Comput. 5: 1-14 (1996) - [j16]Colin Cooper:
Asymptotic Enumeration of Predicate-Junction Flowgraphs. Comb. Probab. Comput. 5: 215-226 (1996) - 1995
- [j15]Colin Cooper, Alan M. Frieze:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. Electron. J. Comb. 2 (1995) - [j14]Colin Cooper, Alan M. Frieze:
On the Connectivity of Random k-th Nearest Neighbour Graphs. Comb. Probab. Comput. 4: 343-362 (1995) - [j13]Martin Anthony, Graham R. Brightwell, Colin Cooper:
The vapnik-chervonenkis dimension of a random graph. Discret. Math. 138(1-3): 43-56 (1995) - [j12]Colin Cooper:
On the 2-Cyclic Property in 2-Regular Digraphs. Random Struct. Algorithms 6(4): 439-448 (1995) - 1994
- [j11]Colin Cooper, Alan M. Frieze, Michael Molloy:
Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. 3: 39-49 (1994) - [j10]Colin Cooper:
Probabilistic analysis of two k-cluster problems. Discret. Appl. Math. 50(1): 27-51 (1994) - [j9]Colin Cooper, Alan M. Frieze:
Hamilton Cycles in a Class of Random Directed Graphs. J. Comb. Theory B 62(1): 151-163 (1994) - [j8]Colin Cooper:
The Threshold for Hamilton Cycles in the Square of a Random Graph. Random Struct. Algorithms 5(1): 25-32 (1994) - 1993
- [j7]Colin Cooper:
A Note on the Connectivity of 2-Regular Digraphs. Random Struct. Algorithms 4(4): 469-472 (1993) - 1992
- [j6]Colin Cooper:
On the Trickness of Sparse Random Graphs. Comb. Probab. Comput. 1: 303-309 (1992) - [j5]Colin Cooper:
1-Pancyclic Hamilton Cycles in Random Graphs. Random Struct. Algorithms 3(3): 277-288 (1992) - 1991
- [j4]Colin Cooper:
Pancyclic Hamilton cycles in random graphs. Discret. Math. 91(2): 141-148 (1991) - 1990
- [j3]Colin Cooper, Alan M. Frieze:
The limiting probability that alpha-in, ß-out is strongly connected. J. Comb. Theory B 48(1): 117-134 (1990)
1980 – 1989
- 1989
- [j2]Colin Cooper, Alan M. Frieze:
On the number of hamilton cycles in a random graph. J. Graph Theory 13(6): 719-735 (1989) - 1988
- [j1]Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze:
Probabilistic Analysis of a Relaxation for the k-Median Problem. Math. Oper. Res. 13(1): 1-31 (1988)
Coauthor Index
[j90] [j89] [j87] [j86] [c58] [j82] [c57] [c56] [i17] [i16] [i13] [j80] [j78] [j77] [c47] [i10] [j76] [j72] [j70] [j69] [j67] [j65] [j64] [j63] [c35] [j60] [c30] [c27] [i4] [j57] [j56] [j55] [i3] [j52] [j51] [c22] [c19] [c18] [j48] [c17] [j46] [j44] [j43] [c15] [j41] [j37] [c9] [j36] [j34] [j33] [j32] [j31] [c6] [j30] [j29] [j28] [c4] [c3] [j27] [c2] [j25] [j24] [j23] [j21] [j18] [c1] [j17] [j15] [j14] [j11] [j9] [j3] [j2] [j1]
Nicolas Rivera
aka: Nicolás Rivera
aka: Nicolás Rivera
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
