( en | de | ru )

 

Disambiguation of "Tchendji, Vianney Kengne"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.

, , , and . Parallel Comput., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vianney Bizimana

Vianney Jouhet

Michel Kengne

Jean-Marie Kengne

Magloire Kengne Fokoua

 

Other publications of authors with the same name

Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model., , and . PDPTA, page 710-716. CSREA Press, (2010)A fast sequential algorithm for the matrix chain ordering problem., , and . Concurr. Comput. Pract. Exp., (2021)Solutions parallèles efficaces sur le modèle CGM d'une classe de problèmes issus de la programmation dynamique. (Efficient parallel solutions on CGM model for a dynamic programming class of problems).. University of Picardie Jules Verne, France, (2014)E2BaSeP: Efficient Bayes Based Security Protocol Against ARP Spoofing Attacks in SDN Architectures., , , and . J. Hardw. Syst. Secur., 5 (1): 58-74 (2021)Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem., , and . CoRR, (2022)A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem., , and . J. Comput. Sci., (2020)Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint., , and . HPCS, page 1038-1044. IEEE, (2018)High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem., , and . J. Supercomput., 78 (4): 5306-5332 (2022)FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks., , , and . J. Comput. Networks Commun., (2020)Parallel dynamic programming for solving the optimal search binary tree problem on CGM., and . Int. J. High Perform. Comput. Netw., 7 (4): 269-280 (2014)