Further Recursive Algorithms for Multidimensional Table Computation
Brian Phillips Murphy, G. A. Bartlett · COMPSTAT · 1988
We briefly review some recursive algorithms in the literature, and see that most seem to fall into two broad classes: classical branch-and-bound backtracking, and mixed-radix integer counting. New examples of the latter are shown, and it is indicated how more can be obtained from these to perform a wide range of tabular computation.