| 289 | -- | 294 | M. Sowa. A Method for Speeding up Serial Processing in Dataflow Computers by Means of a Program Counter |
| 298 | -- | 307 | Jan van Leeuwen, Richard B. Tan. Interval Routing |
| 308 | -- | 315 | D. J. Challab, J. D. Roberts. Buddy Algorithms |
| 316 | -- | 327 | David A. Duce, E. V. C. Fielding. Formal Specification - A Comparison of Two Techniques |
| 328 | -- | 336 | Cristina Sernadas, Rogério Carapuça. The Role of Conceptual Modelling Abstractions in Compiler Development |
| 337 | -- | 342 | Philip Leith. A Programmed, Skeleton Formal Specification Method: The OUFDM |
| 343 | -- | 348 | James K. Mullin. Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters |
| 349 | -- | 354 | P. A. Firby, D. J. Stone. Colour Manipulation of Superposed Families of Curves |
| 355 | -- | 361 | F. Warren Burton, V. J. Kollias, John G. Kollias. A General PASCAL Program for Map Overlay of Quadtrees and Related Problems |
| 362 | -- | 371 | A. Inkeri Verkamo. Performance of Quicksort Adapted for Virtual Memory Use |
| 372 | -- | 375 | S. Dvorák, Branislav Durian. Stable Linear Time Sublinear Space Merging |
| 376 | -- | 378 | D. Gault, Maurice Clint. A Fast Algorithm for the Towers of Hanoi Problem |
| 378 | -- | 380 | T. H. Tse. Towards a Single Criterion for Identifying Program Unstructuredness |