Front cover (PDF)

Fast parallel matrix and GCD computations (Abstract)

How to generate cryptographically strong sequences of pseudo random bits (Abstract)

Why and how to establish a private code on a public network (Abstract)

A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem (Abstract)

Storing a sparse table with O(1) worst case access time (Abstract)

'Eventual' is earlier than 'immediate' (Abstract)

A temporal logic to deal with fairness in transition systems (Abstract)

On the movement of robot arms in 2-dimensional bounded regions (Abstract)

Wafer-scale integration of systolic arrays (Abstract)

The ellipsoid algorithm for linear inequalities in exact arithmetic (Abstract)

An old linear programming algorithm runs in polynomial time (Abstract)

Linear-time algorithms for linear programming in R3 and related problems (Abstract)

Author index (PDF)