Analysis of a left-shift binary GCD algorithm

Authors:
Jeffrey Shallit;Jonathan Sorenson
Affiliations:
-;-
Venue:
Journal of Symbolic Computation
Year:
1994

Citing 0
Cited 2

An analysis of Lehmer's Euclidean GCD algorithm

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Maximal continuants and the Fine-Wilf theorem

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract