"Cells." . . "Linear arrays." . . . . . . . . "A systolic algorithm for integer GCD computation"@en . . "A systolic algorithm for integer GCD computation" . . . . . . . . . . "A Systolic Algorithm for Integer GCD Computation. Revision"@en . . . "Abstract: \"We show 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 array of O(n) identical systolic cells, each of which is a finite-state machine with connections to its nearest neighbours.\""@en . "A systolic algorithm for interger GCD computation" . . "A systolic algorithm for integer gcd computation" . . . . . "A Systolic Algorithm for Integer GCD computation" . . . . . . . . . . . . "In this document the authors show 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 array of O(n) identical systolic cells, each of which is a finite-state machine with connections to its nearest neighbours. (Author)."@en . "Numbers." . . "Algorithms." . . "Größter gemeinsamer Teiler." . . "Division." . . "Polynomials." . . "Theoretical Mathematics." . . "Algorithmus." . . "Computations." . . "CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE." . . "Electrical and Electronic Equipment." . . . .