The following pages link to Euclidean dynamics (Q2503200):
Displaying 14 items.
- Numeration and discrete dynamical systems (Q411444) (← links)
- Small quotients in Euclidean algorithms (Q631506) (← links)
- A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs (Q731697) (← 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)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Analysis of generalized continued fraction algorithms over polynomials (Q2031651) (← links)
- Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion (Q2088115) (← links)
- The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010) (← 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)
- Renewal-type limit theorem for continued fractions with even partial quotients (Q3645384) (← links)
- Distribution of periodic points of certain Gauss shifts with infinite invariant measure (Q4997329) (← links)
- Gaussian behavior of quadratic irrationals (Q5854708) (← links)
