Recommendations
Cites work
- scientific article; zbMATH DE number 3557795 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (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 7051269 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 5279410 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Gray Code for Necklaces of Fixed Density
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- A Survey of Combinatorial Gray Codes
- A loop-free algorithm for generating the linear extensions of a poset
- A loopless algorithm for generating the permutations of a multiset
- Computing and Combinatorics
- De Bruijn sequences for fixed-weight binary strings
- De Bruijn sequences for the binary strings with maximum density
- Efficient oracles for generating binary bubble languages
- Exhaustive generation of combinatorial objects by ECO
- Generating Linear Extensions Fast
- Generating Multiset Permutations in Constant Time
- Generating linear extensions of posets by transpositions
- Gray codes for necklaces
- Gray codes for reflectable languages
- Gray codes from antimatroids
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Loopless generation of linear extensions of a poset
- On universal cycles of labeled graphs
- Random Generation and Enumeration of Proper Interval Graphs
- Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
- The coolest way to generate combinations
- Universal Cycles of Discrete Functions
- Universal cycles for combinatorial structures
- de Bruijn sequences and de Bruijn graphs for a general language
Cited in
(21)- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Constructing the first (and coolest) fixed-content universal cycle
- Cool-lex order and \(k\)-ary Catalan structures
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Successor rules for flipping pancakes and burnt pancakes
- De Bruijn sequences for the binary strings with maximum density
- Efficient oracles for generating binary bubble languages
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Traversing combinatorial 0/1-polytopes via optimization
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- The coolest way to generate binary strings
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Flip-swap languages in binary reflected Gray code order
- A shift Gray code for fixed-content Łukasiewicz words
- Properties of the cycles that contain all vectors of weight \(\le k\)
- Bubble-flip -- a new generation algorithm for prefix normal words
- Combinatorial generation via permutation languages. I: Fundamentals
- On infinite prefix normal words
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Generating 2-Gray codes for ballot sequences in constant amortized time
This page was built for publication: Binary bubble languages and cool-lex order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645969)
