Analytische Kombinatorik


The lecture will be in English. The learning goal is to develop basic skills and techniques which are relevant to problem solving when dealing with formulas related to enumeration, in particular, for the analysis of algorithms.

A major emphasis of the lecture is on putting computer algebra into action. Recently developed algorithms will be discussed, for instance, the Steele-prized summation algorithm by Zeilberger.

Requirements: Basic knowledge from analysis and linear algebra.

Note: Within the frame of this lecture various topics for a diploma thesis are offered.

Berechenbarkeit und Komplexität (WS 2007/08)

In dieser LVA behandeln wir den formalen Berechenbarkeitsbegriff anhand von rekursiven Funktionen und Turingmaschinen. Darauf aufbauend befassen wir uns mit der Entscheidbarkeit bzw. Unentscheidbarkeit von Problemen, mit Komplexitätsklassen und vollständigen Problemen.

Formal Methods in Software Development (WS 2007/08)

This course gives a survey on the use of formal methods for the development of reliable software using freely available tools.

Magister- und Dissertantenseminar (P. Paule)

The purpose of the meetings is to discuss progress made in diploma or PhD theses advised by the lecturer.

Project Seminar Formal Methods in Computer Science (WS 2007/08)

In this seminar, we explore current research and systems for specifying and verifying computer programs (specification languages, program verifiers, model checkers, ...).

Projektseminar Algorithmische Kombinatorik I


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.

Major topics of interest are: symbolic summation and integration, special functions, and related themes like difference equations, generating functions, etc. The main focus is on the design of new computer algebra algorithms.

Despite its research character, the structure of the seminar is such that ambitious students, being new to the area, have a chance to contribute in an active manner. Usually this happens in the form of approx. 120 minutes talks.

Requirements: Active knowledge from "Analytische Kombinatorik" and "Computer Algebra I"

Spezialvorlesung Symbolic Summation I


The lecture will be held in English. The lecture is directed to an audience with strong interest in methods for symbolic summation. However, this semester the main part of the lecture will be devoted to the study of (hypergeometric) summation from a classical point of view. In particular, connections to analytic aspects will be also discussed.

Analytische Kombinatorik copy 1

The lecture will be in English. The learning goal is to develop basic skills and techniques which are relevant to problem solving when dealing with formulas related to enumeration, in particular, for the analysis of algorithms.

A major emphasis of the lecture is on putting computer algebra into action. Recently developed algorithms will be discussed, for instance, the Steele-prized summation algorithm by Zeilberger.

Requirements: Basic knowledge from analysis and linear algebra.

Note: Within the frame of this lecture various topics for a diploma thesis are offered.