S. Sedjelmaci

activity

20042014

most citedThe Accelerated Euclidean Algorithm

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

collaborators

Showing cs.DSShow all

2 papers · 1 filter

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…

cs.DS2004★ 2 cited

The Accelerated Euclidean Algorithm

Sidi Mohamed Sedjelmaci

We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O (n l o g^{2} n l o g l o g n)$ for $n$ -bit inputs.