scientific article; zbMATH DE number 3336026

From MaRDI portal
Publication:5613266

zbMath0212.06503MaRDI QIDQ5613266

Hans Heilbronn

Publication date: 1968


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. ValléeComputer algebra: Past and futureDistribution of facets of higher-dimensional Klein polyhedraContinued fraction algorithms, functional operators, and structure constantsLimit laws for rational continued fractions and value distribution of quantum modular formsBias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sumsDynamical analysis of a class of Euclidean algorithms.Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten GanzenPartial sums of the cotangent functionA rigorous version of R. P. Brent's model for the binary Euclidean algorithmThe average length of finite continued fractions with fixed denominatorAnalysis of Euclidean algorithms for polynomials over finite fieldsFine costs for Euclid's algorithm on polynomials and Farey mapsOn the asymptotic analysis of the Euclidean algorithmÜber die Teilnenner endlicher KettenbruecheEstimate for dispersion of lengths of continued fractionsOn Gauss-Kuz'min statistics for finite continued fractionsDigits and continuants in Euclidean algorithms. Ergodic versus Tauberian theoremsEuclidean algorithms are GaussianThe number of steps in a finite Jacobi algorithmOn the statistical properties of finite continued fractionsThe number of steps in the Euclidean algorithmEvaluation of Porter's constantOn the worst case of three algorithms for computing the Jacobi symbolRegularity of the Euclid algorithm; application to the analysis of fast GCD algorithmsDynamics of continued fractions with periodic constraintsUniversal Hecke L-Series Associated with Cuspidal Eigenforms over Imaginary Quadratic FieldsAn upper bound on the average number of iterations of the LLL algorithm




This page was built for publication: