Jean Frédéric Myoupo

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