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
Constant time generation of derangements
Information Processing Letters
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
Combinatorial generation by fusing loopless algorithms
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Loop-Free Gray Code Algorithms for the Set of Compositions
Journal of Mathematical Modelling and Algorithms
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
Combinatorial generation by fusing loopless algorithms
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Hi-index | 0.00 |