| 759 | -- | 768 | Vasek Chvátal, Endre Szemerédi. Many Hard Examples for Resolution |
| 769 | -- | 776 | Michael D. Grigoriadis, B. Kalantari. A new class of heuristic algorithms for weighted perfect matching |
| 777 | -- | 809 | Richard Cole, Alan Siegel. Optimal VLSI circuits for sorting |
| 810 | -- | 831 | Teofilo F. Gonzalez, Sing-Ling Lee. A linear time algorithm for optimal routing around a rectangle |
| 832 | -- | 844 | Shivendra S. Panwar, Donald F. Towsley, Jack K. Wolf. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service |
| 845 | -- | 875 | Hagit Attiya, Marc Snir, Manfred K. Warmuth. Computing on an anonymous ring |
| 876 | -- | 892 | Anna R. Karlin, Eli Upfal. Parallel hashing: an efficient implementation of shared memory |
| 893 | -- | 920 | Lyle Ramshaw. Eliminating go to s while preserving program structure |
| 921 | -- | 940 | Andrew V. Goldberg, Robert Endre Tarjan. A new approach to the maximum-flow problem |
| 941 | -- | 952 | David A. Mix Barrington, Denis Thérien. Finite monoids and the fine structure of NC:::1::: |
| 953 | -- | 964 | Daniel Leivant, Tim Fernando. Meager and replete failures of relative completeness |
| 965 | -- | 984 | Leonard Pitt, Leslie G. Valiant. Computational limitations on learning from examples |
| 985 | -- | 1000 | Joel I. Seiferas, Paul M. B. Vitányi. Counting is easy |
| 1001 | -- | 0 | Bruce Jay Collings, G. Barry Hembree. Addendum to Initializing Generalized Feedback Shift Register Pseudorandom Number Generators |