Computer Science Master |
Focus Courses |
Focus Courses in Theoretical Computer Science |
Focus Core Courses Theoretical Computer Science |
Number | Title | Type | ECTS | Hours | Lecturers |
---|
261-5110-00L | Optimization for Data Science | W | 8 credits | 3V + 2U + 2A | |
261-5110-00 V | Optimization for Data Science | | | 3 hrs | | B. Gärtner,
D. Steurer |
261-5110-00 U | Optimization for Data Science | | | 2 hrs | | B. Gärtner,
D. Steurer |
261-5110-00 A | Optimization for Data Science | | | 2 hrs | | B. Gärtner,
D. Steurer |
263-4660-00L | Applied Cryptography Number of participants limited to 150. | W | 8 credits | 3V + 2U + 2P | |
263-4660-00 V | Applied Cryptography | | | 3 hrs | | K. Paterson |
263-4660-00 U | Applied Cryptography | | | 2 hrs | | K. Paterson |
263-4660-00 P | Applied Crpytography | | | 2 hrs | | K. Paterson |
|
Focus Elective Courses Theoretical Computer Science |
Number | Title | Type | ECTS | Hours | Lecturers |
---|
252-0408-00L | Cryptographic Protocols | W | 6 credits | 2V + 2U + 1A | |
252-0408-00 V | Cryptographic Protocols | | | 2 hrs | | M. Hirt,
U. Maurer |
252-0408-00 U | Cryptographic Protocols | | | 2 hrs | | M. Hirt,
U. Maurer |
252-0408-00 A | Cryptographic Protocols | | | 1 hrs | | M. Hirt,
U. Maurer |
252-1424-00L | Models of Computation | W | 6 credits | 2V + 2U + 1A | |
252-1424-00 V | Models of Computation | | | 2 hrs | | M. Cook |
252-1424-00 U | Models of Computation
Exercise lessons start in the second week of semester. | | | 2 hrs | | M. Cook |
252-1424-00 A | Models of Computation
No presence required. | | | 1 hrs | | M. Cook |
263-4400-00L | Advanced Graph Algorithms and Optimization Number of participants limited to 30. | W | 5 credits | 3G + 1A | |
263-4400-00 G | Advanced Graph Algorithms and Optimization | | | 3 hrs | | R. Kyng |
263-4400-00 A | Advanced Graph Algorithms and Optimization | | | 1 hrs | | R. Kyng |
263-4507-00L | Advances in Distributed Graph Algorithms | W | 6 credits | 3V + 1U + 1A | |
263-4507-00 V | Advances in Distributed Graph Algorithms
Does not take place this semester. | | | 3 hrs | | M. Ghaffari |
263-4507-00 U | Advances in Distributed Graph Algorithms
Does not take place this semester. | | | 1 hrs | | M. Ghaffari |
263-4507-00 A | Advances in Distributed Graph Algorithms
Does not take place this semester. | | | 1 hrs | | M. Ghaffari |
263-4656-00L | Digital Signatures | W | 4 credits | 2V + 1A | |
263-4656-00 V | Digital Signatures | | | 2 hrs | | D. Hofheinz |
263-4656-00 A | Digital Signatures | | | 1 hrs | | D. Hofheinz |
272-0302-00L | Approximation and Online Algorithms | W | 5 credits | 2V + 1U + 1A | |
272-0302-00 V | Approximations- und Online-Algorithmen | | | 2 hrs | | H.‑J. Böckenhauer,
D. Komm |
272-0302-00 U | Approximations- und Online-Algorithmen | | | 1 hrs | | H.‑J. Böckenhauer,
D. Komm |
272-0302-00 A | Approximations- und Online-Algorithmen | | | 1 hrs | | H.‑J. Böckenhauer,
D. Komm |
401-3052-05L | Graph Theory | W | 5 credits | 2V + 1U | |
401-3052-05 V | Graph Theory | | | 28s hrs | | B. Sudakov |
401-3052-05 U | Graph Theory | | | 7s hrs | | B. Sudakov |
401-3903-11L | Geometric Integer Programming | W | 6 credits | 2V + 1U | |
401-3903-11 V | Geometric Integer Programming | | | 2 hrs | | J. Paat |
401-3903-11 U | Geometric Integer Programming | | | 1 hrs | | J. Paat |
272-0300-00L | Algorithmics for Hard Problems This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science A. | W | 5 credits | 2V + 1U + 1A | |
272-0300-00 V | Algorithmik für schwere Probleme
Does not take place this semester. | | | 2 hrs | | |
272-0300-00 U | Algorithmik für schwere Probleme
Does not take place this semester. | | | 1 hrs | | |
272-0300-00 A | Algorithmik für schwere Probleme
Does not take place this semester. | | | 1 hrs | | |
|
Seminar in Theoretical Computer Science |
Number | Title | Type | ECTS | Hours | Lecturers |
---|
252-4102-00L | Seminar on Randomized Algorithms and Probabilistic Methods The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.
Number of participants limited to 24. | W | 2 credits | 2S | |
252-4102-00 S | Seminar on Randomized Algorithms and Probabilistic Methods | | | 2 hrs | | A. Steger |
252-4202-00L | Seminar in Theoretical Computer Science | W | 2 credits | 2S | |
252-4202-00 S | Seminar in Theoretical Computer Science | | | 2 hrs | | E. Welzl,
B. Gärtner,
M. Ghaffari,
M. Hoffmann,
J. Lengler,
A. Steger,
D. Steurer,
B. Sudakov |
263-4203-00L | Geometry: Combinatorics and Algorithms The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | W | 2 credits | 2S | |
263-4203-00 S | Geometry: Combinatorics and Algorithms | | | 2 hrs | | B. Gärtner,
M. Hoffmann,
E. Welzl,
M. Wettstein |
263-4651-00L | Current Topics in Cryptography Number of participants limited to 24.
The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | W | 2 credits | 2S | |
263-4651-00 S | Current Topics in Cryptography | | | 2 hrs | | D. Hofheinz,
U. Maurer,
K. Paterson |