Theoretical computer science : 6th GI-conference, Dortmund, January 5-7, 1983
Author(s)
Bibliographic Information
Theoretical computer science : 6th GI-conference, Dortmund, January 5-7, 1983
（Lecture notes in computer science, 145）
Springer-Verlag, 1982
- : gw
- : us
Available at / 63 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||1452907318
-
University of Tsukuba Library, Library on Library and Information Science
: G.W.007.08:L-49:145881003690,831031400
-
No Libraries matched.
- Remove all filters.
Note
Papers presented at the 6th Biannual GI Symposium on Theoretical Computer Science, held in Dortmund, Germany, Jan. 5-7, 1983, and sponsored by the Special Interest Group for Automata and Formal Language Theory of the Gesellschaft fur Informatik
Includes bibliographical references and index
Description and Table of Contents
Table of Contents
Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedding of weighted graphs in the plane.- Discreteness, K-density and D-continuity of occurrence nets.- Controlled relativizations of P and NP.- The computational complexity of certain graph grammars.- Inconsistencies of pure LISP.- FIFO nets: A new model of parallel computation.- Une extension aux mots infinis de la notion de transduction rationnelle.- Algebraic and operational semantics of exceptions and errors.- The expected number of nodes and leaves at level k in ordered trees.- Complexity theory on real numbers and functions.- A multifit algorithm for uniform multiprocessor scheduling.- Analysis of polynomial approximation algorithms for constraint expressions.- Heuristics for minimum edge length rectangular partitions of rectilinear figures.- An axiomatic approach to semantics of specification languages.- Efficiency of universal parallel computers.- Coroutines and processes in block structured languages.- A general scheme for some deterministically parsable grammars and their strong equivalents.- A decidability result about sufficient-completeness of axiomatically specified abstract data types.- Two remarks on the power of counting.- Some operations and transductions that preserve rationality.- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.- The equivalence problem for N.T.S. languages is deoidable.- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi.- A hierarchy of sets of infinite trees.- Maintaining order in a generalized linked list.- Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
by "Nielsen BookData"
