The SCEAS System
Navigation Menu

Journals in DBLP

ITA
1996, volume: 30, number: 6

  1. Nguyen Huong Lam
    On Codes Having no Finite Completion. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:483-493 [Journal]
  2. L. Dubuc
    Les automates circulaires biaisés vérifient la conjecture de Cerný. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:495-505 [Journal]
  3. Markus E. Nebel
    Digital Search Trees with Keys of Variable Length. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:507-520 [Journal]
  4. Dany Breslauer, Leszek Gasieniec
    Efficient String Matching on Packed Texts. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:521-544 [Journal]
  5. Rainer Kemp
    On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:545-561 [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