scientific article; zbMATH DE number 1444291

zbMATH Open0961.68050MaRDI QIDQ4953333FDOQ4953333

Authors: Jean Frédéric Myoupo, David Semé 

Publication date: 28 May 2001

Title of this publication is not available (Why is that?)

Recommendations

• Time-efficient parallel algorithms for the longest common subsequence and related problems
• scientific article; zbMATH DE number 278833
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

zbMATH Keywords

parallel computationlongest common subsequenceEREW PRAMlongest increasing subsequence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Cited In (2)

• Improvised divide and conquer approach for the LIS problem
• ANSV problem on BSRs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953333)