EDITORS' FOREWORD
Bounds on the Greedy Routing Algorithm for Array Networks
Improved Parity-Declustered Layouts for Disk Arrays
List Ranking and List Scan on the CRAYC90
Dynamic Load Balancing by Random Matchings
Construction of the Mesh and the Torus Tolerating a Large Number of Faults
On the Parallel Complexity of Gaussian Elimination with Pivoting
An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM
Efficient Low-Contention Parallel Algorithms
An Optimal Predicate Locking Scheduler
A Threshold for Unsatisfiability
Maximal and Minimal Solutions to Language Equations
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
kOne-Way Heads Cannot Do String-Matching
River Routing with a Generalized Model
On Completeness under Random Reductions
Regular Description of Context-free Graph Languages
Partition Triples: A Tool for Reduction of Data Sets
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Author Index for Volume 53