An optimal algorithm for generating equivalence relations on a linear array of processors

DOI10.1007/BF01931658zbMath0696.68073OpenAlexW1973532966MaRDI QIDQ911295

Ivan Stojmenović

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931658

zbMATH Keywords

equivalence relationsparallel algorithmsubsetslinear array

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Related Items (4)

On random and adaptive parallel generation of combinatorial objects ⋮ A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ Listing combinatorial objects in parallel

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal parallel algorithm for generating combinations
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• Classification of \(P_{k2}\)
• The number of orthogonal permutations
• A parallel derangement generation algorithm
• A systolic generation of combinations
• Parallel Generation of Permutations
• Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
• Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
• A Fast Algorithm for Generating Set Partitions
• Permutation Generation on Vector Processors

This page was built for publication: An optimal algorithm for generating equivalence relations on a linear array of processors