scientific article; zbMATH DE number 3581610

MaRDI QIDQ4151157zbMATH OpenFDO

Authors Richard P. Brent

Publication date 1976

zbMATH Keywords

binary Euclidean algorithmcontinuous modelexpected number of iterationsproblem: existence of the limiting distribution

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Limit theorems in probability theory (60F99) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1186933
• scientific article; zbMATH DE number 1222534
• On the asymptotic analysis of the Euclidean algorithm
• Analysis of fast versions of the Euclid algorithm
• scientific article; zbMATH DE number 1254258
• scientific article; zbMATH DE number 2154292
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• Publication:4508390
• scientific article; zbMATH DE number 799776
• Analysis of a left-shift binary GCD algorithm

Cited in

(22)

• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• A systolic algorithm for extended GCD computation
• Computing GCD's by normalized division
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• Dynamical analysis of a class of Euclidean algorithms.
• Combinatorial and arithmetical properties of linear numeration systems
• On the complexity of real root isolation using continued fractions
• New binary Euclidean algorithms
• scientific article; zbMATH DE number 4006333 (Why is no real title available?)
• scientific article; zbMATH DE number 4031770 (Why is no real title available?)
• scientific article; zbMATH DE number 1186933 (Why is no real title available?)
• scientific article; zbMATH DE number 2154292 (Why is no real title available?)
• scientific article; zbMATH DE number 799776 (Why is no real title available?)
• scientific article; zbMATH DE number 7368168 (Why is no real title available?)
• Analysis and geometry of a GCD-algorithm
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
• Probabilistic analyses of the plain multiple gcd algorithm
• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
• Analysis of Euclidean algorithms for polynomials over finite fields
• On the asymptotic analysis of the Euclidean algorithm
• Existence of a limiting distribution for the binary GCD algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151157)