Jean Frédéric Myoupo

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 19

Top Topics

Parallel Algorithm

Routing Protocol

Top Venues

Int. J. Grid High Perform. Comput.

Parallel Comput.

SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI

Publications

Yannick Florian Yankam, Vianney Kengne Tchendji, Jean Frédéric Myoupo
WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks. J. Netw. Syst. Manag. 32 (1) (2024)
Alain Bertrand Bomgni, Garrik Brel Jagho Mdemaya, Miguel Landry Foko Sindjoung, Mthulisi Velempini, Celine Cabrelle Tchuenko Djoko, Jean Frédéric Myoupo
CIBORG: CIrcuit-Based and ORiented Graph theory permutation routing protocol for single-hop IoT networks. J. Netw. Comput. Appl. 231 (2024)
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)
Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. CoRR (2022)
Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. Int. J. Parallel Emergent Distributed Syst. 37 (6) (2022)
Alain Bertrand Bomgni, Miguel Landry Foko Sindjoung, Dhalil Kamdem Tchibonsou, Mthulisi Velempini, Jean Frédéric Myoupo
NESEPRIN: A new scheme for energy-efficient permutation routing in IoT networks. Comput. Networks 214 (2022)
Vianney Kengne Tchendji, Hermann Bogning Tepiele, Mathias Akong Onabid, Jean Frédéric Myoupo, Jerry Lacmou Zeutouo
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem. Parallel Comput. 111 (2022)
Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem. J. Supercomput. 78 (4) (2022)
Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
A fast sequential algorithm for the matrix chain ordering problem. Concurr. Comput. Pract. Exp. 33 (24) (2021)
Jean Frédéric Myoupo, Vianney Kengne Tchendji, Yannick Florian Yankam, Joël Casimir Tagne
FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks. J. Comput. Networks Commun. 2020 (2020)
Armel Nkonjoh Ngomade, Jean Frédéric Myoupo, Vianney Kengne Tchendji
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. J. Comput. Sci. 40 (2020)
Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean Frédéric Myoupo
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. Parallel Comput. 91 (2020)
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) (2020)
Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint. HPCS (2018)
Jean Frédéric Myoupo, Blaise Paho Nana, Vianney Kengne Tchendji
Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network. Comput. Electr. Eng. 72 (2018)
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)
Vianney Kengne Tchendji, Yannick Florian Yankam, Jean Frédéric Myoupo
Conflict-free rerouting scheme through flow splitting for virtual networks using switches. J. Internet Serv. Appl. 9 (1) (2018)
Vianney Kengne Tchendji, Jean Frédéric Myoupo
Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors. HPCC/SmartCity/DSS (2017)
Vianney Kengne Tchendji, Jean Frédéric Myoupo, Gilles Dequen
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem. Int. J. Grid High Perform. Comput. 8 (4) (2016)
Hicham Lakhlef, Julien Bourgeois, Saad Harous, Jean Frédéric Myoupo
Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks. CIT/IUCC/DASC/PICom (2015)
Jean Frédéric Myoupo, Vianney Kengne Tchendji
An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem. Int. J. Grid High Perform. Comput. 6 (2) (2014)
Jean Frédéric Myoupo, Vianney Kengne Tchendji
Parallel dynamic programming for solving the optimal search binary tree problem on CGM. Int. J. High Perform. Comput. Netw. 7 (4) (2014)
Sébastien Faye, Jean Frédéric Myoupo
Secure and Energy-efficient Geocast Protocol for Wireless Sensor Networks based on a Hierarchical Clustered Structure. Int. J. Netw. Secur. 15 (3) (2013)
Vianney Kengne Tchendji, Jean Frédéric Myoupo
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem. J. Supercomput. 61 (3) (2012)
Alain Bertrand Bomgni, Jean Frédéric Myoupo
An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks. Commun. Netw. 2 (2) (2010)
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)
Alain Bertrand Bomgni, Jean Frédéric Myoupo
A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks. Wirel. Sens. Netw. 2 (4) (2010)
Jean Frédéric Myoupo, Aboubecrine Ould Cheikhna, Idrissa Sow
A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem. J. Supercomput. 52 (2) (2010)
Alain Bertrand Bomgni, Jean Frédéric Myoupo, Aboubecrine Ould Cheikhna
Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks. IWCMC (2009)
Mounir Kechid, Jean Frédéric Myoupo
A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. PDPTA (2009)
Jean Frédéric Myoupo, Mohamed Naimi, Ousmane Thiare
A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks. ISCC (2009)
Mounir Kechid, Jean Frédéric Myoupo
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. ITNG (2008)
Idrissa Sow, Jean Frédéric Myoupo
Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. ICWN (2008)
Nassima Hadid, Jean Frédéric Myoupo
Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks. ICNS (2008)
Mounir Kechid, Jean Frédéric Myoupo
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. PDPTA (2008)
Jean Frédéric Myoupo, Idrissa Sow
Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight. Stud. Inform. Univ. 6 (1) (2008)
Djibo Karimou, Jean Frédéric Myoupo, Hamadou Saliah-Hassane
A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks. ICWN (2008)
Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. ICTAI (2006)
Romain Mellier, Jean Frédéric Myoupo
AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights. ICWMC (2006)
Jean Frédéric Myoupo, David Semé
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. J. Supercomput. 38 (1) (2006)
Romain Mellier, Jean Frédéric Myoupo, Idrissa Sow
GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks. ICWMC (2006)
Romain Mellier, Jean Frédéric Myoupo
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks. Int. J. Ad Hoc Ubiquitous Comput. 1 (3) (2006)
Djibo Karimou, Jean Frédéric Myoupo
Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks. Parallel and Distributed Computing and Networks (2005)
Djibo Karimou, Jean Frédéric Myoupo
An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. J. Supercomput. 31 (3) (2005)
Romain Mellier, Jean Frédéric Myoupo
An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks. ICWN (2005)
Romain Mellier, Jean Frédéric Myoupo
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. PE-WASUN (2005)
Djibo Karimou, Jean Frédéric Myoupo
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks. Systems Communications (2005)
Djibo Karimou, Jean Frédéric Myoupo
A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. ICN (2) (2005)
Romain Mellier, Jean Frédéric Myoupo, Vlady Ravelomanana
A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks. MWCN (2004)
Djibo Karimou, Jean Frédéric Myoupo
An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. International Conference on Wireless Networks (2004)
Jean Frédéric Myoupo, Loÿs Thimonier, Vlady Ravelomanana
Average case analysis-based protocols to initialize packet radio networks. Wirel. Commun. Mob. Comput. 3 (4) (2003)
Thierry Garcia, Jean Frédéric Myoupo, David Semé
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. PDP (2003)
Jean Frédéric Myoupo
Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks. ISCC (2003)
Jean Frédéric Myoupo
Dynamic initialization protocols for mobile ad hoc networks. ICON (2003)
Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic
Optimal BSR Solutions to Several Convex Polygon Problems. J. Supercomput. 21 (1) (2002)
Thierry Lecroq, Jean Frédéric Myoupo, David Semé
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. CATA (2002)
Thierry Garcia, Jean Frédéric Myoupo, David Semé
A work-optimal CGM algorithm for the LIS problem. SPAA (2001)
Jean Carle, Jean Frédéric Myoupo, David Semé
A Basis for 3-D Cellular Networks. ICOIN (2001)
Jean Carle, Jean Frédéric Myoupo, Ivan Stojmenovic
Higher Dimensional Honeycomb Networks. J. Interconnect. Networks 2 (4) (2001)
David Semé, Jean Frédéric Myoupo
Efficient BSR-Based Parallel Algorithms for Geometrical Problems. PDP (2001)
Jean Frédéric Myoupo, David Semé
Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections. Parallel Algorithms Appl. 14 (3) (2000)
Jean Frédéric Myoupo, David Semé
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. J. Parallel Distributed Comput. 57 (2) (1999)
Jean Carle, Jean Frédéric Myoupo, David Semé
All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. Parallel Process. Lett. 9 (4) (1999)
Jean Carle, Jean Frédéric Myoupo, David Semé
Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. OPODIS (1999)
Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé
A Constant Time Parallel Detection of Repetitions. Parallel Process. Lett. 9 (1) (1999)
Thierry Lecroq, Jean Frédéric Myoupo, David Semé
A One-Phase Parallel Algorithm for the Sequence Alignment Problem. Parallel Process. Lett. 8 (4) (1998)
Guillaume Luce, Jean Frédéric Myoupo
Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences. Parallel Algorithms Appl. 13 (1) (1998)
Guillaume Luce, Jean Frédéric Myoupo
Systolic-based parallel architecture for the longest common subsequences problem. Integr. 25 (1) (1998)
Jean Frédéric Myoupo, Ahmad Wabbi
Improved Linear Systolic Algorithms for Substring Statistics. Inf. Process. Lett. 61 (5) (1997)
Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo
A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. Inf. Process. Lett. 61 (3) (1997)
Guillaume Luce, Jean Frédéric Myoupo
Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. PPSC (1997)
Jean Frédéric Myoupo, Anne-Cécile Fabret
A Modular Systolic Linearization of the Warshall-Floyd Algorithm. IEEE Trans. Parallel Distributed Syst. 7 (5) (1996)
Jean Frédéric Myoupo, David Semé
A single-layer systolic architecture for backpropagation learning. ICNN (1996)
Jean Frédéric Myoupo
Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. Distributed Comput. 6 (3) (1993)
Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. ICCI (1993)
Jean Frédéric Myoupo
Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. Parallel Process. Lett. 2 (1992)
Jean Frédéric Myoupo, Anne-Cécile Fabret
Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. CONPAR (1992)
Jean Frédéric Myoupo
Corrigenda: Dynamic Programming on Linear Pipelines. Inf. Process. Lett. 41 (5) (1992)
Jean Frédéric Myoupo
A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm. ICPP (1) (1991)
Jean Frédéric Myoupo
Dynamic Programming on Linear Pipelines. Inf. Process. Lett. 39 (6) (1991)
Jean Frédéric Myoupo
A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. ICCI (1991)
Jean Frédéric Myoupo
A Linear Systolic Array for Transitive Closure Problems. ICPP (1) (1990)