Pages that link to "Item:Q5939726"
From MaRDI portal
The following pages link to Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726):
Displaying 11 items.
- Small quotients in Euclidean algorithms (Q631506) (← links)
- A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs (Q731697) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Euclidean algorithms are Gaussian (Q1771021) (← links)
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) (Q2130054) (← 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)
- Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
- EXPONENTIAL INEQUALITIES AND FUNCTIONAL ESTIMATIONS FOR WEAK DEPENDENT DATA: APPLICATIONS TO DYNAMICAL SYSTEMS (Q3426807) (← links)
- Gaussian behavior of quadratic irrationals (Q5854708) (← links)
- Limit laws for rational continued fractions and value distribution of quantum modular forms (Q6075048) (← links)
