Computer Science Master |
Minors |
Minor in 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 |
252-0408-00 U | Cryptographic Protocols | | | 2 hrs | | M. Hirt |
252-0408-00 A | Cryptographic Protocols | | | 1 hrs | | M. Hirt |
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 the semester. | | | 2 hrs | | M. Cook |
252-1424-00 A | Models of Computation
No presence required. | | | 1 hrs | | M. Cook |
261-5110-00L | Optimization for Data Science | W | 10 credits | 3V + 2U + 4A | |
261-5110-00 V | Optimization for Data Science | | | 3 hrs | | B. Gärtner,
N. He |
261-5110-00 U | Optimization for Data Science | | | 2 hrs | | B. Gärtner,
N. He |
261-5110-00 A | Optimization for Data Science | | | 4 hrs | | B. Gärtner,
N. He |
263-4400-00L | Advanced Graph Algorithms and Optimization | W | 10 credits | 3V + 3U + 3A | |
263-4400-00 V | Advanced Graph Algorithms and Optimization | | | 3 hrs | | R. Kyng,
M. Probst |
263-4400-00 U | Advanced Graph Algorithms and Optimization | | | 3 hrs | | R. Kyng,
M. Probst |
263-4400-00 A | Advanced Graph Algorithms and Optimization | | | 3 hrs | | R. Kyng,
M. Probst |
263-4508-00L | Algorithmic Foundations of Data Science | W | 10 credits | 3V + 2U + 4A | |
263-4508-00 V | Algorithmic Foundations of Data Science | | | 3 hrs | | D. Steurer |
263-4508-00 U | Algorithmic Foundations of Data Science | | | 2 hrs | | D. Steurer |
263-4508-00 A | Algorithmic Foundations of Data Science | | | 4 hrs | | D. Steurer |
263-4509-00L | Complex Network Models | W | 5 credits | 2V + 2A | |
263-4509-00 V | Complex Network Models | | | 2 hrs | | J. Lengler,
R. M. Steiner |
263-4509-00 A | Complex Network Models | | | 2 hrs | | J. Lengler,
R. M. Steiner |
263-4510-00L | Introduction to Topological Data Analysis | W | 8 credits | 3V + 2U + 2A | |
263-4510-00 V | Introduction to Topological Data Analysis | | | 3 hrs | | P. Schnider |
263-4510-00 U | Introduction to Topological Data Analysis | | | 2 hrs | | P. Schnider |
263-4510-00 A | Introduction to Topological Data Analysis | | | 2 hrs | | P. Schnider |
263-4656-00L | Digital Signatures | W | 5 credits | 2V + 2A | |
263-4656-00 V | Digital Signatures | | | 2 hrs | | D. Hofheinz |
263-4656-00 A | Digital Signatures | | | 2 hrs | | D. Hofheinz |
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 | | D. Komm |
272-0300-00 U | Algorithmik für schwere Probleme
Does not take place this semester. | | | 1 hrs | | D. Komm |
272-0300-00 A | Algorithmik für schwere Probleme
Does not take place this semester. | | | 1 hrs | | D. Komm |
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,
M. Wettstein |
272-0302-00 U | Approximations- und Online-Algorithmen | | | 1 hrs | | H.‑J. Böckenhauer,
D. Komm,
M. Wettstein |
272-0302-00 A | Approximations- und Online-Algorithmen | | | 1 hrs | | H.‑J. Böckenhauer,
D. Komm,
M. Wettstein |
401-3052-10L | Graph Theory | W | 9 credits | 4V + 1U | |
401-3052-10 V | Graph Theory | | | 4 hrs | | B. Sudakov |
401-3052-10 U | Graph Theory | | | 1 hrs | | B. Sudakov |
401-3902-21L | Network & Integer Optimization: From Theory to Application | W | 5 credits | 3G | |
401-3902-21 G | Network & Integer Optimization: From Theory to Application | | | 3 hrs | | R. Zenklusen |