4. Theoretical Computer Science 1979: Aachen, Germany

@proceedings{DBLP:conf/tcs/1979,
  editor    = {Klaus Weihrauch},
  title     = {Theoretical Computer Science, 4th GI-Conference, Aachen, Germany,
               March 26-28, 1979, Proceedings},
  booktitle = {Theoretical Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {67},
  year      = {1979},
  isbn      = {3-540-09118-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Luc Boasson:
  Context-Free Sets of Infinite Words. 1-9
  
• Hermann A. Maurer:
  New Aspects of Homomorphisms. 10-24
  
• Albert R. Meyer, Irene Greif:
  Can Partial Correctness Assertions Specify Programming Language Semantics?. 25-26
  
• Robin Milner:
  An Algebraic Theory for Synchronization. 27-35
  
• Arnold Schönhage:
  Storage Modification Machines. 36-37
  
• Leslie G. Valiant:
  Negative Results on Counting. 38-46
  
• Joffroy Beauquier:
  Strong Non-Deterministic Context-Free Languages. 47-57
  
• Victor L. Bennison:
  Information Content Characterizations of Complexity Theoretic Properties. 58-66
  
• Norbert Blum, Kurt Mehlhorn:
  Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. 67-78
  
• Gérard Boudol:
  A new Recursion Induction Principle. 79-90
  
• Burchard von Braunmühl, Rutger Verbeek:
  Finite-Change Automata. 91-100
  
• Peter van Emde Boas, Jan van Leeuwen:
  Move Rules and Trade-Offs in the Pebble Game. 101-112
  
• Dietmar Friede:
  Transition Diagrams and Strict Deterministic Grammars. 113-123
  
• Péter Gács:
  Exact Expressions for some Randomness Tests. 124-131
  
• Harald Ganzinger:
  On Storage Optimization for Automatically Generated Compilers. 132-141
  
• Irène Guessarian:
  On Continuous Completions. 142-152
  
• Joos Heintz:
  A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. 153-157
  
• Matthias Jantzen:
  On Zerotesting-Bounded Multicounter Machines. 158-169
  
• Akira Kanda, David Michael Ritchie Park:
  When are two Effectively given Domains Identical?. 170-181
  
• Michel Latteux:
  Sur deux langages linéaires. 182-189
  
• Mila E. Majster-Cederbaum, Angelika Reiser:
  An Efficient On-Line Position Tree Construction Algorithm. 190-198
  
• Kurt Mehlhorn:
  Sorting Presorted Files. 199-212
  
• Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
  Node-Visit Optimal 1-2 Brother Trees. 213-221
  
• Wolfgang J. Paul, Rüdiger Reischuk:
  A Graph Theoretic Approach to Determinism versus Non-Determinism. 222-232
  
• Jean-Eric Pin:
  Une caractérisation de trois variétés de langages bien connues. 233-243
  
• Lutz Priese:
  Über eine minimale universelle Turing-Maschine. 244-259
  
• Christophe Reutenauer:
  Sur les variétés de langages et de monoídes. 260-265
  
• Hans-Anton Rollik:
  Automaten in planaren Graphen. 266-275
  
• Jacques Sakarovitch:
  Théorème de transversale rationnelle pour les automates à pile déterministes. 276-285
  
• Claus-Peter Schnorr:
  On the Additive Complexity of Polynomials and some New Lower Bounds. 286-297
  
• Esko Ukkonen:
  Remarks on the Nonexistence of some Covering Grammars. 298-309
  
• Kai Wöhl:
  Zur Komplexität der Presburger Artihmetik und des Äquivalenzproblems einfacher Programme. 310-318
  

Last update Thu May 24 04:45:06 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page