Volume 58, Number 1, 8 April 1996
: Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic.
: A Note on a Theorem of Barrington, Straubing and Thérien.
Richard J. Lipton
: On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory.
: On Path Equivalence of Nondeterministic Finite Automata.
Volume 58, Number 2, 22 April 1996
: Unambiguous Description of Chain Code Picture Languages.
Volume 58, Number 3, 13 May 1996
B. S. Panda
: New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs.
, Yoon-Joon Lee
: Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries.
: A Unified Linear-Time Algorithm for Computing Distance Maps.
: Branching Bisimilarity is an Equivalence Indeed!
Volume 58, Number 4, 27 May 1996
: Strong Normalization for Non-Structural Subtyping via Saturated Sets.
: Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties.
: The State Complexity of \Sigma * L and its Connection with Temporal Logic.
: Yield-Languages of Two-Way Pushdown Tree Automata.
Volume 58, Number 5, 10 June 1996
: Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems.
Volume 58, Number 6, 24 June 1996
: Minimum Area Joining of k Compacted Cells.
: Codes, Simplifying Words, and Open Set Condition.
: Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time (Erratum).