Armin B. Cremers, Hans-Peter Kriegel (Eds.):
Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings.
Lecture Notes in Computer Science 145 Springer 1982, ISBN 3-540-11973-6 
Invited Lectures
Contributed Papers
Bernd Becker:
On the crossing-free, rectangular embedding of weighted graphs in the plane.
61-72
Françoise Gire:
Une extension aux mots infinis de la notion de transduction rationelle.
123-139
R. Kemp:
The expected number of nodes and leaves at level k in ordered trees.
153-163
Manfred Kunde:
A multifit algorithm for uniform multiprocessor scheduling.
175-185
Andrzej Lingas:
Heuristics for minimum edge length rectangular partitions of rectilinear figures.
199-210
Anton Nijholt,
Jan Pittl:
A general scheme for some deterministically parsable grammars and their strong equivalents.
243-255
Tobias Nipkow,
Gerhard Weikum:
A decidability result about sufficient-completeness of axiomatically specified abstract data types.
257-268
Axel Poigné:
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.
289-300
Patrice Séébold:
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
301-311
Kurt Sieber:
Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi.
325-334
data released under the ODC-BY 1.0 license
