2 citations · 3 across the 5 of their papers we have counts for
1 paper · 1 filter
Bruno Grenet, Ilya Volkovich
We give a new simple and short ("one-line") analysis for the runtime of the well-known Euclidean Algorithm. While very short simple, the obtained upper bound in near-optimal.