The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean Frédéric Myoupo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2002, pp:18-21 [Conf]
  2. Jean Frédéric Myoupo, Anne-Cécile Fabret
    Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:265-270 [Conf]
  3. Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo
    An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:220-224 [Conf]
  4. Jean Frédéric Myoupo
    A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:421-430 [Conf]
  5. Djibo Karimou, Jean Frédéric Myoupo
    A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICN (2), 2005, pp:107-115 [Conf]
  6. Jean Carle, Jean Frédéric Myoupo, David Semé
    A Basis for 3-D Cellular Networks. [Citation Graph (0, 0)][DBLP]
    ICOIN, 2001, pp:631-636 [Conf]
  7. Jean Frédéric Myoupo
    A Linear Systolic Array for Transitive Closure Problems. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1990, pp:617-618 [Conf]
  8. Jean Frédéric Myoupo
    A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1991, pp:575-579 [Conf]
  9. Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo
    An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:555-562 [Conf]
  10. Djibo Karimou, Jean Frédéric Myoupo
    An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICW/ICHSN/ICMCS/SENET, 2005, pp:153-158 [Conf]
  11. Djibo Karimou, Jean Frédéric Myoupo
    An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Wireless Networks, 2004, pp:975-981 [Conf]
  12. Romain Mellier, Jean Frédéric Myoupo
    An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICWN, 2005, pp:341-347 [Conf]
  13. Jean Frédéric Myoupo
    Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISCC, 2003, pp:1272-1276 [Conf]
  14. Romain Mellier, Jean Frédéric Myoupo, Vlady Ravelomanana
    A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MWCN, 2004, pp:287-298 [Conf]
  15. Jean Carle, Jean Frédéric Myoupo, David Semé
    Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1999, pp:85-107 [Conf]
  16. Djibo Karimou, Jean Frédéric Myoupo
    Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2005, pp:38-43 [Conf]
  17. Thierry Garcia, Jean Frédéric Myoupo, David Semé
    A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    PDP, 2003, pp:349-356 [Conf]
  18. Romain Mellier, Jean Frédéric Myoupo
    A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    PE-WASUN, 2005, pp:242-245 [Conf]
  19. Guillaume Luce, Jean Frédéric Myoupo
    Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  20. Thierry Garcia, Jean Frédéric Myoupo, David Semé
    A work-optimal CGM algorithm for the LIS problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:330-331 [Conf]
  21. Romain Mellier, Jean Frédéric Myoupo, Idrissa Sow
    GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks. [Citation Graph (0, 0)][DBLP]
    ICWMC, 2006, pp:38- [Conf]
  22. Romain Mellier, Jean Frédéric Myoupo
    AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights. [Citation Graph (0, 0)][DBLP]
    ICWMC, 2006, pp:39- [Conf]
  23. Jean Frédéric Myoupo
    Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1993, v:6, n:3, pp:165-179 [Journal]
  24. Guillaume Luce, Jean Frédéric Myoupo
    Systolic-based parallel architecture for the longest common subsequences problem. [Citation Graph (0, 0)][DBLP]
    Integration, 1998, v:25, n:1, pp:53-70 [Journal]
  25. Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo
    A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:3, pp:129-136 [Journal]
  26. Jean Frédéric Myoupo
    Dynamic Programming on Linear Pipelines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:6, pp:333-341 [Journal]
  27. Jean Frédéric Myoupo
    Corrigenda: Dynamic Programming on Linear Pipelines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:5, pp:289- [Journal]
  28. Jean Frédéric Myoupo, Ahmad Wabbi
    Improved Linear Systolic Algorithms for Substring Statistics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:5, pp:253-258 [Journal]
  29. Jean Carle, Jean Frédéric Myoupo, Ivan Stojmenovic
    Higher Dimensional Honeycomb Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2001, v:2, n:4, pp:391-420 [Journal]
  30. Jean Frédéric Myoupo, David Semé
    Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:57, n:2, pp:212-223 [Journal]
  31. Jean Carle, Jean Frédéric Myoupo, David Semé
    All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:4, pp:539-550 [Journal]
  32. Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé
    A Constant Time Parallel Detection of Repetitions. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:81-92 [Journal]
  33. Jean Frédéric Myoupo
    Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:97-110 [Journal]
  34. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    A One-Phase Parallel Algorithm for the Sequence Alignment Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:4, pp:515-526 [Journal]
  35. Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic
    Optimal BSR Solutions to Several Convex Polygon Problems. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2002, v:21, n:1, pp:77-90 [Journal]
  36. Jean Frédéric Myoupo, David Semé
    Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2006, v:38, n:1, pp:83-107 [Journal]
  37. Jean Frédéric Myoupo, Anne-Cécile Fabret
    A Modular Systolic Linearization of the Warshall-Floyd Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:5, pp:449-455 [Journal]
  38. Jean Frédéric Myoupo, Loÿs Thimonier, Vlady Ravelomanana
    Average case analysis-based protocols to initialize packet radio networks. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2003, v:3, n:4, pp:539-548 [Journal]

  39. A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  40. Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. [Citation Graph (, )][DBLP]


  41. A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks. [Citation Graph (, )][DBLP]


  42. A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. [Citation Graph (, )][DBLP]


  43. Efficient BSR-Based Parallel Algorithms for Geometrical Problems. [Citation Graph (, )][DBLP]


  44. An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. [Citation Graph (, )][DBLP]


  45. A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. [Citation Graph (, )][DBLP]


  46. Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks. [Citation Graph (, )][DBLP]


  47. Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks. [Citation Graph (, )][DBLP]


Search in 0.066secs, Finished in 0.068secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002