ANU Computer Science Technical Reports

1983

TR-CS-83-09

Christopher J. Lokan.
The use of predicted program behaviour in defining a context-sensitive architecture.
May 1983.

TR-CS-83-08

R.P.Brent and H.T. Kung.
Systolic VLSI arrays for linear-time GCD computation.
May 1983.

TR-CS-83-07

Christopher Lokan.
Static prediction of dynamic program profiles.
May 1983.

TR-CS-83-06

Christopher J. Lokan.
A dynamic analysis of the use of loops and if-statements in Pascal programs.
May 1983.

TR-CS-83-05

Richard P. Brent, Franklin T. Luk, and Charles Van Loan.
Computation of the singular value decomposition using mesh-connected processors.
March 1983.

TR-CS-83-04

Daryel Sachse-Åkerlind.
Relations between complexity classes and provable complexity classes.
February 1983.

TR-CS-83-03

Daryel Sachse-Åkerlind.
Computational complexity and provable equivalence of algorithms.
February 1983.

TR-CS-83-02

Richard P. Brent and Franklin T. Luk.
A systolic array for the linear-time solution of Toeplitz systems of equations.
January 1983.

TR-CS-83-01

editor R. P. Brent.
Research in the Department of Computer Science.
January 1983.