Journals in DBLP

Inf. Process. Lett.
2005, volume: 93, number: 4

1. Mirtha-Lina Fernández
   On proving C_E-termination of rewriting by size-change termination. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:155-162 [Journal]
   
2. Alexander Thomasian
   Reconstruct versus read-modify writes in RAID. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:163-168 [Journal]
   
3. Andrzej Lingas, Martin Wahlen
   A note on maximum independent set and related problems on box graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:169-171 [Journal]
   
4. Minghui Jiang
   UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:173-175 [Journal]
   
5. Jun-Ho Her, R. S. Ramakrishna
   External-memory depth-first search algorithm for solid grid graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:177-183 [Journal]
   
6. Nathan Segerlind
   Exponential separation between Res(k) and Res(k+1) for k leq varepsilonlogn. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:185-190 [Journal]
   
7. Mingyan Li, Radha Poovendran, David A. McGrew
   Minimizing center key storage in hybrid one-way function based group key management with communication constraints. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:191-198 [Journal]
   
8. Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
   Ideal contrast visual cryptography schemes with reversing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:4, pp:199-206 [Journal]