A simple systolic algorithm for generating combinations in lexicographic order

DOI10.1016/0898-1221(92)90007-5MaRDI QIDQ1205904zbMATH OpenOpenAlexFDO

Authors Ivan Stojmenović

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

zbMATH Keywords

combination of \(m\) objectslexicographic ordersystolic algorithm

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Cites work

• A parallel algorithm for generating combinations
• A systolic design for generating combinations in lexicographic order
• A systolic generation of combinations
• Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
• Adjacent interchange generation of combinations
• An optimal parallel algorithm for generating combinations
• Generating combinations in parallel
• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• scientific article; zbMATH DE number 3752234 (Why is no real title available?)
• scientific article; zbMATH DE number 3407692 (Why is no real title available?)
• On random and adaptive parallel generation of combinatorial objects
• Parallel generation of permutations and combinations

This page was built for publication: A simple systolic algorithm for generating combinations in lexicographic order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205904)