This course gives an overview on algebraic and discrete methods in biology, i.e. methods that have been developed in the overall area of symbolic computation.

The first part of the lecture introduces to basic combinatorial
sequences like binomial coefficients, partition numbers, or Stirling

The main part of the lecture is devoted to the concept of group
actions. This fundamental concept, connecting algebra with
combinatorics, can be viewed as the basis of Polya's counting theory.
Typical applications, for instance, concern different colorings of the
cube, or determining the total number of molecular graphs of a
certain type (e.g., alcohols).

The lecture will be in ENGLISH. (Not in German, as announced elsewhere!)

We discuss basic notions and methods to solve problems originating in analysis (like the problem of integration or of proving special function identities) with tools from computer algebra. The whole lecture has introductory character.

Diese Lehrveranstaltung bietet einen Überblick über den Aufbau von Computersystemen.
This course presents the axiomatic (also called algebraic) specification of abstract datatypes using tools such as the specification language CafeOBJ.
This course gives an introduction to the development of software on parallel and distributed computing systems (multiprocessors and computer networks).
The purpose of the meetings is to discuss progress made in diploma or PhD theses advised by the lecturer.
In this seminar, we explore current research and systems for specifying and verifying computer programs (specification languages, program verifiers, model checkers, ...).

The seminar language is English. The overall goal of this
seminar is to study aspects of recent algorithmic developments, and to
discuss progress made in various research projects.