Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
Journal of Discrete Algorithms
The rotation graph of k-ary trees is Hamiltonian
Information Processing Letters
Gray codes for reflectable languages
Information Processing Letters
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
Hi-index | 0.00 |