Theoretical Computer Science: 6th GI-Conference Dortmund, January 5-7, 1983 by A.B. CremersTheoretical Computer Science: 6th GI-Conference Dortmund, January 5-7, 1983 by A.B. Cremers

Theoretical Computer Science: 6th GI-Conference Dortmund, January 5-7, 1983

EditorA.B. Cremers

Paperback | December 1, 1982

Pricing and Purchase Info


Earn 710 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores

Title:Theoretical Computer Science: 6th GI-Conference Dortmund, January 5-7, 1983Format:PaperbackDimensions:380 pagesPublished:December 1, 1982Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540119736

ISBN - 13:9783540119739

Look for similar items by category:


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.