|
Lecturer:
Prof. Dr. Angelika Steger
|
|
|
Area:
4+2 lectures per week in
area III (Theoretical Computer Science)
advanced course
, topic algorithms
|
|
|
Time and Place:
Tue 8:30 - 10:00, lecture hall 1400
Thu 8:30 - 10:00, lecture hall 1400
Start: 4. November
|
|
|
Exercises:
2 hours per week exercises accompanying the lectures
Tue 14h c.t. - 16:00, room S2225
Start: 14. November
Teaching Assistant: Ulrich Voll
Course Certificate: To get a course certificate students must
get at least 40% on the homework assignments and
pass the final 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 topic 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. The course is based in the
book Randomized Algorithms by Motwani and
Raghavan.
|
|
|
Related and Advanced Lectures:
Efficient Algorithms and Datastructures I
|
|
|
Lecture Notes:
Not available.
|
|
|
References:
-
R. Motwani, P. Raghavan:
-
Randomized Algorithms
Cambridge University Press, 1995
|
|
|
Office Hours:
look here
|
