Volume 52, Number 1, 1982
: On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages.
Robert I. Soare
: Computational Complexity of Recursively Enumerable Sets.
Alan L. Selman
: Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity.
Robert P. Daley
: Busy Beaver Sets: Characterizations and Applications.
: Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs.
Volume 52, Number 2, 1982
: A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata.
Volume 52, Number 3, 1982