default search action
Zaher Mahjoub
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c16]Khaoula Bezzina, Zaher Mahjoub:
Maximizing the Parallelism Degree for Optimal Computing of Matrix Chain Products. AICCSA 2017: 311-318 - [c15]Hajer Salhi, Bchira Ben Mabrouk, Zaher Mahjoub:
Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem. AICCSA 2017: 675-681 - [c14]Hajer Salhi, Bchira Ben Mabrouk, Zaher Mahjoub:
Performance Evaluation of a Parallel Dynamic Programming Algorithm for Solving the 1D Array Partitioning Problem. HPCS 2017: 341-348 - [c13]Khaoula Bezzina, Bchira Ben Mabrouk, Zaher Mahjoub:
On Determining Multiple Optimal Parenthesizations for Matrix Chain Products and Scheduling the Corresponding Task Graphs. HPCS 2017: 357-364 - [c12]Hajer Salhi, Bchira Ben Mabrouk, Zaher Mahjoub:
An Exact Pseudo-Linearithmic Binary Search Algorithm for Scheduling Independent Tasks under Contiguity Constraint. HPCS 2017: 373-380 - [c11]Sana Ezouaoui, Olfa Hamdi-Larbi, Zaher Mahjoub:
Towards Efficient Algorithms for Compressed Sparse-Sparse Matrix Product. HPCS 2017: 651-658 - [c10]Ryma Mahfoudhi, Sami Achour, Olfa Hamdi-Larbi, Zaher Mahjoub:
High Performance Recursive Matrix Inversion for Multicore Architectures. HPCS 2017: 675-682 - 2016
- [c9]Ryma Mahfoudhi, Sami Achour, Zaher Mahjoub:
Parallel triangular matrix system solving on CPU-GPU system. AICCSA 2016: 1-6 - [c8]Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub:
On a Parallel Algorithm for the Determination of Multiple Optimal Solutions for the LCSS Problem. ICA3PP 2016: 440-448 - [c7]Khaoula Bezzina, Zaher Mahjoub:
Scheduling binary tree-shaped task graphs representing optimal parenthesizations of dense-triangular matrix chain product. HPCS 2016: 148-155 - [c6]Hajer Salhi, Zaher Mahjoub:
Scheduling independent tasks under contiguity constraint: A polyhedral algorithm based-approach for determining and comparing all optimal solutions. HPCS 2016: 172-179 - 2015
- [j8]Ryma Mahfoudhi, Zaher Mahjoub, Wahid Nasri:
Parallel Communication-Avoiding Algorithm for Triangular Matrix Inversion on Homogeneous and Heterogeneous Platforms. Int. J. Parallel Program. 43(4): 631-655 (2015) - 2014
- [c5]Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub:
Performance evaluation of a parallel dynamic programming algorithm for solving the matrix chain product problem. AICCSA 2014: 109-116 - 2012
- [c4]Ryma Mahfoudhi, Zaher Mahjoub, Wahid Nasri:
Parallel Communication-Free Algorithm for Triangular Matrix Inversion on Heterogeneous Platforms. FedCSIS 2012: 553-560 - 2011
- [j7]Faouzi Ben Charrada, Sana Ezouaoui, Zaher Mahjoub:
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices. RAIRO Oper. Res. 45(1): 1-16 (2011) - 2010
- [c3]Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub:
Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem. AICCSA 2010: 1-8
2000 – 2009
- 2009
- [j6]Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub:
On a parallel genetic-tabu search based algorithm for solving the graph colouring problem. Eur. J. Oper. Res. 197(3): 1192-1201 (2009) - 2002
- [j5]Zaher Mahjoub, Wahid Nasri, Denis Trystram:
Computing the inverse of a triangular matrix on heterogeneous clusters. Parallel Distributed Comput. Pract. 5(4) (2002) - 2001
- [j4]Wahid Nasri, Zaher Mahjoub:
Optimal parallelization of a recursive algorithm for triangular matrix inversion on MIMD computers. Parallel Comput. 27(13): 1767-1782 (2001)
1990 – 1999
- 1996
- [j3]Zaher Mahjoub, Mohamed Jemni
:
On the parallelization of single dynamic conditional loops. Simul. Pract. Theory 4(2-3): 141-154 (1996) - 1995
- [j2]Zaher Mahjoub, Mohamed Jemni
Restructuring and Parallelizing a Static Conditional Loop. Parallel Comput. 21(2): 339-347 (1995) - 1994
- [c2]Zaher Mahjoub, Mohamed Jemni:
Restructuring and Parallelizing a Dynamic Conditional Loop. EUROSIM 1994: 447-454 - 1992
- [c1]Zaher Mahjoub, F. Karoui-Sahtout:
Optimal Performances and Scheduling for Parallel Algorithms with Equal Cost Tasks. CONPAR 1992: 799-800 - 1991
- [j1]Zaher Mahjoub, F. Karoui-Sahtout:
Parallel algorithms for redundant precedence relations elimination in task systems. Parallel Comput. 17(4-5): 471-481 (1991)
1970 – 1979
- 1977
- [b1]Zaher Mahjoub:
Expérimentation de stratégies itératives chaotiques sur des problèmes de point fixe à grand nombre de variables. Grenoble Institute of Technology, France, 1977
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-07-02 20:39 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: