Volume 53, Number 1, 13 January 1995
: On a Question About Learning Nearly Minimal Programs.
: On Key Agreement Protocols Based on Tamper-Proof Hardware.
Volume 53, Number 2, 27 January 1995
S. T. Fischer
: A Note on the Complexity of Local Search Problems.
Volume 53, Number 3, 10 February 1995
: Mapping a Functional Notation for Parallel Programs Onto Hypercubes.
Volume 53, Number 4, 24 February 1995
: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph.
: Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems.
: Corrigendum: Semi-Unification of Two Terms in Abelian Groups.
Volume 53, Number 5, 10 March 1995
: Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.
Robert I. Davis
, Alan Burns
: Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems.
: Topological Properties of the Directional Hypercube.
Volume 53, Number 6, 24 March 1995
: A Note on the Power of Majority Gates and Modular Gates.
Rutger M. Dijkstra
: An Experiment With the Use of Predicate Transformers in UNITY.
: An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1.
: The Weakest Deadlock-Preserving Congruence.
: A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions.