Dynamical analysis of α-Euclidean algorithms

DOI10.1016/S0196-6774(02)00218-3zbMath1030.11074MaRDI QIDQ4799529

Jérémie Bourdon, Benoît Daireaux, Brigitte Vallée

Publication date: 23 March 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

dynamical systemsanalysis of algorithmsTauberian theoremstransfer operatorsfunctional analysisbit-complexityfunctions with bounded variationDirichlet generating functionsEuclidean division algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Topological dynamics of nonautonomous systems (37B55)

Related Items (8)

A canonical thickening of ℚ and the entropy ofα-continued fraction transformations ⋮ Generalized Brjuno functions associated to \(\alpha \)-continued fractions ⋮ Recurrence Function on Sturmian Words: A Probabilistic Study ⋮ Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism ⋮ Existence of a limiting distribution for the binary GCD algorithm ⋮ Euclidean algorithms are Gaussian ⋮ Tanaka–Ito α-continued fractions and matching ⋮ EXPONENTIAL INEQUALITIES AND FUNCTIONAL ESTIMATIONS FOR WEAK DEPENDENT DATA: APPLICATIONS TO DYNAMICAL SYSTEMS

This page was built for publication: Dynamical analysis of α-Euclidean algorithms