Über die mittlere Schrittanzahl bei Divisionsalgorithmen
From MaRDI portal
Publication:4163602
DOI10.1002/mana.19780820115zbMath0383.10033OpenAlexW2066810857MaRDI QIDQ4163602
Publication date: 1978
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19780820115
Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items (12)
A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen ⋮ The mean number of steps in the Euclidean algorithm with odd partial quotients ⋮ Midpoint criteria for solving Pell’s equation using the nearest square continued fraction ⋮ Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems ⋮ Euclidean algorithms are Gaussian ⋮ Ein Gauss-Kusmin-Levy-Satz für Kettenbrüche nach nächsten Ganzen ⋮ On the worst case of three algorithms for computing the Jacobi symbol ⋮ Mean for the sum of elements over a class of finite continued fractions ⋮ A Gauss-Kusmin theorem for optimal continued fractions ⋮ An upper bound on the average number of iterations of the LLL algorithm
This page was built for publication: Über die mittlere Schrittanzahl bei Divisionsalgorithmen
