Journals in DBLP

Inf. Process. Lett.
1975, volume: 4, number: 3

1. Donald B. Johnson
   Priority Queues with Update and Finding Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:53-57 [Journal]
   
2. Doron Rotem
   On a Correspondence Between Binary Trees and a Certain Type of Permutation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:58-61 [Journal]
   
3. Douglas W. Clark
   A Fast Algorithm for Copying Binary Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:62-63 [Journal]
   
4. J. Banerjee, V. Rajaraman
   A Dual Link Data Structure for Random File Organization. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:64-69 [Journal]
   
5. Arthur G. Duncan, Lawrence Yelowitz
   Loop Unravelling: A Practical Tool in Proving Program Correctness. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:70-72 [Journal]
   
6. R. Christensen
   Crossvalidation: Minimizing the Entropy of the Future. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:73-76 [Journal]
   
7. Judea Pearl
   On the Complexity of Inexact Computations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1975, v:4, n:3, pp:77-81 [Journal]