| 1 | -- | 18 | Jonathan Sorenson. Polylog Depth Circuits for Integer Factoring and Discrete Logarithms |
| 19 | -- | 41 | Peter Thanisch, George Loizou, Jyrki Nummenmaa. Finding Compact Scheme Forests in Nested Normal Form is NP-Hard |
| 42 | -- | 83 | Raymond T. Ng, V. S. Subrahmanian. Stable Semantics for Probabilistic Deductive Databases |
| 84 | -- | 95 | Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi. On Learning Monotone DNF Formulae under Uniform Distributions |
| 96 | -- | 118 | Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui. Parallel Random Access Machines with both Multiplication and Shifts |
| 119 | -- | 129 | Steven Homer, Jie Wang. Immunity of Complete Problems |
| 130 | -- | 148 | Marc J. van Kreveld, Mark H. Overmars. Concatenable Structures for Decomposable Problems |
| 149 | -- | 163 | Bernhard Steffen, Anna Ingólfsdóttir. Characteristic Formulae for Processes with Divergence |
| 164 | -- | 182 | Volker Diekert, Edward Ochmanski, Klaus Reinhardt. On Confluent Semi-commutations: Decidability and Complexity Results |
| 183 | -- | 232 | Hagit Attiya, Nancy A. Lynch. Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty |
| 233 | -- | 263 | Guo-Qiang Zhang. A Representation of SFP |