default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHazem M. Bahig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Hazem M. Bahig
, Khaled A. Fathy:
Sequential and parallel sliding window algorithms for multiplying large integers. J. King Saud Univ. Comput. Inf. Sci. 35(3): 131-140 (2023)- 2022
- [j20]Hazem M. Bahig, Khaled A. Fathy:
An Improved Parallel Prefix Sums Algorithm. Parallel Process. Lett. 32(3&4): 2250008:1-2250008:13 (2022) - [j19]Hatem M. Bahig, Dieaa I. Nassr, Mohammed A. Mahdi, Hazem M. Bahig:
Small Private Exponent Attacks on RSA Using Continued Fractions and Multicore Systems. Symmetry 14(9): 1897 (2022) - [j18]Hazem M. Bahig, Mohamed A. G. Hazber, Khaled Abdul-Aziz Al-Utaibi, Dieaa I. Nassr, Hatem M. Bahig:
Efficient Sequential and Parallel Prime Sieve Algorithms. Symmetry 14(12): 2527 (2022) - [j17]Hazem M. Bahig, Dieaa I. Nassr, Mohammed A. Mahdi, Mohamed A. G. Hazber, Khaled Abdul-Aziz Al-Utaibi, Hatem M. Bahig:
Speeding up wheel factoring method. J. Supercomput. 78(14): 15730-15748 (2022) - 2021
- [j16]Hazem M. Bahig, Hatem M. Bahig, Khaled A. Fathy:
Fast and scalable algorithm for product large data on multicore system. Concurr. Comput. Pract. Exp. 33(2) (2021) - [j15]Hazem M. Bahig, Khaled A. Fathy:
An efficient parallel strategy for high-cost prefix operation. J. Supercomput. 77(6): 5267-5288 (2021)
2010 – 2019
- 2019
- [j14]Hazem M. Bahig, Yasser Kotb:
An Efficient Multicore Algorithm for Minimal Length Addition Chains. Comput. 8(1): 23 (2019) - [j13]Hazem M. Bahig, Yasser Kotb:
A Multicore Exact Algorithm for Addition Sequence. J. Comput. 14(1): 79-87 (2019) - [j12]Hazem M. Bahig:
A new constant-time parallel algorithm for merging. J. Supercomput. 75(2): 968-983 (2019) - 2018
- [j11]Hazem M. Bahig:
A fast optimal parallel algorithm for a short addition chain. J. Supercomput. 74(1): 324-333 (2018) - 2017
- [j10]Hazem M. Bahig, Ahmed Y. Khedr:
MonitTDPA: A tool for monitoring the tracing of dynamic programming algorithms. Comput. Appl. Eng. Educ. 25(2): 179-187 (2017) - [j9]Ahmed Y. Khedr, Hazem M. Bahig:
Debugging Tool to Learn Algorithms: A Case Study Minimal Spanning Tree. Int. J. Emerg. Technol. Learn. 12(4): 90-100 (2017) - [c8]Hazem M. Bahig, Mostafa M. Abbas, Mustafa M. Mohie-Eldin:
Parallelizing Partial Digest Problem on Multicore System. IWBBIO (2) 2017: 95-104 - 2016
- [j8]Mostafa M. Abbas, Hazem M. Bahig:
A fast exact sequential algorithm for the partial digest problem. BMC Bioinform. 17(S-19): 139-148 (2016) - 2014
- [j7]Mostafa M. Abbas, Hazem M. Bahig, Mohamed Abouelhoda, Mustafa M. Mohie-Eldin:
Parallelizing exact motif finding algorithms on multi-core. J. Supercomput. 69(2): 814-826 (2014) - 2013
- [j6]Mostafa M. Abbas, Hazem M. Bahig:
An Efficient Algorithm to Identify DNA Motifs. Math. Comput. Sci. 7(4): 387-399 (2013) - 2012
- [j5]Mostafa M. Abbas, Mohamed Abouelhoda, Hazem M. Bahig:
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization. BMC Bioinform. 13(S-17): S10 (2012) - 2011
- [j4]Hatem M. Bahig, Hazem M. Bahig:
A new strategy for generating shortest addition sequences. Computing 91(3): 285-306 (2011) - [j3]Hazem M. Bahig:
Integer merging on EREW PRAM. Computing 91(4): 365-378 (2011) - [c7]Khaled A. Fathy, Hazem M. Bahig, Hatem M. Bahig, A. A. Ragb:
Binary Addition Chain on EREW PRAM. ICA3PP (2) 2011: 321-330 - 2010
- [c6]Hazem M. Bahig:
Merging Data Records on EREW PRAM. ICA3PP (2) 2010: 391-400
2000 – 2009
- 2009
- [c5]Mostafa M. Abbas, Hazem M. Bahig:
Performance and analysis of modified voting algorithm for planted motif search. AICCSA 2009: 725-731 - 2008
- [j2]Hazem M. Bahig:
Parallel merging with restriction. J. Supercomput. 43(1): 99-104 (2008) - 2007
- [c4]Hazem M. Bahig, Hatem M. Bahig:
Optimal Parallel Merging by Counting. ITNG 2007: 664-669 - 2006
- [c3]Hatem M. Bahig, Hazem M. Bahig:
Speeding Up Evaluation of Powers and Monomials. FCS 2006: 149-153 - [c2]Hazem M. Bahig:
Comments on Integer Sorting on Sum-CRCW. PDPTA 2006: 637-642 - 2005
- [c1]Hazem M. Bahig, Sameh S. Daoud:
Practical Integer Sorting on Shared Memory. HPCC 2005: 271-276 - 2002
- [j1]Hazem M. Bahig, Sameh S. Daoud, Mahmoud K. A. Khairat:
Parallel Self-Index Integer Sorting. J. Supercomput. 22(3): 269-275 (2002)
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 2025-01-21 00:11 CET 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:
