Table of contents

  1. Front Matter
  2. Anne Condon
    Pages 33-44
  3. Michel Billaud
    Pages 71-82
  4. Friedhelm Meyer auf der Heide, Hieu Thien Pham
    Pages 95-108
  5. Venkatesh Radhakrishnan, Harry B. Hunt III, Richard E. Stearns
    Pages 109-119
  6. Franco P. Preparata, Jeffrey Scott Vitter
    Pages 133-146
  7. Anne Brüggemann-Klein, Derick Wood
    Pages 173-184
  8. Ming-Jye Sheu, Timothy Juris Long
    Pages 185-198
  9. Jean-Marc Robert, Godfried Toussaint
    Pages 233-244

About these proceedings


This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.


Automat algorithm algorithms automata complexity computational geometry computer computer science distributed systems logic semantics algorithm analysis and problem complexity

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking