![STACS 89 [electronic resource] : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings /](/search/themes/bootstrap3/images/libros.png)
STACS 89 [electronic resource] : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings /
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1989
|
| Subjects: | Computer science., Computers., Algorithms., Computer logic., Mathematical logic., Computer mathematics., Computer Science., Theory of Computation., Computational Mathematics and Numerical Analysis., Computation by Abstract Devices., Algorithm Analysis and Problem Complexity., Logics and Meanings of Programs., Mathematical Logic and Formal Languages., |
| Online Access: | http://dx.doi.org/10.1007/BFb0028968 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|