Lectures Efficient Algorithms and
Data Structures I Advanced Network and
Graph Algorithms Gems of Computer Science I Proseminar Algorithms Exhibition Seminar Algorithms for Memory Hierarchies Courses for PhD Students Oberseminar

Gems of Computer Science I

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module: IN2148
• Area:
  1 lecture of 2 hours per week
• Time and Place:
  Thursday, 14:15-15:45, 03.11.018
• Exercises (web page [in German]):
  2 hours per week exercises accompanying the lectures
  Thursday, 16:00-17:30, 03.11.018
  Teaching Assistant: Sebastian Daum
  
• Audience:
  Participants of the special program for gifted and interested students of the computer science department.
• Prerequisites:
  none
• Contents:
• Lecture Notes:
  
• References:
  The course outline can be found in the following book:
  • Uwe Schöning.
    Theoretische Informatik kurzgefasst.
    Spektrum Akademischer Verlag, 4. Auflage, 2003.
  • Uwe Schöning.
    Perlen der Informatik.
    Spektrum Akademischer Verlag, 1995.
  • Uwe Schöning.
    Logik für Informatiker.
    Spektrum Akademischer Verlag, 5. Auflage, 2000.
  • Christos Papadimitriou.
    Computational Complexity.
    Addison Wesley, 1994.
• Office Hours:
  look here