Advertisement

Table of contents

  1. Christoph Meinel, Stephan Waack
    Pages 617-630
  2. Carsten Damm, Stasys Jukna, Jiří Sgall
    Pages 643-654
  3. E. Bampis, C. Delorme, J. -C. König
    Pages 655-666
  4. Bernd Gärtner, Emo Welzl
    Pages 667-687
  5. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996.
The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and communication complexity.

Keywords

Automat algorithm algorithms automata complexity complexity theory distributed systems logic semantics verification

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60922-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60922-3
  • Online ISBN 978-3-540-49723-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Automotive
Electronics
IT & Software
Telecommunications
Law
Aerospace
Engineering