Hazem M. Bahig

Orcid: 0000-0001-9448-6168

According to our database1, Hazem M. Bahig authored at least 29 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Sequential and parallel sliding window algorithms for multiplying large integers.
J. King Saud Univ. Comput. Inf. Sci., March, 2023

2022
Speeding up wheel factoring method.
J. Supercomput., 2022

Small Private Exponent Attacks on RSA Using Continued Fractions and Multicore Systems.
Symmetry, 2022

Efficient Sequential and Parallel Prime Sieve Algorithms.
Symmetry, 2022

An Improved Parallel Prefix Sums Algorithm.
Parallel Process. Lett., 2022

2021
An efficient parallel strategy for high-cost prefix operation.
J. Supercomput., 2021

Fast and scalable algorithm for product large data on multicore system.
Concurr. Comput. Pract. Exp., 2021

2019
A new constant-time parallel algorithm for merging.
J. Supercomput., 2019

A Multicore Exact Algorithm for Addition Sequence.
J. Comput., 2019

An Efficient Multicore Algorithm for Minimal Length Addition Chains.
Comput., 2019

2018
A fast optimal parallel algorithm for a short addition chain.
J. Supercomput., 2018

2017
Debugging Tool to Learn Algorithms: A Case Study Minimal Spanning Tree.
Int. J. Emerg. Technol. Learn., 2017

MonitTDPA: A tool for monitoring the tracing of dynamic programming algorithms.
Comput. Appl. Eng. Educ., 2017

Parallelizing Partial Digest Problem on Multicore System.
Proceedings of the Bioinformatics and Biomedical Engineering, 2017

2016
A fast exact sequential algorithm for the partial digest problem.
BMC Bioinform., 2016

2014
Parallelizing exact motif finding algorithms on multi-core.
J. Supercomput., 2014

2013
An Efficient Algorithm to Identify DNA Motifs.
Math. Comput. Sci., 2013

2012
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization.
BMC Bioinform., 2012

2011
A new strategy for generating shortest addition sequences.
Computing, 2011

Integer merging on EREW PRAM.
Computing, 2011

Binary Addition Chain on EREW PRAM.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010
Merging Data Records on EREW PRAM.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

2009
Performance and analysis of modified voting algorithm for planted motif search.
Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

2008
Parallel merging with restriction.
J. Supercomput., 2008

2007
Optimal Parallel Merging by Counting.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

2006
Comments on Integer Sorting on Sum-CRCW.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006

Speeding Up Evaluation of Powers and Monomials.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Practical Integer Sorting on Shared Memory.
Proceedings of the High Performance Computing and Communications, 2005

2002
Parallel Self-Index Integer Sorting.
J. Supercomput., 2002


  Loading...