Journals in DBLP

Inf. Process. Lett.
1986, volume: 22, number: 5

1. Peter T. Highnam
   Optimal Algorithms for Finding the Symmetries of a Planar Point Set. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:219-222 [Journal]
   
2. Shaunak Pawagi, I. V. Ramakrishnan
   An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:223-229 [Journal]
   
3. Ming Li, Yaacov Yesha
   String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:231-235 [Journal]
   
4. J. B. Evans
   Experiments with Trees of the Storage and Retrieval of Future Events. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:237-242 [Journal]
   
5. Gopal K. Gupta, B. Srinivasan
   Approximate Storage Utilization of B-Trees. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:243-246 [Journal]
   
6. Paul Bourret, R. Souza de Oliveira
   Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:247-253 [Journal]
   
7. Herbert J. Bernstein
   Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:255-260 [Journal]
   
8. Arthur M. Keller
   Set-Theoretic Problems of Null Completion in Relational Databases. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:261-265 [Journal]
   
9. Yannis Manolopoulos
   Batched Search of Index Sequential Files. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:5, pp:267-272 [Journal]
   
10. Timo O. Alanko, R. L. Smelianski
    On the Calculation of Control Transition Probabilities in a Program. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:5, pp:273-276 [Journal]