| 249 | -- | 250 | Koji Nakano, Jacir Luiz Bordim. Preface |
| 251 | -- | 270 | Thomas Rauber, Gudula Rünger. A Data re-distribution Library for Multi-processor Task Programming |
| 271 | -- | 286 | Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L. Trahan. Routing Multiple Width Communications on the Circuit Switched Tree |
| 287 | -- | 302 | Mourad Hakem, Franck Butelle. Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors |
| 303 | -- | 322 | Sharareh Babvey, Anu G. Bourgeois, José Alberto Fernández-Zepeda, Steven W. McLaughlin. Scalable and Efficient Implementations of the Ldpc Decoder Using Reconfigurable Models |
| 323 | -- | 336 | Zhenyu Xu, Pradip K. Srimani. Self-stabilizing Anonymous Leader Election in a Tree |
| 337 | -- | 356 | Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar. Approximate Block Sorting |
| 357 | -- | 378 | Shiyong Lu, Feng Cao, Yi Lu. Pama: a Fast String Matching Algorithm |
| 379 | -- | 394 | Yo-Sub Han, Yajun Wang, Derick Wood. Infix-free Regular Expressions and Languages |
| 395 | -- | 414 | Zsolt Gazdag. Decidability of the Shape Preserving Property of Bottom-up Tree Transducers |
| 415 | -- | 434 | Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu. The Spanning Connectivity of the (n, k)-star Graphs |
| 435 | -- | 464 | Natasa Jonoska, Joni Burnette Pirnot. Transitivity in Two-dimensional Local Languages Defined by Dot Systems |
| 465 | -- | 474 | Juha Honkala. The Base Problem for D0l Parikh Sets |
| 475 | -- | 488 | Andrzej Ehrenfeucht, Grzegorz Rozenberg. Covers from Templates |