Table of contents

  1. Front Matter
  2. Klaus W. Wagner
    Pages 2-4
  3. Maciej Liśkiewicz, Rüdiger Reischuk
    Pages 16-27
  4. Jack H. Lutz, Elvira Mayordomo
    Pages 38-47
  5. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Pages 48-57
  6. Zhou Chaochen, Michael R. Hansen, Peter Sestoft
    Pages 58-68
  7. Thomas Eiter, Georg Gottlob
    Pages 70-79
  8. T. Kloks, D. Kratsch
    Pages 80-89
  9. Ulrich Huckenbeck
    Pages 90-99
  10. S. Sunder, Xin He
    Pages 100-109
  11. A. Pietracaprina, F. P. Preparata
    Pages 110-119
  12. Jörg Desel, Wolfgang Reisig
    Pages 120-129
  13. Eike Best, Raymond Devillers, Javier Esparza
    Pages 130-140
  14. Maria Paola Bonacina, Jieh Hsiang
    Pages 141-152
  15. Ernst W. Mayr, Ralph Werchner
    Pages 153-162
  16. Eric Allender, Jose Balcázar, Neil Immerman
    Pages 163-174

About these proceedings

Introduction

This volume contains the proceedings of the tenth annual Symposium on Theoretical Aspects of Computer Science (STACS '93), held in W}rzburg, February 25-27, 1993. The STACS symposia are held alternately in Germany and France, and organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI) and theSpecial Interest Group for Applied Mathematics of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (afcet). The volume includes the three invited talks which opened the three days of the symposium: "Causal and distributed semantics for concurrent processes" (I. Castellani), "Parallel architectures: design and efficient use" (B. Monien et al.), and "Transparent proofs" (L. Babai). The selection of contributed papers is organized into parts on: computational complexity, logic in computer science, efficient algorithms, parallel and distributed computation, language theory, computational geometry, automata theory, semantics and logic of programming languages, automata theory and logic, circuit complexity, omega-automata, non-classical complexity, learning theory and cryptography, and systems.

Keywords

Automat algorithm algorithms automata automata theory complexity computational geometry computer computer science logic programming programming language semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-56503-5
  • Copyright Information Springer-Verlag 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56503-1
  • Online ISBN 978-3-540-47574-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book