Constructive combinatorics
On rotations and the generation of binary trees
Journal of Algorithms
A Survey of Combinatorial Gray Codes
SIAM Review
On the loopless generation of binary tree sequences
Information Processing Letters
Simple Combinatorial Gray Codes Constructed by Reversing Sublists
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
A general exhaustive generation algorithm for Gray structures
Acta Informatica
New permutation coding and equidistribution of set-valued statistics
Theoretical Computer Science
Generating gray codes in o(1) worst-case time per word
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Journal of Combinatorial Theory Series A
Loop-free Gray code algorithm for the e-restricted growth functions
Information Processing Letters
| Hi-index | 0.89 |
A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.