Vianney Kengne Tchendji
Orcid: 0000-0003-3836-1859
According to our database1,
Vianney Kengne Tchendji
authored at least 33 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks.
J. Netw. Syst. Manag., March, 2024
GaTeBaSep: game theory-based security protocol against ARP spoofing attacks in software-defined networks.
Int. J. Inf. Sec., February, 2024
2023
P-FARFAR2: A multithreaded greedy approach to sampling low-energy RNA structures in Rosetta FARFAR2.
Comput. Biol. Chem., June, 2023
J. Inf. Telecommun., January, 2023
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem.
ARIMA J., 2023
Proceedings of the 34th IEEE Annual International Symposium on Personal, 2023
Feasibility Study of Improving Blockchain-Based Self-Sovereign Identity Security using Artificial Intelligence and Lightweight Cryptography.
Proceedings of the IEEE AFRICON 2023, Nairobi, Kenya, September 20-22, 2023, 2023
2022
High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem.
J. Supercomput., 2022
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem.
Parallel Comput., 2022
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem.
Int. J. Parallel Emergent Distributed Syst., 2022
2021
E2BaSeP: Efficient Bayes Based Security Protocol Against ARP Spoofing Attacks in SDN Architectures.
J. Hardw. Syst. Secur., 2021
Concurr. Comput. Pract. Exp., 2021
2020
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.
Parallel Comput., 2020
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem.
J. Comput. Sci., 2020
On the Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Networks.
J. Comput., 2020
FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks.
J. Comput. Networks Commun., 2020
Secure and Energy-Efficient Geocasting Protocol for GPS-Free Hierarchical Wireless Sensor Networks with Obstacles.
Int. J. Wirel. Inf. Networks, 2020
2019
Hierarchical and on-demand wireless energy transfer protocol in sensor networks with multiple chargers.
Int. J. Sens. Networks, 2019
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph.
Data Sci. Eng., 2019
Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution.
ARIMA J., 2019
2018
Conflict-free rerouting scheme through flow splitting for virtual networks using switches.
J. Internet Serv. Appl., 2018
Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network.
Comput. Electr. Eng., 2018
A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures.
Proceedings of the 2018 IEEE SmartWorld, 2018
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018
2017
Management of Low-density Sensor-Actuator Network in a Virtual Architecture [Gestion d'un réseau peu dense de capteurs sans fil structuré dans une architecture virtuelle].
ARIMA J., 2017
Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors.
Proceedings of the 19th IEEE International Conference on High Performance Computing and Communications; 15th IEEE International Conference on Smart City; 3rd IEEE International Conference on Data Science and Systems, 2017
2016
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem.
Int. J. Grid High Perform. Comput., 2016
2014
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).
PhD thesis, 2014
Parallel dynamic programming for solving the optimal search binary tree problem on CGM.
Int. J. High Perform. Comput. Netw., 2014
Int. J. Grid High Perform. Comput., 2014
2012
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem.
J. Supercomput., 2012
2010
Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010