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

Efficient Algorithms and Data Structures I
(WS 03/04)

Results of the Examinations are now available in the info box at the chair

• Lecturer:
  Prof. Dr. Ernst W. Mayr,
  Dr. Sven Kosub

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

• Time and Place:
  Tuesday, 8:15-9:45, CH 21010 (Hans Fischer Hall)
  Friday, 13:00-15:00, MW 0001

• Exercises(web page [in German]):
  2 hours per week exercises accompanying the lectures
  Monday, 16:00 - 17:30 Uhr, Raum MI 00.04.011 (HS 2)
  Tuesday, 14:15 - 15:45 Uhr, Raum MI 00.13.009A (Multimedia-Hörsaal)
  Teaching Assistant: Moritz G. Maaß, Stefan Eckhardt
  

• Course Certificate:
  To get a course certificate students must pass the exams (midterm and final).

• Exams:
  Please see German Webpage for details.

• Audience:
  graduate students of computer science
  students with computer science as minor

• Prerequisites:
  1st and 2nd year courses

• Recommended for:
  Fundamental knowledge in topic Algorithms

• Contents:
  This lecture deals in particular with the following topics:
  • Algorithm Analysis
  • Basic Data Structures
  • Search Trees and Skip Lists
  • Sorting, Sets, and Selection
  • Fundamental Techniques
  • Algorithms on Graphs
  • Network Flow and Matching
  • Network Algorithms
  • Text Processing
  • Related and Advanced Lectures:
    Efficient Algorithms and Data Structures II
    Internet Algorithmics

  • Lecture Notes:
    See Lecture Notes

  • References:
    The course outline can be found in the following book:
    • Michael T. Goodrich, Roberto Tamassia.
      Algorithm Design: Foundations, Analysis, and Internet Examples.
      John Wiley & Sons, Inc., 2002.

    Complementary and additional in-depth material can be taken from:
    • 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: Fundamental Algorithms.
      3rd edition, Addison-Wesley, Reading, MA, 1997.

    • Donald E. Knuth.
      The Art of Computer Programming: Sorting and Searching.
      2nd edition, Addison-Wesley, Reading, MA, 1997.

    • Uwe Schöning.
      Algorithmik.
      Spektrum Akademischer Verlag, Heidelberg, 2001.

    • Robert Sedgewick.
      Algorithmen.
      2nd edition, Pearson Education, München, 2002.

  • Office Hours:
    look here

  ---

  Last Changes: Sven Kosub on 11/11/2003