A parallel extended GCD algorithm

DOI10.1016/j.jda.2006.12.009zbMath1193.11118OpenAlexW2040055854MaRDI QIDQ1018106

Sidi Mohamed Sedjelmaci

Publication date: 13 May 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.12.009

zbMATH Keywords

complexity analysisnumber theoryinteger greatest common divisor (GCD)extended GCD algorithmparallel GCD algorithm

Mathematics Subject Classification ID

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

Related Items (3)

A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ The Mixed Binary Euclid Algorithm ⋮ Some Related Functions to Integer GCD and Coprimality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved parallel algorithm for integer GCD
• 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

This page was built for publication: A parallel extended GCD algorithm