Journals in DBLP

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

1. Ivan Lavallée, Gérard Roucairol
   A Fully Distributed (Minimal) Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:55-62 [Journal]
   
2. Alberto Apostolico
   Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:63-69 [Journal]
   
3. Hans Rohnert
   Shortest Paths in the Plane with Convex Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:71-76 [Journal]
   
4. Rob R. Hoogerwoord
   An Implementation of Mutual Inclusion. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:77-80 [Journal]
   
5. Wojciech Rytter
   An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:81-84 [Journal]
   
6. Janusz W. Laski
   An Algorithm for the Derivation of Codefinitions in Computer Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:85-90 [Journal]
   
7. J. K. Annot, M. D. Janssens, A. J. van de Goor
   Comments on Morris's Starvation-Free Solution to the Mutual Exclusion Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:91-97 [Journal]
   
8. Simeon C. Ntafos
   On Gallery Watchmen in Grids. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:99-102 [Journal]
   
9. John V. Franco
   On the Probabilistic Performance of Algorithms for the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:2, pp:103-106 [Journal]
   
10. Bruno Codenotti, Grazia Lotti
    Area-Time Tradeoffs for Bilinear Forms Computations in VLSI. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:2, pp:107-109 [Journal]