Sentence:  "In this paper, we provide new analyses that characterize the precise average bit-complexity of a class of <WSD>Euclidean algorithms</WSD>." / We consider here five algorithms that are all classical variations of the <WSD>Euclidean algorithm</WSD> and are called "Classical" (\mathcal{G}), "By-Excess" (\mathcal{L}), "Centered" (\mathcal{K}), "Subtractive" (\mathcal{T}) and "Binary" (\mathcal{B}). 
Meaning of the word marked with <WSD> tags:  "Specifically", a method, based on a division algorithm, for finding the greatest common divisor (gcd) of two given integers; any of certain variations or generalisations of said method.