Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem - Archive ouverte HAL Access content directly
Journal Articles International Journal of Parallel, Emergent and Distributed Systems Year : 2022

Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem

Dates and versions

hal-03758118 , version 1 (22-08-2022)

Identifiers

Cite

Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo. Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. International Journal of Parallel, Emergent and Distributed Systems, 2022, pp.1-21. ⟨10.1080/17445760.2022.2102168⟩. ⟨hal-03758118⟩
17 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More