default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhaled Day
- > Home > Persons > Khaled Day
Publications
- 2006
[j37]Abdel Elah Al-Ayyoub, Ahmad Awwad, Khaled Day
, Mohamed Ould-Khaoua:
Generalized methods for algorithm development on optical systems. J. Supercomput. 38(2): 111-125 (2006)- 2003
- [j28]Abdel Elah Al-Ayyoub, Khaled Day:
Node-ranking schemes for the star networks. J. Parallel Distributed Comput. 63(3): 239-250 (2003) - 2002
- [j27]Abdel Elah Al-Ayyoub, Khaled Day:
Fast LU Factorization on the Hyperstar Interconnection Network. J. Interconnect. Networks 3(3-4): 231-243 (2002) - [j26]Abdel Elah Al-Ayyoub, Khaled Day:
Comparative Study of Product Networks. J. Parallel Distributed Comput. 62(1): 1-18 (2002) - [j24]Abdel Elah Al-Ayyoub, Khaled Day, Abdullah Al-Dhelaan:
On the attractiveness of the star network. J. Syst. Softw. 63(2): 151-158 (2002) - [j22]Khaled Day, Abdel Elah Al-Ayyoub:
Topological Properties of OTIS-Networks. IEEE Trans. Parallel Distributed Syst. 13(4): 359-366 (2002) - [c8]Khaled Day, Abdel Elah Al-Ayyoub:
Reliable Communication in Faulty Star Networks. IPDPS 2002 - 2001
- [j20]Khaled Day, Abdel Elah Al-Ayyoub:
Adaptive Fault-Tolerant Routing in Star Networks. J. Interconnect. Networks 2(2): 213-231 (2001) - [j17]Abdel Elah Al-Ayyoub, Mohamed Ould-Khaoua, Khaled Day:
On the Performance of Parallel Matrix Factorisation on the Hypermesh. J. Supercomput. 20(1): 37-53 (2001) - 2000
- [j16]Abdel Elah Al-Ayyoub, Khaled Day:
Unified Parallel Algorithms for Gaussian Elimination with Backward Substitution on Product Networks. Parallel Algorithms Appl. 14(4): 253-269 (2000) - [j15]Khaled Day, Saad Harous, Abdel Elah Al-Ayyoub:
A fault tolerant routing scheme for hypercubes. Telecommun. Syst. 13(1): 29-44 (2000) - [j14]Khaled Day, Abdel Elah Al-Ayyoub:
Minimal Fault Diameter for Highly Resilient Product Networks. IEEE Trans. Parallel Distributed Syst. 11(9): 926-930 (2000) - 1999
- [j13]Abdel Elah Al-Ayyoub, Khaled Day:
Efficient Algorithms on the Hyperstar Network. Parallel Algorithms Appl. 14(1): 79-88 (1999) - [c4]Khaled Day, Saad Harous, Abdel Elah Al-Ayyoub:
The Conditional Node Connectivity of the k-ary n-Cube. PDPTA 1999: 2706-2710 - 1998
- [j12]Abdel Elah Al-Ayyoub, Khaled Day:
The Hyperstar Interconnection Network. J. Parallel Distributed Comput. 48(2): 175-199 (1998) - [j11]Khaled Day, Abdel Elah Al-Ayyoub:
Product-closed networks. J. Syst. Archit. 45(4): 323-338 (1998) - 1997
- [j10]Abdel Elah Al-Ayyoub, Khaled Day:
Parallel Solution of Dense Linear Systems on the k-Ary n-Cube Networks. Int. J. High Speed Comput. 9(2): 85-99 (1997) - [j9]Abdel Elah Al-Ayyoub, Khaled Day:
Errata: Parallel Solution of Dense Linear Systems on the k-Ary n-Cube Networks. Int. J. High Speed Comput. 9(3): 257 (1997) - [j8]Khaled Day, Abdel Elah Al-Ayyoub:
The Cross Product of Interconnection Networks. IEEE Trans. Parallel Distributed Syst. 8(2): 109-118 (1997) - [j7]Abdel Elah Al-Ayyoub, Khaled Day:
Matrix Decomposition on the Star Graph. IEEE Trans. Parallel Distributed Syst. 8(8): 803-812 (1997) - [j6]Khaled Day, Abdel Elah Al-Ayyoub:
Fault Diameter of k-ary n-cube Networks. IEEE Trans. Parallel Distributed Syst. 8(9): 903-907 (1997) - 1996
- [c3]Abdel Elah Al-Ayyoub, Khaled Day:
Comparative Study of Cartesian Product Networks. PDPTA 1996: 387-390
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-05-08 21:45 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:
