The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
2005, volume: 16, number: 6

  1. Jan Holub
    Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1071-1073 [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002