Parallel Generation of Permutations

DOI10.1093/comjnl/26.2.97zbMath0512.68028OpenAlexW2104385759MaRDI QIDQ3657425

P. Gupta, G. P. Bhattacharjee

Publication date: 1983

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/26.2.97

zbMATH Keywords

parallel algorithmSIMD computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Algorithms in computer science (68W99)

Related Items (14)

Generating combinations in parallel ⋮ Parallel generation of permutations and combinations ⋮ On generation of permutations of \(m\) out of \(n\) items ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Parallel permutation generation on linear array ⋮ An efficient algorithm for random sampling without replacement ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems ⋮ Parallel algorithm for generating permutations on linear array ⋮ On generation of permutations through decomposition of symmetric groups into cosets ⋮ Efficient enumeration of cyclic permutations in situ ⋮ Listing combinatorial objects in parallel ⋮ A parallel derangement generation algorithm ⋮ Unnamed Item

This page was built for publication: Parallel Generation of Permutations