The number of steps in the Euclidean algorithm
From MaRDI portal
The author deals with the Euclidean algorithm and with related pairs \((a,b)\), which by a special selection converge to the normal distribution.
Cited in
(22)- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- Continued fraction algorithms, functional operators, and structure constants
- The rate of convergence of approximations of a continued fraction
- Dynamical analysis of a class of Euclidean algorithms.
- High moments of the Estermann function
- Euclidean algorithms are Gaussian
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Statistical distribution of the Stern sequence
- Fine costs for Euclid's algorithm on polynomials and Farey maps
- Gaussian laws for the main parameters of the Euclid algorithms
- New normality constructions for continued fraction expansions
- Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
- Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
- Dynamics of continued fractions and distribution of modular symbols
- On the rate of convergence of continued fraction statistics of random rationals
- A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs
- A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée
- Probabilistic analyses of the plain multiple gcd algorithm
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
- Estimate for dispersion of lengths of continued fractions
- On Gauss-Kuz'min statistics for finite continued fractions
This page was built for publication: The number of steps in the Euclidean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906618)
