A cost-optimal pipeline algorithm for permutation generation in lexicographic order

DOI10.1006/JPDC.1997.1347MaRDI QIDQ1373870zbMATH OpenOpenAlexFDO

Authors Clémentin Tayou Djamegni, Maurice Tchuente

Publication date 25 November 1997

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1347

zbMATH Keywords

permutation generation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• An optimal systolic algorithm for generating permutations in lexicographic order
• A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
• Parallel permutation generation on linear array
• Permutation Generation on Vector Processors
• scientific article; zbMATH DE number 4053045

Cited in

(3)

• A systolic design for generating permutations in lexicographic order
• An optimal systolic algorithm for generating permutations in lexicographic order
• A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems

This page was built for publication: A cost-optimal pipeline algorithm for permutation generation in lexicographic order

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