Advertisement

Table of contents

  1. Miltos D. Grammatikakis, Jung-Sing Jwo
    Pages 609-610
  2. P. Spirakis, B. Tampakas, Matthias Papatriantafillou, K. Konstantoulis, K. Vlaxodimitropoulos, V. Antonopoulos et al.
    Pages 615-616
  3. Peter Bachmann, Thomas Drescher, Sabine Nieke
    Pages 619-620
  4. Back Matter

About these proceedings

Introduction

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.

Keywords

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

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-55210-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55210-9
  • Online ISBN 978-3-540-46775-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Automotive
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Engineering