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

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2022★ 1 cited

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

Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frederic Myoupo

This paper presents a parallel solution based on the coarse-grained multicomputer (CGM) model using the four-splitting technique to solve the optimal binary search tree problem. Th…