Listing combinatorial objects in parallel

DOI10.1080/17445760500355777zbMath1088.68180OpenAlexW1970643267MaRDI QIDQ3378053

Ivan Stojmenović

Publication date: 29 March 2006

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

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

zbMATH Keywords

permutationscombinatorial algorithmssubsetscombinationslinear array of processors

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order

Cites Work

• Unnamed Item
• An optimal parallel algorithm for generating combinations
• An optimal algorithm for generating equivalence relations on a linear array of processors
• Parallel algorithm for generating permutations on linear array
• On generation of permutations through decomposition of symmetric groups into cosets
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• A systolic design for generating permutations in lexicographic order
• An optimal systolic algorithm for generating permutations in lexicographic order
• A parallel derangement generation algorithm
• A systolic generation of combinations
• Gray code for derangements
• New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
• Constant time generation of derangements
• On O(1) Time Algorithms for Combinatorial Generation
• Parallel Generation of Permutations
• On random and adaptive parallel generation of combinatorial objects
• Loopless Generation of Schroder Trees
• A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL

This page was built for publication: Listing combinatorial objects in parallel