Algorithm 382: combinations of M out of N objects [G6]
Communications of the ACM
Communications of the ACM
Some Hamilton Paths and a Minimal Change Algorithm
Journal of the ACM (JACM)
Algorithm 467: Matrix Transposition in Place
Communications of the ACM
ACM Transactions on Mathematical Software (TOMS)
Remark on “Algorithm 483: Masked Three-Dimensional Plot Program with Rotations [J6]”
ACM Transactions on Mathematical Software (TOMS)
Normal Random Numbers: Using Machine Analysis to Choose the Best Algorithm
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
A Comparison of Combination Generation Methods
ACM Transactions on Mathematical Software (TOMS)
Remark on algorithm 246: Graycode [Z]
ACM Transactions on Mathematical Software (TOMS)
Permutation Generation Methods
ACM Computing Surveys (CSUR)
Three new combination algorithms with the minimal change property
Communications of the ACM
Permutation enumeration: four new permutation algorithms
Communications of the ACM
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Generator of set-partitions to exactly R subsets [G7]
Communications of the ACM
Algorithm 465: student's t frequency [S14]
Communications of the ACM
Algorithm 466: four combinatorial algorithm [G6]
Communications of the ACM
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
Accelerated algorithm for pattern detection in logical analysis of data
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
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
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
Journal of Discrete Algorithms
Combinatorial Gray codes for classes of pattern avoiding permutations
Theoretical Computer Science
Gray codes for reflectable languages
Information Processing Letters
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
Gray codes for non-crossing partitions and dissections of a convex polygon
Discrete Applied Mathematics
Accelerated algorithm for pattern detection in logical analysis of data
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
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
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
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
Loop-free Gray code algorithm for the e-restricted growth functions
Information Processing Letters
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
Generating combinations by prefix shifts
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Analog Integrated Circuits and Signal Processing
Loopless functional algorithms
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Hamilton cycles in restricted rotator graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Counting and computing the Rand and block distances of pairs of set partitions
Journal of Discrete Algorithms
Cool-lex order and k-ary Catalan structures
Journal of Discrete Algorithms
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms (TALG)
Combinatorial generation by fusing loopless algorithms
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
A heuristic approximation method for the Banzhaf index for voting games
Multiagent and Grid Systems
| Hi-index | 0.11 |
The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.