"Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest ..."

Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji (2018)

> Home

Details and statistics

DOI: 10.1109/HPCS.2018.00163

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ieeehpcs/MyoupoNT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ieeehpcs/MyoupoNT18
Jean Frédéric Myoupo, Armel Nkonjoh Ngomade, Vianney Kengne Tchendji:
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint. HPCS 2018: 1038-1044

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.