S. Sedjelmaci

activity

20042014

most citedThe Accelerated Euclidean Algorithm

2 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

cs.DC2013★ 2 cited

A New Modular Division Algorithm and Applications

Sidi Mohamed Sedjelmaci, Christian Lavault

The present paper proposes a new parallel algorithm for the modular division $u / v mod β^{s}$ , where $u, v, β$ and $s$ are positive integers $(β \geq 2)$ . The algorithm combines th…

cs.DS2013

Worst-Case Analysis of Weber's Algorithm

Christian Lavault, Sidi Mohamed Sedjelmaci

Recently, Ken Weber introduced an algorithm for finding the $(a, b)$ -pairs satisfying $a u + b v \equiv 0 (mod k)$ , with $0 < ∣ a ∣, ∣ b ∣ < k$ , where $(u, k)$ and $(v, k)$ are coprime. It i…