| 1 | -- | 15 | Amir M. Ben-Amram, Neil D. Jones. A Precise Version of a Time Hierarchy Theorem |
| 17 | -- | 23 | Martti Penttonen. Relative Cost Random Access Machines |
| 25 | -- | 37 | Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup. The Complexity of Identifying Large Equivalence Classes |
| 39 | -- | 50 | Merja Wanne, Matti Linna. A General Model for Adjacency |
| 51 | -- | 60 | Stojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby. Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras |
| 61 | -- | 77 | Mogens Nielsen, Thomas Hune. Bisimulation and Open Maps for Timed Transition Systems |
| 79 | -- | 91 | Eija Jurvanen, Marjo Lipponen. Distinguishability, Simulation and Universality of Moore Tree Automata |
| 93 | -- | 107 | Jarkko Kari. On the Circuit Depth of Structurally Reversible Cellular Automata |
| 109 | -- | 118 | Lucian Ilie. Subwords and Power-Free Words are not Expressible by Word Equations |
| 119 | -- | 133 | Juhani Karhumäki, Sabrina Mantaci. Defect Theorems for Trees |
| 135 | -- | 148 | Keijo Ruohonen. Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation |
| 149 | -- | 161 | Cunsheng Ding, Kwok-Yan Lam, Chaoping Xing. Construction and Enumeration of All Binary Duadic Codes of Length p:::m::: |
| 163 | -- | 180 | Jukka A. Koskinen. Non-Injectivity and Knapsacks |
| 181 | -- | 188 | Valtteri Niemi, Ari Renvall. Solitaire Zero-knowledge |
| 189 | -- | 200 | Vesa Halava, Tero Harju. Undecidability in Integer Weighted Finite Automata |
| 201 | -- | 208 | Juha Honkala. The Equivalence Problem of D0L and DF0L Power Series |
| 209 | -- | 221 | Paavo Turakainen. On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem |