
- 1 BENTLEY, J.L., AND SAXE, J.B. Algorithm. Generating sorted hsts of randoms. Rep. CMU-CS- 79-113, Carnegie-Mellon Univ, Pittsburgh, Pa., Comput. Scl. Dep., March 1979.Google Scholar
- 2 DAVID, H.A. Order Stat~sttcs. Wiley, New York, 1970.Google Scholar
- 3 FRIEDMAN, J.H. Random event generation with preferred frequency distributions. J. Comput Phys. 7, 2 (April 1971), 201-218Google Scholar
- 4 JOHNSON, N.L, AND KOTZ, S Continuous Unwar~ate Dtstr~but~ons--2 Houghton-Mifflin, Boston, Mass., 1970Google Scholar
- 5 KNUTH, D.E. The Art of Computer Programming, vol. 2. Sem~numer~cal Algorithms. Addtson- Wesley, Reading, Mass., 1969. Google Scholar
- 6 KNUTH, D.E. The Art of Computer Programmzng, vol. 3. Sorting and Searchtng. Addison- Wesley, Reading, Mass., 1973. Google Scholar
Index Terms
Generating Sorted Lists of Random Numbers
Recommendations
Fishburn diagrams, Fishburn numbers and their refined generating functions
The Fishburn numbers can be defined as the coefficients of the generating function1+@?m=1~@?i=1m(1-(1-t)^i). Combinatorially, the Fishburn numbers enumerate certain supersets of sets enumerated by the Catalan numbers. We add to this work by giving an ...
ACORN-A new method for generating sequences of uniformly distributed Pseudo-random Numbers
A new family of pseudo-random number generators, the ACORN (additive congruential random number) generators, is proposed. The resulting numbers are distributed uniformly in the interval [0, 1). The ACORN generators are defined recursively, and the (k + ...
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
We describe the recursive structures of the set of two-stack sortable permutations which avoid 132 and the set of two-stack sortable permutations which contain 132 exactly once. Using these results and standard generating function techniques, we ...






Comments