Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1992

STACS 92

9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings

Editors:

  1. Alain Finkel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Matthias Jantzen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

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, access via your institution.

Table of contents (56 papers)

  1. Front Matter

    PDF

  4. A theory of strict P-completeness

    • Anne Condon
    Pages 33-44

  7. Axiomatizations of backtracking

    • Michel Billaud
    Pages 71-82

  9. On the performance of networks with multiple busses

    • Friedhelm Meyer auf der Heide, Hieu Thien Pham
    Pages 95-108

  10. Efficient algorithms for solving systems of linear equations and path problems

    • Venkatesh Radhakrishnan, Harry B. Hunt III, Richard E. Stearns
    Pages 109-119

  12. A simplified technique for hidden-line elimination in terrains

    • Franco P. Preparata, Jeffrey Scott Vitter
    Pages 133-146

  15. Deterministic regular languages

    • Anne Brüggemann-Klein, Derick Wood
    Pages 173-184

  16. The extended low hierarchy is an infinite hierarchy

    • Ming-Jye Sheu, Timothy Juris Long
    Pages 185-198

  20. Linear approximation of simple objects

    • Jean-Marc Robert, Godfried Toussaint
    Pages 233-244
Back to top

About this book

This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.
Back to top

Keywords

  • Automat
  • algorithm
  • algorithms
  • automata
  • complexity
  • computational geometry
  • computer
  • computer science
  • distributed systems
  • logic
  • semantics
  • algorithm analysis and problem complexity
Back to top

Bibliographic Information

Back to top
Access via your institution

Buy it now

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

search

Navigation