Journals in DBLP
Maxime Crochemore , Costas S. Iliopoulos , Thierry Lecroq Occurrence and Substring Heuristics for i-Matching. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:1-21 [Journal ] Josué Kuri , Gonzalo Navarro , Ludovic Mé Fast Multipattern Search Algorithms for Intrusion Detection. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:23-49 [Journal ] Stefan Burkhardt , Juha Kärkkäinen Better Filtering with Gapped q-Grams. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:51-70 [Journal ] Pierre Nicodème Regexpcount, a symbolic package for counting problems on regular expressions and words. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:71-88 [Journal ] Maxime Crochemore , Costas S. Iliopoulos , Yoan J. Pinzon Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:89-103 [Journal ] Jesper Jansson , Andrzej Lingas A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:105-120 [Journal ] Marie-Pierre Béal , Maxime Crochemore , Filippo Mignosi Computing forbidden words of regular languages. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:121-135 [Journal ] Leszek Gasieniec , Igor Potapov Time/Space Efficient Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:137-154 [Journal ] Foto N. Afrati , Hans Leiß , Michel de Rougemont Definability and Compression. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:155-180 [Journal ] Inbok Lee , Kunsoo Park , Yanghee Choi A Simple and Scalable Algorithm for the IP Address Lookup Problem. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:181-190 [Journal ] Veli Mäkinen Compact Suffix Array -- A Space-Efficient Full-Text Index. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:56, n:1-2, pp:191-210 [Journal ]