The coolest way to generate combinations

DOI10.1016/J.DISC.2007.11.048MaRDI QIDQ1044892zbMATH OpenOpenAlexFDO

Authors Frank Ruskey, Aaron Williams

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.11.048

zbMATH Keywords

binary stringsgenerating combinationsloopless algorithmbranchless algorithmcolexconstant extra spaceGray code orderprefix rotationprefix shift

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Nonnumerical algorithms (68W05)

Recommendations

• Computing and Combinatorics
• The coolest way to generate binary strings
• scientific article; zbMATH DE number 4195954
• Lexicographic ordering, ranking and unranking of combinations
• scientific article; zbMATH DE number 4106841

Cites work

• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• scientific article; zbMATH DE number 4106841 (Why is no real title available?)
• scientific article; zbMATH DE number 1354135 (Why is no real title available?)
• scientific article; zbMATH DE number 2040940 (Why is no real title available?)
• scientific article; zbMATH DE number 1522933 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• scientific article; zbMATH DE number 4195954 (Why is no real title available?)
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• A loopless algorithm for generating the permutations of a multiset
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Computing and Combinatorics
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Efficient generation of the binary reflected gray code and its applications
• Generating Multiset Permutations in Constant Time
• Gray codes for involutions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Some Hamilton Paths and a Minimal Change Algorithm

Cited in

(17)

• Star transposition Gray codes for multiset permutations
• Computing and Combinatorics
• Constructing the first (and coolest) fixed-content universal cycle
• On a combinatorial generation problem of Knuth
• Cool-lex order and \(k\)-ary Catalan structures
• Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
• Successor rules for flipping pancakes and burnt pancakes
• Constant time and space updates for the sigma-tau problem
• De Bruijn sequences for the binary strings with maximum density
• Efficient oracles for generating binary bubble languages
• Computing expectations and marginal likelihoods for permutations
• On the hardness of Gray code problems for combinatorial objects
• The coolest way to generate binary strings
• Flip-swap languages in binary reflected Gray code order
• A shift Gray code for fixed-content Łukasiewicz words
• Binary bubble languages and cool-lex order
• Unranking of small combinations from large sets

This page was built for publication: The coolest way to generate combinations

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