| 409 | -- | 422 | Serge Abiteboul, Seymour Ginsburg. Tuple sequences and lexicographic indexes |
| 423 | -- | 450 | Catriel Beeri, Michael Kifer. Elimination of intersection anomalies from database schemes |
| 451 | -- | 464 | Francis Y. L. Chin. Security problems on inference control for SUM, MAX, and MIN queries |
| 465 | -- | 488 | Seymour Ginsburg, Richard Hull. Sort sets in the relational model |
| 489 | -- | 498 | Luc Devroye. A note on the height of binary search trees |
| 499 | -- | 516 | Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl. Reaching approximate agreement in the presence of faults |
| 517 | -- | 532 | Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert. Predicting fill for sparse orthogonal factorization |
| 533 | -- | 550 | Dorit S. Hochbaum, David B. Shmoys. A unified approach to approximation algorithms for bottleneck problems |
| 551 | -- | 567 | Samar Singh. Improved methods for storing and updating information in the out-of-kilter algorithm |
| 568 | -- | 592 | Debasis Mitra, James McKenna. Asymptotic expansions for closed Markovian networks with state-dependent service rates |
| 593 | -- | 602 | John N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet. The performance of a precedence-based queuing discipline |
| 603 | -- | 617 | José L. Balcázar, Ronald V. Book, Uwe Schöning. The polynomial-time hierarchy and sparse oracles |
| 618 | -- | 627 | Timothy J. Long, Alan L. Selman. Relativizing complexity classes with sparse oracles |