6. Theoretical Computer Science 1983: Dortmund, Germany

@proceedings{DBLP:conf/tcs/1983,
  editor    = {Armin B. Cremers and
               Hans-Peter Kriegel},
  title     = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
               January 5-7, 1983, Proceedings},
  booktitle = {Theoretical Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {145},
  year      = {1982},
  isbn      = {3-540-11973-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Robert L. Constable:
  Partial functions in constructive formal theories. 1-18
  
• Claus-Peter Schnorr:
  Monte-Carlo factoring algorithm with finite storage. 19-33
  
• Christos H. Papadimitriou:
  Theory of concurrency control. 35-47
  

Contributed Papers

• Gerhard Barth:
  Interprocedural data flow systems. 49-59
  
• Bernd Becker:
  On the crossing-free, rectangular embedding of weighted graphs in the plane. 61-72
  
• Eike Best, Agathe Merceron:
  Discreteness, k-density and d-continuity of occurrence nets. 73-83
  
• Ronald V. Book, Timothy J. Long, Alan L. Selman:
  Controlled relativizations of P and NP. 85-90
  
• Franz-Josef Brandenburg:
  The computational complexity of certain graph grammars. 91-99
  
• Andreas Eick, Elfriede Fehr:
  Inconsistencies of pure LISP. 101-110
  
• Alain Finkel, Gérard Memmi:
  Fifo nets: a new model of parallel computation. 111-121
  
• Françoise Gire:
  Une extension aux mots infinis de la notion de transduction rationelle. 123-139
  
• Martin Gogolla, Klaus Drosten, Udo W. Lipeck, Hans-Dieter Ehrich:
  Algebraic and operational semantics of exceptions and errors. 141-151
  
• R. Kemp:
  The expected number of nodes and leaves at level k in ordered trees. 153-163
  
• Christoph Kreitz, Klaus Weihrauch:
  Complexity theory on real numbers and functions. 165-174
  
• Manfred Kunde:
  A multifit algorithm for uniform multiprocessor scheduling. 175-185
  
• Karl J. Lieberherr, Stephen A. Vavasis:
  Analysis of polynomial approximation algorithms for constraint expressions. 187-197
  
• Andrzej Lingas:
  Heuristics for minimum edge length rectangular partitions of rectilinear figures. 199-210
  
• Johann A. Makowsky, Bernd Mahr:
  An axiomatic approach to semantics of specification languages. 211-219
  
• Friedhelm Meyer auf der Heide:
  Efficiency of universal parallel computers. 221-241
  
• 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
  
• Christos H. Papadimitriou, Stathis Zachos:
  Two remarks on the power of counting. 269-276
  
• Jean-Eric Pin, Jacques Sakarovitch:
  Some operations and transductions that preserve rationality. 277-288
  
• 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
  
• Géraud Sénizergues:
  The equivalence problem for N.T.S. languages is decidable. 313-323
  
• Kurt Sieber:
  Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi. 325-334
  
• Wolfgang Thomas:
  A hierarchy of sets of infinite trees. 335-342
  
• Athanasios K. Tsakalidis:
  Maintaining order in a generalized linked list. 343-352
  
• Harry A. G. Wijshoff, Jan van Leeuwen:
  Periodic versus arbitrary tessellations of the plane using polyominos of a single type. 353-366
  

Last update Fri May 25 08:43:02 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page