Autumn Semester 2020 takes place in a mixed form of online and classroom teaching.
Please read the published information on the individual courses carefully.

Search result: Courses in Spring Semester 2016

Certificate of Advanced Studies in Computer Science Information
Focus Courses and Electives
NumberTitleTypeECTSHoursLecturers
252-0312-00LUbiquitous Computing Information W3 credits2V
252-0312-00 VUbiquitous Computing
Diese Lehrveranstaltung wird im FS16 als Blockkurs durchgeführt.
2 hrs
21.03.14-18CAB G 61 »
22.03.14-18ML E 12 »
23.03.14-18HG E 3 »
09.05.14-18CAB G 61 »
10.05.14-18ML E 12 »
11.05.14-18HG E 3 »
S. Mayer
252-0355-00LObject Databases Information W4 credits2V + 1U
252-0355-00 VObject Databases2 hrs
Wed09-11CAB G 59 »
A. K. de Spindler
252-0355-00 UObject Databases1 hrs
Wed11-12CAB G 59 »
A. K. de Spindler
252-0374-00LWeb Engineering Information W6 credits2V + 2U + 1A
252-0374-00 VWeb Engineering2 hrs
Thu10-12IFW A 36 »
M. Norrie
252-0374-00 UWeb Engineering2 hrs
Thu13-15IFW A 32.1 »
13-15IFW A 36 »
M. Norrie
252-0374-00 AWeb Engineering
No presence required.
1 hrsM. Norrie
252-0407-00LCryptography Foundations Information W7 credits3V + 2U + 1A
252-0407-00 VCryptography Foundations3 hrs
Wed13-16CAB G 51 »
U. Maurer
252-0407-00 UCryptography Foundations2 hrs
Mon10-12CAB G 52 »
Tue13-15ETZ G 91 »
U. Maurer
252-0407-00 ACryptography Foundations
Project Work, no fixed presence required.
1 hrsU. Maurer
252-0408-00LCryptographic Protocols Information W5 credits2V + 2U
252-0408-00 VCryptographic Protocols
Does not take place this semester.
2 hrsU. Maurer
252-0408-00 UCryptographic Protocols
Does not take place this semester.
2 hrsU. Maurer
252-0491-00LSatisfiability of Boolean Formulas - Combinatorics and Algorithms Information
Takes place for the last time in spring 2016.
W7 credits3V + 2U + 1A
252-0491-00 VSatisfiability of Boolean Formulas - Combinatorics and Algorithms3 hrs
Tue10-12CAB G 59 »
Thu09-10CAB G 59 »
E. Welzl
252-0491-00 USatisfiability of Boolean Formulas - Combinatorics and Algorithms2 hrs
Tue13-15CAB G 57 »
02.06.08-10CHN F 42 »
E. Welzl
252-0491-00 ASatisfiability of Boolean Formulas - Combinatorics and Algorithms
No presence required.
1 hrsE. Welzl
252-0526-00LStatistical Learning Theory Information W4 credits2V + 1U
252-0526-00 VStatistical Learning Theory2 hrs
Mon14-16HG G 5 »
J. M. Buhmann
252-0526-00 UStatistical Learning Theory1 hrs
Mon16-17HG G 5 »
J. M. Buhmann
252-0538-00LShape Modeling and Geometry Processing Information W4 credits2V + 1U
252-0538-00 VShape Modeling and Geometry Processing
Does not take place this semester.
2 hrsO. Sorkine Hornung
252-0538-00 UShape Modeling and Geometry Processing
Does not take place this semester.
1 hrsO. Sorkine Hornung
252-0579-00L3D Vision Information W4 credits3G
252-0579-00 G3D Vision3 hrs
Mon09-12CAB G 51 »
M. Pollefeys, T. Sattler
252-0820-00LCase Studies from Practice Information W4 credits2V + 1U
252-0820-00 VCase Studies from Practice2 hrs
Mon12-14ML F 38 »
M. Brandis
252-0820-00 UCase Studies from Practice1 hrs
Mon14-15ML F 38 »
M. Brandis
252-1403-00LIntroduction to Quantum Information Processing Information W3 credits2G
252-1403-00 GEinführung in die Quanteninformatik2 hrs
Fri13-15CAB G 59 »
S. Wolf
252-1424-00LModels of Computation Information W6 credits2V + 2U + 1A
252-1424-00 VModels of Computation2 hrs
Fri14-16ML F 39 »
M. Cook
252-1424-00 UModels of Computation
Exercise lessons start in the second week of semester.
2 hrs
Tue15-17I55 G 20 »
M. Cook
252-1424-00 AModels of Computation
No presence required.
1 hrsM. Cook
252-3005-00LIntroduction to Natural Language Processing Information W4 credits2V + 1U
252-3005-00 VIntroduction to Natural Language Processing2 hrs
Mon10-12ML H 44 »
30.05.10-16CHN G 46 »
T. Hofmann, M. Ciaramita
252-3005-00 UIntroduction to Natural Language Processing1 hrs
Mon13-14ML H 44 »
T. Hofmann, M. Ciaramita
252-5706-00LMathematical Foundations of Computer Graphics and Vision Information W4 credits2V + 1U
252-5706-00 VMathematical Foundations of Computer Graphics and Vision2 hrs
Mon14-16CAB G 57 »
J.‑C. Bazin, M. R. Oswald, C. Öztireli
252-5706-00 UMathematical Foundations of Computer Graphics and Vision1 hrs
Mon16-17CAB G 57 »
J.‑C. Bazin, M. R. Oswald, C. Öztireli
263-2300-00LHow To Write Fast Numerical Code Information
Prerequisite: Master student, solid C programming skills.
W6 credits3V + 2U
263-2300-00 VHow To Write Fast Numerical Code3 hrs
Mon10-12HG D 3.2 »
Thu09-10CAB G 51 »
M. Püschel
263-2300-00 UHow To Write Fast Numerical Code2 hrs
Wed13-15HG D 3.2 »
M. Püschel
263-2810-00LAdvanced Compiler Design Information W7 credits3V + 2U + 1A
263-2810-00 VAdvanced Compiler Design3 hrs
Wed10-12CAB G 51 »
Fri09-10CAB G 51 »
T. Gross
263-2810-00 UAdvanced Compiler Design2 hrs
Fri13-15CAB G 51 »
T. Gross
263-2810-00 AAdvanced Compiler Design
No presence required.
1 hrsT. Gross
263-2910-00LProgram Analysis and Synthesis Information W6 credits3V + 2U
263-2910-00 VProgram Analysis and Synthesis3 hrs
Mon13-16CAB G 51 »
M. Vechev
263-2910-00 UProgram Analysis and Synthesis2 hrs
Tue13-15CHN F 46 »
M. Vechev
263-3501-00LAdvanced Computer Networks Information W5 credits2V + 2U
263-3501-00 VAdvanced Computer Networks2 hrs
Tue13-15CAB G 51 »
P. M. Stüdi
263-3501-00 UAdvanced Computer Networks2 hrs
Thu14-16CAB G 52 »
P. M. Stüdi
263-3700-00LUser Interface Engineering Information W4 credits2V + 1U
263-3700-00 VUser Interface Engineering2 hrs
Wed10-12ETZ E 8 »
23.03.10-12CAB G 56 »
O. Hilliges, F. Pece
263-3700-00 UUser Interface Engineering1 hrs
Wed14-15CAB G 52 »
O. Hilliges, F. Pece
263-4600-00LFormal Methods for Information Security Information W4 credits2V + 1U
263-4600-00 VFormal Methods for Information Security2 hrs
Thu09-11CAB G 57 »
C. Sprenger, S. Radomirovic, R. Sasse
263-4600-00 UFormal Methods for Information Security1 hrs
Thu11-12CAB G 57 »
C. Sprenger, S. Radomirovic, R. Sasse
  •  Page  1  of  2 Next page Last page     All