( en | de | ru )

 

Disambiguation of "Myoupo, Jean Frédéric"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.

, , , and . Parallel Comput., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Frédéric Castagnet

Jean-Frédéric Sergejew

Jean-Frédéric Reyss-Brion

Frédéric Ruckert

Frédéric Roux

 

Other publications of authors with the same name

Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding., , and . OPODIS, page 85-107. Suger, Saint-Denis, rue Catulienne, France, (1999)Average case analysis-based protocols to initialize packet radio networks., , and . Wirel. Commun. Mob. Comput., 3 (4): 539-548 (2003)Systolic-based parallel architecture for the longest common subsequences problem., and . Integr., 25 (1): 53-70 (1998)Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network., , and . Comput. Electr. Eng., (2018)Conflict-free rerouting scheme through flow splitting for virtual networks using switches., , and . J. Internet Serv. Appl., 9 (1): 13:1-13:15 (2018)Designing Modular Linear Systolic Arrays Using Dependance Graph Regular Partitions., and . CONPAR, volume 634 of Lecture Notes in Computer Science, page 265-270. Springer, (1992)GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks., , and . ICWMC, page 38. IEEE Computer Society, (2006)A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem., and . ITNG, page 1186-1189. IEEE Computer Society, (2008)A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures., , and . SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI, page 1509-1515. IEEE, (2018)An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem., and . J. Supercomput., 61 (3): 463-480 (2012)