Computer Science Department - Technische Universität München Chair for Efficient Algorithms

Efficient Algorithms and Datastructures II
SS 03

• Lecturer:
  Prof. Dr. Ernst W. Mayr

• Area:
  4 lectures per week in area III (Theoretical Computer Science)
  advanced course, topic algorithms

• Time and Place:
  

  Wednesday	10:15 - 12:00	MI 00.04.011
  Friday	08:30 - 10:00	MI 00.04.011

• Exercises: (Date changed!)
  2 hours per week exercises accompanying the lectures
  Thursday, 8:30-10:00, MI 00.06.011 (Lecture hall 3)
  Teaching Assistant: Jens Ernst, Jan Griebsch
  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

• 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:
  see table of contents (.pdf)

• Related and Advanced Lectures:
  

• Lecture Notes:
  Not available.

• References:
  

  Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:

  The design and analysis of computer algorithms
  Addison-Wesley Publishing Company, Reading, MA, 1976

  Robert Endre Tarjan:

  Data Structures and Network Algorithms
  CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983

  Christos H. Papadimitriou, Kenneth Steiglitz:

  Combinatorial optimization : Algorithms and complexity
  Prentice-Hall, Englewood Cliffs, NJ, 1982

  Steven S. Skiena:

  The Algorithm Design Manual
  Springer, New York, 1998

  Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:

  Introduction to Algorithms
  MIT Press, 1990

• Office Hours:
  look here