Colloquium on Computability, Complexity, and Logic

Abteilung Theoretische Informatik

Universität Stuttgart

Germany

December 5-6, 1996

Programme:
(All lectures are supposed to have a length of approx. 45 minutes)

THURSDAY, December 5:

12.00: Lunch
13.15: Introduction by Volker Diekert
13.30: J. Esparza (München): Model checking pushdown automata
14.30: K. J. Lange (Tübingen): Mangrove deforestation
15.30: Coffee Break
16.00: C. Lautemann (Mainz): On binary NP
17.00: M. Droste (Dresden): The theorem of Kleene-Schuetzenberger for formal power series over traces
18.00: C. Meinel (Trier): Efficient manipulation of Boolean functions
19.30: Dinner

FRIDAY, December 6:

8.30: M. Krause (Mannheim): Optimality results for secret sharing schemes in visual cryptography
9.30: E. Mayr (München): Applying Hilbert's 10th problem in complexity
10.30: Coffee Break
11.00: Yu. Matiyasevich (St. Petersburg): Reduction of trace equations to word equations
12.00: E. Börger (Pisa): Theory and practical applications of Gurevich abstract state machines
13.00: Lunch

Zurück zur / Back to: Colloquium on Computability, Complexity, and Logic.

Last modified: Mon Dec 2 14:34:14 MET 1996