Journals in DBLP

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

1. Jerzy R. Nawrocki
   Contiguous Segmentation with Limited Compacting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:57-62 [Journal]
   
2. Michael J. Magazine
   Optimality of Intuitive Checkpointing Policies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:63-66 [Journal]
   
3. Man-tak Shing
   Optimum Ordered Bi-Weighted Binary Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:67-70 [Journal]
   
4. Jozef Vyskoc
   A Note on the Power of Integer Division. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:71-72 [Journal]
   
5. Po Tong, Eugene L. Lawler
   A Faster Algorithm for Finding Edge-Disjoint Branchings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:73-76 [Journal]
   
6. Adi Shamir
   Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:77-79 [Journal]
   
7. Dan E. Willard
   Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). [Citation Graph (4, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:81-84 [Journal]
   
8. Youichi Kobuchi
   Stability of Desynchronized 0L Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:85-90 [Journal]
   
9. Paul De Bra, Jan Paredaens
   An Algorithm for Horizontal Decompositions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:2, pp:91-95 [Journal]
   
10. Alan A. Bertossi
    Finding Hamiltonian Circuits in Proper Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:2, pp:97-101 [Journal]
    
11. Amir Schorr
    Physical Parallel Devices are not Much Faster than Sequential Ones. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:2, pp:103-106 [Journal]