default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJehad Al-Sadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j15]Jehad A. Al-Sadi:
A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks. Int. J. Inf. Syst. Soc. Chang. 8(3): 45-57 (2017)- 2015
- [j14]Jehad A. Al-Sadi:
Factor-Optical-Factor Exchanges Method: a new load balancing method for Extended Optical Transpose Interconnection System-n-Cube networks. Concurr. Comput. Pract. Exp. 27(13): 3415-3428 (2015) - 2012
- [j13]Jehad Al-Sadi:
Topological properties of the Extended OTIS-n-Cube interconnection network. J. Supercomput. 62(1): 134-149 (2012) - [c16]Ahmad Awwad, Jehad A. Al-Sadi:
Extended OTIS-Arrangment a new efficient interconnection network. DICTAP 2012: 394-399 - [c15]Jehad Al-Sadi:
The Load Balancing Problem in Extended OTIS-n-Cube Interconnection Networks. TrustCom 2012: 1469-1474 - 2011
- [j12]Jehad Al-Sadi, Ahmad Awwad:
A new otis-arrangment interconnection network. Int. Arab J. Inf. Technol. 8(4): 376-382 (2011) - [j11]Ahmad Awwad, Jehad Al-Sadi, Bassam Haddad
, Ahmad Kayed:
Structural Outlooks for the OTIS-Arrangement Network. Int. J. Grid High Perform. Comput. 3(2): 59-68 (2011) - 2010
- [j10]Bayan Abu Shawar, Jehad Al-Sadi:
Learning Management Systems: Are They Knowledge Management Tools? Int. J. Emerg. Technol. Learn. 5(1): 4-10 (2010)
2000 – 2009
- 2009
- [j9]Mohamd Hassan Hassan, Jehad Al-Sadi:
A New Mobile Learning Adaptation Model. Int. J. Interact. Mob. Technol. 3(4): 4-7 (2009) - [c14]Bayan Abu Shawar, Jehad Al-Sadi, Taleb H. Sarie:
An Online Math Module at Arab Open University: The Present and Future. CSREA EE 2009: 115-118 - [c13]Jehad Al-Sadi:
Investigating the Assessments Process and Students Feedback on the M206 Course: Computing: an Object Oriented Approach. CSREA EE 2009: 151-154 - 2008
- [c12]Jehad Al-Sadi, Bayan Abu Shawar, Taleb H. Sarie:
The Relationship Between Knowledge Management and e-Learning. CSREA EEE 2008: 514-518 - 2007
- [c11]Bayan Abu Shawar, Jehad Al-Sadi, Taleb H. Sarie:
Integrating the Learning Management System with Mobile Technology. CSREA EEE 2007: 31-36 - [c10]Jehad Al-Sadi, Bayan Abu Shawar:
Using WAP Technology in E-learning. CSREA EEE 2007: 41-46 - 2006
- [c9]Jehad Al-Sadi, Bayan Abu Shawar, Taleb H. Sarie:
Quality Assurance Procedures: New Enhancements to the Learning Management System at AOU. CSREA EEE 2006: 265-271 - [c8]Bayan Abu Shawar, Jehad Al-Sadi, Amr Hourani:
Integrating the Learning Management System with other Online Administrative Systems at AOU. CSREA EEE 2006: 272-277 - 2005
- [j8]Ahmad Awwad, Jehad Al-Sadi:
On the Routing of the OTIS-Cube Network in Presence of Faults. Int. Arab J. Inf. Technol. 2(1): 17-23 (2005) - [c7]Jehad A. Al-Sadi, Taleb H. Sarie:
Fault-Tolerant Routing Algorithm for EOC Interconnection Network. AMCS 2005: 107-113 - [c6]Jehad Al-Sadi:
An extended OTIS-Cube interconnection network. IADIS AC 2005: 167-172 - 2004
- [j7]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
A New Fault-Tolerant Routing Algorithm for k-Ary n-Cube Networks. Int. J. High Speed Comput. 12(1): 29-54 (2004) - [c5]Jehad Al-Sadi, A. M. Awwad:
Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors. SAC 2004: 1426-1430 - 2003
- [j6]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Analysis of fault-tolerant routing algorithms in k-ary n-cube networks. Comput. Syst. Sci. Eng. 18(2): 79-85 (2003) - [j5]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
A Fault-Tolerant Routing Algorithm for 3-D Torus Interconnection Networks. Int. Arab J. Inf. Technol. 1(0) (2003) - 2002
- [b1]Jehad Al-Sadi:
New fault tolerant routing algorithms for k ary n cube networks. University of Glasgow, UK, 2002 - [j4]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Unsafety vectors: a new fault-tolerant routing for the binary n-cube. J. Syst. Archit. 47(9): 783-793 (2002) - [c4]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
A New Probabilistic Approach for Fault-Tolerant Routing in k-Ary n-Cubes. ICPADS 2002: 509- - [c3]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes. SAC 2002: 830-834 - 2001
- [j3]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Probability-based Fault-tolerant Routing in Hypercubes. Comput. J. 44(5): 368-373 (2001) - [j2]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Unsafety vectors: a new fault-tolerant routing for k-Ary n-cubes. Microprocess. Microsystems 25(5): 239-246 (2001) - [j1]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Fault-tolerant routing in hypercubes using probability vectors. Parallel Comput. 27(10): 1381-1399 (2001) - 2000
- [c2]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Probability-Based Fault-Tolerant Routing in Hypercubes (Research Note). Euro-Par 2000: 935-938
1990 – 1999
- 1999
- [c1]Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua:
Fault-Tolerant Routing in the Binary n-Cube Using Unsafety Sets. PDPTA 1999: 2171-2176
Coauthor Index
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-10-07 22:23 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:
