| 1 | -- | 16 | Ryszard Janicki, Maciej Koutny. Semantics of Inhibitor Nets |
| 17 | -- | 28 | Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener. Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs |
| 29 | -- | 37 | Martin Farach, Mikkel Thorup. Fast Comparison of Evolutionary Trees |
| 38 | -- | 49 | Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows. On the Structure of Parameterized Problems in NP |
| 50 | -- | 63 | Jan C. Bioch, Toshihide Ibaraki. Complexity of Identification and Dualization of Positive Boolean Functions |
| 64 | -- | 71 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith. On the Intrinsic Complexity of Learning |
| 72 | -- | 110 | Hannah Bast, Torben Hagerup. Fast Parallel Space Allocation, Estimation and Integer Sorting |
| 111 | -- | 120 | Fabrizio Luccio, Linda Pagli. Approximate Matching for Two Families of Trees |
| 121 | -- | 126 | Lance Fortnow, Sophie Laplante. Circuit Lower Bounds à la Kolmogorov |
| 127 | -- | 137 | Omer Berkman, Costas S. Iliopoulos, Kunsoo Park. The Subtree Max Gap Problem with Application to Parallel String Covering |
| 138 | -- | 145 | Yuji Takada. A Hierarchy of Language Families Learnable by Regular Language Learning |
| 146 | -- | 153 | Nader H. Bshouty. Exact Learning Boolean Function via the Monotone Theory |