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

Randomized Algorithms (WS 07/08)

• Lecturer:
  Prof. Dr. Christian Scheideler

• Module: IN2160

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

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

• Exercises:
  2 hours per week exercises accompanying the lectures
  ??? ??:?? - ??:??, lecture hall ??.??.???
  Teaching Assistant:
  Course Certificate: To get a course certificate students must pass the final exam.

• Exam:
  

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

• Prerequisites:
  1st and 2nd year courses
  Course Efficient Algorithms and Datastructures I advantagious, but not necessary.

• Recommended for:
  Fundamental knowledge in algorithms

• Contents:
  During the last years efficient algorithms have been discovered for various problems which outperfom deterministic algorithms with respect to system and/or time resources. Often randomized algorithms are also much easier to implement and analyze than their deterministic counterparts.
  In this lecture we will present basic principles for the design of randomized algorithms.

• Related and Advanced Lectures:
  Efficient Algorithms and Datastructures I

• Lecture Notes: Lecture notes (in German) will be provided on the German form of the webpage (click on the German flag).

• References:
  

  R. Motwani, P. Raghavan:

  Randomized Algorithms
  Cambridge University Press, 1995

• Office Hours:
  look here