Pages that link to "Item:Q1401315"
From MaRDI portal
The following pages link to Dynamical analysis of a class of Euclidean algorithms. (Q1401315):
Displaying 20 items.
- Small quotients in Euclidean algorithms (Q631506) (← links)
- The mean number of steps in the Euclidean algorithm with odd partial quotients (Q650319) (← links)
- On the worst case of three algorithms for computing the Jacobi symbol (Q752075) (← links)
- Algorithms for computing signs of \(2 \times 2\) determinants: dynamics and average-case analysis (Q826120) (← 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)
- Dynamics of the binary Euclidean algorithm: Functional analysis and operators (Q1277390) (← links)
- Euclidean algorithms are Gaussian (Q1771021) (← links)
- Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion (Q2088115) (← links)
- Statistical distribution of the Stern sequence (Q2421725) (← links)
- Perron-Frobenius operators and the Klein-Gordon equation (Q2436087) (← 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)
- Euclidean dynamics (Q2503200) (← links)
- Timed Symbolic Dynamics (Q2945581) (← links)
- The dynamics of Pythagorean Triples (Q3532555) (← links)
- Distribution of periodic points of certain Gauss shifts with infinite invariant measure (Q4997329) (← links)
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726) (← links)
- Limit laws for rational continued fractions and value distribution of quantum modular forms (Q6075048) (← links)
- Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums (Q6093611) (← links)
