
Journals in DBLP
 ErnstErich Doberkat
Factoring stochastic relations. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:161166 [Journal]
 Valerio Freschi, Alessandro Bogliolo
Longest common subsequence between runlengthencoded strings: a new algorithm with improved parallelism. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:167173 [Journal]
 Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, S. K. Kim
A simple algorithm for the constrained sequence problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:175179 [Journal]
 James F. Korsh, Paul LaFollette
Constant time generation of derangements. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:181186 [Journal]
 Alexandros V. Gerbessiotis, Constantinos J. Siniolakis
Probabilistic integer sorting. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:187193 [Journal]
 Harumichi Nishimura, Tomoyuki Yamakami
Polynomial time quantum computation with advice. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:195204 [Journal]
 Nicholas J. A. Harvey, J. Ian Munro
Deterministic SkipNet. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:205208 [Journal]
 Guy Melançon, Fabrice Philippe
Generating connected acyclic digraphs uniformly at random. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:4, pp:209213 [Journal]
