Improvements on the accelerated integer GCD algorithm

DOI10.1016/S0020-0190(96)00185-8zbMath1338.11107arXiv1402.2266OpenAlexW2963232922MaRDI QIDQ290191

Mohamed S. Sedjelmaci, Christian Lavault

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.2266

zbMATH Keywords

parallel algorithmsnumber theoryinteger greatest common divisor (GCD)parallel arithmetic computing

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10)

Related Items (2)

A modular reduction for GCD computation. ⋮ Worst-case analysis of Weber's GCD algorithm

Cites Work

• Parallel implementation of the accelerated integer GCD algorithm
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvements on the accelerated integer GCD algorithm