Access this book
Tax calculation will be finalised at checkout
Other ways to access
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.
Similar content being viewed by others
Keywords
Table of contents (56 papers)
-
Front Matter
Bibliographic Information
Book Title: STACS 92
Book Subtitle: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
Editors: Alain Finkel, Matthias Jantzen
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-55210-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1992
Softcover ISBN: 978-3-540-55210-9Published: 04 February 1992
eBook ISBN: 978-3-540-46775-5Published: 02 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVI, 628
Topics: Theory of Computation, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Numerical Analysis