Journals in DBLP
Jan Holub Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1071-1073 [Journal ] Amihood Amir Theoretical issues of searching aerial photographs: a bird's eye view. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1075-1097 [Journal ] Abdullah N. Arslan , Ömer Egecioglu Algorithms For The Constrained Longest Common Subsequence Problems. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1099-1109 [Journal ] Luigi Cinque , Sergio De Agostino , Franco Liberati , Bart J. Westgeest A simple lossless compression heuristic for grey scale images. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1111-1119 [Journal ] Marc Fontaine , Stefan Burkhardt , Juha Kärkkäinen Bdd-based analysis of gapped q-gram Filters. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1121-1134 [Journal ] Frantisek Franek , William F. Smyth Sorting suffixes of two-pattern strings. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1135-1144 [Journal ] Costas S. Iliopoulos , James A. M. McHugh , Pierre Peterlongo , Nadia Pisanti , Wojciech Rytter , Marie-France Sagot A first approach to finding common motifs with gaps. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1145-1154 [Journal ] Shunsuke Inenaga , Ayumi Shinohara , Masayuki Takeda A fully compressed pattern matching algorithm for simple collage systems. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1155-1166 [Journal ] Yair Kaufman , Shmuel T. Klein Semi-lossless text compression. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1167-1178 [Journal ] Alban Mancheron , Christophe Moan Combinatorial characterization of the language recognized by factor and suffix oracles. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1179-1191 [Journal ] Ernest Ketcha Ngassam , Bruce W. Watson , Derrick G. Kourie A framework for the dynamic implementation of finite automata for performance enhancement. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1193-1206 [Journal ] Jan Supol , Borivoj Melichar Arithmetic coding in parallel. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1207-1217 [Journal ] Uli Laube , Maik Weinard Conditional inequalities and the shortest common superstring problem. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1219-1230 [Journal ] Lili Zhang , Francine Blanchet-Sadri Algorithms for approximate k-covering of strings. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1231-1251 [Journal ] Jean-Marc Champarnaud , Fabien Coulon Enumerating nondeterministic automata for a given language without constructing the canonical automaton. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1253-1266 [Journal ] Giorgio Ausiello , Cristina Bazgan , Marc Demange , Vangelis Th. Paschos Completeness in differential approximation classes. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1267-1295 [Journal ] N. Variyam Vinodchandran Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1297-1308 [Journal ]