Sidi Mohamed Sedjelmaci

17 papers B 2C 1Journal 13Unranked 1

Year	Rank	Type	Title / Venue / Authors
2017	B	`conf`	Two Fast Parallel GCD Algorithms of Many Integers. ISSAC Sidi Mohamed Sedjelmaci
2014	J	`jnl`	Improvements on the accelerated integer GCD algorithm. CoRR Sidi Mohamed Sedjelmaci, Christian Lavault
2013	J	`jnl`	A New Modular Division Algorithm and Applications. CoRR Sidi Mohamed Sedjelmaci, Christian Lavault
2013	J	`jnl`	Fast parallel GCD algorithm of many integers. ACM Commun. Comput. Algebra Sidi Mohamed Sedjelmaci
2013	J	`jnl`	New fast euclidean algorithms. J. Symb. Comput. Marie-Françoise Roy, Sidi Mohamed Sedjelmaci
2013	J	`jnl`	Worst-Case Analysis of Weber's Algorithm. CoRR Christian Lavault, Sidi Mohamed Sedjelmaci
2011	J	`jnl`	Some Related Functions to Integer GCD and Coprimality. Electron. Notes Discret. Math. Sidi Mohamed Sedjelmaci
2009	J	`jnl`	The Mixed Binary Euclid Algorithm. Electron. Notes Discret. Math. Sidi Mohamed Sedjelmaci
2008	J	`jnl`	A parallel extended GCD algorithm. J. Discrete Algorithms Sidi Mohamed Sedjelmaci
2008	J	`jnl`	A straight line program computing the integer greatest common divisor (abstract only). ACM Commun. Comput. Algebra Sidi Mohamed Sedjelmaci
2007	J	`jnl`	Jebelean-Weber's algorithm without spurious factors. Inf. Process. Lett. Sidi Mohamed Sedjelmaci
2005	—	`conf`	Jebelean-Weber's algorithm without spurious factors. ICECS Sidi Mohamed Sedjelmaci
2004	J	`jnl`	The Accelerated Euclidean Algorithm CoRR Sidi Mohamed Sedjelmaci
2001	C	`conf`	On a Parallel Extended Euclidean Algorithm. AICCSA Sidi Mohamed Sedjelmaci
2001	B	`conf`	On a parallel Lehmer-Euclid GCD algorithm. ISSAC Sidi Mohamed Sedjelmaci
1999	J	`jnl`	Worst-case analysis of Weber's GCD algorithm. Inf. Process. Lett. Christian Lavault, Sidi Mohamed Sedjelmaci
1997	J	`jnl`	Improvements on the Accelerated Integer GCD Algorithm. Inf. Process. Lett. Sidi Mohamed Sedjelmaci, Christian Lavault