A Linear Systolic Array for Transitive Closure Problems. - Jean Frédéric Myoupo (ICPP (1), 1990)

A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. - Jean Frédéric Myoupo (ICCI, 1991)

A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm. - Jean Frédéric Myoupo (ICPP (1), 1991)

Dynamic Programming on Linear Pipelines. - Jean Frédéric Myoupo (Inf. Process. Lett., 1991)

Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. - Jean Frédéric Myoupo; Anne-Cécile Fabret (CONPAR, 1992)

Corrigenda: Dynamic Programming on Linear Pipelines. - Jean Frédéric Myoupo (Inf. Process. Lett., 1992)

Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. - Jean Frédéric Myoupo (Parallel Process. Lett., 1992)

An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. - Christophe Cérin; Catherine Dufourd; Jean Frédéric Myoupo (ICCI, 1993)

Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. - Jean Frédéric Myoupo (Distributed Comput., 1993)

A single-layer systolic architecture for backpropagation learning. - Jean Frédéric Myoupo; David Semé (ICNN, 1996)

A Modular Systolic Linearization of the Warshall-Floyd Algorithm. - Jean Frédéric Myoupo; Anne-Cécile Fabret (IEEE Trans. Parallel Distributed Syst., 1996)

Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. - Guillaume Luce; Jean Frédéric Myoupo (PP, 1997)

A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. - Thierry Lecroq; Guillaume Luce; Jean Frédéric Myoupo (Inf. Process. Lett., 1997)

Improved Linear Systolic Algorithms for Substring Statistics. - Jean Frédéric Myoupo; Ahmad Wabbi (Inf. Process. Lett., 1997)

Systolic-based parallel architecture for the longest common subsequences problem. - Guillaume Luce; Jean Frédéric Myoupo (Integr., 1998)

Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences. - Guillaume Luce; Jean Frédéric Myoupo (Parallel Algorithms Appl., 1998)

A One-Phase Parallel Algorithm for the Sequence Alignment Problem. - Thierry Lecroq; Jean Frédéric Myoupo; David Semé (Parallel Process. Lett., 1998)

Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. - Jean Carle; Jean Frédéric Myoupo; David Semé (OPODIS, 1999)

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. - Jean Frédéric Myoupo; David Semé (J. Parallel Distributed Comput., 1999)

All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. - Jean Carle; Jean Frédéric Myoupo; David Semé (Parallel Process. Lett., 1999)

A Constant Time Parallel Detection of Repetitions. - Emmanuel Delacourt; Jean Frédéric Myoupo; David Semé (Parallel Process. Lett., 1999)

Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections. - Jean Frédéric Myoupo; David Semé (Parallel Algorithms Appl., 2000)

A Basis for 3-D Cellular Networks. - Jean Carle; Jean Frédéric Myoupo; David Semé (ICOIN, 2001)

Efficient BSR-Based Parallel Algorithms for Geometrical Problems. - David Semé; Jean Frédéric Myoupo (PDP, 2001)

A work-optimal CGM algorithm for the LIS problem. - Thierry Garcia; Jean Frédéric Myoupo; David Semé (SPAA, 2001)

Higher Dimensional Honeycomb Networks. - Jean Carle; Jean Frédéric Myoupo; Ivan Stojmenovic (J. Interconnect. Networks, 2001)

Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. - Thierry Lecroq; Jean Frédéric Myoupo; David Semé (CATA, 2002)

Optimal BSR Solutions to Several Convex Polygon Problems. - Jean Frédéric Myoupo; David Semé; Ivan Stojmenovic (J. Supercomput., 2002)

Dynamic initialization protocols for mobile ad hoc networks. - Jean Frédéric Myoupo (ICON, 2003)

Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks. - Jean Frédéric Myoupo (ISCC, 2003)

A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. - Thierry Garcia; Jean Frédéric Myoupo; David Semé (PDP, 2003)

Average case analysis-based protocols to initialize packet radio networks. - Jean Frédéric Myoupo; Loÿs Thimonier; Vlady Ravelomanana (Wirel. Commun. Mob. Comput., 2003)

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks. - Romain Mellier; Jean Frédéric Myoupo; Vlady Ravelomanana (MWCN, 2004)

A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. - Djibo Karimou; Jean Frédéric Myoupo (ICN (2), 2005)

An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks. - Djibo Karimou; Jean Frédéric Myoupo (Systems Communications, 2005)

An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks. - Romain Mellier; Jean Frédéric Myoupo (ICWN, 2005)

Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks. - Djibo Karimou; Jean Frédéric Myoupo (Parallel and Distributed Computing and Networks, 2005)

A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. - Romain Mellier; Jean Frédéric Myoupo (PE-WASUN, 2005)

An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. - Djibo Karimou; Jean Frédéric Myoupo (J. Supercomput., 2005)

An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. - Abdellah Idrissi; Chu Min Li 001; Jean Frédéric Myoupo (ICTAI, 2006)

AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights. - Romain Mellier; Jean Frédéric Myoupo (ICWMC, 2006)

GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks. - Romain Mellier; Jean Frédéric Myoupo; Idrissa Sow (ICWMC, 2006)

Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks. - Romain Mellier; Jean Frédéric Myoupo (Int. J. Ad Hoc Ubiquitous Comput., 2006)

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. - Jean Frédéric Myoupo; David Semé (J. Supercomput., 2006)

Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks. - Nassima Hadid; Jean Frédéric Myoupo (ICNS, 2008)

A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks. - Djibo Karimou; Jean Frédéric Myoupo; Hamadou Saliah-Hassane (ICWN, 2008)

Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. - Idrissa Sow; Jean Frédéric Myoupo (ICWN, 2008)

A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. - Mounir Kechid; Jean Frédéric Myoupo (ITNG, 2008)

An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. - Mounir Kechid; Jean Frédéric Myoupo (PDPTA, 2008)

Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight. - Jean Frédéric Myoupo; Idrissa Sow (Stud. Inform. Univ., 2008)

A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks. - Jean Frédéric Myoupo; Mohamed Naimi; Ousmane Thiare (ISCC, 2009)

Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks. - Alain Bertrand Bomgni; Jean Frédéric Myoupo; Aboubecrine Ould Cheikhna (IWCMC, 2009)

A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. - Mounir Kechid; Jean Frédéric Myoupo (PDPTA, 2009)

Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model. - Laure Pauline Fotso; Vianney Kengne Tchendji; Jean Frédéric Myoupo (PDPTA, 2010)

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks. - Alain Bertrand Bomgni; Jean Frédéric Myoupo (Commun. Netw., 2010)

A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem. - Jean Frédéric Myoupo; Aboubecrine Ould Cheikhna; Idrissa Sow (J. Supercomput., 2010)

A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks. - Alain Bertrand Bomgni; Jean Frédéric Myoupo (Wirel. Sens. Netw., 2010)

An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem. - Vianney Kengne Tchendji; Jean Frédéric Myoupo (J. Supercomput., 2012)

Secure and Energy-efficient Geocast Protocol for Wireless Sensor Networks based on a Hierarchical Clustered Structure. - Sébastien Faye; Jean Frédéric Myoupo (Int. J. Netw. Secur., 2013)

An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem. - Jean Frédéric Myoupo; Vianney Kengne Tchendji (Int. J. Grid High Perform. Comput., 2014)

Parallel dynamic programming for solving the optimal search binary tree problem on CGM. - Jean Frédéric Myoupo; Vianney Kengne Tchendji (Int. J. High Perform. Comput. Netw., 2014)

Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks. - Hicham Lakhlef; Julien Bourgeois; Saad Harous; Jean Frédéric Myoupo (CIT/IUCC/DASC/PICom, 2015)

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem. - Vianney Kengne Tchendji; Jean Frédéric Myoupo; Gilles Dequen (Int. J. Grid High Perform. Comput., 2016)

Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors. - Vianney Kengne Tchendji; Jean Frédéric Myoupo (HPCC/SmartCity/DSS, 2017)

Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint. - Jean Frédéric Myoupo; Armel Nkonjoh Ngomade; Vianney Kengne Tchendji (HPCS, 2018)

A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures. - Jean Frédéric Myoupo; Yannick Florian Yankam; Vianney Kengne Tchendji (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI, 2018)

Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network. - Jean Frédéric Myoupo; Blaise Paho Nana; Vianney Kengne Tchendji (Comput. Electr. Eng., 2018)

Conflict-free rerouting scheme through flow splitting for virtual networks using switches. - Vianney Kengne Tchendji; Yannick Florian Yankam; Jean Frédéric Myoupo (J. Internet Serv. Appl., 2018)

FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks. - Jean Frédéric Myoupo; Vianney Kengne Tchendji; Yannick Florian Yankam; Joël Casimir Tagne (J. Comput. Networks Commun., 2020)

On the Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Networks. - Jean Frédéric Myoupo; Yannick Florian Yankam; Vianney Kengne Tchendji (J. Comput., 2020)

A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem. - Armel Nkonjoh Ngomade; Jean Frédéric Myoupo; Vianney Kengne Tchendji (J. Comput. Sci., 2020)

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. - Vianney Kengne Tchendji; Armel Nkonjoh Ngomade; Jerry Lacmou Zeutouo; Jean Frédéric Myoupo (Parallel Comput., 2020)

A fast sequential algorithm for the matrix chain ordering problem. - Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo (Concurr. Comput. Pract. Exp., 2021)

NESEPRIN: A new scheme for energy-efficient permutation routing in IoT networks. - Alain Bertrand Bomgni; Miguel Landry Foko Sindjoung; Dhalil Kamdem Tchibonsou; Mthulisi Velempini; Jean Frédéric Myoupo (Comput. Networks, 2022)

Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. - Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo (Int. J. Parallel Emergent Distributed Syst., 2022)

A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem. - Vianney Kengne Tchendji; Hermann Bogning Tepiele; Mathias Akong Onabid; Jean Frédéric Myoupo; Jerry Lacmou Zeutouo (Parallel Comput., 2022)

High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem. - Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo (J. Supercomput., 2022)

Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem. - Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo (ARIMA J., 2023)

CIBORG: CIrcuit-Based and ORiented Graph theory permutation routing protocol for single-hop IoT networks. - Alain Bertrand Bomgni; Garrik Brel Jagho Mdemaya; Miguel Landry Foko Sindjoung; Mthulisi Velempini; Celine Cabrelle Tchuenko Djoko; Jean Frédéric Myoupo (J. Netw. Comput. Appl., 2024)

WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks. - Yannick Florian Yankam; Vianney Kengne Tchendji; Jean Frédéric Myoupo (J. Netw. Syst. Manag., 2024)

Dominant Point-Based Sequential and Parallel Algorithms for the Multiple Sequential Substring Constrained-LCS Problem. - Hermann Bogning Tepiele; Vianney Kengne Tchendji; Mathias Akong Onabid; Jean Frédéric Myoupo; Armel Nkonjoh Ngomade (ACM Trans. Parallel Comput., 2024)