| 1 | -- | 57 | François Puitg, Jean-François Dufourd. Formalizing mathematics in higher-order logic: A case study in geometric modelling |
| 59 | -- | 84 | Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing |
| 85 | -- | 107 | Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic. The complexity of shortest path and dilation bounded interval routing |
| 109 | -- | 133 | Klaus Weihrauch, Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions |
| 135 | -- | 166 | Dennis Pixton. Splicing in abstract families of languages |
| 167 | -- | 176 | Kai Salomaa, Sheng Yu. Alternating finite automata and star-free languages |
| 203 | -- | 218 | Dimitris Achlioptas, Marek Chrobak, John Noga. Competitive analysis of randomized paging algorithms |
| 219 | -- | 232 | Cao An Wang, Binhai Zhu. Three-dimensional weak visibility: Complexity and applications |
| 233 | -- | 254 | Jean Françon, Yves Bertrand. Topological 3D-manifolds: a statistical study of the cells |
| 255 | -- | 272 | Didier Arquès, Alain Giorgetti. Counting rooted maps on a surface |
| 273 | -- | 286 | Aduri Pavan, Alan L. Selman. Complete distributional problems, hard languages, and resource-bounded measure |
| 287 | -- | 300 | Zoltán Ésik. A proof of the Krohn-Rhodes Decomposition Theorem |
| 301 | -- | 308 | Tanja Lange, Arne Winterhof. Factoring polynomials over arbitrary finite fields |
| 309 | -- | 321 | Gérard Boudol. On the semantics of the call-by-name CPS transform |
| 323 | -- | 0 | Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara. Erratum to Reducibility classes of P-selective sets |
| 325 | -- | 326 | Sergio De Agostino. Erratum to P-complete Problems in Data Compression |