The Euclid algorithm is ``totally Gaussian
From MaRDI portal
Publication:2920862
zbMATH Open1296.68208MaRDI QIDQ2920862FDOQ2920862
Authors: Brigitte Vallée 
Publication date: 29 September 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAQ0122/0.html
Recommendations
- Euclidean algorithms are Gaussian
- scientific article; zbMATH DE number 3853202
- Gaussian laws for the main parameters of the Euclid algorithms
- A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée
- Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
- A fast Euclidean algorithm for Gaussian integers
- Euclid's Algorithm = Reverse Gaussian Elimination
- The Euclidean Algorithm and the Degree of the Gauss Map
- scientific article; zbMATH DE number 1254272
Central limit and other weak theorems (60F05) Analysis of algorithms (68W40) Continued fractions (11A55) Number-theoretic algorithms; complexity (11Y16)
Cited In (6)
- Sharp Estimates for the Main Parameters of the Euclid Algorithm
- A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée
- A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs
- Euclidean algorithms are Gaussian
- Gaussian laws for the main parameters of the Euclid algorithms
- Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
This page was built for publication: The Euclid algorithm is ``totally Gaussian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920862)
