The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jean Frédéric Myoupo" ( http://dblp.L3S.de/Authors/Jean_Frédéric_Myoupo )

URL (Homepage):  http://www.laria.u-picardie.fr/~myoupo/  Author page on DBLP  Author page in RDF  Community of Jean Frédéric Myoupo in ASPL-2

Publication years (Num. hits)
1990-1998 (16) 1999-2004 (16) 2005-2008 (17) 2009-2010 (7)
Publication types (Num. hits)
article(24) inproceedings(32)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 39 occurrences of 32 keywords

Results
Found 56 publication records. Showing 56 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Alain Bertrand Bomgni, Jean Frédéric Myoupo A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks. Search on Bibsonomy Wireless Sensor Network The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean 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. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alain Bertrand Bomgni, Jean Frédéric Myoupo An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks. Search on Bibsonomy Communications and Network The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laure Pauline Fotso, Vianney Kengne Tchendji, Jean Frédéric Myoupo Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM Model. Search on Bibsonomy PDPTA The full citation details ... 2010 DBLP  BibTeX  RDF
1Alain Bertrand Bomgni, Jean Frédéric Myoupo, Aboubecrine Ould Cheikhna Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks. Search on Bibsonomy IWCMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multi-geocast, sensor networks, wireless communications, geocast
1Mounir Kechid, Jean Frédéric Myoupo A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. Search on Bibsonomy PDPTA The full citation details ... 2009 DBLP  BibTeX  RDF
1Jean Frédéric Myoupo, Mohamed Naimi, Ousmane Thiare A clustering Group Mutual Exclusion algorithm for mobile ad hoc networks. Search on Bibsonomy ISCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, Idrissa Sow Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight. Search on Bibsonomy Stud. Inform. Univ. The full citation details ... 2008 DBLP  BibTeX  RDF
1Djibo Karimou, Jean Frédéric Myoupo, Hamadou Saliah-Hassane A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks. Search on Bibsonomy ICWN The full citation details ... 2008 DBLP  BibTeX  RDF
1Idrissa Sow, Jean Frédéric Myoupo Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. Search on Bibsonomy ICWN The full citation details ... 2008 DBLP  BibTeX  RDF
1Mounir Kechid, Jean Frédéric Myoupo A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Parallel algorithm, Dynamic programming, BSP, CGM
1Mounir Kechid, Jean Frédéric Myoupo An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. Search on Bibsonomy PDPTA The full citation details ... 2008 DBLP  BibTeX  RDF
1Nassima Hadid, Jean Frédéric Myoupo Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks. Search on Bibsonomy ICNS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks. Search on Bibsonomy IJAHUC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, David Semé Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point
1Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. Search on Bibsonomy ICTAI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights. Search on Bibsonomy ICWMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo, Idrissa Sow GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks. Search on Bibsonomy ICWMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Djibo Karimou, Jean Frédéric Myoupo An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks. Search on Bibsonomy ICWN The full citation details ... 2005 DBLP  BibTeX  RDF
1Djibo Karimou, Jean Frédéric Myoupo A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. Search on Bibsonomy ICN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. Search on Bibsonomy PE-WASUN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF wireless networks, mobile ad hoc NETworks, broadcasting, mobility management
1Djibo Karimou, Jean Frédéric Myoupo An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks. Search on Bibsonomy ICW/ICHSN/ICMCS/SENET The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Initialization Problem, Efficient-energy, Mobile Ad Hoc Network, Energy-saving
1Djibo Karimou, Jean Frédéric Myoupo Markov Chain-based Protocols for Dynamic Initialization of Single Hop Mobile Ad Hoc Networks. Search on Bibsonomy Parallel and Distributed Computing and Networks The full citation details ... 2005 DBLP  BibTeX  RDF
1Djibo Karimou, Jean Frédéric Myoupo An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks. Search on Bibsonomy International Conference on Wireless Networks The full citation details ... 2004 DBLP  BibTeX  RDF
1Romain Mellier, Jean Frédéric Myoupo, Vlady Ravelomanana A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks. Search on Bibsonomy MWCN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Ad Hoc Mobile Networks, Wireless Networks, Mutual Exclusion
1Jean Frédéric Myoupo, Loÿs Thimonier, Vlady Ravelomanana Average case analysis-based protocols to initialize packet radio networks. Search on Bibsonomy Wireless Communications and Mobile Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Thierry Garcia, Jean Frédéric Myoupo, David Semé A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. Search on Bibsonomy PDP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo Concurrent Broadcast-Based Permutation Routing Algorithms in Radio Networks. Search on Bibsonomy ISCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic Optimal BSR Solutions to Several Convex Polygon Problems. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Thierry Lecroq, Jean Frédéric Myoupo, David Semé Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. Search on Bibsonomy Computers and Their Applications The full citation details ... 2002 DBLP  BibTeX  RDF
1Jean Carle, Jean Frédéric Myoupo, Ivan Stojmenovic Higher Dimensional Honeycomb Networks. Search on Bibsonomy Journal of Interconnection Networks The full citation details ... 2001 DBLP  BibTeX  RDF
1Thierry Garcia, Jean Frédéric Myoupo, David Semé A work-optimal CGM algorithm for the LIS problem. Search on Bibsonomy SPAA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jean Carle, Jean Frédéric Myoupo, David Semé A Basis for 3-D Cellular Networks. (PDF / PS) Search on Bibsonomy ICOIN The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Honeycomb Mesh, Mobile Computing, wireless, Cellular Network, Hexagonal Mesh
1David Semé, Jean Frédéric Myoupo Efficient BSR-Based Parallel Algorithms for Geometrical Problems. Search on Bibsonomy PDP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, David Semé Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections. Search on Bibsonomy Parallel Algorithms Appl. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, David Semé Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé A Constant Time Parallel Detection of Repetitions. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1999 DBLP  BibTeX  RDF
1Jean Carle, Jean Frédéric Myoupo, David Semé All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1999 DBLP  BibTeX  RDF
1Jean Carle, Jean Frédéric Myoupo, David Semé Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. Search on Bibsonomy OPODIS The full citation details ... 1999 DBLP  BibTeX  RDF
1Thierry Lecroq, Jean Frédéric Myoupo, David Semé A One-Phase Parallel Algorithm for the Sequence Alignment Problem. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1998 DBLP  BibTeX  RDF
1Guillaume Luce, Jean Frédéric Myoupo Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences. Search on Bibsonomy Parallel Algorithms Appl. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Guillaume Luce, Jean Frédéric Myoupo Systolic-based parallel architecture for the longest common subsequences problem. Search on Bibsonomy Integration The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo, Ahmad Wabbi Improved Linear Systolic Algorithms for Substring Statistics. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Guillaume Luce, Jean Frédéric Myoupo Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. Search on Bibsonomy PPSC The full citation details ... 1997 DBLP  BibTeX  RDF
1Jean Frédéric Myoupo, Anne-Cécile Fabret A Modular Systolic Linearization of the Warshall-Floyd Algorithm. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Modular linear systolic algorithms, shortest path, matrix multiplication, transitive closure
1Jean Frédéric Myoupo Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. Search on Bibsonomy Distributed Computing The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Christophe Cérin, Catherine Dufourd, Jean Frédéric Myoupo An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. Search on Bibsonomy ICCI The full citation details ... 1993 DBLP  BibTeX  RDF
1Jean Frédéric Myoupo Corrigenda: Dynamic Programming on Linear Pipelines. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1992 DBLP  BibTeX  RDF
1Jean Frédéric Myoupo, Anne-Cécile Fabret Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions. Search on Bibsonomy CONPAR The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo Dynamic Programming on Linear Pipelines. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Jean Frédéric Myoupo A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. Search on Bibsonomy ICCI The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Modular Arrays, Parallel Algorithms, Complexity, Dynamic Programming, Design of Algorithms, Linear Systolic Arrays
1Jean Frédéric Myoupo A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm. Search on Bibsonomy ICPP The full citation details ... 1991 DBLP  BibTeX  RDF
1Jean Frédéric Myoupo A Linear Systolic Array for Transitive Closure Problems. Search on Bibsonomy ICPP The full citation details ... 1990 DBLP  BibTeX  RDF
Displaying result #1 - #56 of 56 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.