An analysis of Lehmer's Euclidean GCD algorithm

  • Authors:
  • Jonathan Sorenson

  • Affiliations:
  • Department of Mathematics and Computer Science, Butler University, 4600 Sunset Ave., Indianapolis, Indiana

  • Venue:
  • ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract