Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
An O(1) Time Algorithm for Generating Multiset Permutations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
A direct algorithm for restricted rotation distance
Information Processing Letters
Constant time generation of derangements
Information Processing Letters
Theoretical Computer Science
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
Generating balanced parentheses and binary trees by prefix shifts
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Gray codes for reflectable languages
Information Processing Letters
Generation of valid labeled binary trees
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Loop-Free Gray Code Algorithms for the Set of Compositions
Journal of Mathematical Modelling and Algorithms
Loop-free Gray code algorithm for the e-restricted growth functions
Information Processing Letters
Efficient generation of restricted growth words
Information Processing Letters
Hi-index | 0.90 |