Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Arbitrary-precision arithmeticArithmetic shiftComputational complexity of mathematical operationsEuclidean algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
On Schönhage's algorithm and subquadratic integer gcd computation
We describe a new subquadratic left-to-right GCD algorithm, inspired by Schonhage's algorithm for reduction of binary quadratic… 
2004
2004
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of… 
2003
2003
An Analysis of the Generalized Binary GCD Algorithm
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… 
2001
2001
Systolic VLSI realization of a novel iterative division algorithm over GF(2/sup m/): a high-speed, low-complexity design
We present a parallel-in parallel-out systolic division circuit over GF(2/sup m/) based on the novel extended Stein's algorithm… 
2000
2000
(1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm
We present a novel algorithm for GCD computation over the ring of Gaussian integersZi ], that is similar to the binary GCD… 
1996
1996
Parallel Implementation of the Accelerated Integer GCD Algorithm
Abstract The accelerated integer greatest common divisor (GCD) algorithm has been shown to be one of the most efficient in… 
1994
1994
Analysis of a Left-Shift Binary GCD Algorithm
We introduce a new left-shift binary algorithm, LSBGCD, for computing the greatest common divisor of two integers, and we provide… 
Highly Cited
1993
Highly Cited
1993
A generalization of the binary GCD algorithm
A generalization of the binary algorithm for operation at ‘word level” by using a new concept of ‘modular conjugates” computes… 
1993
1993
Comparing several GCD algorithms
  • T. Jebelean
  • Proceedings of IEEE 11th Symposium on Computer…
  • 1993
  • Corpus ID: 3168583
The execution times of several algorithms for computing the GCD of arbitrary precision integers are compared. These algorithms… 
Highly Cited
1971
Highly Cited
1971
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
This paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)