scientific article; zbMATH DE number 2040940
From MaRDI portal
Publication:4452089
Recommendations
Cited in
(27)- Efficient generation of restricted growth words
- Improved methods for generating quasi-Gray codes
- More restrictive Gray codes for necklaces and Lyndon words
- Gray visiting Motzkins
- A fast algorithm to generate Beckett-Gray codes
- Strings from linear recurrences and permutations: a gray code
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Generating Gray codes for weak orders in constant amortized time
- Efficient coroutine generation of constrained Gray sequences
- Gray coding cubic planar maps
- Gray code for permutations with a fixed number of cycles
- scientific article; zbMATH DE number 1933234 (Why is no real title available?)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Gray code orders for \(q\)-ary words avoiding a given factor
- Traversing combinatorial 0/1-polytopes via optimization
- Minimal change list for Lucas strings and some graph theoretic consequences
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
- Generalized algorithm for restricted weak composition generation
- Flip-swap languages in binary reflected Gray code order
- Gray codes for signed involutions
- The coolest way to generate combinations
- Binary bubble languages and cool-lex order
- Gray codes for involutions
- A general exhaustive generation algorithm for Gray structures
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Restricted compositions and permutations: from old to new Gray codes
- Generating 2-Gray codes for ballot sequences in constant amortized time
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 Q4452089)
