( en | de | ru )

 

Disambiguation of "Cooper, Colin"

Author of the publication

copydeleteadd this publication to your clipboard
The Cover Time of Random Digraphs.

, and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 422-435. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maité Colin

Samuel Colin

Cooper Baker

Jason Cooper

Simon Cooper

 

Other publications of authors with the same name

On Markov Chains for Randomly H-Coloring a Graph., , and . J. Algorithms, 39 (1): 117-134 (2001)Triangle-creation processes on cubic graphs., , and . CoRR, (2019)The Cover Times of Random Walks on Hypergraphs., , and . SIROCCO, volume 6796 of Lecture Notes in Computer Science, page 210-221. Springer, (2011)Coalescing Walks on Rotor-Router Systems., , , and . SIROCCO, volume 9439 of Lecture Notes in Computer Science, page 444-458. Springer, (2015)Classifying Special Interest Groups in Web Graphs.. RANDOM, volume 2483 of Lecture Notes in Computer Science, page 263-276. Springer, (2002)The use of Biweight Mid Correlation to improve graph based portfolio construction., , and . CEEC, page 101-106. IEEE, (2016)An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data., and . WAW, volume 10836 of Lecture Notes in Computer Science, page 145-169. Springer, (2018)Random 2-SAT with Prescribed Literal Degrees., , and . Algorithmica, 48 (3): 249-265 (2007)The cover time of sparse random graphs., and . Random Struct. Algorithms, 30 (1-2): 1-16 (2007)Mixing properties of the Swendsen-Wang process on classes of graphs., and . Random Struct. Algorithms, 15 (3-4): 242-261 (1999)