The results of the midterm exam are available! (check the Personal Status page)
The inspection of works will take place in room 415 of E1 3, from 12:00 to 13:00 on Friday, the 11th of January.
The midterm exam will take place in Günter-Hotz lecture hall (E2 2), at 16 o'clock on December 12th.
Please use mailboxes 069 and 080 for submitting solutions outside the lecture hall. See details.
A discussion forum is now available!
Time & Date
- We 08:30-10:00, Lecture Hall 002, Building E1 3
- Th 12:15-13:45, Lecture Hall 002, Building E1 3
The detailed information on participation in this lecture can be found under participation rules.
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).
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)