5. Theoretical Computer Science 1981: Karlsruhe, Germany

@proceedings{DBLP:conf/tcs/1981,
  editor    = {Peter Deussen},
  title     = {Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany,
               March 23-25, 1981, Proceedings},
  booktitle = {Theoretical Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {104},
  year      = {1981},
  isbn      = {3-540-10576-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Andrzej Ehrenfeucht, Grzegorz Rozenberg: On the Subword Complexity and Square-Freeness of Formal Languages. 1-4 BibTeX
• Werner Kuich: Cycle-Free N-Algebraic Systems. 5-12 BibTeX
• Franz-Josef Brandenburg: On the Height of Syntactical Graphs. 13-21 BibTeX
• Ingo Wegener: Boolean Functions Whose Monotone Complexity is of Size n²/log n. 22-31 BibTeX
• Jürgen Sattler: Netzwerke zur simultanen Berechnung Boolescher Funktionen. 32-40 BibTeX
• Jürgen Avenhaus, Klaus Madlener: P-Complete Problems in Free Groups. 42-51 BibTeX
• Michel Latteux: Quelques propriétés des langages à un Comptuer. 52-63 BibTeX
• Jean-Michel Autebert: Un resultat de discontinuité dans les familles de langages. 64-69 BibTeX
• Ioannis Keklikoglou: Verallgemeinerte kommutative Sprachen. 70-75 BibTeX
• Günter Hotz: Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen. 76-77 BibTeX
• Jean-Eric Pin: Un analogue du théorème des variétés pour les cones et les cylindres. 78-90 BibTeX
• Georg Schnitger: A Family of Graphs with Expensive Depth-Reduction. 91-97 BibTeX
• Henk J. Olivié: On alpha-balanced Binary Search Trees. 98-108 BibTeX
• Reiner Güttler: Erzeugung optimalen Codes für Series - Parallel Graphs. 109-122 BibTeX
• John E. Hopcroft: Recent Directions in Algorithmic Research. 123-134 BibTeX
• Ralf Hartmut Güting, Hans-Peter Kriegel: Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies. 135-145 BibTeX
• Luc Boasson: Some Applications of CFL's over Infinte Alphabets. 146-151 BibTeX
• Jean-Jacques Pansiot: A Decidable Property of Iterated Morphisms. 152-158 BibTeX
• Christian Choffrut: Prefix-Preservation fo Rational Partial Functions Is Decidable. 159-166 BibTeX
• David Michael Ritchie Park: Concurrency and Automata on Infinite Sequences. 167-183 BibTeX
• Bernhard Josko: An Effective Retract Calculus. 184-194 BibTeX
• Klaus Weihrauch: Recursion and Complexity Theory on CPO-S. 195-202 BibTeX
• Herbert Klaeren, Martin Schulz: Computable Algebras, Word Problems and Canonical Term Algebras. 203-213 BibTeX
• Horst Müller: Reachability Analysis with Assertion Systems. 214-223 BibTeX
• Mark H. Overmars, Jan van Leeuwen: Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. 224-233 BibTeX
• Scott Huddleston, Kurt Mehlhorn: Robust Balancing in B-Trees. 234-244 BibTeX
• Luc Boasson, Maurice Nivat: Centers of Languages. 245-251 BibTeX
• Ronald V. Book, Matthias Jantzen, Celia Wrathall: (Erasing)* Strings. 252-259 BibTeX