From: lange@informatik.tu-muenchen.de (Klaus-Joern Lange)
Subject: IMYCS'92 accepted papers
Organization: Inst. fuer Informatik, Technische Univ. Muenchen, Germany
Distribution: news
Date: Mon, 27 Jul 1992 19:36:23 GMT
Expires: Fri, 20 Nov 1992 08:00:00 GMT


             ********************************************
             *     Seventh International Meeting of     *
             *         Young Computer Scientists        *
             *                 (IMYCS'92)               *
             ********************************************
                        November 17-20, 1992
                     Smolenice, Czecho-Slovakia

This preliminary programme contains 20 accepted talks, 7 invited
talks and one tutorial. Some of the titles of the invited talks
are still to be announced. In this case the area of the talk is
indicated.

     Tuesday, November 17, 1992

     09.00 - 09.15  Opening Address
     09.15 - 09.30  J.Gruska (Bratislava/Hamburg)
                    Tutorial

                    Coffee Break

     10.30 - 11.30  H.L.Bodlaender (Utrecht)
                    A tourist guide through treewidth
     11.30 - 12.30  V.Diekert (Stuttgart)
                    A new semantics for Petri nets

                    Lunch

     14.15 - 14.30  The IMYCS Award 1992
     14.30 - 15.05  A. Siroky (Bratislava)
                    Edge-label controlled graph grammars
                    with node relabelling
     15.05 - 15.30  H. Bordihn (Magdeburg)
                    On the degree of nondeterminism of grammars
     15.30 - 15.55  H. Fernau (Karlsruhe)
                    IIFS and Codes

                    Coffee Break

     16.15 - 16.40  M. Nolle (Karlruhe)
                    Comparison of different methods for
                    genereting fractals
     16.40 - 17.05  G. Salzer (Vienna)
                    Solvable classes of cycle unification problems
     17.05 - 17.30  Ch.G. Fermueller (Vienna)
                    A simple resolution based decision procedure
                    for the maslov class
     17.30 - 17.55  St. Sjogaard (Aarhus)
                    Generalization in cascade-correlation networks

     Wednesday, November 18, 1992

     09.00 - 10.00  J.Gruska (Bratislava/Hamburg)
                    Tutorial

                    Coffee Break

     10.20 - 11.20  J.-P. Briot (Paris)
                    N.N (area: Object oriented parallel/concurrent programming)
     11.20 - 12.20  J. Paredaens (Antwerp)
                    N.N (area: Data bases)

                    Lunch

     14.00          Excursion

     Thursday, November 19, 1992

     09.00 - 10.00  J. Gruska (Bratislava/Hamburg)
                    Tutorial

                    Coffee Break

     10.20 - 11.20  H.Edelsbrunner (Urbana-Champaigne)
                    N.N (area: Computational geometry)
     11.20 - 12.20  P.M.B. Vitanyi (Amsterdam)
                    Kolmogorov complexity and applications
                    in formal language theory

                    Lunch

     14.15 - 14.40  D. Pardubska (Bratislava)
                    The communication complexity hierarchy of
                    parallel communicating systems
     14.40 - 15.05  C. Damm (Trier), M. Holzer and P. Rossmanith (Munich)
                    Expressing uniformity via oracles
     15.05 - 15.30  E. Mayordomo (Barcelona)
                    Measuring in PSPACE
     15.30 - 15.55  K. Reinhardt (Stuttgart)
                    On counting and empty alternating pushdown automata

                    Coffee Break

     16.15 - 16.40  M.R.K. Krishna Rao
                    Occour-check in well-moded logic programs
     16.40 - 17.05  M Middendorf (Hannover)
                    Supersequences, runs and CD grammar systems
     17.05 - 17.30  S. Vicolov (Bucharest)
                    Hierarchies of valence languages
     17.30 - 17.55  V. Mitrana (Bucharest)
                    On some classes of grammar systems

     Friday, November 20, 1992

     09.00 - 10.00  R. Wiehagen (Berlin)
                    N.N (area: Learning theory)

                    Coffee Break

     10.15 - 10.40  T. Hegedues (Bratislava)
                    A lower bound on the performance of optimal
                    prediction strategies in mistake-bounded learning
     10.40 - 11.05  A. Asteroth, M.S. Fischer, K. Moeller (Bonn) and
                    U. Schnepf (St. Augustin)
                    Tracking and grasping of moving objects
                    - a behaviour-based approach -
     11.05 - 11.30  W. Neitz (Leipzig)
                    Selective backtracking in the connection method
     11.30 - 11.55  K. Hoerwein (Vienna)
                    Keeping inconsistencies local
     11.55 - 12.20  E. Pales (Bratislava)
                    A computational model of language as a whole
     12.20 - 12.30  Closing Adress










--
----------------------------------------------------------------
Klaus-Joern Lange              <lange@informatik.tu-muenchen.de>
Institut fuer Informatik,                Phone: +49-89-2105-2403
Technische Universitaet Muenchen,        Secr.: +49-89-2105-2404
Arcisstr. 21, 8000 Muenchen 2            FAX:   +49-89-2105-8207
F.R.o.Germany                            Telex: 3457 tumue d
(Further information by finger lange@131.159.8.70)