Table of contents

  1. Front Matter
  2. David W. Juedes, Jack H. Lutz
    Pages 26-37
  3. Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
    Pages 38-49
  4. Yenjo Han, Lane A. Hemaspaandra
    Pages 50-59
  5. Angelo Monti, Adriano Peron
    Pages 131-142
  6. Sriram C. Krishnan, Anuj Puri, Robert K. Brayton
    Pages 143-156
  7. Torsten Minkwitz
    Pages 157-167
  8. Paul F. Fischer, Franco P. Preparata, John E. Savage
    Pages 168-180
  9. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter, Wojciech Plandowski
    Pages 181-192
  10. Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Pages 193-204
  11. Marco Cadoli, Francesco M. Donini, Marco Schaerf
    Pages 205-216
  12. Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
    Pages 217-228

About these proceedings

Introduction

This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995.
Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.

Keywords

Algorithms Automat algorithm automata automata theory complexity complexity theory computational geometry computer computer science database logic

Bibliographic information

  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-59042-2
  • Online ISBN 978-3-540-49175-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349