 | 2009 |
|---|
| 48 |       | Jean Frédéric Myoupo,
Mohamed Naimi,
Ousmane Thiare:
A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks.
ISCC 2009: 693-696 |
| 47 | | 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 |
| 46 |  | Mounir Kechid,
Jean Frédéric Myoupo:
A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem.
PDPTA 2009: 480-486 |
| 2008 |
|---|
| 45 | | 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 |
| 44 | | 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 |
| 43 | | Mounir Kechid,
Jean Frédéric Myoupo:
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem.
ITNG 2008: 1186-1189 |
| 42 | | Mounir Kechid,
Jean Frédéric Myoupo:
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem.
PDPTA 2008: 327-332 |
| 2006 |
|---|
| 41 | | 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 |
| 40 | | Romain Mellier,
Jean Frédéric Myoupo,
Idrissa Sow:
GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks.
ICWMC 2006: 38 |
| 39 | | Romain Mellier,
Jean Frédéric Myoupo:
AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights.
ICWMC 2006: 39 |
| 38 | | Romain Mellier,
Jean Frédéric Myoupo:
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks.
IJAHUC 1(3): 156-166 (2006) |
| 37 | | Jean Frédéric Myoupo,
David Semé:
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.
The Journal of Supercomputing 38(1): 83-107 (2006) |
| 2005 |
|---|
| 36 | | Djibo Karimou,
Jean Frédéric Myoupo:
A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks.
ICN (2) 2005: 107-115 |
| 35 | | Djibo Karimou,
Jean Frédéric Myoupo:
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks.
ICW/ICHSN/ICMCS/SENET 2005: 153-158 |
| 34 | | 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 |
| 33 | | Romain Mellier,
Jean Frédéric Myoupo:
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks.
PE-WASUN 2005: 242-245 |
| 32 | | 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 |
| 2004 |
|---|
| 31 | | 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 |
| 30 | | 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 |
|---|
| 29 | | Jean Frédéric Myoupo:
Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks.
ISCC 2003: 1272-1276 |
| 28 | | Thierry Garcia,
Jean Frédéric Myoupo,
David Semé:
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem.
PDP 2003: 349-356 |
| 27 | | Jean Frédéric Myoupo,
Loÿs Thimonier,
Vlady Ravelomanana:
Average case analysis-based protocols to initialize packet radio networks.
Wireless Communications and Mobile Computing 3(4): 539-548 (2003) |
| 2002 |
|---|
| 26 | | Thierry Lecroq,
Jean Frédéric Myoupo,
David Semé:
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word.
Computers and Their Applications 2002: 18-21 |
| 25 | | Jean Frédéric Myoupo,
David Semé,
Ivan Stojmenovic:
Optimal BSR Solutions to Several Convex Polygon Problems.
The Journal of Supercomputing 21(1): 77-90 (2002) |
| 2001 |
|---|
| 24 | | Jean Carle,
Jean Frédéric Myoupo,
David Semé:
A Basis for 3-D Cellular Networks.
ICOIN 2001: 631-636 |
| 23 | | Thierry Garcia,
Jean Frédéric Myoupo,
David Semé:
A work-optimal CGM algorithm for the LIS problem.
SPAA 2001: 330-331 |
| 22 | | Jean Carle,
Jean Frédéric Myoupo,
Ivan Stojmenovic:
Higher Dimensional Honeycomb Networks.
Journal of Interconnection Networks 2(4): 391-420 (2001) |
| 2000 |
|---|
| 21 | | 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) |
| 1999 |
|---|
| 20 | | 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 |
| 19 | | Jean Frédéric Myoupo,
David Semé:
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems.
J. Parallel Distrib. Comput. 57(2): 212-223 (1999) |
| 18 | | Emmanuel Delacourt,
Jean Frédéric Myoupo,
David Semé:
A Constant Time Parallel Detection of Repetitions.
Parallel Processing Letters 9(1): 81-92 (1999) |
| 17 | | Jean Carle,
Jean Frédéric Myoupo,
David Semé:
All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications.
Parallel Processing Letters 9(4): 539-550 (1999) |
| 1998 |
|---|
| 16 | | Guillaume Luce,
Jean Frédéric Myoupo:
Systolic-based parallel architecture for the longest common subsequences problem.
Integration 25(1): 53-70 (1998) |
| 15 | | 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) |
| 14 | | Thierry Lecroq,
Jean Frédéric Myoupo,
David Semé:
A One-Phase Parallel Algorithm for the Sequence Alignment Problem.
Parallel Processing Letters 8(4): 515-526 (1998) |
| 1997 |
|---|
| 13 | | Guillaume Luce,
Jean Frédéric Myoupo:
Efficient Parallel Computing of a Longest Common Subsequence of Three Strings.
PPSC 1997 |
| 12 | | 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) |
| 11 | | Jean Frédéric Myoupo,
Ahmad Wabbi:
Improved Linear Systolic Algorithms for Substring Statistics.
Inf. Process. Lett. 61(5): 253-258 (1997) |
| 1996 |
|---|
| 10 | | Jean Frédéric Myoupo,
Anne-Cécile Fabret:
A Modular Systolic Linearization of the Warshall-Floyd Algorithm.
IEEE Trans. Parallel Distrib. Syst. 7(5): 449-455 (1996) |
| 1993 |
|---|
| 9 | | Christophe Cérin,
Catherine Dufourd,
Jean Frédéric Myoupo:
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.
ICCI 1993: 220-224 |
| 8 | | Jean Frédéric Myoupo:
Mapping Dynamic Programming Onto Modular Linear Systolic Arrays.
Distributed Computing 6(3): 165-179 (1993) |
| 1992 |
|---|
| 7 | | Jean Frédéric Myoupo,
Anne-Cécile Fabret:
Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions.
CONPAR 1992: 265-270 |
| 6 | | Jean Frédéric Myoupo:
Corrigenda: Dynamic Programming on Linear Pipelines.
Inf. Process. Lett. 41(5): 289 (1992) |
| 5 | | Jean Frédéric Myoupo:
Synthesizing Linear Systolic Arrays for Dynamic Programming Problems.
Parallel Processing Letters 2: 97-110 (1992) |
| 1991 |
|---|
| 4 | | Jean Frédéric Myoupo:
A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems.
ICCI 1991: 421-430 |
| 3 | | 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 |
| 2 | | Jean Frédéric Myoupo:
Dynamic Programming on Linear Pipelines.
Inf. Process. Lett. 39(6): 333-341 (1991) |
| 1990 |
|---|
| 1 | | Jean Frédéric Myoupo:
A Linear Systolic Array for Transitive Closure Problems.
ICPP (1) 1990: 617-618 |
