How to share memory in a distributed system.
Using dual approximation algorithms for scheduling problems theoretical and practical results.
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.
On the minimal synchronism needed for distributed consensus.
Electing a leader in a synchronous ring.
Analysis of a composite performance reliability measure for fault-tolerant systems.
Slowing down sorting networks to obtain faster sorting algorithms.
On the Church-Rosser property for the direct sum of term rewriting systems.
Hard examples for resolution.
A logarithmic time sort for linear size networks.
Intersection of convex objects in two and three dimensions.
Dynamic functional dependencies and database aging.