Volume 148,
Number 1,
21 August 1995
- P. Diamond, P. Kloeden, V. Kozyakin, A. Pokrovskii:
On the Fragmentary Complexity of Symbolic Sequences.
1-17
- Bruno Durand:
A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
19-32
- Liming Cai, Jianer Chen:
On Input Read-Modes of Alternating Turing Machines.
33-55
- Takayoshi Shoudai, Satoru Miyano:
Using Maximal Independent Sets to Solve Problems in Parallel.
57-65
- Ratnesh Kumar, Vijay K. Garg:
Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control.
67-92
- Hans L. Bodlaender, Klaus Jansen:
Restrictions of Graph Partition Problems. Part I.
93-109
- Ingo Althöfer, Jörg Bültermann:
Superlinear Period Lengths in Some Subtraction Games.
111-119
- André Arnold:
An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma.
121-132
- Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
The Fourth Moment in Luby's Distribution.
133-140
- Don Kimber, Philip M. Long:
On-Line Learning of Smooth Functions of a Single Variable.
141-156
- Kenichi Morita:
Reversible Simulation of One-Dimensional Irreversible Cellular Automata.
157-163
- Uri Zwick:
The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate.
165-170
- Maria Cristina Pinotti, Geppino Pucci:
Parallel Algorithms for Priority Queue Operations.
171-180
Volume 148,
Number 2,
4 September 1995
Selected Papers of the Eleventh Symposium on Theoretical Aspects of Computer Science,
Caen,
France,
24-26 February 1994
Copyright © Fri Mar 12 17:33:08 2010
by Michael Ley (ley@uni-trier.de)
