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

DOI10.1016/J.JNT.2009.02.018zbMATH Open1250.11105OpenAlexW2029559546MaRDI QIDQ838439FDOQ838439

Authors: 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

Recommendations

• Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
• Euclidean algorithms are Gaussian
• Gaussian laws for the main parameters of the Euclid algorithms
• Sharp Estimates for the Main Parameters of the Euclid Algorithm
• The Euclid algorithm is ``totally Gaussian

zbMATH Keywords

distributional analysisEuclidean algorithms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Cites Work

• The number of steps in the Euclidean algorithm
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• Euclidean algorithms are Gaussian
• Title not available (Why is that?)
• The number of steps in the Euclidean algorithm
• Über die mittlere Schrittanzahl bei Divisionsalgorithmen
• A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs
• On the non randomness of modular arithmetic progressions

Cited In (4)

• The Euclid algorithm is ``totally Gaussian
• Euclidean algorithms are Gaussian
• Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm

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

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