Volume 12, Number 1, February 1983
John H. Reif
: Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time.
Gerald E. Peterson
: A Technique for Establishing Completeness Results in Theorem Proving with Equality.
Hans F. de Groote
: Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties.
: Simple Construction for Multi-Terminal Network Flow Synthesis.
Arthur C. Fleck
, R. S. Limaye
: Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms.
Volume 12, Number 2, May 1983
: The Equivalence of Two Semantic Definitions: A Case Study in LCF.
: Computing Rational Zeros of Integral Polynomials by p-adic Expansion.
: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines.
: Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions.
: Towards a Genuinely Polynomial Algorithm for Linear Programming.
Jan A. Bergstra
, J. V. Tucker
: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.
Volume 12, Number 3, August 1983
: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets.
David M. Choy
, C. K. Wong
: Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval.
: Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets.
Peter A. Bloniarz
: A Shortest-Path Algorithm with Expected Time O(n2 log n log* n).
Volume 12, Number 4, November 1983
John L. Pfaltz
: Convex Clusters in a Discrete m-Dimensional Space.
: Linear-Time Algorithms for Linear Programming in R3 and Related Problems.