Skip to main content
  • Conference proceedings
  • © 1995

STACS 95

12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 900)

Conference series link(s): STACS: Annual Symposium on Theoretical Aspects of Computer Science

Conference proceedings info: STACS 1995.

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (56 papers)

  1. Front Matter

  2. Completeness and weak completeness under polynomial-size circuits

    • David W. Juedes, Jack H. Lutz
    Pages 26-37
  3. Communication complexity of key agreement on small ranges

    • Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
    Pages 38-49
  4. Pseudorandom generators and the frequency of simplicity

    • Yenjo Han, Lane A. Hemaspaandra
    Pages 50-59
  5. Systolic tree ω-languages

    • Angelo Monti, Adriano Peron
    Pages 131-142
  6. Structural complexity of ω-automata

    • Sriram C. Krishnan, Anuj Puri, Robert K. Brayton
    Pages 143-156
  7. Algorithms explained by symmetries

    • Torsten Minkwitz
    Pages 157-167
  8. Generalized scans and tri-diagonal systems

    • Paul F. Fischer, Franco P. Preparata, John E. Savage
    Pages 168-180
  9. Two-dimensional pattern matching in linear time and small space

    • Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter, Wojciech Plandowski
    Pages 181-192
  10. On-line and dynamic algorithms for shortest path problems

    • Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Pages 193-204
  11. On compact representations of propositional circumscription

    • Marco Cadoli, Francesco M. Donini, Marco Schaerf
    Pages 205-216
  12. A set-theoretic translation method for (poly)modal logics

    • Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
    Pages 217-228

Other Volumes

  1. STACS 95

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access