STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16-18, 1989 Proceedings /

Saved in:
Bibliographic Details
Meeting name:Annual Symposium on Theoretical Aspects of Computer Science (6th : 1989 : Paderborn, Germany)
Imprint:Berlin, Heidelberg : Springer-Verlag, 1989.
Description:1 online resource : v.: digital.
Language:English
Series:Lecture Notes in Computer Science, 0302-9743 ; 349
Lecture notes in computer science ; 349.
Subject:Computer science.
Microprogramming.
Computer software.
Logic design.
Combinatorial analysis.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Control Structures and Microprogramming.
Combinatorial analysis.
Computer science.
Computer software.
Logic design.
Microprogramming.
Electronic books.
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11078120
Hidden Bibliographic Details
Other authors / contributors:Monien, B.
Cori, Robert.
ISBN:9783540460985
3540460985
0387508406
9780387508405
3540508406
9783540508403
9783540508403
3540460985
Notes:Includes bibliographical references.
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.
Other form:Print version: Symposium on Theoretical Aspects of Computer Science (6th : 1989 : Paderborn, Germany). STACS 89. Berlin, Heidelberg : Springer-Verlag, 1989
Table of 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.