Volume 57, Number 1, 15 January 1996
: A Note on ``A Simplified Account of Polymorphic References''.
, Kouichi Sakurai
: A Short Certificate of the Number of Universal Optimal Strategies for Stopping Simple Stochastic Games.
: Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates.
Volume 57, Number 2, 29 January 1996
: A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law.
: An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata.
: A Lower Bound for Communication in the Crossbar.
Volume 57, Number 3, 12 February 1996
: A Note on the Monotone Complexity of 2-REF.
: New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
Volume 57, Number 4, 26 February 1996
Volume 57, Number 5, 11 March 1996
: A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees.
: More on BPP and the Polynomial-Time Hierarchy.
Thomas W. Cusick
: Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion.
Volume 57, Number 6, 25 March 1996
: On the Computational Complexity of Graph Closures.
: A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs.
: A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm.
: An Note on Finding Compact Sets in Graphs Represented by an Adjacency List.