Volume 23, Number 1, July 1986
: The Space Complexity of the Unique Decipherability Problem.
: On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees.
Volume 23, Number 2, August 1986
: Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings.
: Shortest Paths in the Plane with Convex Polygonal Obstacles.
: An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages.
Janusz W. Laski
: An Algorithm for the Derivation of Codefinitions in Computer Programs.
John V. Franco
: On the Probabilistic Performance of Algorithms for the Satisfiability Problem.
Volume 23, Number 3, October 1986
O. M. Makarov
: A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 102 Multiplications.
: On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications.
Klaus W. Wagner
: On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages.
: Some Characterizations of Finitely Specifiable Implicational Dependency Families.
Volume 23, Number 4, November 1986
: Towards an Asymptotic Analysis of Karmarkar's Algorithm.
, Shuji Doshita
: Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic.
: Eliminating the Flag in Threaded Binary Search Trees.
Volume 23, Number 5, November 1986
: Denotational Semantics of Communicating Sequential Programs.
Volume 23, Number 6, December 1986
Ernst L. Leiss
: The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Database.
Alain J. Martin
: A New Generalization of Dekker's Algorithm for Mutual Exclusion.
, C. H. Chang
: Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair.