Colloquium on Computability, Complexity, and Logic
             ==================================================

                     Abteilung  Theoretische Informatik            
                           Universitaet 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:        Model checking pushdown automata
           (Muenchen)

    14.30  K. J. Lange:       Mangrove deforestation
           (Tuebingen)

    15.30  Coffee Break

    16.00  C. Lautemann:      On binary NP
           (Mainz)

    17.00  M. Droste:         The theorem of Kleene-Schuetzenberger for
           (Dresden)           formal power series over traces

    18.00  C. Meinel:         Efficient manipulation of Boolean functions
           (Trier)

    19.30  Dinner                  



    FRIDAY, December 6:
    ===================

     8.30  M. Krause:         Optimality results for secret sharing
           (Mannheim)          schemes in visual cryptography

     9.30  E. Mayr:           Applying Hilbert's 10th problem in
           (Muenchen)          complexity

    10.30  Coffee Break
 
    11.00  Yu. Matiyasevich:  Reduction of trace equations to word equations
           (St. Petersburg)   

    12.00  E. Boerger:        Theory and practical applications of
           (Pisa)              Gurevich abstract state machines

    13.00  Lunch