The coolest way to generate combinations
From MaRDI portal
Publication:1044892
DOI10.1016/j.disc.2007.11.048zbMath1180.68297OpenAlexW2027483825MaRDI QIDQ1044892
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
loopless algorithmbinary stringsgenerating combinationsbranchless algorithmcolexconstant extra spaceGray code orderprefix rotationprefix shift
Related Items
On a Combinatorial Generation Problem of Knuth ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Star transposition Gray codes for multiset permutations ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Binary bubble languages and cool-lex order ⋮ Unranking of small combinations from large sets ⋮ The coolest way to generate binary strings ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density ⋮ Computing expectations and marginal likelihoods for permutations
Cites Work
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Determining the Hamilton-connectedness of certain vertex-transitive graphs
- A loopless algorithm for generating the permutations of a multiset
- Some Hamilton Paths and a Minimal Change Algorithm
- Efficient generation of the binary reflected gray code and its applications
- Generating Multiset Permutations in Constant Time
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
