Suchergebnis: Katalogdaten im Herbstsemester 2016
Informatik Bachelor  | ||||||
 Bachelor-Studium (Studienreglement 2008) | ||||||
| Vertiefung | ||||||
| Obligatorische Fächer der Vertiefung | ||||||
| Vertiefung Theoretische Informatik | ||||||
| Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
|---|---|---|---|---|---|---|
| 252-0209-00L | Algorithms, Probability, and Computing | O | 8 KP | 4V + 2U + 1A | E. Welzl, M. Ghaffari, A. Steger, P. Widmayer | |
| Kurzbeschreibung | 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). | |||||
| Lernziel | Studying and understanding of fundamental advanced concepts in algorithms, data structures and complexity theory. | |||||
| Skript | Will be handed out. | |||||
| Literatur | 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. | |||||
Seite
1
von
1
