Algorithms and Complexity

Algorithm Theory
Graduate Course - Winter Term 2017/18
Fabian Kuhn


Course Description

The design and analysis of algorithms is fundamental to computer science. In this course, we will study efficient algorithms for a variety of basic problems and, more generally, investigate advanced design and analysis techniques. Central topics are algorithms and data structures that go beyond what has been considered in the undergraduate course Informatik II. Basic algorithms and data structures knowledge, comparable to what is done in Informatik II, or , is therefore assumed. The topics of the course include (but are not limited to):

  • Divide and conquer: geometrical divide and conquer, fast fourier transformation
  • Randomization: median, randomized quicksort, probabilistic primality testing
  • Amortized analysis: Fibonacci heaps, union-find data structures
  • Greedy algorithms: minimum spanning trees, scheduling, matroids
  • Dynamic programming: matrix chain product problem, edit distance, longest common subsequence problem
  • Graph algorithms: network flows, combinatorial optimization problems on graphs


If you have a question to the lecture or the exercises, please use the forum instead of writing an email. Then all of us and also your colleagues see the question and can answer to it. Feel free to also use the forum to discuss anything related to the topics and organization of the lecture.


For the German tutorial group: Contrary to what I said in the exercise class you can of course drop your solution into the according box in building 51. My apologies, I was not aware of that - Philipp Schneider


  • Monday 14:15-16:00 (lecture and tutorials alternating weekly)
    • Lecture: 101-00-026
    • Exercises: 101-00-026 (German) 051-00-006 (English)
  • Thursday 10:15-12:00
    • Lecture: 101-00-026


Exercise Material

Submit your exercise solutions via one of the following options:
  • Hand in as hard copy on Thursday 10.15 am in lecture.
  • Drop hard copy into the Algorithm Theory [German/English] box in building 051.
  • Send a digital version per mail to your tutor (see above) with the subject 'AlgoTheo1718_[SheeetNumber]' (Latex preferred, Word is ok, Scans must be readable, check before).
Exercise sheet Assigned Due (10:15) Solution

Exercise Sheet 1 (Landau-Notation - Divide & Conquer) 23.10.2017 02.11.2017 Solution Sheet 1
Exercise Sheet 2 (Divide & Conquer - FFT - Greedy) 02.11.2017 16.11.2017
Exercise Sheet 3 (Dyn. Programming - Amort. Analysis) 16.11.2017 30.11.2017

Lecture Material

All slides and recordings can be found on our Webserver.
Partly, the slides are modifications of earlier versions of Prof. Dr. T. Ottmann and Prof. Dr. S. Albers.


  • Jon Kleinberg and Éva Tardos: Algorithm Design, Addison Wesley
  • Thomas H. Cormen, Charles E. Leiserson, Robert L. Rivest, and Cliford Stein: Introduction to Algorithms, MIT Press
  • Thomas Ottmann and Peter Widmayer: Algorithmen und Datenstrukturen, Spektrum Akademischer Verlag