A constant time string shuffle algorithm on reconfigurable meshes

DOI10.1080/00207169808804693MaRDI QIDQ3838260zbMATH OpenOpenAlexFDO

Authors B. Pradeep, C. Siva Ram Murthy

Publication date 10 December 1998

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169808804693

zbMATH Keywords

string shuffle problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1304058
• String shuffle: circuits and graphs
• Circuit complexity of shuffle
• An 0(1) time algorithm for string matching
• Unshuffling a square is NP-hard

Cites work

• An algorithm for a merge recognition problem
• Efficient recognition of rational relations
• scientific article; zbMATH DE number 3848584 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)

Cited in

(3)

• Shuffle factorization is unique
• scientific article; zbMATH DE number 1304058 (Why is no real title available?)
• On Shuffle Ideals

This page was built for publication: A constant time string shuffle algorithm on reconfigurable meshes

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