An optimal parallel algorithm for generating combinations

DOI10.1016/0020-0190(89)90192-0zbMath0689.68043OpenAlexW2045504543MaRDI QIDQ582077

Ivan Stojmenović, Selim G. Akl, David Gries

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90192-0

zbMATH Keywords

parallel algorithmsdesign of algorithmsconcurrencygenerating combinations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

On random and adaptive parallel generation of combinatorial objects ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. ⋮ Listing combinatorial objects in parallel

Cites Work

• Unnamed Item
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
• Adjacent interchange generation of combinations

This page was built for publication: An optimal parallel algorithm for generating combinations