default search action
Vianney Kengne Tchendji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Miguel Landry Foko Sindjoung
, Mthulisi Velempini, Vianney Kengne Tchendji:
ARPMEC: an adaptive mobile edge computing-based routing protocol for IoT networks. Clust. Comput. 27(7): 9435-9450 (2024) - [j29]Fabrice Mvah, Vianney Kengne Tchendji, Clémentin Tayou Djamégni, Ahmed H. Anwar, Deepak K. Tosh, Charles A. Kamhoua:
Countering ARP spoofing attacks in software-defined networks using a game-theoretic approach. Comput. Secur. 139: 103696 (2024) - [j28]Fabrice Mvah
GaTeBaSep: game theory-based security protocol against ARP spoofing attacks in software-defined networks. Int. J. Inf. Sec. 23(1): 373-387 (2024) - [j27]Yannick Florian Yankam
WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks. J. Netw. Syst. Manag. 32(1): 23 (2024) - [j26]Garrik Brel Jagho Mdemaya, Vianney Kengne Tchendji, Mthulisi Velempini, Ariege Atchaze:
ATENA: Adaptive TEchniques for Network Area Coverage and Routing in IoT-Based Edge Computing. J. Netw. Syst. Manag. 32(4): 83 (2024) - [j25]Hermann Bogning Tepiele, Vianney Kengne Tchendji, Mathias Akong Onabid, Jean Frédéric Myoupo, Armel Nkonjoh Ngomade:
Dominant Point-Based Sequential and Parallel Algorithms for the Multiple Sequential Substring Constrained-LCS Problem. ACM Trans. Parallel Comput. 11(4): 18:1-18:31 (2024) - [c9]Fabrice Mvah, Vianney Kengne Tchendji, Clémentin Tayou Djamégni, Ahmed H. Anwar, Deepak K. Tosh, Charles A. Kamhoua:
Deception-Based IDS Against ARP Spoofing Attacks in Software-Defined Networks. ICNC 2024: 188-192 - [c8]Grace Colette Tessa Masse, Abderrahim Benslimane, Vianney Kengne Tchendji, Ahmed H. Anwar:
A Secure Hierarchical Federated Learning Using Dirichlet-based Trust Management. ICNC 2024: 1098-1103 - 2023
- [j24]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem. ARIMA J. 38 (2023) - [j23]Franklin Ingrid Kamga Youmbi
P-FARFAR2: A multithreaded greedy approach to sampling low-energy RNA structures in Rosetta FARFAR2. Comput. Biol. Chem. 104: 107878 (2023) - [j22]Vianney Kengne Tchendji
Game theory-based dynamic resource allocations scheme in virtual networks. J. Inf. Telecommun. 7(1): 1-28 (2023) - [j21]Vianney Kengne Tchendji
A Parallel Tiled and Sparsified Four-Russians Algorithm for Nussinov's RNA Folding. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1795-1806 (2023) - [c7]Joel Herve Mboussam Emati
Feasibility Study of Improving Blockchain-Based Self-Sovereign Identity Security using Artificial Intelligence and Lightweight Cryptography. AFRICON 2023: 1-3 - [c6]Fabrice Mvah
FlipPath Game to Counter Stealthy Attacks in SDN-Based Tactical Networks. GameSec 2023: 294-308 - [c5]Achile Leonel Nguemkam, Ahmed H. Anwar, Vianney Kengne Tchendji, Deepak K. Tosh
Optimal Honeypot Allocation using Core Attack Graph in Cyber Deception Games. PIMRC 2023: 1-6 - 2022
- [j20]Jerry Lacmou Zeutouo
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. Int. J. Parallel Emergent Distributed Syst. 37(6): 659-679 (2022) - [j19]Vianney Kengne Tchendji
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem. Parallel Comput. 111: 102927 (2022) - [j18]Jerry Lacmou Zeutouo
High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem. J. Supercomput. 78(4): 5306-5332 (2022) - [i1]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. CoRR abs/2207.06083 (2022) - 2021
- [j17]Jerry Lacmou Zeutouo
A fast sequential algorithm for the matrix chain ordering problem. Concurr. Comput. Pract. Exp. 33(24) (2021) - [j16]Vianney Kengne Tchendji
E2BaSeP: Efficient Bayes Based Security Protocol Against ARP Spoofing Attacks in SDN Architectures. J. Hardw. Syst. Secur. 5(1): 58-74 (2021) - 2020
- [j15]Blaise Nana Paho
Secure and Energy-Efficient Geocasting Protocol for GPS-Free Hierarchical Wireless Sensor Networks with Obstacles. Int. J. Wirel. Inf. Networks 27(1): 60-76 (2020) - [j14]Jean Frédéric Myoupo
FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks. J. Comput. Networks Commun. 2020: 8891481:1-8891481:14 (2020) - [j13]Jean Frédéric Myoupo, Yannick Florian Yankam, Vianney Kengne Tchendji:
On the Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Networks. J. Comput. 15(1): 10-21 (2020) - [j12]Armel Nkonjoh Ngomade, Jean Frédéric Myoupo
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. J. Comput. Sci. 40: 101070 (2020) - [j11]Vianney Kengne Tchendji
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. Parallel Comput. 91 (2020)
2010 – 2019
- 2019
- [j10]Vianney Kengne Tchendji
Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution. ARIMA J. 31: 1 (2019) - [j9]Vianney Kengne Tchendji
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. 4(2): 141-156 (2019) - [j8]Vianney Kengne Tchendji
Hierarchical and on-demand wireless energy transfer protocol in sensor networks with multiple chargers. Int. J. Sens. Networks 31(1): 33-43 (2019) - 2018
- [j7]Jean Frédéric Myoupo
Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network. Comput. Electr. Eng. 72: 949-964 (2018) - [j6]Vianney Kengne Tchendji
Conflict-free rerouting scheme through flow splitting for virtual networks using switches. J. Internet Serv. Appl. 9(1): 13:1-13:15 (2018) - [c4]Jean Frédéric Myoupo
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint. HPCS 2018: 1038-1044 - [c3]Jean Frédéric Myoupo, Yannick Florian Yankam, Vianney Kengne Tchendji
A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2018: 1509-1515 - 2017
- [j5]Vianney Kengne Tchendji
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. 27 (2017) - [c2]Vianney Kengne Tchendji
Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors. HPCC/SmartCity/DSS 2017: 605-608 - 2016
- [j4]Vianney Kengne Tchendji
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem. Int. J. Grid High Perform. Comput. 8(4): 55-77 (2016) - 2014
- [b1]Vianney Kengne Tchendji:
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 Yaoundé I, Cameroon, 2014 - [j3]Jean Frédéric Myoupo
An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem. Int. J. Grid High Perform. Comput. 6(2): 74-100 (2014) - [j2]Jean Frédéric Myoupo
Parallel dynamic programming for solving the optimal search binary tree problem on CGM. Int. J. High Perform. Comput. Netw. 7(4): 269-280 (2014) - 2012
- [j1]Vianney Kengne Tchendji
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem. J. Supercomput. 61(3): 463-480 (2012) - 2010
- [c1]Laure Pauline Fotso, Vianney Kengne Tchendji, Jean Frédéric Myoupo:
Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model. PDPTA 2010: 710-716
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: