| 65 | -- | 67 | Cliff B. Jones. Partial Functions and Logics: A Warning |
| 69 | -- | 72 | Chui-Cheng Chen, Rong-Jaye Chen. Compact Embedding of Binary Trees Into Hyperacubes |
| 73 | -- | 79 | Giorgio Ausiello, Marco Protasi. Local Search, Reducibility and Approximability of NP-Optimization Problems |
| 81 | -- | 84 | Luis Barriga, Rassul Ayani. Lazy Update: An Efficient Implementation of LRU Stacks |
| 85 | -- | 92 | Gene Myers. Approximately Matching Context-Free Languages |
| 93 | -- | 96 | Horst Bunke, János Csirik. An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings |
| 97 | -- | 100 | Richa Agarwala, David Fernández-Baca. Weighted Search in the Plane |
| 101 | -- | 103 | Dennis Moore, William F. Smyth. A Correction to An Optimal Algorithm to Compute all the Covers of a String |
| 105 | -- | 110 | Guozhu Dong. On the Index of Positive Programmed Formal Languages |
| 111 | -- | 119 | Israel Cidon, Yuval Shavitt. Message Terminating Algorithms for Anonymous Rings of Unknown Size |
| 121 | -- | 126 | George Varghese, Roger D. Chamberlain, William E. Weihl. Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols |
| 127 | -- | 0 | Mark Allen Weiss. A Note on Construction of Treaps and Cartesian Trees |