| 373 | -- | 0 | Daniel Andresen, Tao Yang. Selected Papers from Irregular 1999 - Preface |
| 375 | -- | 390 | Henrique Mongelli, Siang W. Song. Parallel Range Minima on Coarse Grained Multicomputers |
| 391 | -- | 404 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. Deterministic Branch-and-Bound on Distributed Memory Machines |
| 405 | -- | 424 | Cristina Boeres, Aline de P. Nascimento, Vinod E. F. Rebello. Cluster-Based Task Scheduling for the LOGP Model |
| 425 | -- | 442 | Frédérique Voisin, Guy-René Perrin. Sparse Computation with PEI |
| 443 | -- | 464 | Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha. Distributed Processing in Automata |
| 465 | -- | 472 | Alan P. Sprague, Tadao Takaoka. O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs |
| 473 | -- | 482 | Ryuhei Uehara. A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits |
| 483 | -- | 502 | Takeshi Okadome. Simple Flat Languages: A Learnable Class in the Limit from Positive Data |
| 503 | -- | 512 | Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc. Minimizing Congestion of Layouts for ATM Networks with Faulty Links |
| 513 | -- | 534 | Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe. Bipartite Graphs Totally Decomposable by Canonical Decomposition |
| 535 | -- | 0 | Richard Beigel, Anna Bernasconi. A Note on the Polynomial Representation of Boolean Functions over GF(2) |