22 citations · 25 across the 6 of their papers we have counts for
1 paper · 1 filter
Ian D. Morris
D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a nor…