icon forward
This is our 2020 curriculum. For the new structure, valid as of the 2021 intake, click here

Randomised Algorithms and Random Graphs

Additional Info

  • ECTS credits: 6
  • University: Hamburg University of Technology
  • Semester: 2
  • Objectives:

     

    The course is intended to develop an understanding of the fundamental concepts in randomised algorithms and the theory of random graphs. The primary focus is on the ability to determine average or typical behaviour of algorithms and structures, and to analyze how this behaviour evolves when the underlying random distribution is changing.

  • Topics:

     

    Randomised search, random walks, text search with fingerprinting. parallel and distributed algorithms, online algorithms. Typical properties of random graphs, first and second moment method, tail bounds, thresholds and phase transitions, probabilistic method, models for complex networks.

Read 7074 times Last modified on Tuesday, 20 February 2018 21:29
Home Structure for 2020 intake Course units Randomised Algorithms and Random Graphs