| 97 | -- | 108 | Thomas Lippert, Armin Seyfried, Achim Bode, Klaus Schilling. Hyper-Systolic Parallel Computing |
| 109 | -- | 125 | Cong Fu, Xiangmin Jiao, Tao Yang. Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures |
| 126 | -- | 136 | Hao Chen, Nicholas S. Flann, Daniel W. Watson. Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm |
| 137 | -- | 149 | Yuh-Jzer Joung, Scott A. Smolka. Strong Interaction Fairness Via Randomization |
| 150 | -- | 162 | Andrew A. Chien. A Cost and Speed Model for k-ary n-Cube Wormhole Routers |
| 163 | -- | 174 | Ming-Jer Tsai, Sheng-De Wang. A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori |
| 175 | -- | 185 | Geunmo Kim, Hyunsoo Yoon. On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes |
| 186 | -- | 191 | Biing-Feng Wang. Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel |
| 192 | -- | 205 | Frederic Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, Yves Robert. Scheduling Block-Cyclic Array Redistribution |
| 206 | -- | 216 | Gheith A. Abandah, Edward S. Davidson. Characterizing Distributed Shared Memory Performance: A Case Study of the Convex SPP1000 |
| 217 | -- | 223 | Ge-Ming Chiu, Chih-Ming Hsiao. A Note on Total Ordering Multicast Using Propagation Trees |