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