| 1 | -- | 36 | Bruno Courcelle. The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications |
| 37 | -- | 63 | Letizia Magnoni, Massimo Mirolli, Franco Montagna, Giulia Simi. PAC learning of probability distributions over a discrete domain |
| 65 | -- | 79 | Julio Aracena, Eric Goles Ch.. Complexity of perceptron recognition for a class of geometric patterns |
| 81 | -- | 106 | Marcos A. Kiwi. Algebraic testing and weight distributions of codes |
| 107 | -- | 121 | Frank K. Hwang. A survey on multi-loop networks |
| 123 | -- | 150 | Chiara Epifanio, Michel Koskas, Filippo Mignosi. On a conjecture on bidimensional words |
| 151 | -- | 178 | David R. Wood. Optimal three-dimensional orthogonal graph drawing in the general position model |
| 179 | -- | 210 | Miklós Bartha, Miklós Krész. Structuring the elementary components of graphs having a perfect internal matching |
| 211 | -- | 229 | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu. Approximation algorithms for NMR spectral peak assignment |
| 231 | -- | 271 | Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer. Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees |
| 273 | -- | 288 | Subhas C. Nandy, Sandip Das, Partha P. Goswami. An efficient k nearest neighbors searching algorithm for a query line |
| 289 | -- | 306 | Dahlia Malkhi, Yishay Mansour, Michael K. Reiter. Diffusion without false rumors: on propagating updates in a Byzantine environment |
| 307 | -- | 326 | Markus Holzer, Pierre McKenzie. Alternating and empty alternating auxiliary stack automata |
| 327 | -- | 346 | Olivier Finkel. On omega context free languages which are Borel sets of infinite rank |
| 347 | -- | 386 | Dietrich Kuske. Towards a language theory for infinite N-free pomsets |
| 387 | -- | 412 | Kjell Lemström, Lauri Hella. Approximate pattern matching and transitive closure logics |
| 413 | -- | 438 | Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer. Presburger liveness verification of discrete timed automata |
| 439 | -- | 450 | Leah Epstein, Rob van Stee. Lower bounds for on-line single-machine scheduling |
| 451 | -- | 475 | Michaël Rusinowitch, Mathieu Turuani. Protocol insecurity with a finite number of sessions, composed keys is NP-complete |
| 477 | -- | 493 | Francesca Fiorenzi. Cellular automata and strongly irreducible shifts of finite type |
| 495 | -- | 508 | Shankara Narayanan Krishna, Raghavan Rama. Breaking DES using P systems |
| 509 | -- | 521 | Bruce W. Watson. A new regular grammar pattern matching algorithm |
| 523 | -- | 535 | Bruno Durand, Enrico Formenti, Zsuzsanna Róka. Number-conserving cellular automata I: decidability |
| 537 | -- | 584 | Lars Engebretsen, Jonas Holmerin. Towards optimal lower bounds for clique and chromatic number |
| 585 | -- | 602 | Alain Giorgetti. An asymptotic study for path reversal |
| 603 | -- | 631 | Marcel Wild. Idempotent and co-idempotent stack filters and min-max operators |
| 633 | -- | 662 | Henning Fernau, Markus Holzer, Rudolf Freund. Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k |
| 663 | -- | 685 | Alexander Okhotin. On the closure properties of linear conjunctive languages |
| 687 | -- | 706 | Oscar H. Ibarra, Zhe Dang. Eliminating the storage tape in reachability constructions |
| 707 | -- | 718 | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook. On finding common neighborhoods in massive graphs |
| 719 | -- | 734 | Michael U. Gerber, Daniel Kobler. Algorithms for vertex-partitioning problems on graphs with fixed clique-width |
| 735 | -- | 741 | Pierre-Cyrille Héam. Some complexity results for polynomial rational expressions |
| 743 | -- | 749 | Y. J. Liu. Regular component decomposition of regular languages |
| 751 | -- | 761 | Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri. The minimum broadcast range assignment problem on linear multi-hop wireless networks |
| 763 | -- | 774 | Wojciech Rytter. On maximal suffixes, constant-space linear-time versions of KMP algorithm |
| 775 | -- | 783 | Pedro García, José Ruiz, Manuel Vazquez de Parga. Bilateral locally testable languages |
| 785 | -- | 794 | Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil. PC grammar systems with five context-free components generate all recursively enumerable languages |