Armel Nkonjoh Ngomade

According to our database, Armel Nkonjoh Ngomade authored at least 3 papers between 2018 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.

Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean Frédéric Myoupo

Parallel Comput., 2020

A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem.

Armel Nkonjoh Ngomade, Jean Frédéric Myoupo, Vianney Kengne Tchendji

J. Comput. Sci., 2020

2018

Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint.

Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji

Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018