Jean Frédéric Myoupo
Orcid: 0000-0003-3657-2556Affiliations:
- The University of Picardie - Jules Verne, Amiens, France
According to our database1,
Jean Frédéric Myoupo
authored at least 79 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks.
J. Netw. Syst. Manag., March, 2024
2023
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem.
ARIMA J., 2023
2022
High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem.
J. Supercomput., 2022
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem.
Parallel Comput., 2022
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem.
Int. J. Parallel Emergent Distributed Syst., 2022
Comput. Networks, 2022
2021
Concurr. Comput. Pract. Exp., 2021
2020
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.
Parallel Comput., 2020
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem.
J. Comput. Sci., 2020
On the Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Networks.
J. Comput., 2020
FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks.
J. Comput. Networks Commun., 2020
2018
Conflict-free rerouting scheme through flow splitting for virtual networks using switches.
J. Internet Serv. Appl., 2018
Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network.
Comput. Electr. Eng., 2018
A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures.
Proceedings of the 2018 IEEE SmartWorld, 2018
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018
2017
Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors.
Proceedings of the 19th IEEE International Conference on High Performance Computing and Communications; 15th IEEE International Conference on Smart City; 3rd IEEE International Conference on Data Science and Systems, 2017
2016
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem.
Int. J. Grid High Perform. Comput., 2016
2015
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015
2014
Parallel dynamic programming for solving the optimal search binary tree problem on CGM.
Int. J. High Perform. Comput. Netw., 2014
Int. J. Grid High Perform. Comput., 2014
2013
Secure and Energy-efficient Geocast Protocol for Wireless Sensor Networks based on a Hierarchical Clustered Structure.
Int. J. Netw. Secur., 2013
2012
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem.
J. Supercomput., 2012
2010
Wirel. Sens. Netw., 2010
A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem.
J. Supercomput., 2010
Commun. Netw., 2010
Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010
2009
A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2009
Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, 2009
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009
2008
Stud. Inform. Univ., 2008
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008
Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters.
Proceedings of the 2008 International Conference on Wireless Networks, 2008
A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks.
Proceedings of the 2008 International Conference on Wireless Networks, 2008
Proceedings of the Fourth International Conference on Networking and Services, 2008
2006
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.
J. Supercomput., 2006
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks.
Int. J. Ad Hoc Ubiquitous Comput., 2006
Proceedings of the Second International Conference on Wireless and Mobile Communications (ICWMC'06), 2006
Proceedings of the Second International Conference on Wireless and Mobile Communications (ICWMC'06), 2006
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006
2005
An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks.
J. Supercomput., 2005
Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2005
Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005
An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks.
Proceedings of the 2005 International Conference on Wireless Networks, 2005
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks.
Proceedings of the Systems Communications 2005 (ICW / ICHSN / ICMCS / SENET 2005), 2005
Proceedings of the Networking, 2005
2004
A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks.
Proceedings of the Mobile and Wireless Communication Networks, 2004
2003
Wirel. Commun. Mob. Comput., 2003
Proceedings of the 11th Euromicro Workshop on Parallel, 2003
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003
Proceedings of the 11th IEEE International Conference on Networks, 2003
2002
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word.
Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002
2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001
Proceedings of the 15th International Conference on Information Networking, 2001
2000
Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections.
Parallel Algorithms Appl., 2000
1999
Parallel Process. Lett., 1999
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems.
J. Parallel Distributed Comput., 1999
Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999
1998
Parallel Process. Lett., 1998
Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences.
Parallel Algorithms Appl., 1998
Integr., 1998
1997
Inf. Process. Lett., 1997
Inf. Process. Lett., 1997
Efficient Parallel Computing of a Longest Common Subsequence of Three Strings.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997
1996
IEEE Trans. Parallel Distributed Syst., 1996
Proceedings of International Conference on Neural Networks (ICNN'96), 1996
1993
Distributed Comput., 1993
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.
Proceedings of the Computing and Information, 1993
1992
Parallel Process. Lett., 1992
Proceedings of the Parallel Processing: CONPAR 92, 1992
1991
A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm.
Proceedings of the International Conference on Parallel Processing, 1991
Proceedings of the Advances in Computing and Information, 1991
1990
A Linear Systolic Array for Transitive Closure Problems.
Proceedings of the 1990 International Conference on Parallel Processing, 1990