King's College London

Research portal

Research Outputs

  1. 2018
  2. The cover time of a biased random walk on a random cubic graph

    Cooper, C., Frieze, A. & Johansson, T., 1 Jun 2018, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 110. 16

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  3. An experimental study of the k-MXT algorithm with applications to clustering geo-tagged data

    Cooper, C. & Vu, N., 1 Jan 2018, Algorithms and Models for the Web Graph - 15th International Workshop, WAW 2018, Proceedings. Springer Verlag, p. 145-169 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10836 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  4. The cover time of a biased random walk on Gn,p

    Cooper, C., Frieze, A. & Petti, S., 1 Jan 2018, 2018 Proceedings of the 15th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018. Society for Industrial and Applied Mathematics Publications, Vol. 2018-January. p. 158-167 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  5. 2017
  6. Brief announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time

    Bilke, A., Cooper, C., Elsässer, R. & Radzik, T., 26 Jul 2017, PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, Vol. Part F129314. p. 451-453 3 p.

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  7. Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs

    Cooper, C. D., Radzik, T. & Rivera Aburto, N. A., 24 Jul 2017, Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. ACM New York, NY, USA, p. 305-312 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  8. Spectral clustering using the kNN-MST similarity graph

    Veenstra, P., Cooper, C. & Phelps, S., 27 Jan 2017, 2016 8th Computer Science and Electronic Engineering Conference, CEEC 2016 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 222-227 6 p. 7835917

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  9. The use of biweight mid correlation to improve graph based portfolio construction

    Veenstra, P., Cooper, C. & Phelps, S., 27 Jan 2017, 2016 8th Computer Science and Electronic Engineering Conference, CEEC 2016 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 101-106 6 p. 7835896

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  10. Fast plurality consensus in regular expanders

    Cooper, C., Radzik, T., Rivera, N. & Shiraga, T., 2017, 31st International Symposium on Distributed Computing, DISC 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 91. p. 1-16

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  11. Multi-Agent Flag Coordination Games

    Kohan Marzagao, D., Rivera Aburto, N. A., Cooper, C. D., McBurney, P. J. & Steinhofel, K. K., 2017, AAMAS '17 Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 1442-1450 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  12. 2016
  13. Discordant voting processes on finite graphs

    Cooper, C., Dyer, M., Frieze, A. & Rivera, N., 1 Aug 2016, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 55. 145

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  14. The linear voting model

    Cooper, C. & Rivera, N., 1 Aug 2016, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 55. 144

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  15. Speeding up cover time of sparse graphs using local knowledge

    Abdullah, M. A., Cooper, C. & Draief, M., 20 Feb 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer‐Verlag Berlin Heidelberg, Vol. 9538. p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9538).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  16. The coalescing-branching random walk on expanders and the dual epidemic process

    Cooper, C., Radzik, T. & Rivera Aburto, N., 2016, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM New York, NY, USA, Vol. 25-29-July-2016. p. 461-467 7 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  17. 2015
  18. Coalescing walks on rotor-router systems

    Cooper, C., Radzik, T., Rivera, N. & Shiraga, T., 20 Nov 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer-Verlag Berlin Heidelberg, Vol. 9439. p. 444-458 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9439).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  19. Constructing self-stabilizing oscillators in population protocols

    Cooper, C., Lamani, A., Viglietta, G., Yamashita, M. & Yamauchi, Y., 4 Aug 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer-Verlag Berlin Heidelberg, Vol. 9212. p. 187-200 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9212).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  20. Science forum: RIPOSTE: a framework for improving the design and analysis of laboratory-based research.

    Masca, N. G. D., Hensor, E. M. A., Cornelius, V. R., Buffa, F. M., Marriott, H. M., Eales, J. M., Messenger, M. P., Anderson, A. E., Boot, C., Bunce, C., Goldin, R. D., Harris, J., Hinchliffe, R. F., Junaid, H., Kingston, S., Martin-Ruiz, C., Nelson, C. P., Peacock, J., Seed, P. T., Shinkins, B. & 4 others, Staples, K. J., Toombs, J., Wright, A. K. A. & Teare, M. D., 2015, eLife. p. e05519 (eLife; vol. 4).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  21. 2014
  22. Random walks in recommender systems: exact computation and simulations

    Cooper, C., Lee, S-H., Radzik, T. & Siantos, Y., 2014, 23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume. Chung, C-W., Broder, A. Z., Shim, K. & Suel, T. (eds.). ACM New York, NY, USA, p. 811-816 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  23. 2013
  24. Fast Low-Cost Estimation of Network Properties Using Random Walks

    Cooper, C., Radzik, T. & Siantos, Y., 2013, Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings. Bonato, A., Mitzenmacher, M. & Pralat, P. (eds.). Springer International Publishing, p. 130-143 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8305 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  25. 2012
  26. A fast algorithm to find all high degree vertices in graphs with a power law degree sequence

    Cooper, C., Radzik, T. & Siantos, Y., 2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7323 LNCS. p. 165-178 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7323 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  27. A fast algorithm to find all high degree vertices in power law graphs

    Cooper, C., Radzik, T. & Siantos, Y., 2012, Proceedings of the 21st World Wide Web Conference, WWW 2012, Lyon, France, April 16-20, 2012 (Companion Volume). Mille, A., Gandon, F. L., Misselis, J., Rabinovich, M. & Staab, S. (eds.). ACM, p. 1007-1016 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  28. Coalescing random walks and voting on graphs

    Cooper, C., Elsässer, R., Ono, H. & Radzik, T., 2012, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. p. 47-55 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  29. Estimating network parameters using random walks

    Cooper, C., Radzik, T. & Siantos, Y., 2012, Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012. p. 33-40 8 p. 6412374

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  30. 2011
  31. The Cover Time of Cartesian Product Graphs

    Abdullah, M., Cooper, C. & Radzik, T., 2011, Unknown. BERLIN: Springer, Vol. 6460 LNCS. p. 377 - 389 13 p. (COMBINATORIAL ALGORITHMS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  32. The Cover Times of Random Walks on Hypergraphs

    Cooper, C., Frieze, A. & Radzik, T., 2011, Structural Information and Communication Complexity: 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011. Proceedings. Kosowski, A. & Yamashita, M. (eds.). BERLIN: Springer, p. 210-221 12 p. (Lecture Notes in Computer Science; vol. 6796).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  33. 2010
  34. Oxidative Stress and redox signalling in cardiac remodelling

    Zhang, M., Sirker, A. & Shah, A., 2010, Oxidative Stress in Applied Basic Research and Clinical Practice: Studies on Cardiovascular Disorders. Sauer, H., Shah, AM. & Laurindo, FRM. (eds.). Springer Humana, p. 405 - 424 20 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  35. Speeding up random walks with neighborhood exploration

    Berenbrink, P., Cooper, C., Elsaesser, R., Radzik, T. & Sauerwald, T., 2010, PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS. PHILADELPHIA: SIAM, p. 1422-1435 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  36. Speeding up random walks with neighbourhood exploration

    Berenbrink, P., Cooper, C., Elsasser, R., Radzik, T. & Sauerwald, T., 2010, Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms. Philadelphia: Society for Industrial and Applied Mathematics, p. 1422-1435 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  37. 2009
  38. The cover time of random geometric graphs

    Cooper, C. & Frieze, A. M., 4 Jan 2009, SODA '09: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Mathieu, C. (ed.). N/A ed. Philadelphia: Society for Industrial and Applied Mathematics, Vol. N/A. p. 48-57 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  39. An efficient sparse regularity concept

    Coja-Oghlan, A., Cooper, C. & Frieze, A. M., 2009, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Mathieu, C. (ed.). p. 207-216 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  40. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

    Cooper, C., Ilcinkas, D., Klasiing, R. & Kosowski, A., 2009, 36th International Colloquium on Automata, Languages and Programming. PART 2 ed. BERLIN: Springer, Vol. 5556 LNCS. p. 411 - 422 12 p. (AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  41. Martingales on Trees and the Empire Chromatic Number of Random Trees

    Cooper, C., McGrae, A. R. A. & Zito, M., 2009, 17th International Symposium on Fundamentals of Computation Theory. BERLIN: Springer, Vol. 5699 LNCS. p. 74 - 83 10 p. (FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  42. Multiple Random Walks and Interacting Particle Systems

    Cooper, C., Frieze, A. & Radzik, T., 2009, Automata, Languages and Programming, 36th International Colloquium , ICALP 2009. PART 2 ed. BERLIN: Springer, Vol. 5556 LNCS. p. 399 - 410 12 p. (AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  43. Random Walks on Random Graphs

    Cooper, C. & Frieze, A., 2009, Unknown. NEW YORK: Springer, p. 95 - 106 12 p. (NANO-NET).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  44. The Flip Markov Chain and a Randomising P2P Protocol

    Cooper, C., Dyer, M. & Handley, A. J., 2009, 28th Annual ACM Symposium on Principles of Distributed Computing. NEW YORK: ASSOC COMPUTING MACHINERY, p. 141 - 150 10 p. (PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  45. The cover time of random geometric graphs

    Cooper, C. & Frieze, A., 2009, 20th Annual ACM-SIAM Symposium on Discrete Algorithms. PHILADELPHIA: SIAM, p. 48 - 57 10 p. (PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  46. 2008
  47. Locating and Repairing Faults in a Network with Mobile Agents

    Cooper, C., Klasing, R. & Radzik, T., 2008, Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings. Springer Finance, Vol. 5058. p. 20-32 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  48. Locating and repairing faults in a network with mobile agents

    Cooper, C., Klasing, R. & Radzik, T., 2008, Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Proceedings, Springer LNCS vol. 5058.. BERLIN: Springer, Vol. 5058 LNCS. p. 20 - 32 13 p. (International Colloquium on Structural Information and Communication Complexity - SIROCCO).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  49. Realistic Data for Testing Rule Mining Algorithms

    Cooper, C. & Zito, M., 2008, Encyclopedia of Data Warehousing and Mining. Wang, J. (ed.). IGI Global, p. 1653 - 1658 6 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  50. 2007
  51. Energy efficient randomised communication in unknown AdHoc networks

    Berenbrink, P., Cooper, C. & Hu, Z., 2007, SPAA 2007: Proceedings of the 19th Annual ACM Symposium. Gibbons, P. B. & Scheideler, C. (eds.). p. 250-259 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  52. Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases

    Cooper, C. & Zito, M., 2007, Knowledge Discovery in Databases: PKDD 2007, 11th European. Springer, LNCS 4702, p. 398-405 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  53. The cover time of random digraphs

    Cooper, C. & Frieze, A., 2007, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. BERLIN: Springer, Vol. 4627 LNCS. p. 422 - 435 14 p. (LECTURE NOTES IN COMPUTER SCIENCE).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  54. 2006
  55. Searching for black-hole faults in a network using multiple agents

    Cooper, C., Klasing, R. & Radzik, T., 2006, Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, Springer Lecture Notes in Computer Science, vol 4305. BERLIN: Springer, Vol. 4305. p. 320 - 332 13 p. (LECTURE NOTES IN COMPUTER SCIENCE).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  56. 2005
  57. Sampling Regular Graphs and A Peer to Peer Network

    Cooper, C., Dyer, M. & Greenhill, C., 2005, 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). Unknown Publisher, p. 980 - 988 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  58. The Cover Time of Two Classes of Random Graphs

    Cooper, C. & Frieze, A., 2005, 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). Unknown Publisher, p. 961 - 970 10 p. (16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  59. 2004
  60. Dominating sets in web graphs

    Cooper, C., Klasing, R. & Zito, M., 2004, 3rd International Workshop on Algorithms and Models for the Web-Graph. BERLIN: Springer, p. 31 - 43 13 p. (LECTURE NOTES IN COMPUTER SCIENCE).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  61. 2002
  62. A Note on Random 2SAT With Prescribed Literal Degrees

    Cooper, C., Frieze, A. & Sorkin, G., 2002, ACM/SIAM Symposium on Discrete Algorithms (SODA 2005). Unknown Publisher, p. 316 - 320 5 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  63. Classifying special interest groups in web graphs

    Cooper, C., 2002, Randomization and approximation techniques in computer science. Unknown Publisher, p. 263 - -275 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  64. Crawling on web graphs

    Cooper, C. & Frieze, A., 2002, Proceedings of the 34th ACM Symposium on the Theory of Computing (STOC 2002). ACM, p. 419 - 427 9 p. (ACM Symposium on the Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  65. 2001
  66. A general model of undirected web graphs

    Cooper, C. & Frieze, A. M., 2001, Algorithms---ESA 2001 Aarhus. Unknown Publisher, p. 500 - -511 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

Export:RIS BibTex Word PDF - will at most contain 500 items

Refine results Clear filters

Language

Language

Publication year

Publication year

Full text

Full text

Meeting and poster abstracts

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454