Journals in DBLP

Inf. Process. Lett.
1986, volume: 23, number: 6

1. Ernst L. Leiss
   The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Database. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:275-279 [Journal]
   
2. M. Benois, Jacques Sakarovitch
   On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:281-287 [Journal]
   
3. Herbert Edelsbrunner, Emo Welzl
   Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:289-293 [Journal]
   
4. Alain J. Martin
   A New Generalization of Dekker's Algorithm for Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:295-297 [Journal]
   
5. Leszek Holenderski
   The Correctness of Nondeterministic Programs Revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:299-303 [Journal]
   
6. Lloyd Allison, Trevor I. Dix
   A Bit-String Longest-Common-Subsequence Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:305-310 [Journal]
   
7. Kwang-Moo Choe, C. H. Chang
   Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:311-316 [Journal]
   
8. Frank Harary, Peter J. Slater
   A Linear Algorithm for the Cutting Center of a Tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:317-319 [Journal]
   
9. Richard B. Kieburtz
   When Chasing Your Tail Saves Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:6, pp:321-324 [Journal]
   
10. Ikuo Nakata, Masataka Sassa
    L-Attributed LL(1)-Grammars are LR-Attributed. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:6, pp:325-328 [Journal]