Volume 19,
1982
- Yehoshua Perl, Shmuel Zaks:
On the Complexity of Edge Labelings for Trees.
1-16
- Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions.
17-28
- Karel Culik II, Arto Salomaa:
On Infinite Words Obtained by Iterating Morphisms.
29-38
- Dima Grigoriev:
Additive Complexity in Directed Computations.
39-67
- Ravi Sethi:
Pebble Games for Studying Storage Sharing.
69-84
- A. Cardon, Maxime Crochemore:
Partitioning a Graph in O(|A| log2 |V|).
85-98
- Mike Holcombe:
On the Holonomy Decomposition of Transformation Semigroups.
99-104
- T. Ito, Yasuaki Nishitani:
On Universality of Concurrent Expressions with Synchronization Primitives.
105-115
- Peter Padawitz:
Graph Grammars and Operational Semantics.
117-141
- Jan Paredaens:
A Universal Formalism to Express Decompositions, Functional Dependencies and Other Constraints in a Relational Database.
143-160
- Harry R. Lewis, Christos H. Papadimitriou:
Symmetric Space-Bounded Computation.
161-187
- Greg N. Frederickson, Joseph JáJá:
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
189-201
- Andrew Chi-Chih Yao:
On the Time-Space Tradeoff for Sorting with Linear Queries.
203-218
- Oscar H. Ibarra:
2DST Mapppings on Languages and Related Problems.
219-227
- Jean H. Gallier:
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems.
229 ,
-> TCS 14:
155-186 (1981)
- Ronald V. Book, Matthias Jantzen, Celia Wrathall:
Monadic Thue Systems.
231-251
- Rüdiger Reischuk:
A Fast Implementation of a Multidimensional Storage Into a Tree Storage.
253-266
- Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini:
Inclusion and Equivalence between Relational Database Schemata.
267-285
- Alan L. Selman:
Reductions on NP and P-Selective Sets.
287-304
- Helge Szwerinski:
Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position.
305-320
- Marc Snir:
Comparisons between Linear Functions can Help.
321-330
- Bernard R. Hodgson:
On Direct Products of Automaton Decidable Theories.
331-335
- Nimrod Megiddo:
Is Binary Encoding Appropriate for the Problem-Language Relationship?
337-341
Copyright © Tue Nov 10 01:05:28 2009
by Michael Ley (ley@uni-trier.de)
