scientific article; zbMATH DE number 1263309

zbMath0921.11074MaRDI QIDQ4234183

Tudor Jebelean

Publication date: 16 March 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

binary algorithmsystolic algorithmssystolic parallelizationGCD of multiprecision integersmodular conjugates

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (10)

An approximating \(k\)-ary GCD algorithm ⋮ Improvements on the accelerated integer GCD algorithm ⋮ Jebelean-Weber's algorithm without spurious factors ⋮ A modular reduction for GCD computation. ⋮ An effective programming of GCD algorithms for natural numbers ⋮ Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ A parallel extended GCD algorithm ⋮ The Mixed Binary Euclid Algorithm ⋮ Worst-case analysis of Weber's GCD algorithm

This page was built for publication: