Get started
Author

Jean‐Frédéric Myoupo

Observed names: Idrissa Sow Jean Frederic Myoupo, J.-F. Myoupo, J.F. Myoupo, JEAN FRÉDÉRIC MYOUPO, JEAN-FREDERIC MYOUPO, JEAN-FRÉDŔIC MYOUPO, Jean Fr Myoupo, Jean Frederic Myoupo, Jean Frederic Myoupo -, Jean Frédéric Myoupo, Jean Frédéric Myoupop, Jean Fr�d�ric Myoupo, Jean Myoupo, Jean-Frederic Myoupo, Jean-Frederic Myoupo Romain Mellier, Jean-Frédéric Myoupo, Jean-frédéric Myoupo, Jean‐Fréderic Myoupo, MYOUPO, Jean-Frédéric, Myoupo Jean-Frédéric, Myoupo, Jean-Frédéric
Observed institutions: Université Paris-Sud, Centre National de la Recherche Scientifique, Université de Dschang, United Arab Emirates University, Laboratoire de Recherche en Informatique, Laboratoire Amiénois de Mathématique Fondamentale et Appliquée, Modélisation, information et systèmes, Université de Picardie Jules Verne
ORCID: 0000-0003-3657-2556
Observed ORCID: 0000-0003-3657-2556
OpenAlex ID: A5013486678
All-to-all Broadcasting Algorithms on Honeycomb Networks and Applications
1999 · JEAN CARLE, JEAN-FREDERIC MYOUPO, et al. · Parallel Processing Letters · 30
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks
2006 · Abdellah Idrissi, Chu Li, et al. · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · 27
A basis for 3-D cellular networks
2002 · J. Carle, J.-F. Myoupo, et al. · International Conference on Information Networking · 26
A coarse-grained multicomputer algorithm for the longest common subsequence problem
2003 · T. Garcia, J.-F. Myoupo, et al. · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · 24
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems
1999 · Jean-Frédéric Myoupo, David Semé · Journal of Parallel and Distributed Computing · 22
An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks
2010 · Alain Bertrand Bomgni, Jean Frédéric Myoupo · Communications and Network · 21
PDF
Topological properties and optimal routing algorithms for three dimensional hexagonal networks
2000 · J. Carle, J.F. Myoupo · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · 21
Systolic-based parallel architecture for the longest common subsequences problem
1998 · Guillaume Luce, Jean Frédéric Myoupo · Integration · 20
NESEPRIN: A new scheme for energy-efficient permutation routing in IoT networks
2022 · Alain Bertrand Bomgni, Miguel Landry Foko Sindjoung, et al. · Computer Networks · 18
PDF
Higher Dimensional Honeycomb Networks
2001 · JEAN CARLE, JEAN-FRÉDŔIC MYOUPO, et al. · Journal of Interconnection Networks · 15
A faster linear systolic algorithm for recovering a longest common subsequence
1997 · Thierry Lecroq, Guillaume Luce, et al. · Information Processing Letters · 15
A modular systolic linearization of the Warshall-Floyd algorithm
1996 · J.F. Myoupo, A.C. Fabret · IEEE Transactions on Parallel and Distributed Systems · 15
Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network
2018 · Jean Frédéric Myoupo, Blaise Paho Nana, et al. · Computers & Electrical Engineering · 14
Parallel dynamic programming for solving the optimal search binary tree problem on CGM
2014 · Jean Frédéric Myoupo, Vianney Kengne Tchendji · International Journal of High Performance Computing and Networking · 14
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem
2008 · Mounir Kechid, Jean Fr Myoupo · International Conference on Information Technology: New Generations · 12
An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks
2005 · Djibo Karimou, Jean Fr�d�ric Myoupo · The Journal of Supercomputing · 11
A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks
2005 · Djibo Karimou, Jean Frédéric Myoupo · Lecture notes in computer science · 11
Mapping dynamic programming onto modular linear systolic arrays
1993 · Jean Frédéric Myoupo · Distributed Computing · 10
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem
2020 · Armel Nkonjoh Ngomade, Jean Frédéric Myoupo, et al. · Journal of Computational Science · 9
PDF
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints
2019 · Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, et al. · Parallel Computing · 9
An Ultra Hierarchical Clustering-Based Secure Aggregation Protocol for Wireless Sensor Networks
2011 · Sebastien Faye -, Jean Frederic Myoupo - · INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences · 9
A Clustering Mutual Exclusion Protocol For Multi-Hop Mobile Ad Hoc Networks
2006 · Jean-Frederic Myoupo Romain Mellier · The ... IEEE International Conference on Networks/The IEEE International Conference on Networks · 9
Concurrent broadcasts-based permutation routing algorithms in radio networks
2004 · J.-F. Myoupo · IEEE Symposium on Computers and Communications (ISCC) · 9
Average case analysis‐based protocols to initialize packet radio networks
2003 · Jean‐Fréderic Myoupo, Loys Thimonier, et al. · Wireless Communications and Mobile Computing · 9
An Efficient Permutation Routing Protocol in Multi-Hop Wireless Sensor Networks
2011 · Hicham Lakhlef -, Alain Bertrand Bomgni -, et al. · International Journal of Advancements in Computing Technology · 8
Works count: 140
Citation count: 663
H-index: 14
I10-index: 18
Year
Topic
Type