Jean Frédéric Myoupo

发表

GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks

Romain Mellier, Jean Frédéric Myoupo, Idrissa Sow, 2006, 2006 International Conference on Wireless and Mobile Communications (ICWMC'06).

A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks

Djibo Karimou, Jean Frédéric Myoupo, J. Myoupo, 2005, ICN.

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Jean Frédéric Myoupo, Alain Bertrand Bomgni, 2010, Commun. Netw..

A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks

Jean Frédéric Myoupo, Alain Bertrand Bomgni, 2010, Wirel. Sens. Netw..

Average case analysis-based protocols to initialize packet radio networks

Jean Frédéric Myoupo, Vlady Ravelomanana, Loÿs Thimonier, 2003, Wirel. Commun. Mob. Comput..

Higher Dimensional Honeycomb Networks

Ivan Stojmenovic, Jean Frédéric Myoupo, Jean Carle, 2001, J. Interconnect. Networks.

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. Myoupo, 2005, The Journal of Supercomputing.

A basis for 3-D cellular networks

Jean Frédéric Myoupo, Jean Carle, David Semé, 2001, Proceedings 15th International Conference on Information Networking.

Secure and Energy-efficient Geocast Protocol for Wireless Sensor Networks based on a Hierarchical Clustered Structure

Jean Frédéric Myoupo, Sébastien Faye, S. Faye, 2013, Int. J. Netw. Secur..

AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights

Romain Mellier, Jean Frédéric Myoupo, 2006, 2006 International Conference on Wireless and Mobile Communications (ICWMC'06).

Heterogeneous Clustering for Secure, Energy-efficient and Fault tolerant Permutation Routing in Wireless Sensor Networks

Jean Frédéric Myoupo, Alain Bertrand Bomgni, Sébastien Faye, 2013 .

Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Blaise Paho Nana, 2018, Comput. Electr. Eng..

An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks

Abdellah Idrissi, Chu Min Li, Chu Min Li, 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

An energy-saving algorithm for the initialization of single hop mobile ad hoc networks

Djibo Karimou, Jean Frédéric Myoupo, J. Myoupo, 2005, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05).

Improved Linear Systolic Algorithms for Substring Statistics

Jean Frédéric Myoupo, Ahmad Wabbi, 1997, Inf. Process. Lett..

Synthesizing Linear Systolic Arrays for Dynamic Programming Problems

Jean Frédéric Myoupo, 1992, Parallel Process. Lett..

A work-optimal CGM algorithm for the LIS problem

Jean Frédéric Myoupo, Thierry Garcia, David Semé, 2001, SPAA '01.

All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications

Jean Frédéric Myoupo, Jean Carle, David Semé, 1999, Parallel Process. Lett..

A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Yannick Florian Yankam, 2018, 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI).

A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem

Jean Frédéric Myoupo, Mounir Kechid, J. Myoupo, 2008, Fifth International Conference on Information Technology: New Generations (itng 2008).

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

Gilles Dequen, Jean Frédéric Myoupo, Vianney Kengne Tchendji, 2016, Int. J. Grid High Perform. Comput..

Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks

Jean Frédéric Myoupo, Nassima Hadid, 2008, Fourth International Conference on Networking and Services (icns 2008).

A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks

Ousmane Thiare, Mohamed Naimi, Jean Frédéric Myoupo, 2009, 2009 IEEE Symposium on Computers and Communications.

An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem

Jean Frédéric Myoupo, Mounir Kechid, 2008, PDPTA.

An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks

Romain Mellier, Jean Frédéric Myoupo, 2005, ICWN.

Deployment of Sparse Sensor-Actuator Network in a Virtual Architecture

Jean Frédéric Myoupo, Sébastien Faye, 2011 .

A Constant Time Parallel Detection of Repetitions

Jean Frédéric Myoupo, David Semé, Emmanuel Delacourt, 1999, Parallel Process. Lett..

A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems

Jean Frédéric Myoupo, 1991, ICCI.

Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word

Jean Frédéric Myoupo, Thierry Lecroq, David Semé, 2002, Computers and Their Applications.

Dynamic Programming on Linear Pipelines

Jean Frédéric Myoupo, 1991, Inf. Process. Lett..

A Linear Systolic Array for Transitive Closure Problems

Jean Frédéric Myoupo, 1990, ICPP.

Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight

Jean Frédéric Myoupo, Idrissa Sow, J. Myoupo, 2008, Stud. Inform. Univ..

A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks

Romain Mellier, Jean Frédéric Myoupo, 2005, PE-WASUN '05.

A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks

Hamadou Saliah-Hassane, Djibo Karimou, Jean Frédéric Myoupo, 2008, ICWN.

An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem

Jean Frédéric Myoupo, Vianney Kengne Tchendji, J. Myoupo, 2012, The Journal of Supercomputing.

Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding

Jean Frédéric Myoupo, Jean Carle, David Semé, 1999, OPODIS.

On the Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Networks

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Yannick Florian Yankam, 2020, J. Comput..

Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions

Jean Frédéric Myoupo, Anne-Cécile Fabret, 1992, CONPAR.

Corrigenda: Dynamic Programming on Linear Pipelines

Jean Frédéric Myoupo, 1992, Inf. Process. Lett..

Dynamic initialization protocols for mobile ad hoc networks

Jean Frédéric Myoupo, J. Myoupo, 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm

Jean Frédéric Myoupo, 1991, ICPP.

Efficient BSR-based parallel algorithms for geometrical problems

Jean Frédéric Myoupo, David Semé, 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, 2018, 2018 International Conference on High Performance Computing & Simulation (HPCS).

Distributed Clustering in Ad Hoc Networks and Applications

Romain Mellier, Jean Frédéric Myoupo, 2010 .

Conflict-free rerouting scheme through flow splitting for virtual networks using switches

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Yannick Florian Yankam, 2018, Journal of Internet Services and Applications.

Systolic-based parallel architecture for the longest common subsequences problem

Jean Frédéric Myoupo, Guillaume Luce, 1998, Integr..

Concurrent broadcasts-based permutation routing algorithms in radio networks

Jean Frédéric Myoupo, J. Myoupo, 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence

Jean Frédéric Myoupo, Thierry Lecroq, Guillaume Luce, 1997, Inf. Process. Lett..

Dynamic Source Routing with Delay and Bandwidth Guarantees for Mobile Ad Hoc Networks

Hicham Lakhlef, Jean Frédéric Myoupo, Bentaleb Abdelhak, 2012 .

Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks

Jean Frédéric Myoupo, Alain Bertrand Bomgni, Aboubecrine Ould Cheikhna, 2009, IWCMC.

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

Jean Frédéric Myoupo, David Semé, 2006, The Journal of Supercomputing.

A One-Phase Parallel Algorithm for the Sequence Alignment Problem

Jean Frédéric Myoupo, Thierry Lecroq, David Semé, 1998, Parallel Process. Lett..

Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks

Hicham Lakhlef, Julien Bourgeois, Saad Harous, 2015, 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing.

A coarse-grained multicomputer algorithm for the longest common subsequence problem

Jean Frédéric Myoupo, Thierry Garcia, David Semé, 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..

Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks

Djibo Karimou, Jean Frédéric Myoupo, 2005, Parallel and Distributed Computing and Networks.

Efficient Parallel Computing of a Longest Common Subsequence of Three Strings

Jean Frédéric Myoupo, Guillaume Luce, 1997, PPSC.

An efficient linear systolic algorithm for recovering longest common subsequences

Jean Frédéric Myoupo, Guillaume Luce, J. Myoupo, 1995, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing.

An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem

Jean Frédéric Myoupo, Vianney Kengne Tchendji, 2014, Int. J. Grid High Perform. Comput..

A Modular Systolic Linearization of the Warshall-Floyd Algorithm

Jean Frédéric Myoupo, Anne-Cécile Fabret, 1996, IEEE Trans. Parallel Distributed Syst..

Optimal BSR Solutions to Several Convex Polygon Problems

Ivan Stojmenovic, Jean Frédéric Myoupo, David Semé, 2004, The Journal of Supercomputing.

Dynamic programming on linear pipelines: Information processing letters 39 (6) (27 September 1991) 333-341

Jean Frédéric Myoupo, 1992 .

Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors

Jean Frédéric Myoupo, Vianney Kengne Tchendji, 2017, 2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS).

Mapping dynamic programming onto modular linear systolic arrays

Jean Frédéric Myoupo, 2005, Distributed Computing.

Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem

Gilles Dequen, Jean Frédéric Myoupo, Vianney Kengne Tchendji, 2016 .

An efficient parallel solution for the longest increasing subsequence problem

Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo, 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

Move-to-front and transpose hybrid parallel architectures for high-speed data compression

Jean Frédéric Myoupo, A. Wabbi, 2000, Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

Jean Frédéric Myoupo, David Semé, 1999, J. Parallel Distributed Comput..

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, 2020, J. Comput. Networks Commun..

Deployment and Management of Sparse Sensor-Actuator Network in a Virtual Architecture

Jean Frédéric Myoupo, Sébastien Faye, 2012 .

A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem

Jean Frédéric Myoupo, Mounir Kechid, 2009, PDPTA.

EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS

Jean Frédéric Myoupo, David Semé, 2000, Parallel Algorithms Appl..

Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks

Romain Mellier, Jean Frédéric Myoupo, J. Myoupo, 2006, Int. J. Ad Hoc Ubiquitous Comput..

Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences

Jean Frédéric Myoupo, Guillaume Luce, J. Myoupo, 1998, Parallel Algorithms Appl..

Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Laure Pauline Fotso, 2010, PDPTA.

A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem

Jean Frédéric Myoupo, Idrissa Sow, Aboubecrine Ould Cheikhna, 2010, The Journal of Supercomputing.

Parallel dynamic programming for solving the optimal search binary tree problem on CGM

Jean Frédéric Myoupo, Vianney Kengne Tchendji, J. Myoupo, 2014, Int. J. High Perform. Comput. Netw..

Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters

Jean Frédéric Myoupo, Idrissa Sow, 2008, ICWN.

A fast sequential algorithm for the matrix chain ordering problem

Jean Frédéric Myoupo, Vianney Kengne Tchendji, Jerry Lacmou Zeutouo, 2021, Concurr. Comput. Pract. Exp..

A Modular Systolic Linearizat of the Wars ha1 I- Floyd Algorithm

Jean Frédéric Myoupo, Anne Cecile Fabret, 1996 .

A Secure permutation routing protocol in multi-hop wireless sensor networks

Hicham Lakhlef, Jean Frédéric Myoupo, 2011 .