Efficient Algorithms and Data Structures II
Dr. Riko Jacob
4+2 lectures per week in
area III (Theoretical Computer Science)
advanced course, topic algorithms
- Time and Location:
Tuesday, 10:15-11:45, MI HS 2
Thursday, 10:15-11:45, MI 03.11.18
2 hours per week exercises accompanying the lectures
Teaching Assistant: Matthias Baumgart.
graduate students of computer science
students with computer science as minor
- ECTS: 8 points
1st and 2nd year courses
Course Efficient Algorithms and Datastructures I advantagious, but not necessary.
- Recommended for:
In-depth knowledge in topic Algorithms
The lectures deal in particular with the following topics:
- Algorithms for network flows
- String and pattern matching
- Related and Advanced Lectures:
See German version of this page.
Contents of this course are essentially covered by the following books:
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.
The design and analysis of computer algorithms.
Addison-Wesley Publishing Company: Reading (MA), 1974
- Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.
Network flows --- Theory, algorithms, and applications.
Prentice-Hall: Englewood Cliffs, NJ, 1993
- Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein.
Introduction to Algorithms.
2nd Edition, The MIT Press, Cambridge, MA, 2001.
- Volker Heun
Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
2nd Edition, Vieweg: Braunschweig-Wiesbaden, 2003
- Donald E. Knuth
The art of computer programming. Vol. 1: Fundamental algorithms.
3rd Edition, Addison-Wesley Publishing Company: Reading (MA), 1997
- Christos H. Papadimitriou, Kenneth Steiglitz.
Combinatorial optimization: Algorithms and complexity.
Prentice-Hall, Englewood Cliffs, NJ, 1982.
- Steven S. Skiena.
The Algorithm Design Manual.
Springer-Verlag, New York, 1998.
- Robert E. Tarjan.
Data Structures and Network Algorithms.
CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983.