A parallel algorithm for the generation of a permutation and applications

DOI10.1016/0304-3975(95)00198-0zbMath0872.68060OpenAlexW2058402896MaRDI QIDQ1351208

René Schott, Laurent Alonso

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00198-0

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cycle lemma and some applications
• Sorting in \(c \log n\) parallel steps
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• A calculus for the random generation of labelled combinatorial structures
• Uniform generation of a Motzkin word
• The random generation of directed animals
• Patterns in trees
• On the Number of Stable States in a NOR Network
• Parallel Processing with the Perfect Shuffle

This page was built for publication: A parallel algorithm for the generation of a permutation and applications