STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16-18, 1989 Proceedings / edited by B. Monien, R. Cori.

By: (6th : Annual Symposium on Theoretical Aspects of Computer Science (6th : 1989 : Paderborn, Germany)Contributor(s): Monien, B | Cori, Robert Material type: Text

TextSeries: Serienbezeichnung | Lecture notes in computer science ; 349.Publication details: Berlin, Heidelberg : Springer-Verlag, 1989. Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540460985; 3540460985; 0387508406; 9780387508405; 3540508406; 9783540508403Subject(s): Computer science | Microprogramming | Computer software | Logic design | Combinatorial analysis | Combinatorial analysis | Computer science | Computer software | Logic design | MicroprogrammingGenre/Form: Electronic books. Additional physical formats: Print version:: STACS 89.DDC classification: 004 LOC classification: QA75.5Other classification: 54.10 Online resources: Click here to access online

Contents:

Invited Presentations -- Contributed Papers: Semantics 1. Computational Geometry. Structures. Automata Theory. Parallel Algorithms. Complexity 1. Complexity 2. Distributed Computing. Fault Tolerance. Semantics 2. Completeness. Concurrency. Formal Languages. Graph Algorithms -- Systems -- Author Index.

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 3 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
eBook	e-Library Electronic Book@IST	EBook		Available

Total holds: 0

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.

Includes bibliographical references.