Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Hazem M. Bahig"'
Publikováno v:
AIMS Mathematics, Vol 9, Iss 5, Pp 11212-11227 (2024)
Ribonucleic acid (RNA) structure alignment is an important problem in computational biology to identify structural similarity of RNAs. Obtaining an efficient method for this problem is challenging due to the high computational time for the optimal so
Externí odkaz:
https://doaj.org/article/8773a43fd447425f9ef647c825226b26
Publikováno v:
AIMS Mathematics, Vol 9, Iss 5, Pp 11024-11038 (2024)
Let $ N = \left\{{n}_{1}, {n}_{2}, \;\dots , {n}_{k}\right\} $ be a finite set of positive numbers. The problem of finding the minimal number of additions required to compute all elements of N starting from 1 (called the addition sequence problem) is
Externí odkaz:
https://doaj.org/article/bc36d918a5724ff089ce62f69f2aa12a
Autor:
Hazem M. Bahig, Khaled A. Fathy
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 35, Iss 3, Pp 131-140 (2023)
The cost of some primitive operations such as multiplication and division significantly affects the running time of some applications in science and engineering especially when the size of data is big. In this study, we propose a formula to minimize
Externí odkaz:
https://doaj.org/article/d7776288a7f946e39f3d59004bb5fd7c
Publikováno v:
Symmetry, Vol 14, Iss 12, p 2527 (2022)
Generating prime numbers less than or equal to an integer number m plays an important role in many asymmetric key cryptosystems. Recently, a new sequential prime sieve algorithm was proposed based on set theory. The main drawback of this algorithm is
Externí odkaz:
https://doaj.org/article/417782ba823345f6957bf586208b0509
Publikováno v:
Symmetry, Vol 14, Iss 9, p 1897 (2022)
The RSA (Rivest–Shamir–Adleman) asymmetric-key cryptosystem is widely used for encryptions and digital signatures. Let (n,e) be the RSA public key and d be the corresponding private key (or private exponent). One of the attacks on RSA is to find
Externí odkaz:
https://doaj.org/article/177ea26937e24098ad2d6508a0730db2
Autor:
Hazem M. Bahig
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 27, Iss 1, Pp 1-12 (2019)
Abstract Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics. A large number of sorting algorithms have been proposed base
Externí odkaz:
https://doaj.org/article/1e6e212b7ae74748b955eb219916e746
Autor:
Hazem M. Bahig, Yasser Kotb
Publikováno v:
Computers, Vol 8, Iss 1, p 23 (2019)
A minimal length addition chain for a positive integer m is a finite sequence of positive integers such that (1) the first and last elements in the sequence are 1 and m, respectively, (2) any element greater than 1 in the sequence is the addition of
Externí odkaz:
https://doaj.org/article/7b2d204bea9c4b8596f3137942d09ebc
Publikováno v:
International Journal of Information Technology. 14:3019-3029
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::273fe1ab4c5155d0b9ffeefa2b1082f2
https://doi.org/10.1007/s41870-022-01038-0
https://doi.org/10.1007/s41870-022-01038-0
Autor:
Hazem M. Bahig, Dieaa I. Nassr, Mohammed A. Mahdi, Mohamed A. G. Hazber, Khaled Al-Utaibi, Hatem M. Bahig
Publikováno v:
The Journal of Supercomputing. 78:15730-15748
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea6e291b22e57f5035dfd4e334822ffb
https://doi.org/10.1007/s11227-022-04470-y
https://doi.org/10.1007/s11227-022-04470-y
Autor:
Hazem M. Bahig, Khaled A. Fathy
Publikováno v:
Parallel Processing Letters. 32
The prefix sums problem for an array [Formula: see text] is to compute all sums [Formula: see text], [Formula: see text]. In this paper, we introduce an improvement for the best previous algorithm that runs in [Formula: see text] time using [Formula:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cd0fcfb36fe507620e590ac66a657ca
https://doi.org/10.1142/s0129626422500086
https://doi.org/10.1142/s0129626422500086