Observations on the generation of permutations from random sequences

References

• Aldous , D. and Diaconis , P. 1986 . Shuffling cards and stopping times . Amer. Math. Monthly , 93 : 333 – 348 .
   Web of Science ®Google Scholar
• Balbine , G. De . 1967 . Note on random permutations . Math. Comp , 21 : 710 – 712 .
   Google Scholar
• Chaitin , G. J. 1966 . On the length of programs for computing finite binary sequences . J. ACM , 13 : 547 – 569 .
   Web of Science ®Google Scholar
• Cochran , W. G. and Cox , G. M. 1957 . Experimental Designs , 2nd ed. , New York : Wiley .
   Google Scholar
• Durstenfeld , R. 1964 . Random permutation (algorithm 235) . Comm. ACM , 7 : 420 – 420 .
   Web of Science ®Google Scholar
• Hardy , G. H. and Wright , E. M. 1960 . An Introduction to the Theory of Numbers , 4th ed. , Oxford : Clarendon Press .
   Google Scholar
• Kimble , G. W. 1978 . “ Research problem (no. 12) ” . In Algorithmic Aspects of Combinatorics , Edited by: Alspach , B. , Hell , P. and Miller , D. J. Amsterdam : North-Holland .
   Google Scholar
• Knuth , D. E. 1973 . Fundamental Algorithms , 2nd ed. , Reading, MA : Addison-Wesley .
   Google Scholar
• Knuth , D. E. 1981 . Seminumerical Algorithms , 2nd ed. , Reading, MA : Addison-Wesley .
   Google Scholar
• Moses , L. E. and Oakford , R. V. 1963 . Tables of Random Permutations , Stanford : Stanford University Press .
   Google Scholar
• Neiderreiter , H. 1978 . Quasi-Monte Carlo methods and pseudo-random numbers . Bull. Amer. Math. Soc. , 84 : 957 – 1041 .
   Google Scholar
• Nijenhuis , A. and Wilf , H. S. 1978 . Combinatorial Algorithms , 2nd ed. , New York : Academic Press .
   Google Scholar