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