The following pages link to (Q4151157):
Displaying 17 items.
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm (Q908058) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
- Existence of a limiting distribution for the binary GCD algorithm (Q924557) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- A systolic algorithm for extended GCD computation (Q1110555) (← links)
- Computing GCD's by normalized division (Q1191635) (← links)
- Dynamics of the binary Euclidean algorithm: Functional analysis and operators (Q1277390) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- Combinatorial and arithmetical properties of linear numeration systems (Q1872882) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- New binary Euclidean algorithms (Q3033829) (← links)
- (Q4664856) (← links)
- (Q5000138) (← links)
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726) (← links)
