169 | -- | 223 | Charles A. Stewart. Reducibility between Classes of Port Graph Grammar |
224 | -- | 256 | Atsuyoshi Nakamura, Naoki Abe. Online Learning of Binary and n-ary Relations over Clustered Domains |
257 | -- | 277 | Vikraman Arvind, Johannes Köbler. New Lowness Results for ZPPNP and Other Complexity Classes |
278 | -- | 294 | Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa. Some Decision Problems Concerning Semilinearity and Commutation |
295 | -- | 331 | Dan E. Willard. An Algorithm for Handling Many Relational Calculus Queries Efficiently |
332 | -- | 350 | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter. On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts |
351 | -- | 376 | Konstantin Skodinis, Egon Wanke. Node Replacements in Embedding Normal Form |
377 | -- | 392 | Juha Honkala. The Equivalence Problem for DF0L Languages and Power Series |
393 | -- | 414 | Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang. Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds |
415 | -- | 438 | Llew Mason, Peter L. Bartlett, Mostefa Golea. Generalization Error of Combined Classifiers |