Existence of a limiting distribution for the binary GCD algorithm

DOI10.1016/j.jda.2006.03.013zbMath1192.11083arXivmath/0504426OpenAlexW2171220019MaRDI QIDQ924557

Gérard Maze

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0504426

zbMATH Keywords

fixed pointanalysis of algorithmsbinary gcd algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Dynamical systems involving maps of the interval (37E05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

A rigorous version of R. P. Brent's model for the binary Euclidean algorithm

Cites Work

• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• Computational problems associated with Racah algebra
• Dynamical analysis of α-Euclidean algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence of a limiting distribution for the binary GCD algorithm