A modular reduction for GCD computation.

DOI10.1016/j.cam.2003.08.014zbMath1107.11051OpenAlexW2130659841MaRDI QIDQ1421214

Sidi Mohamed Sedjelmaci

Publication date: 26 January 2004

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.014

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ The Mixed Binary Euclid Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improvements on the accelerated integer GCD algorithm
• An improved parallel algorithm for integer GCD
• An algorithm for exact division
• Fast computation of continued fraction expansions.
• Parallel implementation of the accelerated integer GCD algorithm
• On a parallel Lehmer-Euclid GCD algorithm
• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
• Two Fast GCD Algorithms
• Euclid's Algorithm for Large Numbers

This page was built for publication: A modular reduction for GCD computation.