Analysis and geometry of a GCD-algorithm

MaRDI QIDQ5493825zbMATH OpenFDO

Authors Gerhard Ramharter

Publication date 16 October 2006

zbMATH Keywords

Euclidean type algorithmlattice polygonssemiregular continued fraction expansion

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Continued fractions and generalizations (11J70) Metric theory of continued fractions (11K50) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Analysis of generalized continued fraction algorithms over polynomials
• Analysis of the Brun GCD algorithm
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• scientific article; zbMATH DE number 3581610
• Analysis of fast versions of the Euclid algorithm

Cited in

(6)

• Satins, lattices, and extended Euclid's algorithm
• Analysis of the Brun GCD algorithm
• scientific article; zbMATH DE number 4137244 (Why is no real title available?)
• scientific article; zbMATH DE number 4127290 (Why is no real title available?)
• scientific article; zbMATH DE number 2154292 (Why is no real title available?)
• The Lyapunov tortoise and the dyadic hare

This page was built for publication: Analysis and geometry of a GCD-algorithm

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