Binary GCD algorithm

Known as: Binary gcd, Stein's Algorithm, Knuth's algorithm B

The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to…

2011

The binary GCD algorithm, also known as Stein’s algorithm, is an algorithm that computes the greatest common divisor of two…

2010

The focus of the this work is on the better integration of algorithms expressed in Conformal Geometric Algebra (CGA) in modern…

2005

The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common…

2004

Luo et al wrote in a recent paper [A Fast Algorithm for Computing gcd Based on Binary Multi Precision,this journal,2002,Vol.32,No…

2003

In this paper we analyze a slight modification of Jebelean’s version of the k-ary GCD algorithm. Jebelean had shown that on n-bit…

2002

Dependence test is the most important part in a parallelizing compiler. There are many results on it: some are precise but slow…

2001

1998

These seminar notes represent the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects…

1997

Computer algebra, that is the use of computers to perform symbolic math¬ ematics rather than numerical computation, has found…