| 1 | -- | 46 | Axel Poigné. On Specifications, Theories, and Models with Higher Types |
| 47 | -- | 85 | Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas. Probabilistic Analysis of a Network Resource Allocation Algorithm |
| 86 | -- | 104 | Neil Immerman. Relational Queries Computable in Polynomial Time |
| 105 | -- | 124 | Bernard Chazelle, R. Cole, Franco P. Preparata, Chee-Keng Yap. New Upper Bounds for Neighbor Searching |
| 125 | -- | 145 | Susanne Graf, Joseph Sifakis. A Modal Characterization of Observational Congruence on Finite Terms of CCS |
| 146 | -- | 169 | Mike Townsend. A Polynomial Jump Operator |
| 170 | -- | 184 | Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees |
| 185 | -- | 195 | Ulrike Brandt. The Position of Index Sets of Identifiable Sets in the Arithmetical Hierarchy |
| 196 | -- | 206 | Dung T. Huynh. A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems |
| 207 | -- | 222 | Peter A. Flanagan. An Optimally Data Efficient Isomorphism Inference Algorithm |
| 223 | -- | 253 | Krzysztof R. Apt, Carole Delporte-Gallet. Syntax Directed Analysis of Liveness Properties |
| 254 | -- | 270 | Susanne Graf, Joseph Sifakis. A Logic for the Description of Non-deterministic Programs and Their Properties |