Table of contents

  1. Front Matter
  2. Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil Shende
    Pages 3-13
  3. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 50-60
  4. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Pages 73-83
  5. Lance Fortnow, Sophie Laplante
    Pages 84-93
  6. Joel H. Spencer, Katherine St. John
    Pages 94-104
  7. Jacques Mazoyer, Ivan Rapaport
    Pages 116-127
  8. Giovanni Manzini, Luciano Margara
    Pages 128-138
  9. Carlo Mereghetti, Giovanni Pighizzini
    Pages 139-149
  10. Alexandru Mateescu
    Pages 150-160
  11. Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
    Pages 161-171
  12. V. Arvind, R. Beigel, A. Lozano
    Pages 172-182
  13. Peter Bürgisser
    Pages 194-204

About these proceedings

Introduction

This book constitutes the strictly refereed proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, held in Paris, France, in February 1998.
The volume presents three invited surveys together with 52 revised full papers selected from a total of 155 submissions. The papers are organized in topical sections on algorithms and data structures, logic, complexity, and automata and formal languages.

Keywords

Algorithms Automat Variable automata communication complexity computer science data structure data structures formal language formal languages logic programming simulation

Bibliographic information

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