Average Bit-Complexity of Euclidean Algorithms

@inproceedings{Akhavi2000AverageBO,
  title={Average Bit-Complexity of Euclidean Algorithms},
  author={Ali Akhavi and Brigitte Vall{\'e}e},
  booktitle={ICALP},
  year={2000}
}
We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms, where the average-case complexity of an algorithm is seen to be related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory and provide a unifying framework for… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Fractions continues à contraintes périodiques

B. Vallée
Journal of Number Theory • 1998
View 1 Excerpt

Opérateurs de Ruelle - Mayer généralisés et analyse des algorithmes d ’ Euclide et de Gauss , Acta Arithmetica 81

B. Vallée
1997

Opérateurs de Ruelle-Mayer généralisés et analyse des algorithmes d’Euclide et de Gauss

B. Vallée
Acta Arithmetica • 1997
View 1 Excerpt

The number of steps in the Euclidean algorithm

D. Hensley
Journal of Number Theory • 1994
View 2 Excerpts

Similar Papers

Loading similar papers…