default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Frédéric Myoupo
Person information
- affiliation: The University of Picardie - Jules Verne, Amiens, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]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: 103986 (2024)- [j43]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): 23 (2024) - [j42]Hermann Bogning Tepiele, Vianney Kengne Tchendji, Mathias Akong Onabid, Jean Frédéric Myoupo, Armel Nkonjoh Ngomade:
Dominant Point-Based Sequential and Parallel Algorithms for the Multiple Sequential Substring Constrained-LCS Problem. ACM Trans. Parallel Comput. 11(4): 18:1-18:31 (2024) - 2023
- [j41]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) - 2022
- [j40]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: 109162 (2022) - [j39]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): 659-679 (2022) - [j38]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: 102927 (2022) - [j37]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): 5306-5332 (2022) - [i1]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 abs/2207.06083 (2022) - 2021
- [j36]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) - 2020
- [j35]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: 8891481:1-8891481:14 (2020) - [j34]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): 10-21 (2020) - [j33]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: 101070 (2020) - [j32]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)
2010 – 2019
- 2018
- [j31]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: 949-964 (2018) - [j30]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): 13:1-13:15 (2018) - [c38]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: 1038-1044 - [c37]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: 1509-1515 - 2017
- [c36]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: 605-608 - 2016
- [j29]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): 55-77 (2016) - 2015
- [c35]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: 92-99 - 2014
- [j28]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): 74-100 (2014) - [j27]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): 269-280 (2014) - 2013
- [j26]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): 151-160 (2013) - 2012
- [j25]Vianney Kengne Tchendji, Jean Frédéric Myoupo:
An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem. J. Supercomput. 61(3): 463-480 (2012) - 2010
- [j24]Alain Bertrand Bomgni, Jean Frédéric Myoupo:
An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks. Commun. Netw. 2(2): 125-133 (2010) - [j23]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): 135-148 (2010) - [j22]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): 293-299 (2010) - [c34]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: 710-716
2000 – 2009
- 2009
- [c33]Jean Frédéric Myoupo, Mohamed Naimi, Ousmane Thiare:
A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks. ISCC 2009: 693-696 - [c32]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: 286-291 - [c31]Mounir Kechid, Jean Frédéric Myoupo:
A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. PDPTA 2009: 480-486 - 2008
- [j21]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): 1-13 (2008) - [c30]Nassima Hadid, Jean Frédéric Myoupo:
Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks. ICNS 2008: 35-39 - [c29]Idrissa Sow, Jean Frédéric Myoupo:
Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. ICWN 2008: 75-81 - [c28]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: 488-493 - [c27]Mounir Kechid, Jean Frédéric Myoupo:
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. ITNG 2008: 1186-1189 - [c26]Mounir Kechid, Jean Frédéric Myoupo:
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. PDPTA 2008: 327-332 - 2006
- [j20]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): 156-166 (2006) - [j19]Jean Frédéric Myoupo, David Semé:
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. J. Supercomput. 38(1): 83-107 (2006) - [c25]Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo:
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. ICTAI 2006: 555-562 - [c24]Romain Mellier, Jean Frédéric Myoupo, Idrissa Sow:
GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks. ICWMC 2006: 38 - [c23]Romain Mellier, Jean Frédéric Myoupo:
AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights. ICWMC 2006: 39 - 2005
- [j18]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): 215-226 (2005) - [c22]Djibo Karimou, Jean Frédéric Myoupo:
A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. ICN (2) 2005: 107-115 - [c21]Djibo Karimou, Jean Frédéric Myoupo:
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks. Systems Communications 2005: 153-158 - [c20]Romain Mellier, Jean Frédéric Myoupo:
An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks. ICWN 2005: 341-347 - [c19]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: 38-43 - [c18]Romain Mellier, Jean Frédéric Myoupo:
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. PE-WASUN 2005: 242-245 - 2004
- [c17]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: 975-981 - [c16]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: 287-298 - 2003
- [j17]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): 539-548 (2003) - [c15]Jean Frédéric Myoupo:
Dynamic initialization protocols for mobile ad hoc networks. ICON 2003: 149-154 - [c14]Jean Frédéric Myoupo:
Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks. ISCC 2003: 1272-1276 - [c13]Thierry Garcia, Jean Frédéric Myoupo, David Semé:
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. PDP 2003: 349-356 - 2002
- [j16]Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic:
Optimal BSR Solutions to Several Convex Polygon Problems. J. Supercomput. 21(1): 77-90 (2002) - [c12]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: 18-21 - 2001
- [j15]Jean Carle, Jean Frédéric Myoupo, Ivan Stojmenovic:
Higher Dimensional Honeycomb Networks. J. Interconnect. Networks 2(4): 391-420 (2001) - [c11]Jean Carle, Jean Frédéric Myoupo, David Semé:
A Basis for 3-D Cellular Networks. ICOIN 2001: 631-636 - [c10]David Semé, Jean Frédéric Myoupo:
Efficient BSR-Based Parallel Algorithms for Geometrical Problems. PDP 2001: 265-272 - [c9]Thierry Garcia, Jean Frédéric Myoupo, David Semé:
A work-optimal CGM algorithm for the LIS problem. SPAA 2001: 330-331 - 2000
- [j14]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): 187-202 (2000)
1990 – 1999
- 1999
- [j13]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): 212-223 (1999) - [j12]Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé:
A Constant Time Parallel Detection of Repetitions. Parallel Process. Lett. 9(1): 81-92 (1999) - [j11]Jean Carle, Jean Frédéric Myoupo, David Semé:
All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. Parallel Process. Lett. 9(4): 539-550 (1999) - [c8]Jean Carle, Jean Frédéric Myoupo, David Semé:
Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. OPODIS 1999: 85-107 - 1998
- [j10]Guillaume Luce, Jean Frédéric Myoupo:
Systolic-based parallel architecture for the longest common subsequences problem. Integr. 25(1): 53-70 (1998) - [j9]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): 27-52 (1998) - [j8]Thierry Lecroq, Jean Frédéric Myoupo, David Semé:
A One-Phase Parallel Algorithm for the Sequence Alignment Problem. Parallel Process. Lett. 8(4): 515-526 (1998) - 1997
- [j7]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): 129-136 (1997) - [j6]Jean Frédéric Myoupo, Ahmad Wabbi:
Improved Linear Systolic Algorithms for Substring Statistics. Inf. Process. Lett. 61(5): 253-258 (1997) - [c7]Guillaume Luce, Jean Frédéric Myoupo:
Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. PP 1997 - 1996
- [j5]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): 449-455 (1996) - [c6]Jean Frédéric Myoupo, David Semé:
A single-layer systolic architecture for backpropagation learning. ICNN 1996: 1329-1333 - 1993
- [j4]Jean Frédéric Myoupo:
Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. Distributed Comput. 6(3): 165-179 (1993) - [c5]Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo:
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. ICCI 1993: 220-224 - 1992
- [j3]Jean Frédéric Myoupo:
Corrigenda: Dynamic Programming on Linear Pipelines. Inf. Process. Lett. 41(5): 289 (1992) - [j2]Jean Frédéric Myoupo:
Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. Parallel Process. Lett. 2: 97-110 (1992) - [c4]Jean Frédéric Myoupo, Anne-Cécile Fabret:
Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. CONPAR 1992: 265-270 - 1991
- [j1]Jean Frédéric Myoupo:
Dynamic Programming on Linear Pipelines. Inf. Process. Lett. 39(6): 333-341 (1991) - [c3]Jean Frédéric Myoupo:
A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. ICCI 1991: 421-430 - [c2]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: 575-579 - 1990
- [c1]Jean Frédéric Myoupo:
A Linear Systolic Array for Transitive Closure Problems. ICPP (1) 1990: 617-618
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 01:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
