The Mixed Binary Euclid Algorithm

DOI10.1016/j.endm.2009.11.029zbMath1268.11161OpenAlexW1986372353MaRDI QIDQ2840536

Sidi Mohamed Sedjelmaci

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.029

zbMATH Keywords

algorithmsparallel complexityEuclidean algorithmgreatest common divisor (GCD)binary GCD algorithm

Mathematics Subject Classification ID

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

Cites Work

• An improved parallel algorithm for integer GCD
• A parallel extended GCD algorithm
• A modular reduction for GCD computation.
• Fast computation of continued fraction expansions.
• Parallel implementation of the accelerated integer GCD algorithm
• Two Fast GCD Algorithms
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Mixed Binary Euclid Algorithm