LIPN : CALIN

Page personnelle de Sidi Mohamed Sedjelmaci

Sidi Mohamed Sedjelmaci Laboratoire d'Informatique de Paris-Nord UMR CNRS 7030 Institut Galilée - Université Paris-Nord 99, avenue Jean-Baptiste Clément 93430 Villetaneuse France Bureau : A110 Tél : +33 1 49 40 35 95 Fax : +33 1 48 26 07 12 Courriel : sms at lipn.univ-paris13.fr

J'ai une double formation en mathématique (thèse de Doctorat en EDP, à Lille 1) et en informatique (thèse de Doctorat sur la complexité du calcul de PGCD en parallèle, à Paris 13). J'ai enseigné en mathématiques pures et appliquées pendant plus d'une dizaine d'années à Oran en Algérie. Depuis, j'ai été ATER à l'UTC de Compiègne, Paris 13, Cergy et à l'IUT de Vitry (où j'ai enseigné de l'algorithmique, de la programmation C et du parallélisme). J'enseigne actuellement en mathématiques à l'école d'ingénieurs ESILV, Centre Léonard de Vinci, Paris La Défense.

Thèmes de recherche:

Algorithmes parallèles, analyse de complexité, calcul scientifique, arithmétique des ordinateurs, calcul formel, plus grand commun diviseur (pgcd).

Quelques publications

Don't hesitate to contact me if you would like a reprint.

• Worst case analysis of Poincaré-like algorithm, S. M. Sedjelmaci, LIPN Report, updated version, May (2022).
• Worst case analysis of a subtractive like GCD algorithm, S. M. Sedjelmaci, LIPN Report, updated version, May (2018).
• Slides of the paper Two fast parallel GCD algorithm for many integers, S. M. Sedjelmaci, ISSAC 2017, July 25-28, 2017, Kaiserslautern, Germany.
• Two fast parallel GCD algorithm for many integers, S. M. Sedjelmaci, in proceedings of ISSAC 2017, ACM Press, pp. 397-404, July 25-28, 2017, Kaiserslautern, Germany.
• New Fast Euclidean Algorithms, M-F. Roy, S. M. Sedjelmaci, Journal of Symbolic Computation, 50 (2013) 208-226.
• Fast parallel GCD algorithm for many integers, S. M. Sedjelmaci, accepted as Poster at ISSAC 2013, Boston, USA (2013) and in ACM Communications in Computer Algebra, Vol 47, No. 3, Issue 185, September 2013, pp. 92-93.
• Parallel Hankel-based Integer GCD, S. M. Sedjelmaci, LIPN Report, January (2013).
• Some Related Functions to Integer GCD and Coprimality, S. M. Sedjelmaci, Latin American Graph and Algorithms Symposium, LAGOS'2011, Bariloche, Argentina, Electronic Notes in Discrete Mathematics, 37 (2011), 135-140.
• The Mixed Binary Euclid Algorithm, S. M. Sedjelmaci, Electronic Notes in Discrete Mathematics, 35 (2009), 169-176.
• Worst Case Analysis of Purdy Algorithm , S. M. Sedjelmaci, submitted, 2010.
• The Mixed Binary Euclid Algorithm, S. M. Sedjelmaci, Latin American Graph and Algorithms Symposium, LAGOS'09, Gramado, Brasil, 2009.
• A Staight Line Program for computing Integer GCD, S. M. Sedjelmaci, 2008, Poster talk at ANTS VIII, May 17-22, Banff (Alberta), Canada, also available in ACM SIGSAM Bulletin, Issue 164, Vol. 42, No. 2, June 2008.
• A Parallel Extended GCD Algorithm, S. M. Sedjelmaci, 2008, Journal of Discrete Algorithms, 6, (2008) 526-538.
• A Jebelean-Weber like Algorithm without Spurious Factors, S. M. Sedjelmaci, Information Processing Letters, vol.102, no.6, North-Holland, pp.247-252, June 2007.
• Note on the Parallel Complexity of Integer Coprimality and The Modular Inversion, S. M. Sedjelmaci, LIPN Report 2005-03, September, 2005.
• The Accelerated Euclidean Algorithm, S.M. Sedjelmaci, Poster talk presented at ISSAC 2004, July 3-7, University of Cantabria, Santander, Spain, also available in Proceedings of the EACA, Laureano Gonzales-Vega and Thomas Recio Eds., pp. 283-287, July 1-3, 2004, Santander, Spain.
• A modular reduction for GCD computation, S.M. Sedjelmaci, Journal of Computational and Applied Mathematics, Volume 162, Issue 1, 1 January 2004, Pages 17-31.
• On a parallel Lehmer-Euclid GCD algorithm, S.M Sedjelmaci, ISSAC 2001, ACM Press, 303-308, July 22-25, 2001, London, Canada.
• On a parallel extended Euclidean algorithm, S.M Sedjelmaci, in ACS/IEEE International Conference on Computer Systems and Applications AICCSA'2001, 235-241, June 26-29, 2001, Beyrouth, Liban.
• Worst-Case Analysis of Weber's Algorithm, C. Lavault, S. M. Sedjelmaci, Information Processing Letters, vol. 72, n 3-4, North-Holland, p. 125-130, 1999.
• Improvements on the Accelerated Integer GCD Algorithm S.M. Sedjelmaci, C. Lavault, Information Processing Letters, Vol. 61, no 1, North-Holland, 1997, p. 31-36.
• A New Modular Division Algorithm and Applications, S. M. Sedjelmaci, C. Lavault, in the Proceedings of the 6th International Conference on Theoretical Computer Science (ICTCS'98), eds. P. Degano, U. Vaccaro, G. Pirillo, World Scientific, p. 65-76, Nov. 1998, Prato, Italy.
• Convergence acceleration of monotone sequences using synchronous subsequences, M.N. Senhadji and S. M. Sedjelmaci, in the Proceedings of Colloque sur les mathématiques appliquées, Avril 1993, Oujda, Marocco.
• Expémentation d'un noyau graphique basé sur une arithmétique exacte, S. M. Sedjelmaci and Y. Slimani, in the Proceedings of les 1ères journées de mathématiques appliquées, Vol. 2, p. 524, 15-17 Juillet 1992, EMI Rabat, Marocco.
• Expériences numériques sur diverses arithmétiques, S. M. Sedjelmaci, in the Proceedings of Colloque national sur les Micro-ordinateurs et Systèmes, Feb. 1988, Arzew, Algeria.
• The B-ary equivalent of Hensel Code, S. M. Sedjelmaci, ERSIG Preprint 89-03, Univerisity of Es-Sénia Oran, 1989, Algeria.
• Talk in honnor of Prof. Christian Lavault's retirement (in French), Jully 5th, 2011.

Mon CV détaillé en anglais

Curriculum Vitae (English version)

Mon CV cours (une page) en français

Curriculum Vitae (version française)

Articles en préparation

• A New Staight Line Program for computing Integer GCD.
• Some properties of Collatz sequences.

Loisirs: Guitare: