
Journals in DBLP
 Arnaud Lefebvre, Thierry Lecroq
Compror: Online lossless data compression with a factor oracle. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:16 [Journal]
 Harald Fecher, Mila E. MajsterCederbaum, Jinzhao Wu
Bundle event structures: A revised cpo approach. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:712 [Journal]
 Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
On a game in directed graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:1316 [Journal]
 Ingo Wegener
A simplified correctness proof for a wellknown algorithm computing strongly connected components. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:1719 [Journal]
 Atsushi Sasaki
A timeoptimal distributed sorting algorithm on a line network. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:2126 [Journal]
 Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
Lower bounds on precedenceconstrained scheduling for parallel processors. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:2732 [Journal]
 Amihood Amir, Moshe Lewenstein, Ely Porat
Approximate swapped matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:3339 [Journal]
 Maharaj Mukherjee, Kanad Chakraborty
A polynomialtime optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:4148 [Journal]
 Haengrae Cho
Database recovery using incomplete page versions in a multisystem data sharing environment. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:4955 [Journal]
