Lectures Fundamentals of Algorithms and Data Structures (GAD) Efficient Algorithms and
Data Structures II Network Algorithms Computational Biology I Proseminar Algorithms in Computer Graphics Seminar Computational Geometry Lab Course Discrete Optimization Courses for PhD Students Oberseminar

Efficient Algorithms and Data Structures II

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module: IN2004
• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)
  advanced course, topic algorithms
• Time and Location:
  Monday, 08:30-10:00, MI 00.08.038
  Friday, 08:30-10:00, MI 00.08.038
• Exercises:
  2 hours per week exercises accompanying the lectures
  Teaching Assistant: Matthias Baumgart
• Course Certificate:
  To get a course certificate students must get at least 40% on the homework assignments and pass the final exam.
• 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
• Contents
• Related and Advanced Lectures:
  Internet algorithmics
  Randomized Algorithms
  Complexity Theory
  
• Slides:
  

  April 14 thru July 18, 2008

• Lecture Notes: see Slides
• 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.
• Office Hours:
  look here