Table of contents

  1. Front Matter
  2. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz
    Pages 19-32
  3. N. Bensaou, I. Guessarian
    Pages 33-46
  4. F. Laroussinie, Ph. Schnoebelen
    Pages 47-58
  5. Belaid Benhamou, Lakhdar Sais, Pierre Siegel
    Pages 71-82
  6. Burchard von Braunmühl, Romain Gengler, Robert Rettinger
    Pages 83-96
  7. Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    Pages 97-108
  8. Kousha Etessami, Neil Immerman
    Pages 123-135
  9. Hubert Comon, Florent Jacquemard
    Pages 149-162
  10. Christophe Ringeissen
    Pages 187-198
  11. Marcin Kik, Mirosław Kutyłowski, Grzegorz Stachowiak
    Pages 199-212
  12. Bogdan S. Chlebus, Leszek Gasieniec
    Pages 213-224
  13. Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
    Pages 225-236

About these proceedings

Introduction

This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.

Keywords

Bisimulation Computer-Science-Logik Kombinatorik Komplexität Monoid automata combinatorics complexity complexity theory computer science logic efficient algorithms effiziente Algorithmen information theory logic parallel algorithms

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57785-8
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57785-0
  • Online ISBN 978-3-540-48332-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book