Computer Science Master |
Focus Courses |
Focus Courses in Theoretical Computer Science |
Focus Elective Courses Theoretical Computer Science |
Number | Title | Type | ECTS | Hours | Lecturers |
---|
252-0408-00L | Cryptographic Protocols | W | 5 credits | 2V + 2U | |
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-1403-00L | Invitation to Quantum Informatics | W | 3 credits | 2V | |
252-1403-00 V | Invitation to Quantum Informatics | | | 2 hrs | | S. Wolf |
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-4110-00L | Interdisciplinary Algorithms Lab In the Master Programme max. 10 credits can be accounted by Labs on top of the Interfocus Courses. Additional Labs will be listed on the Addendum. | W | 5 credits | 2P | |
263-4110-00 P | Interdisciplinary Algorithms Lab
Number of participants limited to 12. | | | 2 hrs | | A. Steger,
D. Steurer,
J. Lengler |
263-4310-00L | Linear Algebra Methods in Combinatorics | W | 5 credits | 2V + 2U | |
263-4310-00 V | Linear Algebra Methods in Combinatorics | | | 2 hrs | | P. Penna |
263-4310-00 U | Linear Algebra Methods in Combinatorics | | | 2 hrs | | P. Penna |
263-4312-00L | Advanced Data Structures | W | 5 credits | 2V + 2U | |
263-4312-00 V | Advanced Data Structures | | | 2 hrs | | P. Uznanski |
263-4312-00 U | Advanced Data Structures | | | 2 hrs | | P. Uznanski |
272-0301-00L | Methods for Design of Random Systems This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science B. | W | 4 credits | 2V + 1U | |
272-0301-00 V | Methoden zum Entwurf von zufallsgesteuerten Algorithmen | | | 2 hrs | | H.‑J. Böckenhauer,
D. Komm,
R. Kralovic |
272-0301-00 U | Methoden zum Entwurf von zufallsgesteuerten Algorithmen | | | 1 hrs | | H.‑J. Böckenhauer,
D. Komm,
R. Kralovic |
272-0302-00L | Approximation and Online Algorithms | W | 4 credits | 2V + 1U | |
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 |
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 | | R. Weismantel |
401-3903-11 U | Geometric Integer Programming | | | 1 hrs | | R. Weismantel |
401-4904-00L | Combinatorial Optimization | W | 6 credits | 2V + 1U | |
401-4904-00 V | Combinatorial Optimization
Starts on 22 February 2018 in HG D 1.2 and will take place in HG G 19.1 in the subsequent weeks of the semester. | | | 2 hrs | | R. Zenklusen |
401-4904-00 U | Combinatorial Optimization
Starts in the second week of the semester. | | | 1 hrs | | R. Zenklusen |
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 | 4 credits | 2V + 1U | |
272-0300-00 V | Algorithmik für schwere Probleme
Does not take place this semester. | | | 2 hrs | | J. Hromkovic |
272-0300-00 U | Algorithmik für schwere Probleme
Does not take place this semester. | | | 1 hrs | | J. Hromkovic |