| 475 | -- | 522 | Natarajan Shankar. A mechanical proof of the Church-Rosser theorem |
| 523 | -- | 534 | Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch. Finding a maximum-genus graph imbedding |
| 535 | -- | 563 | Wen-Lian Hsu. The coloring and maximum independent set problems on planar perfect graphs |
| 564 | -- | 578 | Wansoo T. Rhee, Michel Talagrand. Some distributions that allow perfect packing |
| 579 | -- | 602 | Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March. Stability of binary exponential backoff |
| 603 | -- | 634 | Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith. The physical mapping problem for parallel architectures |
| 635 | -- | 650 | S. Rao Kosaraju, Mikhail J. Atallah. Optimal simulations between mesh-connected arrays of processors |
| 651 | -- | 667 | Faith E. Fich, Martin Tompa. The parallel complexity of exponentiating polynomials over finite fields |
| 668 | -- | 674 | Hans Daduna. Busy periods for subnetworks in stochastic networks: mean value analysis |
| 675 | -- | 696 | Jan Robin Rohlicek, Alan S. Willsky. The reduction of perturbed Markov generators: an algorithm exposing the role of transient states |
| 697 | -- | 726 | Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis. On the power of one-way communication |
| 727 | -- | 739 | Michael R. Fellows, Michael A. Langston. Nonconstructive tools for proving polynomial-time decidability |
| 740 | -- | 747 | Friedhelm Meyer auf der Heide. Fast algorithms for N-dimensional restrictions of hard problems |
| 748 | -- | 754 | Arnold Schönhage. A nonlinear lower bound for random-access machines under logarithmic cost |