One sequence to rule them all: O(1)-time parallel generation of mixed-radix Gray codes
From MaRDI portal
Publication:7363406
Cites work
- A book proof of the middle levels theorem
- A fast algorithm to generate Beckett-Gray codes
- A note on Beckett-Gray codes and the relationship of Gray codes to data structures
- A parallel algorithm for generating combinations
- A short proof of the middle levels theorem
- A Survey of Combinatorial Gray Codes
- Affine m-ary gray codes
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges
- Combinatorial generation via permutation languages. I: Fundamentals
- Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
- Combinatorial generation: greedy approaches and symmetry
- Combinatorial Gray codes -- an updated survey
- Doubly adjacent gray codes for the symmetric group
- Efficient generation of the binary reflected gray code and its applications
- Flip-swap languages in binary reflected Gray code order
- Generating pivot gray codes for spanning trees of complete graphs in constant amortized time
- Generating signed permutations by twisting two-sided ribbons
- scientific article; zbMATH DE number 3557795 (Why is no real title available?)
- scientific article; zbMATH DE number 2040940 (Why is no real title available?)
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Maximize the rightmost digit: Gray codes for restricted growth strings
- Proof of the middle levels conjecture
- Shorthand universal cycles for permutations
- The greedy Gray code algorithm
This page was built for publication: One sequence to rule them all: \( \mathcal{O}(1)\)-time parallel generation of mixed-radix Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363406)
