| |
| 2008 | ||
|---|---|---|
| 7 | EE | Sidi Mohamed Sedjelmaci: A parallel extended GCD algorithm. J. Discrete Algorithms 6(3): 526-538 (2008) |
| 2007 | ||
| 6 | EE | Sidi Mohamed Sedjelmaci: Jebelean-Weber's algorithm without spurious factors. Inf. Process. Lett. 102(6): 247-252 (2007) |
| 2004 | ||
| 5 | EE | Sidi Mohamed Sedjelmaci: The Accelerated Euclidean Algorithm CoRR abs/cs/0412006: (2004) |
| 2001 | ||
| 4 | EE | Sidi Mohamed Sedjelmaci: On a Parallel Extended Euclidean Algorithm. AICCSA 2001: 235-241 |
| 3 | EE | Sidi Mohamed Sedjelmaci: On a parallel Lehmer-Euclid GCD algorithm. ISSAC 2001: 303-308 |
| 1999 | ||
| 2 | EE | Christian Lavault, Sidi Mohamed Sedjelmaci: Worst-case analysis of Weber's GCD algorithm. Inf. Process. Lett. 72(3-4): 125-130 (1999) |
| 1997 | ||
| 1 | EE | Sidi Mohamed Sedjelmaci, Christian Lavault: Improvements on the Accelerated Integer GCD Algorithm. Inf. Process. Lett. 61(1): 31-36 (1997) |
| 1 | Christian Lavault | [1] [2] |