VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Algorithms, Probability, and Computing
Last Updated: 2026-02-05 15:07:04
Abstract
Advanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Network Flows, Minimum Cut, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).
Content
Advanced design and analysis methods for algorithms and data structures (Random(ized) Search Trees, Network Flows, Minimum Cut, Randomized Algebraic Algorithms, Point Location).
Resources
Lecture Notes
Lecture notes will be distributed.
Literature
Th. Cormen, Ch. Leiserson und R. Rivest, Introduction to Algorithms, MIT Press (1994), ISBN 0-262-03141-8; R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press (1995), ISBN 0-521-47465-5; M. de Berg, M. van Kreveld, M. Overmars und O. Schwarzkopf, Computational Geometry -Algorithms and Applications, Springer Verlag (2nd Edition, 2000) ISBN 3540656200. (Remark: are in loose connection to the material covered in the course.)
General Information
- Language
- English
- Levels
- BSC , DS
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- written 180 minutes
- Aids
- Keine.
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Algorithms, Probability, and Computing |
|
3 h weekly |
| exercise | Algorithms, Probability, and Computing |
|
2 h weekly |