Pages that link to "Item:Q5906618"
From MaRDI portal
The following pages link to The number of steps in the Euclidean algorithm (Q5906618):
Displayed 15 items.
- New normality constructions for continued fraction expansions (Q273482) (← links)
- A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs (Q731697) (← links)
- A note on ``Euclidean algorithms are Gaussian'' by V. Baladi and B. Vallée (Q838439) (← links)
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm (Q908058) (← links)
- Estimate for dispersion of lengths of continued fractions (Q950789) (← links)
- On Gauss-Kuz'min statistics for finite continued fractions (Q950805) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Continued fraction algorithms, functional operators, and structure constants (Q1127539) (← links)
- The rate of convergence of approximations of a continued fraction (Q1385259) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- Euclidean algorithms are Gaussian (Q1771021) (← links)
- Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
- Gaussian laws for the main parameters of the Euclid algorithms (Q2482727) (← links)
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726) (← links)