Search result: Courses in Spring Semester 2020

Computer Science Master Information
Focus Courses
Focus Courses in Theoretical Computer Science
Focus Elective Courses Theoretical Computer Science
NumberTitleTypeECTSHoursLecturers
252-0408-00LCryptographic Protocols Information W6 credits2V + 2U + 1A
252-0408-00 VCryptographic Protocols2 hrs
Wed12:15-14:00CAB G 51 »
M. Hirt, U. Maurer
252-0408-00 UCryptographic Protocols2 hrs
Wed14:15-16:00CAB G 51 »
M. Hirt, U. Maurer
252-0408-00 ACryptographic Protocols1 hrsM. Hirt, U. Maurer
252-1424-00LModels of ComputationW6 credits2V + 2U + 1A
252-1424-00 VModels of Computation2 hrs
Fri14:15-16:00CAB G 51 »
M. Cook
252-1424-00 UModels of Computation
Exercise lessons start in the second week of semester.
2 hrs
Tue15:00-17:00Y55 G 20 »
M. Cook
252-1424-00 AModels of Computation
No presence required.
1 hrsM. Cook
263-4400-00LAdvanced Graph Algorithms and Optimization Information Restricted registration - show details
Number of participants limited to 30.
W5 credits3G + 1A
263-4400-00 GAdvanced Graph Algorithms and Optimization3 hrs
Wed09:15-12:00CAB G 52 »
R. Kyng
263-4400-00 AAdvanced Graph Algorithms and Optimization1 hrsR. Kyng
263-4507-00LAdvances in Distributed Graph AlgorithmsW6 credits3V + 1U + 1A
263-4507-00 VAdvances in Distributed Graph Algorithms
Does not take place this semester.
3 hrsM. Ghaffari
263-4507-00 UAdvances in Distributed Graph Algorithms
Does not take place this semester.
1 hrsM. Ghaffari
263-4507-00 AAdvances in Distributed Graph Algorithms
Does not take place this semester.
1 hrsM. Ghaffari
263-4656-00LDigital Signatures Information W4 credits2V + 1A
263-4656-00 VDigital Signatures2 hrs
Tue10:00-12:00ER SA TZ »
10:15-12:00ML E 12 »
D. Hofheinz
263-4656-00 ADigital Signatures1 hrsD. Hofheinz
272-0302-00LApproximation and Online Algorithms Information W5 credits2V + 1U + 1A
272-0302-00 VApproximations- und Online-Algorithmen2 hrs
Wed13:15-15:00CAB G 59 »
H.‑J. Böckenhauer, D. Komm
272-0302-00 UApproximations- und Online-Algorithmen1 hrs
Wed15:15-16:00CAB G 59 »
H.‑J. Böckenhauer, D. Komm
272-0302-00 AApproximations- und Online-Algorithmen1 hrsH.‑J. Böckenhauer, D. Komm
401-3052-05LGraph Theory Information W5 credits2V + 1U
401-3052-05 VGraph Theory28s hrs
Wed/110:00-12:00ER SA TZ »
10:15-12:00HG E 5 »
Thu/110:00-12:00ER SA TZ »
10:15-12:00HG F 3 »
B. Sudakov
401-3052-05 UGraph Theory7s hrs
Thu/115:15-16:00CAB G 52 »
15:15-16:00CAB G 56 »
15:15-16:00HG E 21 »
17:15-18:00HG E 33.5 »
B. Sudakov
401-3903-11LGeometric Integer ProgrammingW6 credits2V + 1U
401-3903-11 VGeometric Integer Programming2 hrs
Thu13:15-15:00HG E 33.3 »
J. Paat
401-3903-11 UGeometric Integer Programming1 hrs
Wed12:15-13:00HG E 33.3 »
J. Paat
272-0300-00LAlgorithmics for Hard Problems Information
This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science A.
W5 credits2V + 1U + 1A
272-0300-00 VAlgorithmik für schwere Probleme
Does not take place this semester.
2 hrs
272-0300-00 UAlgorithmik für schwere Probleme
Does not take place this semester.
1 hrs
272-0300-00 AAlgorithmik für schwere Probleme
Does not take place this semester.
1 hrs
  •  Page  1  of  1