On a parallel Lehmer-Euclid GCD algorithm

DOI10.1145/384101.384142zbMATH Open1356.68293OpenAlexW2022475297MaRDI QIDQ2958950FDOQ2958950

Authors: Sidi Mohammed Sedjelmaci 

Publication date: 3 February 2017

Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/384101.384142

Recommendations

• An improved parallel algorithm for integer GCD
• A parallel extended GCD algorithm
• Two fast parallel GCD algorithms of many integers
• The mixed binary Euclid algorithm
• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited In (13)

• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
• Multithread parallelization of LEPP-bisection algorithms
• Is the Euclidean Algorithm Optimal Among its Peers?
• An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
• Improvements on the accelerated integer GCD algorithm
• A randomized sublinear time parallel GCD algorithm for the EREW PRAM
• A parallel extended GCD algorithm
• Title not available (Why is that?)
• A modular reduction for GCD computation.
• ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION
• The mixed binary Euclid algorithm
• Some related functions to integer GCD and coprimality
• An improved parallel algorithm for integer GCD

This page was built for publication: On a parallel Lehmer-Euclid GCD algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958950)