default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSidi Mohamed Sedjelmaci
Person information
- affiliation: University of Paris 13, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c4]Sidi Mohamed Sedjelmaci:
Two Fast Parallel GCD Algorithms of Many Integers. ISSAC 2017: 397-404- 2014
- [i4]Sidi Mohamed Sedjelmaci, Christian Lavault:
Improvements on the accelerated integer GCD algorithm. CoRR abs/1402.2266 (2014) - 2013
- [j9]Sidi Mohamed Sedjelmaci:
Fast parallel GCD algorithm of many integers. ACM Commun. Comput. Algebra 47(3/4): 92-93 (2013) - [j8]Marie-Françoise Roy, Sidi Mohamed Sedjelmaci:
New fast euclidean algorithms. J. Symb. Comput. 50: 208-226 (2013) - [i3]Christian Lavault, Sidi Mohamed Sedjelmaci:
Worst-Case Analysis of Weber's Algorithm. CoRR abs/1311.7369 (2013) - [i2]Sidi Mohamed Sedjelmaci, Christian Lavault:
A New Modular Division Algorithm and Applications. CoRR abs/1312.2570 (2013) - 2011
- [j7]Sidi Mohamed Sedjelmaci:
Some Related Functions to Integer GCD and Coprimality. Electron. Notes Discret. Math. 37: 135-140 (2011)
2000 – 2009
- 2009
- [j6]Sidi Mohamed Sedjelmaci:
The Mixed Binary Euclid Algorithm. Electron. Notes Discret. Math. 35: 169-176 (2009) - 2008
- [j5]Sidi Mohamed Sedjelmaci:
A straight line program computing the integer greatest common divisor (abstract only). ACM Commun. Comput. Algebra 42(1-2): 62-64 (2008) - [j4]Sidi Mohamed Sedjelmaci:
A parallel extended GCD algorithm. J. Discrete Algorithms 6(3): 526-538 (2008) - 2007
- [j3]Sidi Mohamed Sedjelmaci:
Jebelean-Weber's algorithm without spurious factors. Inf. Process. Lett. 102(6): 247-252 (2007) - 2005
- [c3]Sidi Mohamed Sedjelmaci:
Jebelean-Weber's algorithm without spurious factors. ICECS 2005: 1-4 - 2004
- [i1]Sidi Mohamed Sedjelmaci:
The Accelerated Euclidean Algorithm. CoRR abs/cs/0412006 (2004) - 2001
- [c2]Sidi Mohamed Sedjelmaci:
On a Parallel Extended Euclidean Algorithm. AICCSA 2001: 235-241 - [c1]Sidi Mohamed Sedjelmaci:
On a parallel Lehmer-Euclid GCD algorithm. ISSAC 2001: 303-308
1990 – 1999
- 1999
- [j2]Christian Lavault, Sidi Mohamed Sedjelmaci:
Worst-case analysis of Weber's GCD algorithm. Inf. Process. Lett. 72(3-4): 125-130 (1999) - 1997
- [j1]Sidi Mohamed Sedjelmaci, Christian Lavault:
Improvements on the Accelerated Integer GCD Algorithm. Inf. Process. Lett. 61(1): 31-36 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
