Volume 25, Number 1, February 1996
: A Fast Derandomization Scheme and Its Applications.
Volume 25, Number 2, April 1996
Volume 25, Number 3, June 1996
, Ron Shamir
: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques.
Volume 25, Number 4, August 1996
: An Efficient Parallel Algorithm for the Martix-Chain-Product Problem.
Volume 25, Number 5, October 1996
: On Point Location and Motion Planning among Simplices.
Volume 25, Number 6, December 1996
: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets.
, Nimrod Megiddo
: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions.
: Lower Bounds for Geometrical and Physical Problems.
: On Unapproximable Versions of NP-Complete Problems.
Hans L. Bodlaender
: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth.
, Luca Gemignani
: Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices.