Skip to main content
Conference Proceedings

Analysis of a left-shift binary GCD algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 877 LNCS 169-183
DOI: 10.1007/3-540-58691-1_55
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a new left-shift binary algorithm, LSBGCD, for computing the greatest common divisor of two integers, and we provide an analysis of the worst-case behavior of this algorithm. The analysis depends on a theorem of Ramharter about the extremal behavior of certain continuants.

Cite

CITATION STYLE

APA

Shallit, J., & Sorenson, J. (1994). Analysis of a left-shift binary GCD algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 877 LNCS, pp. 169–183). Springer Verlag. https://doi.org/10.1007/3-540-58691-1_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free