Pages that link to "Item:Q4099520"
From MaRDI portal
The following pages link to Efficient generation of the binary reflected gray code and its applications (Q4099520):
Displayed 10 items.
- Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
- On cyclic 〈m,n〉-enumerations (Q4947158) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A low spatial complexity algorithm to generate combinations with the strong minimal change property (Q5242834) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5970257) (← links)
- Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length (Q6115821) (← links)
- Combinatorial generation via permutation languages. III: Rectangulations (Q6156087) (← links)