Journals in DBLP

Inf. Process. Lett.
1997, volume: 63, number: 1

1. Richard S. Bird, Jesús N. Ravelo
   On Computing Representatives. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:1-7 [Journal]
   
2. Enrico Nardelli, Vincenzo Mastrobuoni, Alesiano Santomo
   On building the Transitive Reduction of a Two-Dimensional Poset. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:9-12 [Journal]
   
3. Hon-Chan Chen, Yue-Li Wang
   A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:13-18 [Journal]
   
4. Chin-Chen Chang, Shin-Jia Hwang
   A Simple Approach for Generating RSA Keys. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:19-21 [Journal]
   
5. Paola Flocchini, Bernard Mans, Nicola Santoro
   On the Impact of Sense of Direction on Message Complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:23-31 [Journal]
   
6. Eric T. Bax, Joel Franklin
   A Permanent Formula with Many Zero-Valued Terms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:33-39 [Journal]
   
7. Marten van Dijk
   More Information Theoretical Inequalities to be Used in Secret Sharing? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:41-44 [Journal]
   
8. Zoran Ivkovic, Errol L. Lloyd
   Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:45-50 [Journal]
   
9. Jiri Sgall
   A Lower Bound for Randomized On-Line Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:1, pp:51-55 [Journal]