Volume 56, Number 1, 13 October 1995
: Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach.
: A Real-Time Algorithm for the (n²-1)-Puzzle.
: The Parallel Complexity of Integer Prefix Summation.
Volume 56, Number 2, 27 October 1995
Thomas W. Cusick
: Cryptanalysis of a Public Key System Based on Diophantine Equations.
Y. Daniel Liang
: Steiner Set and Connected Domination in Trapezoid Graphs.
: Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.
Volume 56, Number 3, 10 November 1995
: Multiple Quickselect - Hoare's Find Algorithm for Several Elements.
: An Attack on the Needham-Schroeder Public-Key Authentication Protocol.
: Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates.
Volume 56, Number 4, 24 November 1995
: A Negative Answer to a Question of Wilke on Varieties of \omega-Languages.
: A Parallel Algorithm for Nearly Optimal Edge Search.
Volume 56, Number 5, 5 December 1995
: A Note on Fine Covers and Iterable Factors of VAS Languages.
: A Note on Neural Sorting Networks with O(1) Time Complexity.
: A Better Subgraph of the Minimum Weight Triangulation.
Juan Miguel Vilar
: Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm.
Volume 56, Number 6, 22 December 1995
: Representations and Complete Semiring Morphisms.
: The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph.
: Succinct Iterative Characterizations of Primitive Computable Unary Functions.
Nader H. Bshouty
: On the Additive Complexity of 2 x 2 Matrix Multiplication.
: A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order.
: An Improvement on Parallel Computation of a Maximal Matching.