| 162 | -- | 173 | Xiao Jun Chen, Hasan Ural. Construction of Deadlock-free Designs of Communication Protocols from Observation |
| 174 | -- | 186 | Tien-Tai Pan, Shun-Shii Lin. Constant-time Algorithms for Minimum Spanning Tree and Related Problems on Processor Array with Reconfigurable Bus Systems |
| 187 | -- | 201 | Fairouz Kamareddine, Alejandro Ríos. Pure Type Systems with de Bruijn Indices |
| 202 | -- | 212 | N. Parimala. Explicit Operation Specification for Component Databases |
| 213 | -- | 220 | Alan Gibbons, Ida Pu, Muthu Muthukrishnan. Exact Analyses of a Simple Heuristic Employed in Array Compression |
| 221 | -- | 236 | Alexey Stakhov. Brousentsov s Ternary Principle, Bergman s Number System and Ternary Mirror-symmetrical Arithmetic |
| 237 | -- | 242 | Vladimir B. Balakirsky. A New Coding Algorithm for TreesVladimir B. Balakirsky |
| 243 | -- | 248 | Vladimir B. Balakirsky. Block Codes for Asynchronous Data Transmission Designed from Binary Trees |
| 249 | -- | 251 | Stefan Conrad, Wilhelm Hasselbring, Anne E. James, Dalen Kambur, Ralf-Detlef Kutsche, Philippe Thiran. Report on the EFIS 2001 Workshop |