Journals in DBLP

Inf. Process. Lett.
1983, volume: 17, number: 1

1. M. C. Er
   Computing Sums of Order-k Fibonacci Numbers in Log Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:1-5 [Journal]
   
2. Michael Willett
   Trapdoor Knapsacks Without Superincreasing Structure. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:7-11 [Journal]
   
3. Francesca Cesarini, Giovanni Soda
   An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:13-16 [Journal]
   
4. Ronald C. Richards
   Shape Distribution of Height-Balanced Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:17-20 [Journal]
   
5. Henry Tirri
   Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:21-27 [Journal]
   
6. Manfred Broy
   Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:29-35 [Journal]
   
7. Robert Endre Tarjan
   An Improved Algorithm for Hierarchical Clustering Using Strong Components. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:37-41 [Journal]
   
8. S. P. Rana
   A Distributed Solution of the Distributed Termination Problem. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:43-46 [Journal]
   
9. M. Howard Williams
   Is an Exit Statement Sufficient? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:1, pp:47-51 [Journal]
   
10. Cornelius Croitoru, Emilian Suditu
    Perfect Stables in Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:1, pp:53-56 [Journal]