A simple systolic algorithm for generating combinations in lexicographic order
From MaRDI portal
Publication:1205904
DOI10.1016/0898-1221(92)90007-5zbMath0800.68337OpenAlexW2071613519MaRDI QIDQ1205904
Publication date: 1 April 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(92)90007-5
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal parallel algorithm for generating combinations
- Generating combinations in parallel
- Parallel generation of permutations and combinations
- A systolic design for generating combinations in lexicographic order
- A parallel algorithm for generating combinations
- A systolic generation of combinations
- Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
- On random and adaptive parallel generation of combinatorial objects
- Adjacent interchange generation of combinations
This page was built for publication: A simple systolic algorithm for generating combinations in lexicographic order