- Bitner , J. R. , Ehrlich , G. and Reingold , E. M. 1976 . Efficient generation of the binary reflected gray code and its applications . Comm. ACM , 19 : 517 – 521 .
- Ehrlich , G. 1973 . Loopless algorithms for generating permutations, combination, and other combinatorial configurations . ACM , 20 : 500 – 513 .
- Foata , D. and Zeilberger , D. 1997 . A classic proof of a recurrence for a very classical sequence . J. Combinatorial Theory Series A , 80 : 380 – 384 .
- Hu , T. C. and Tien , B. N. 1976 . Generating permutations with nondistinct items . Amer. Math. Monthly , 83 : 193 – 196 .
- Johnson , S. M. 1963 . Generation of permutations by adjacent transpositions . Math. Comput. , 17 : 282 – 285 .
- Korsh , J. and Lipschutz , S. 1997 . Generating multiset permutations in constant time . J. Algorithms , 25 : 321 – 335 .
- Korsh , J. F. and Lipschutz , S. 1998 . Shifts and loopless generation of k-ary trees . Inform. Process. Lett. , 65 : 235 – 240 .
- Lehmer , D. H. 1964 . “ The machine tools of combinatorics. ” . In Applied Combinatorial Mathematics , Edited by: Beckenbach , E. F. 5 – 31 . New York : Wiley .
- Lucas , J. M. , Roelants von Baronaigien , D. and Ruskey , F. 1993 . On rotations and the generation of binary trees . J. Algorithms , 15 : 1 – 24 .
- Savage , C. D. 1997 . A survey of combinatorial Gray codes . SIAM Review , 39 (4} ) : 605 – 629 .
- Stanley , R. P. 1997 . Hipparchus, Plutarch, Schröder and Hough . Amer. Math. Monthly , : 344 – 350 .
International Journal of Computer Mathematics
Volume 80, 2003 - Issue 6