+612 9045 4394
Theoretical Computer Science : 6th Gi-Conference Dortmund, January 5-7, 1983 - A.B. Cremers

Theoretical Computer Science

6th Gi-Conference Dortmund, January 5-7, 1983

By: A.B. Cremers (Editor), H.-P. Kriegel (Editor)

Paperback Published: 1st December 1982
ISBN: 9783540119739
Number Of Pages: 368

Share This Book:


or 4 easy payments of $33.88 with Learn more
Ships in 7 to 10 business days
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.

ISBN: 9783540119739
ISBN-10: 3540119736
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English , French
Number Of Pages: 368
Published: 1st December 1982
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.01
Weight (kg): 0.54