Algorithms and Data Structures
WS 2013/2014

Raimund Seidel
E 1 3, Room 409
+49 (681) 302-4513
rseidel at
Mo, Fr 11:00-12:00

The course covers the design and analysis of efficient algorithms and data structures. Specific topics include: data structures (e.g. rank-pairing heaps, hashing, geometric searching); graph algorithms (e.g. network flow, matchings); analysis techniques (amortized, randomized, worst case); specific and generic methods for optimization and for dealing with hard problems; geometric algorithms (triangulation, convex hull, sweep).
Time & Date
We 16:15-17:45 Lecture Hall 002, Building E1 3 Fr 8:30-10:00 Lecture Hall 002, Building E1 3
Raimund Seidel
Email: rseidel at
Office hours: Mo, Fr 11:00-12:00
László Kozma
Email: kozma at
Office hours: blank

Victor Alvarez
Email: alvarez at
Office hours: blank

Your final grade will be determined by your performance on a mid-term exam (40%) and a final exam (60%). Alternatively, the grade can be determined by your performance on the repeat exam only. In order to be admitted to the midterm exam you have to achieve at least 50% of the possible points on the homework assignments. To be admitted to the final exam you must have passed the midterm and also have achieved at least 50% of the points on the homeworks in the second half of the course. In order to be admitted to the repeat exam you must have achieved at least 50% of all possible homework points. There will be about 10 homework assignments.
Midterm: Dec. 14, 2012, 15-18
Endterm: Feb. 15, 2013, 14-17
Reexam: April 11, 2013, 14-17
There are many books on the design and analysis of algorithms and data structures. Here is a small selection. The course will not follow any particular book.
K. Mehlhorn, Data Structures and Algorithms, Vols. 1-3, Springer Verlag, 1984
K. Mehlhorn and S. Näher, LEDA, Cambridge Univ. Press, 1999
T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms - Second Edition, McGraw-Hill, 2001 (ISBN: 0262531968)
M. Dietzfelbinger, K. Mehlhorn und P. Sanders, Algorithmen und Datenstrukturen -- Die Grundwerkzeuge, Springer, 2014 (ISBN: 978-3-642-05471-6)
J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005 (ISBN: 0-321-29535-8)