| 1 | -- | 11 | Toshihiko Kurata. Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees |
| 12 | -- | 22 | Arnaud Durand. Linear Time and the Power of One First-Order Universal Quantifier |
| 23 | -- | 43 | Furio Honsell, Donald Sannella. Prelogical Relations |
| 44 | -- | 100 | Eike Best, Raymond R. Devillers, Maciej Koutny. The Box Algebra = Petri Nets + Process Expressions |
| 101 | -- | 131 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. Relative Undecidability in Term Rewriting: I. The Termination Hierarchy |
| 132 | -- | 148 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy |
| 149 | -- | 179 | Peter Møller Neergaard, Morten Heine Sørensen. Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions |
| 180 | -- | 213 | Irek Ulidowski, Iain C. C. Phillips. Ordered SOS Process Languages for Branching and Eager Bisimulations |
| 214 | -- | 240 | Marta Arias, Roni Khardon. Learning Closed Horn Expressions |
| 241 | -- | 252 | Michael V. Vyugin, Vladimir V. V yugin. On Complexity of Easy Predictable Sequences |
| 253 | -- | 262 | Mikael Goldmann, Alexander Russell. The Complexity of Solving Equations over Finite Groups |
| 263 | -- | 278 | Beate Bollig, Martin Sauerhoff, Ingo Wegener. On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs |
| 279 | -- | 293 | Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel. The Small Model Property: How Small Can It Be? |
| 294 | -- | 343 | Salvador Lucas. Context-Sensitive Rewriting Strategies |