H. T. Rung

Learn More
It is shown that the greatest common divisor of two n-bit integers (given in the usual binary representation) can be computed in time O(n) on a linear systolic array of O(n) cells. Comments Only the Abstract is given here. The full paper appeared as [3]. The method used is a variant of the binary Euclidean algorithms considered earlier in [1]. For the(More)
  • 1