Cycle length in a random function
HTML articles powered by AMS MathViewer
- by P. W. Purdom and J. H. Williams PDF
- Trans. Amer. Math. Soc. 133 (1968), 547-551 Request permission
References
- Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms. MR 633878
- L. A. Shepp and S. P. Lloyd, Ordered cycle lengths in a random permutation, Trans. Amer. Math. Soc. 121 (1966), 340–357. MR 195117, DOI 10.1090/S0002-9947-1966-0195117-8
- Donald E. Knuth, The art of computer programming, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Volume 1: Fundamental algorithms. MR 0378456
Additional Information
- © Copyright 1968 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 133 (1968), 547-551
- MSC: Primary 60.10; Secondary 05.00
- DOI: https://doi.org/10.1090/S0002-9947-1968-0228032-3
- MathSciNet review: 0228032