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]

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]

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]

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]

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]