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

Partial functions in comstructive formal theories....Pages 1-18
A Monte Carlo factoring algorithm with finite storage....Pages 19-33
Theory of concurrency control....Pages 35-47
Interprocedural data flow systems....Pages 49-59
On the crossing-free, rectangular embedding of weighted graphs in the plane....Pages 61-72
Discreteness, K-density and D-continuity of occurrence nets....Pages 73-83
Controlled relativizations of P and NP....Pages 85-90
The computational complexity of certain graph grammars....Pages 91-99
Inconsistencies of pure LISP....Pages 101-110
FIFO nets: A new model of parallel computation....Pages 111-121
Une extension aux mots infinis de la notion de transduction rationnelle....Pages 123-139
Algebraic and operational semantics of exceptions and errors....Pages 141-151
The expected number of nodes and leaves at level k in ordered trees....Pages 153-163
Complexity theory on real numbers and functions....Pages 165-174
A multifit algorithm for uniform multiprocessor scheduling....Pages 175-185
Analysis of polynomial approximation algorithms for constraint expressions....Pages 187-197
Heuristics for minimum edge length rectangular partitions of rectilinear figures....Pages 199-210
An axiomatic approach to semantics of specification languages....Pages 211-219
Efficiency of universal parallel computers....Pages 221-229
Coroutines and processes in block structured languages....Pages 231-241
A general scheme for some deterministically parsable grammars and their strong equivalents....Pages 243-255
A decidability result about sufficient-completeness of axiomatically specified abstract data types....Pages 257-267
Two remarks on the power of counting....Pages 269-275
Some operations and transductions that preserve rationality....Pages 277-288
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics....Pages 289-299
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits....Pages 301-311
The equivalence problem for N.T.S. languages is deoidable....Pages 313-323
Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi....Pages 325-333
A hierarchy of sets of infinite trees....Pages 335-342
Maintaining order in a generalized linked list....Pages 343-352
Periodic versus arbitrary tessellations of the plane using polyominos of a single type....Pages 353-365