Jean Frederic Myoupo

Professor

Université de Picardie Jules Verne

France

Research Interests

Explore related searches

Professors in France Professors in High Performance Computing High Performance Computing professors in France

About

Jean Frederic Myoupo is a Professor at the University of Picardie Jules Verne, France. His research focuses on algorithms in computational theory, particularly in the areas of parallel computing, sequencing problems, and energy-efficient protocols in Internet of Things (IoT) networks. His recent publications include works on various graph theory permutations and efficient management schemes for programmable networks.

Articles (12)

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2020

Year:

2020

Year:

2020

Collaborators (1)

Jerry LACMOU ZEUTOUO

Assistant professor

Amity University

FRANCE

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Jean Frederic Myoupo

Research Interests

Explore related searches

About

Articles (12)

CIBORG: CIrcuit-Based and ORiented Graph theory permutation routing protocol for single-hop IoT networks

Dominant point-based sequential and parallel algorithms for the multiple sequential substring constrained-LCS problem

WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks

Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem

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

NESEPRIN: A new scheme for energy-efficient permutation routing in IoT networks

A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem

High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem

A fast sequential algorithm for the matrix chain ordering problem

FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks

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

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

Collaborators (1)

Jerry LACMOU ZEUTOUO

Make your next move.