default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Cooper
- > Home > Persons > Colin Cooper
Publications
- 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)- 2019
- [j89]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26(4): 4 (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) - [c58]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the rank of a random binary matrix. SODA 2019: 946-955 - 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 - [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
- [i13]Colin Cooper, Alan M. Frieze, Samantha Petti:
The covertime of a biased random walk on Gn, p. CoRR abs/1708.04908 (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) - [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) - [c47]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant Voting Processes on Finite Graphs. ICALP 2016: 145:1-145:13 - [i10]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant voting processes on finite graphs. CoRR abs/1604.06884 (2016) - 2015
- [j76]Colin Cooper, Alan M. Frieze:
Long Paths in Random Apollonian Networks. Internet Math. 11(4-5): 308-318 (2015) - 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) - [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) - 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) - [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) - 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) - [c35]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40 - 2011
- [j60]Colin Cooper, Alan M. Frieze:
The cover time of random geometric graphs. Random Struct. Algorithms 38(3): 324-349 (2011) - [c30]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221 - [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 - [i4]Colin Cooper, Alan M. Frieze:
Stationary distribution and cover time of random walks on random digraphs. CoRR abs/1103.4317 (2011) - 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) - [i3]Colin Cooper, Alan M. Frieze:
Component structure induced by a random walk on a random graph. CoRR abs/1005.1564 (2010) - 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) - [c22]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410 - [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 - 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) - [c17]Colin Cooper, Alan M. Frieze:
Random Walks on Random Graphs. NanoNet 2008: 95-106 - 2007
- [j46]Colin Cooper, Alan M. Frieze, Gregory B. Sorkin:
Random 2-SAT with Prescribed Literal Degrees. Algorithmica 48(3): 249-265 (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 - 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) - 2005
- [j37]Colin Cooper, Alan M. Frieze:
The Cover Time of Random Regular Graphs. SIAM J. Discret. Math. 18(4): 728-740 (2005) - [c9]Colin Cooper, Alan M. Frieze:
The cover time of two classes of random graphs. SODA 2005: 961-970 - 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) - 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) - [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) - [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) - [j21]Colin Cooper, Alan M. Frieze:
Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16(4): 369-401 (2000) - 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) - 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) - 1994
- [j11]Colin Cooper, Alan M. Frieze, Michael Molloy:
Hamilton Cycles in Random Regular Digraphs. Comb. Probab. Comput. 3: 39-49 (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) - 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) - 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)
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-08-05 21:21 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:
