Journals in DBLP

Inf. Process. Lett.
1983, volume: 16, number: 5

1. Edsger W. Dijkstra, W. H. J. Feijen, A. J. M. van Gasteren
   Derivation of a Termination Detection Algorithm for Distributed Computations. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:217-219 [Journal]
   
2. Andrzej Duda
   The Effects of Checkpointing on Program Execution Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:221-229 [Journal]
   
3. Arturo Carpi
   On the Size of a Square-Free Morphism on a Three Letter Alphabet. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:231-235 [Journal]
   
4. Fionn Murtagh
   Expected-Time Complexity Results for Hierarchic Clustering Algorithms Which Use Cluster Centres. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:237-241 [Journal]
   
5. Kazumasa Ozawa
   Considerations on the Similarity Measures Between Index Terms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:243-246 [Journal]
   
6. Jacques Cohen
   A Note on a Fast Algorithm for Sparse Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:247-248 [Journal]
   
7. John Zahorjan, Barbara J. Bell, Kenneth C. Sevcik
   Estimating Block Transfers When Record Access Probabilities are Non-Uniform. [Citation Graph (6, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:249-252 [Journal]
   
8. Robert Endre Tarjan
   Updating a Balanced Search Tree in O(1) Rotations. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:253-257 [Journal]
   
9. Hans-Peter Kriegel, Y. S. Kwong
   Insertion-Safeness in Balanced Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:16, n:5, pp:259-264 [Journal]
   
10. Rudolf Freund
    Init and Anf Operating on omega-Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:5, pp:265-269 [Journal]