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

252-0209-00L 8 Credits BSC , SHE D-MATH , D-INFK
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Algorithms, Probability, and Computing

Lecturers & Examiners: Prof. Dr. Bernd Gärtner, Dr. Mohsen Ghaffari, Prof. Dr. David Steurer, Prof. Dr. Rasmus Kyng
VVZ CR 2.91

Last Updated: 2026-02-05 15:35:13

Abstract

Advanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Minimum Cut, Linear Programming, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).

Objective

Studying and understanding of fundamental advanced concepts in algorithms, data structures and complexity theory.

Resources

Lecture Notes

Will be handed out.

Literature

Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest; Randomized Algorithms by R. Motwani und P. Raghavan; Computational Geometry - Algorithms and Applications by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf.

Learning Materials (Links)

General Information

Language
English
Levels
BSC , SHE
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 180 minutes
Aids
Keine Hilfsmittel erlaubt.
There will be an optional written midterm exam and a written final exam. Script or any other supplementary material for either exam is not permitted. Furthermore, we will hand out two special assignments (compulsory continuous performance assessment) whose solution (typeset in LaTeX) is due two weeks later and will be graded.The final grade is 20% midterm exam + 20% special assignments + 60% final examORif the result of the midterm exam does not improve the final grade or has not been sitted:20% special assignments + 80% final exam

Course Components

Type Title Time & Place Hours
lecture Algorithms, Probability, and Computing
The lecturers will communicate the exact lesson times.
  • Mon 14:00-16:00 (ON LI NE)
  • Tue 14:00-16:00 (ON LI NE)
4 h weekly
exercise Algorithms, Probability, and Computing
The lecturers will communicate the exact lesson times.
  • Wed 14:00-16:00 (ON LI NE)
  • Wed 16:00-18:00 (ON LI NE)
2 h weekly
independent project Algorithms, Probability, and Computing
Project Work, no fixed presence required.
No time listed 1 h weekly

Offered In