Pages that link to "Item:Q4163602"
From MaRDI portal
The following pages link to Über die mittlere Schrittanzahl bei Divisionsalgorithmen (Q4163602):
Displaying 12 items.
- 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)
- A note on ``Euclidean algorithms are Gaussian'' by V. Baladi and B. Vallée (Q838439) (← links)
- Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen (Q1146706) (← links)
- Ein Gauss-Kusmin-Levy-Satz für Kettenbrüche nach nächsten Ganzen (Q1246566) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- Euclidean algorithms are Gaussian (Q1771021) (← links)
- Mean for the sum of elements over a class of finite continued fractions (Q1838508) (← links)
- Midpoint criteria for solving Pell’s equation using the nearest square continued fraction (Q3584786) (← links)
- A Gauss-Kusmin theorem for optimal continued fractions (Q4235622) (← links)
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726) (← links)
