Bachelor and Master Theses

Algorithms and Complexity Theory

Many computational problems that are of high practical relevance are represented by theoretical models that often do not take into account existing information. The modeling and quantification of such information forms a large subfield of algorithmics. Our group has developed and coined several such models.

Contact

Dr. Hans-Joachim Böckenhauer
Lecturer at the Department of Computer Science
  • CAB F 11
  • +41 44 632 81 83
  • +41 44 632 13 90

Professur Algorithmen und Didaktik
Universitätstrasse 6
8092 Zürich
Switzerland

Dr.  Hans-Joachim Böckenhauer

Didactics of Computer Science

For sustainable computer science teaching at school, learning platforms are developed that enable competencies in core areas of computer science to be built up. These are continuously developed and supplemented. The target level is students from kindergarten to high school.

On the website of the Center for Computer Science Education at ETH Zurich ("Ausbildungs- und Beratungszentrum für Informatikunterricht," ABZ) you will find numerous computer-based learning environments that were also developed in our group: https://www.abz.inf.ethz.ch.

Contact

Giovanni Serafini
Lecturer at the Department of Computer Science
  • CAB F 11
  • +41 44 632 66 05

Professur Algorithmen und Didaktik
Universitätstrasse 6
8092 Zürich
Switzerland

Giovanni Serafini
JavaScript has been disabled in your browser