Pages that link to "Item:Q1025385"

The following pages link to Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385):

Displaying 9 items.

• Numeration and discrete dynamical systems (Q411444) (← links)
• A note on ``Euclidean algorithms are Gaussian'' by V. Baladi and B. Vallée (Q838439) (← links)
• Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
• On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
• Existence of a limiting distribution for the binary GCD algorithm (Q924557) (← links)
• An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling (Q2365172) (← links)
• The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010) (← links)
• Gaussian laws for the main parameters of the Euclid algorithms (Q2482727) (← links)
• (Q5000138) (← links)