| 271 | -- | 282 | Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Vaidyanathan. Tighter and Broader Complexity Results for Reconfigurable Models |
| 283 | -- | 295 | Yueming Li, Jianhui Tao, Si-Qing Zheng. A Symmetric Processor Array with Synchronous Optical Buses and Switches |
| 297 | -- | 306 | Tzung-Pei Hong, Jyh-Jong Lee. A Nearly Optimal Back-Propagation Learning Algorithm on a Bus-Based Architecture |
| 307 | -- | 320 | Jie Wu. Fault-Tolerant Communications in Cube-Based Multiple-Bus Systems |
| 321 | -- | 336 | Chunming Qiao, Yousong Mei. An Improved Embedding of Binary Trees in a Square Reconfigurable Array with Spanning Optical Buses |
| 337 | -- | 350 | Sook-Yeon Kim, Oh-Heum Kwon, Kyung-Yong Chwa. Embeddings of Butterflies into Hypermeshes |
| 351 | -- | 361 | M. Manzur Murshed, Richard P. Brent. Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh |
| 363 | -- | 370 | Tarun Anand, Phalguni Gupta. A Selection Algorithm for X + Y on Mesh |
| 371 | -- | 385 | Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes. Hamilton Cycle Decomposition of the Butterfly Network |
| 387 | -- | 397 | Marek Karpinski, Wojciech Rytter. On a Sublinear Time Parallel Construction of Optimal Binary Search Trees |
| 399 | -- | 405 | Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis. A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph |
| 407 | -- | 418 | Paraskevas Evripidou, Robert Barry. Mapping Fortran Programs to Single Assignment Semantics for Efficient Parallelization |