ANU Computer Science Technical Reports

1982

TR-CS-82-16

D. Sachse-Åkerlind.
Anomalous algorithms and provable complexity properties.
December 1982.

TR-CS-82-15

R.P. Brent, H.T. Kung, and F.T. Luk.
Some linear-time algorithms for systolic arrays.
December 1982.

TR-CS-82-14

J.M. Robson.
The complexity of GO.
October 1982.

TR-CS-82-13

A. P. Paplinski.
On serial algorithms for exponential and logarithmic functions.
July 1982.

TR-CS-82-12

J. M. Robson.
N by N checkers is exptime complete.
August 1982.

TR-CS-82-11

R.P. Brent and H.T. Kung.
A systolic algorithm for integer GCD computation.
December 1982.
Revised April 1984.

TR-CS-82-10

Richard P. Brent and Franklin T. Luk.
A systolic architecture for almost linear-time solution of the symmetric Eigenvalue problem.
September 1982.