Network Algorithms

  • 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:
    Wed 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: Jonas Pfoh
  • 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:
    1. Models for distributed algorithms and data structures
    2. Network theory
    3. Routing and scheduling
    4. Hashing and caching
    5. The continuous-discrete approach
    6. Supervised overlay networks
    7. Decentralized overlay networks
    8. Anycasting and multicasting
    9. Searching and sorting
    10. Self-stabilizing overlay networks
    11. Self-preserving overlay networks
    12. Overlay networks for wireless systems
    13. Logical networks for configware
  • Related and Advanced Lectures:
    An advanced lecture is planned.
  • Lecture Notes:
    See the German version of the webpage. All lecture notes are in English.
  • Programs:
    Programs will be written in C++ using the Subjects environment that can be downloaded below.
  • Assignments (in German):
  • References:
    The course is based on recent conference publications. References will be given in the lecture notes.
  • Office Hours:
    look here