A modular reduction for GCD computation.
type: Item
instance of: scholarly article
title: A modular reduction for GCD computation.
zbMATH Open document ID: 1107.11051
author: Sidi Mohamed Sedjelmaci
published in: Journal of Computational and Applied Mathematics
publication date: 2004-01-26T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11A05
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 2032610
MaRDI profile type: Publication
full work available at URL: j.cam.2003.08.014
OpenAlex ID: W2130659841
cites work: Q4773298
cites work: An improved parallel algorithm for integer GCD
cites work: Q4234183
cites work: An algorithm for exact division
cites work: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
cites work: Q4385522
cites work: Q4349924
cites work: Euclid's Algorithm for Large Numbers
cites work: Fast computation of continued fraction expansions.
cites work: On a parallel Lehmer-Euclid GCD algorithm
cites work: Improvements on the accelerated integer GCD algorithm
cites work: Two Fast GCD Algorithms
cites work: Q4227305
cites work: Parallel implementation of the accelerated integer GCD algorithm
DOI: 10.1016/J.CAM.2003.08.014
description: scientific article; zbMATH DE number 2032610