Efficient Algorithms and Data Structures II
- Lecturer:
Prof. Dr. Harald Räcke - Module: IN2004, TUMonline
- Area:
4+2 lectures + exercises per week in area III (Theoretical Computer Science)
advanced course, topic algorithms - Time and Location:
Wednesday, 12:00–14:00, 00.13.009A
Friday, 10:00–12:00, MI HS3 - Exercises:
2 SWS tutorials per week - Audience:
graduate students of computer science
students with computer science as minor - ECTS: 8 points
- Prerequisites:
1st and 2nd year courses
Course Efficient Algorithms and Data Structures I advantagious, but not necessary. - Recommended for:
In-depth knowledge in topic algorithms
References
The content of this course is 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.
2. Auflage, The MIT Press, Cambridge, MA, 2001. - Dan Gusfield
Algorithms on Strings, Trees, and Sequences
Cambridge University Press, 1999, TUM-Bibliothek Signatur: BIO 110f 2001A 16544 . - Volker Heun
Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
2. Auflage, Vieweg: Braunschweig-Wiesbaden, 2003 - Donald E. Knuth
The art of computer programming. Vol. 1: Fundamental algorithms.
3. Auflage, 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.