scientific article; zbMATH DE number 1186933

MaRDI QIDQ3840152zbMATH OpenFDO

Authors Brigitte Vallée

Publication date 7 March 1999

zbMATH Keywords

complexitycontinued fractionsEuclidean algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Continued fraction calculations (number-theoretic aspects) (11Y65)

Recommendations

• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
• scientific article; zbMATH DE number 3581610
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• New binary Euclidean algorithms
• On the asymptotic analysis of the Euclidean algorithm

Cited in

(10)

• Partial evaluation of the Euclidean algorithm, revisited
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm
• Maximum number of steps taken by modular exponentiation and Euclidean algorithm
• New binary Euclidean algorithms
• scientific article; zbMATH DE number 3581610 (Why is no real title available?)
• scientific article; zbMATH DE number 7368168 (Why is no real title available?)
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• A rigorous version of R. P. Brent's model for the binary 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 Q3840152)