Lectures Fundamentals of Algorithms and Data Structures Efficient Algorithms and
Data Structures II Complexity Theory Proseminar Graph Drawing Lab Course Discrete Optimization Courses for PhD Students Oberseminar

Efficient Algorithms and Data Structures II

• Lecturer:
  Prof. Dr. Harald Räcke
• Module: IN2004, TUMonline
• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)
  advanced course, topic algorithms
• Time and Location:
  Monday, 10:00–12:00, MI HS 2
  Thursday, 10:00–12:00, MI HS 3
• Exercises:
  Tuesday, 14:00–16:00, MI 03.11.018
  Teaching Assistant: Chintan Shah
• 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
  
• Slides
1. lecture
2. print (1 slide per page)
3. print (4 slides per page)