Journals in DBLP

Inf. Process. Lett.
1997, volume: 61, number: 4

1. Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung
   Faithful 1-Edge Fault Tolerant Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:173-181 [Journal]
   
2. Martin Henk
   Note on Shortest and Nearest Lattice Vectors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:183-188 [Journal]
   
3. Patrizio Cintioli, Riccardo Silvestri
   Revisiting a Result of Ko. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:189-194 [Journal]
   
4. Paolo Dell'Olmo, Stefano Giordani, Maria Grazia Speranza
   An Approximation Result for a Duo-Processor Task Scheduling Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:195-200 [Journal]
   
5. Mark J. Encarnación
   Black-Box Polynomials Resultants. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:201-204 [Journal]
   
6. Frédéric Roupin
   On Approximating the Memory-Constrained Module Allocation Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:205-208 [Journal]
   
7. Sung-Mo Park, Sangjin Lee, Soo Hak Sung, Kwangjo Kim
   Improving Bounds for the Number of Correlation Immune Boolean Functions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:209-212 [Journal]
   
8. Ying Choi, Tak Wah Lam
   Dynamic Suffix Tree and Two-Dimensional Texts Management. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:213-220 [Journal]
   
9. Priyalal Kulasinghe
   Connectivity of the Crossed Cube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:61, n:4, pp:221-226 [Journal]