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

Network Algorithms (SS 07)

• Lecturer:
  Prof. Dr. Christian Scheideler

• Announcements:
  
  
• Module: IN2115

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

• Time and Place:
  Wen 14:15 - 15:45, lecture hall MI HS 3
  Fri 12:00 - 13:30, lecture hall MI HS 2
  
  

• Course Certificate:
  To get a course certificate students muss pass the exams.

• Exams:
  See the German webpage for details.

• Exercises:
  2 hours per week central exercises accompanying the lectures
  Teaching Assistant: Johannes Nowak
  

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

• ECTS: 8 points

• Prerequisites:
  1st and 2nd year courses

• Recommended for:
  In-depth knowledge in topic Algorithms

• Contents:
  The course will focus on the following topics:
  • Models for distributed algorithms and data structures
  • Network theory
  • Routing and scheduling
  • Hashing and caching
  • The continuous-discrete approach
  • Supervised overlay networks
  • Decentralized overlay networks
  • Anycasting and multicasting
  • Searching and sorting
  • Self-stabilizing overlay networks
  • Self-preserving overlay networks
  • Overlay networks for wireless systems
  • Logical networks for configware

• Related and Advanced Lectures:
  An advanced lecture is planned.

• Lecture Notes:
  

• Programs:
  Programs will be written in C++ using the Subjects environment that can be downloaded below.
  • Subjects environment (Version 1.1)
  • A Hello World example.
  • A Ping Pong example.

• Assignments (in German):
  

• References:
  The course is based on recent conference publications. References will be given in the lecture notes.

• Office Hours:
  look here