A parallel algorithm for generating combinations
From MaRDI portal
Publication:1825043
DOI10.1016/0898-1221(89)90052-7zbMath0683.68059MaRDI QIDQ1825043
Publication date: 1989
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(89)90052-7
05A15: Exact enumeration problems, generating functions
68N25: Theory of operating systems
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
A systolic algorithm for solving knapsack problems, Parallel algorithm for generating permutations on linear array, A simple systolic algorithm for generating combinations in lexicographic order, Parallel permutation generation on linear array
Cites Work
- Unnamed Item
- Generating combinations in parallel
- Parallel generation of permutations and combinations
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
- Fast parallel sorting algorithms