|
Journals in DBLP
- Arnaud Lefebvre, Thierry Lecroq
Compror: On-line lossless data compression with a factor oracle. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:1-6 [Journal]
- Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu
Bundle event structures: A revised cpo approach. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:7-12 [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:13-16 [Journal]
- Ingo Wegener
A simplified correctness proof for a well-known algorithm computing strongly connected components. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:17-19 [Journal]
- Atsushi Sasaki
A time-optimal distributed sorting algorithm on a line network. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:21-26 [Journal]
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger
Lower bounds on precedence-constrained scheduling for parallel processors. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:27-32 [Journal]
- Amihood Amir, Moshe Lewenstein, Ely Porat
Approximate swapped matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:33-39 [Journal]
- Maharaj Mukherjee, Kanad Chakraborty
A polynomial-time 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:41-48 [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:49-55 [Journal]
|