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 6726 times Last modified on Tuesday, 20 February 2018 21:29
Home Structure Semester 2 Course units Randomised Algorithms and Random Graphs

Connect with us

Our partners' addresses

University of L'Aquila, Italy (UAQ)

Department of Information Engineering, Computer Science and Mathematics, via Vetoio (Coppito), 1 – 67100 L’Aquila (Italy)

University of Hamburg , Germany (UHH)

Department of Mathematics
Bundesstr. 55
20146 Hamburg - Germany

University of Côte d'Azur, Nice - France (UCA)

Laboratoire J.A.Dieudonné
Parc Valrose, France-06108 NICE Cedex 2