STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989; Proceedings. 1st ed. 1989

種類:

電子ブック

責任表示:

edited by Burkhard Monien, Robert Cori

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989

著者名:

• Monien, Burkhard.
• Cori, Robert.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 349

ISBN:

9783540460985 [3540460985]    

注記:

On genuinely time bounded computations -- Unified Algebras and action semantics -- Properties of infinite words : Recent results -- A first order logic for partial functions -- Observational implementations -- On the boundary of a union of Rays -- Dynamic planar point location with optimal query time -- An O(n log n) algorithm for computing a link center in a simple polygon -- Polynomial graph-colorings -- Time-optimal simulations of networks by universal parallel computers -- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats -- Linear numeration systems, ?-developments and finite automata -- A generalization of automatic sequences -- Word problems over traces which are solvable in linear time -- Computing minimum spanning forests on 1- and 2-dimensional processor arrays -- Parallel computation of discrete Voronoi diagrams -- Successive approximation in parallel graph algorithms -- Reversals and alternation -- On the power of parity polynomi
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.

ローカル注記:

学内専用E-BOOKS (local access only)