We stand with Ukraine  

Sidi Mohamed Sedjelmaci

Affiliations:
  • University of Paris 13, France


According to our database1, Sidi Mohamed Sedjelmaci authored at least 15 papers between 1997 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Two Fast Parallel GCD Algorithms of Many Integers.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2013
New fast euclidean algorithms.
[BibTeX]
[DOI]
Marie-Françoise Roy
,
Sidi Mohamed Sedjelmaci
J. Symb. Comput., 2013

A New Modular Division Algorithm and Applications.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
,
Christian Lavault
CoRR, 2013

Worst-Case Analysis of Weber's Algorithm.
[BibTeX]
[DOI]
Christian Lavault
,
Sidi Mohamed Sedjelmaci
CoRR, 2013

Fast parallel GCD algorithm of many integers.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
ACM Commun. Comput. Algebra, 2013

2011
Some Related Functions to Integer GCD and Coprimality.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Electron. Notes Discret. Math., 2011

2009
The Mixed Binary Euclid Algorithm.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Electron. Notes Discret. Math., 2009

2008
A parallel extended GCD algorithm.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
J. Discrete Algorithms, 2008

A straight line program computing the integer greatest common divisor (abstract only).
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
ACM Commun. Comput. Algebra, 2008

2007
Jebelean-Weber's algorithm without spurious factors.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Inf. Process. Lett., 2007

2004
The Accelerated Euclidean Algorithm
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
CoRR, 2004

2001
On a parallel Lehmer-Euclid GCD algorithm.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

On a Parallel Extended Euclidean Algorithm.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
Proceedings of the 2001 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2001), 2001

1999
Worst-case analysis of Weber's GCD algorithm.
[BibTeX]
[DOI]
Christian Lavault
,
Sidi Mohamed Sedjelmaci
Inf. Process. Lett., 1999

1997
Improvements on the Accelerated Integer GCD Algorithm.
[BibTeX]
[DOI]
Sidi Mohamed Sedjelmaci
,
Christian Lavault
Inf. Process. Lett., 1997


  Loading...