
Journals in DBLP
 Tadao Takaoka
An O(n^{3}loglogn/logn) time algorithm for the allpairs shortest path problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:5, pp:155161 [Journal]
 Walter A. Burkhard
Double hashing with passbits. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:5, pp:162166 [Journal]
 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:167174 [Journal]
 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:175177 [Journal]
 Gonzalo Navarro, Nieves R. Brisaboa
New bounds on Dary optimal codes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:5, pp:178184 [Journal]
 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:185191 [Journal]
