Volume 39, Number 1, 12 July 1991
Volume 39, Number 2, 31 July 1991
: Private vs. Common Random Bits in Communication Complexity.
: Fast One's-Complement Multiplication.
: A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.
: Fault-Tolerant Parallel k Selection Algorithm in n-Cube Networks.
Volume 39, Number 3, 16 August 1991
: A Simple Algorithm for Determining the Envelope of a Set of Lines.
: The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank.
: Order Independent NCE Grammars Recognized in Polynomial Time.
Volume 39, Number 4, 30 August 1991
: Inductive Inference from all Positive and Some Negative Data.
: Randomized Optimal Algorithm for Slope Selection.
Volume 39, Number 5, 13 September 1991
Abhay K. Parekh
: Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs.
Jae Dong Yang
, Yoon-Joon Lee
: A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values.
Volume 39, Number 6, 27 September 1991
: A Special Case of the Dynamization Problem for Least Cost Paths.
: Characterizing Parallel Hierarchies by Reducibilities.
Rodney R. Howell
: The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.
: Derivation of Logic Programs by Functional Methods.