Volume 127,
Number 1,
9 May 1994
- Chiharu Hosono, Yasuwo Ikeda:
A Formal Derivation of the Decidability of the Theory SA.
1-23
- Kai Salomaa:
Synchronized Tree Automata.
25-51
- Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth:
Parallel RAM Algorithms for Factorizing Words.
53-67
- Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
69-98
- Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra.
99-121
- Juraj Hromkovic, Jarkko Kari, Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
123-147
- Matthias Jantzen, Holger Petersen:
Cancellation in Context-Free Languages: Enrichment by Reduction.
149-170
- Katsushi Inoue, Akira Ito, Itsuo Takanami:
On 1-inkdot Alternating Turing Machines with Small Space.
171-179
- Sergio De Agostino:
P-complete Problems in Data Compression.
181-186
- Alberto Del Lungo:
Polyominoes Defined by Two Vectors.
187-198
Volume 127,
Number 2,
23 May 1994
- Helen Cameron, Derick Wood:
Balance in AVL Trees and Space Cost of Brother Trees.
199-228
- Jarkko Kari:
Rice's Theorem for the Limit Sets of Cellular Automata.
229-254
- Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani:
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages.
255-267
- Juha Honkala:
On Generalized DT0L Systems and Their Fixed Points.
269-286
- Armando B. Matos:
Periodic Sets of Integers.
287-312
- Jean-Baptiste Yunès:
Seven-State Solutions to the Firing Squad Synchronization Problem.
313-332
- Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The Random Generation of Directed Animals.
333-350
- Sanjay Jain, Arun Sharma:
Program Size Restrictions in Computational Learning.
351-386
- A. H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Hyperedge Channels are Abelian.
387-393
- Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Note on Optimal Gossiping in Some Weak-Connected Graphs.
395-402
Copyright © Mon Nov 2 21:55:58 2009
by Michael Ley (ley@uni-trier.de)
