scientific article; zbMATH DE number 822743

MaRDI QIDQ4856622zbMATH OpenFDO

Authors

Publication date 30 May 1996

zbMATH Keywords

algorithminteger sequencesminimal change

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05)

Recommendations

• An algorithm for generating subsets of fixed size with a strong minimal change property
• scientific article; zbMATH DE number 4021142
• scientific article; zbMATH DE number 559036
• scientific article; zbMATH DE number 1208725
• Lexicographical Ordering of k-Subsets of a Set

Cited in

(15)

• An algorithm for generating subsets of fixed size with a strong minimal change property
• Trimming and gluing Gray codes
• On the probability that subset sequences are minimal
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• Lexicographical Ordering of k-Subsets of a Set
• scientific article; zbMATH DE number 4021142 (Why is no real title available?)
• scientific article; zbMATH DE number 4099308 (Why is no real title available?)
• scientific article; zbMATH DE number 1208725 (Why is no real title available?)
• On the \(q\)-analog of the revolving door algorithm
• On a combinatorial generation problem of Knuth
• A low spatial complexity algorithm to generate combinations with the strong minimal change property
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Star transposition Gray codes for multiset permutations
• Generating all subsets of a finite set with disjoint unions
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

This page was built for publication:

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