LEA

Efficient Algorithms and Data Structures II

  • Lecturer:
    Prof. Dr. Ernst W. Mayr
  • Module: IN2004, TUMonline
  • Area:
    4+2 lectures per week in area III (Theoretical Computer Science)
    advanced course, topic algorithms
  • Time and Location:
    Tuesday, 08:30–10:00, MI HS 2
    Thursday, 08:30–10:00, 00.08.038
  • Exam:
    The new time for the final exam is 04.08.2011 from 09:00 until 12:00 .
    Please see German Webpage for details.
  • Exercises:
    2 hours per week exercises accompanying the lectures
    Teaching Assistant: Jeremias Weihmann
  • 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 Datastructures I advantagious, but not necessary.
  • Recommended for:
    In-depth knowledge in topic Algorithms
  • Related and Advanced Lectures:
    Internet algorithmics
    Randomized Algorithms
    Complexity Theory
  • Contents:
    see here.

Slides

May:May 3, 2011 May 5, 2011
May 10, 2011 May 12, 2011
May 17, 2011 May 19, 2011
May 24, 2011 May 26, 2011
May 31, 2011
June:June 7, 2011 June 9, 2011
June 16, 2011
June 21, 2011
June 28, 2011 June 30, 2011
July:July 5, 2011 July 7, 2011
July 12, 2011 July 14, 2011
July 19, 2011 July 21, 2011
July 26, 2011 July 28, 2011

And here you get everything in one file! 

References

Contents of this course are essentially covered by the following books:
  1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.
    The design and analysis of computer algorithms.
    Addison-Wesley Publishing Company: Reading (MA), 1974
  2. Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.
    Network flows --- Theory, algorithms, and applications.
    Prentice-Hall: Englewood Cliffs, NJ, 1993
  3. Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein.
    Introduction to Algorithms.
    2nd Edition, The MIT Press, Cambridge, MA, 2001.
  4. Volker Heun
    Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
    2nd Edition, Vieweg: Braunschweig-Wiesbaden, 2003
  5. Donald E. Knuth
    The art of computer programming. Vol. 1: Fundamental algorithms.
    3rd Edition, Addison-Wesley Publishing Company: Reading (MA), 1997
  6. Christos H. Papadimitriou, Kenneth Steiglitz.
    Combinatorial optimization: Algorithms and complexity.
    Prentice-Hall, Englewood Cliffs, NJ, 1982.
  7. Steven S. Skiena.
    The Algorithm Design Manual.
    Springer-Verlag, New York, 1998.
  8. Robert E. Tarjan.
    Data Structures and Network Algorithms.
    CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983.