Volume 53, Number 1, August 1996
Narayan Vikas:
An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism. 1-9 Frank Drewes:
Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. 33-66 Detlef Sieling:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. 79-87 Feng Gao:
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures. 112-128 Harold N. Gabow,
Ying Xu:
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. 129-147 Paul F. Dietz:
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets. 148-152
Volume 53, Number 2, October 1996
Eighth Annual Conference on Structure in Complexity Theory 1993
Ninth Annual Conference on Structure in Complexity Theory 1994
Gábor Tardos:
Multi-prover Encoding Schemes and Three-prover Proof Systems. 251-260 Manindra Agrawal:
On the Isomorphism Conjecture for Weak Reducibilities. 267-282 Richard Chang:
On the Query Complexity of Clique Size and Maximum Satisfiability. 298-313
Volume 53, Number 3, December 1996
ACM Symposium on Parallel Algorithms and Architectures June 27-29, 1994
Hisao Tamaki:
Construction of the Mesh and the Torus Tolerating a Large Number of Faults. 371-379 Mauro Leoncini:
On the Parallel Complexity of Gaussian Elimination with Pivoting. 380-394 Shay Halperin,
Uri Zwick:
An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. 395-416 Sanjay Jain:
Program Synthesis in the Presence of Infinite Number of Inaccuracies. 583-591
maintained by

, founded at
