| 687 | -- | 718 | Thomas Dean. Using temporal hierarchies to efficiently maintain large temporal databases |
| 719 | -- | 737 | Loren K. Platzman, John J. Bartholdi III. Spacefilling curves and the planar travelling salesman problem |
| 738 | -- | 757 | Martin Dowd, Yehoshua Perl, Larry Rudolph, Michael E. Saks. The periodic balanced sorting network |
| 758 | -- | 789 | Serge Abiteboul, Victor Vianu. A transaction-based approach to relational database specification |
| 790 | -- | 825 | Marc Gyssens, Jan Paredaens, Dirk Van Gucht. A uniform approach toward handling atomic and structured information in the nested relational database model |
| 826 | -- | 840 | Jan L. A. van de Snepscheut, Johan B. Swenker. On the design of some systolic algorithms |
| 841 | -- | 869 | Joost Engelfriet, Gilberto Filé. Passes, sweeps, and visits in attribute grammars |
| 870 | -- | 872 | Juha Kortelainen. The conjecture of Fliess on commutative context-free languages |
| 873 | -- | 886 | Andrew V. Goldberg, Robert Endre Tarjan. Finding minimum-cost circulations by canceling negative cycles |
| 887 | -- | 911 | Ilaria Castellani, Matthew Hennessy. Distributed bisimulations |
| 912 | -- | 928 | Eric Allender. P-uniform circuit complexity |
| 929 | -- | 965 | Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension |