Suchergebnis: Lehrveranstaltungen im Frühjahrssemester 2020
Informatik Master | ||||||||||||||||||
Vertiefungsfächer | ||||||||||||||||||
Vertiefung in Theoretical Computer Science | ||||||||||||||||||
Wahlfächer der Vertiefung in Theoretical Computer Science | ||||||||||||||||||
Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
252-0408-00L | Cryptographic Protocols | W | 6 KP | 2V + 2U + 1A | ||||||||||||||
252-0408-00 V | Cryptographic Protocols | 2 Std. |
| M. Hirt, U. Maurer | ||||||||||||||
252-0408-00 U | Cryptographic Protocols | 2 Std. |
| M. Hirt, U. Maurer | ||||||||||||||
252-0408-00 A | Cryptographic Protocols | 1 Std. | M. Hirt, U. Maurer | |||||||||||||||
252-1424-00L | Models of Computation | W | 6 KP | 2V + 2U + 1A | ||||||||||||||
252-1424-00 V | Models of Computation | 2 Std. |
| M. Cook | ||||||||||||||
252-1424-00 U | Models of Computation Exercise lessons start in the second week of semester. | 2 Std. |
| M. Cook | ||||||||||||||
252-1424-00 A | Models of Computation No presence required. | 1 Std. | M. Cook | |||||||||||||||
263-4400-00L | Advanced Graph Algorithms and Optimization Number of participants limited to 30. | W | 5 KP | 3G + 1A | ||||||||||||||
263-4400-00 G | Advanced Graph Algorithms and Optimization | 3 Std. |
| R. Kyng | ||||||||||||||
263-4400-00 A | Advanced Graph Algorithms and Optimization | 1 Std. | R. Kyng | |||||||||||||||
263-4507-00L | Advances in Distributed Graph Algorithms | W | 6 KP | 3V + 1U + 1A | ||||||||||||||
263-4507-00 V | Advances in Distributed Graph Algorithms Findet dieses Semester nicht statt. | 3 Std. | M. Ghaffari | |||||||||||||||
263-4507-00 U | Advances in Distributed Graph Algorithms Findet dieses Semester nicht statt. | 1 Std. | M. Ghaffari | |||||||||||||||
263-4507-00 A | Advances in Distributed Graph Algorithms Findet dieses Semester nicht statt. | 1 Std. | M. Ghaffari | |||||||||||||||
263-4656-00L | Digital Signatures | W | 4 KP | 2V + 1A | ||||||||||||||
263-4656-00 V | Digital Signatures | 2 Std. |
| D. Hofheinz | ||||||||||||||
263-4656-00 A | Digital Signatures | 1 Std. | D. Hofheinz | |||||||||||||||
272-0302-00L | Approximations- und Online-Algorithmen | W | 5 KP | 2V + 1U + 1A | ||||||||||||||
272-0302-00 V | Approximations- und Online-Algorithmen | 2 Std. |
| H.‑J. Böckenhauer, D. Komm | ||||||||||||||
272-0302-00 U | Approximations- und Online-Algorithmen | 1 Std. |
| H.‑J. Böckenhauer, D. Komm | ||||||||||||||
272-0302-00 A | Approximations- und Online-Algorithmen | 1 Std. | H.‑J. Böckenhauer, D. Komm | |||||||||||||||
401-3052-05L | Graph Theory | W | 5 KP | 2V + 1U | ||||||||||||||
401-3052-05 V | Graph Theory | 28s Std. |
| B. Sudakov | ||||||||||||||
401-3052-05 U | Graph Theory | 7s Std. |
| B. Sudakov | ||||||||||||||
401-3903-11L | Geometric Integer Programming | W | 6 KP | 2V + 1U | ||||||||||||||
401-3903-11 V | Geometric Integer Programming | 2 Std. |
| J. Paat | ||||||||||||||
401-3903-11 U | Geometric Integer Programming | 1 Std. |
| J. Paat | ||||||||||||||
272-0300-00L | Algorithmik für schwere Probleme Diese Lerneinheit beinhaltet die Mentorierte Arbeit Fachwissenschaftliche Vertiefung mit pädagogischem Fokus Informatik A n i c h t ! | W | 5 KP | 2V + 1U + 1A | ||||||||||||||
272-0300-00 V | Algorithmik für schwere Probleme Findet dieses Semester nicht statt. | 2 Std. | ||||||||||||||||
272-0300-00 U | Algorithmik für schwere Probleme Findet dieses Semester nicht statt. | 1 Std. | ||||||||||||||||
272-0300-00 A | Algorithmik für schwere Probleme Findet dieses Semester nicht statt. | 1 Std. |
- Seite 1 von 1