VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

251-0417-00L 5 Credits
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Randomisierte Algorithmen

Lecturers & Examiners: Prof. Dr. Bernd Gärtner
VVZ CR n/a

Last Updated: 2026-02-05 14:53:04

Content

Randomized Algorithms are algorithms that "flip coins" to take certain decisions. This concept extends the classical model of deterministic algorithms and has become very popular and useful within the last twenty years. In many cases, randomized algorithms are faster, simpler or just more elegant than determinictic ones. In the course, we will discuss basic principles and techniques and derive from them a number of randomized methods for problems in different areas. We will need some very basic probability theory which we develop on the fly during the course.

Resources

Literature

R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press (1995).

General Information

Language
German
Frequency
Yearly recurring

Examination

Type
session examination
Mode
oral 30 minutes

Course Components

Type Title Time & Place Hours
lecture Randomisierte Algorithmen
  • Mon 10:15-12:00 (IFW B 42)
2 h weekly
exercise Randomisierte Algorithmen
  • Mon 13:15-14:00 (IFW B 42)
1 h weekly

Offered In