| 113 | -- | 116 | Ming-Yang Kao, Stephen R. Tate. Online Matching with Blocked Input |
| 117 | -- | 121 | David Fernández-Baca, Mark A. Williams. On Matroids and Hierarchical Graphs |
| 123 | -- | 127 | Günter Rote. Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation |
| 129 | -- | 134 | Lars Langemyr. Circuits for Computing the GCD of Two Polynomials Over an Algebraic Number Field |
| 135 | -- | 141 | Charles U. Martel. Self-Adjusting Multi-Way Search Trees |
| 143 | -- | 148 | Subbiah Rajanarayanan, S. Sitharama Iyengar. A New Optimal Distributed Algorithm for the Set Intersection Problem |
| 149 | -- | 151 | Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang. Counting k-Subsets and Convex k-gons in the Plane |
| 153 | -- | 156 | Michal Mnuk. A div(n) Depth Bollean Circuit for Smooth Modular Inverse |
| 157 | -- | 161 | P. Pramanik, P. K. Das, A. K. Bandyopadhyay, D. Q. M. Fay. A Deadlock-Free Communication Kernel for Loop Architecture |
| 163 | -- | 168 | Dragan M. Acketa, Jovisa D. Zunic. On the Number of Linear Partitions of the (m, n)-Grid |