A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée

DOI10.1016/j.jnt.2009.02.018zbMath1250.11105OpenAlexW2029559546MaRDI QIDQ838439

Eda Cesaratto

Publication date: 26 August 2009

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2009.02.018

zbMATH Keywords

Euclidean algorithmsdistributional analysis

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• Euclidean algorithms are Gaussian
• Über die mittlere Schrittanzahl bei Divisionsalgorithmen
• The number of steps in the Euclidean algorithm
• The number of steps in the Euclidean algorithm

This page was built for publication: A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée