The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2005, volume: 96, number: 5

  1. Tadao Takaoka
    An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:155-161 [Journal]
  2. Walter A. Burkhard
    Double hashing with passbits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:162-166 [Journal]
  3. Xianbing Wang, Yong Meng Teo, Jiannong Cao
    A bivalency proof of the lower bound for uniform consensus. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:167-174 [Journal]
  4. Igor Shparlinski, Arne Winterhof
    On the linear complexity of bounded integer sequences over different moduli. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:175-177 [Journal]
  5. Gonzalo Navarro, Nieves R. Brisaboa
    New bounds on D-ary optimal codes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:178-184 [Journal]
  6. Moritz G. Maaß, Johannes Nowak
    A new method for approximate indexing and dictionary lookup with one error. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:185-191 [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