Volume 53, Number 1, August 1996
: An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism.
: Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid.
: New Lower Bounds and Hierarchy Results for Restricted Branching Programs.
: Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures.
Harold N. Gabow
, Ying Xu
: Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems.
Paul F. Dietz
: A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets.
Volume 53, Number 2, October 1996
Eighth Annual Conference on Structure in Complexity Theory 1993
Ninth Annual Conference on Structure in Complexity Theory 1994
: Multi-prover Encoding Schemes and Three-prover Proof Systems.
: On the Isomorphism Conjecture for Weak Reducibilities.
: On the Query Complexity of Clique Size and Maximum Satisfiability.
Volume 53, Number 3, December 1996
ACM Symposium on Parallel Algorithms and Architectures June 27-29, 1994
: Construction of the Mesh and the Torus Tolerating a Large Number of Faults.
: On the Parallel Complexity of Gaussian Elimination with Pivoting.
, Uri Zwick
: An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.
: Program Synthesis in the Presence of Infinite Number of Inaccuracies.