This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency.
ISBN: | 9783540508403 |
---|---|
Sprache: | Englisch |
Seitenzahl: | 546 |
Produktart: | Kartoniert / Broschiert |
Herausgeber: | Cori, Robert Monien, Burkhard |
Verlag: | Springer Berlin |
Veröffentlicht: | 08.02.1989 |
Untertitel: | 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989; Proceedings |
Schlagworte: | Approximation Bit Graph Monoid Variable automata theory bisimulation code concurrency formal language |