Journals in DBLP

Int. J. Found. Comput. Sci.
2006, volume: 17, number: 6

1. Jan Holub
   Foreword. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1233-1234 [Journal]
   
2. Domenico Cantone, Simone Faro
   A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1235-1252 [Journal]
   
3. Loek G. Cleophas, Kees Hemerik, Gerard Zwaan
   Two Related Algorithms for Root-to-frontier Tree Pattern Matching. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1253-1272 [Journal]
   
4. Sergio De Agostino
   Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1273-1280 [Journal]
   
5. Frantisek Franek, William F. Smyth
   Reconstructing a Suffix Array. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1281-1296 [Journal]
   
6. Shmuel T. Klein, Dana Shapira
   Compressed Pattern Matching in Jpeg Images. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1297-1306 [Journal]
   
7. Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie
   Dynamic Allocation of Finite Automata States for Fast String Recognition. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1307-1324 [Journal]
   
8. Heikki Hyyrö, Gonzalo Navarro
   Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1325-1344 [Journal]
   
9. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
   Flexible Music Retrieval in Sublinear Time. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1345-1364 [Journal]
   
10. Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen
    A Simple Alphabet-independent Fm-index. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1365-1384 [Journal]
    
11. Élise Prieur, Thierry Lecroq
    From Suffix Trees to Suffix Vectors. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1385-1402 [Journal]
    
12. Joseph K. Liu, Duncan S. Wong
    Enhanced Security Models and a Generic Construction Approach for Linkable Ring Signature. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1403-1422 [Journal]
    
13. Michel Paquette, Andrzej Pelc
    Fast Broadcasting with Byzantine Faults. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1423-1440 [Journal]
    
14. Shuguang Li, Guojun Li, Xingqin Qi
    Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1441-1454 [Journal]
    
15. Amr Elmasry
    A Priority Queue with the Working-set Property. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1455-1466 [Journal]
    
16. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1467-1484 [Journal]