Optimal simulations between mesh-connected arrays of processors.
Finding a maximum-genus graph imbedding.
The coloring and maximum independent set problems on planar perfect graphs.
A mechanical proof of the Church-Rosser theorem.
The physical mapping problem for parallel architectures.
Stability of binary exponential backoff.
Busy periods for subnetworks in stochastic networks: mean value analysis.
A nonlinear lower bound for random-access machines under logarithmic cost.
On the power of one-way communication.
Fast algorithms for N-dimensional restrictions of hard problems.
The parallel complexity of exponentiating polynomials over finite fields.
The reduction of perturbed Markov generators: an algorithm exposing the role of transient states.
Some distributions that allow perfect packing.
Nonconstructive tools for proving polynomial-time decidability.