Coding the Lehmer pseudo-random number generator
From MaRDI portal
Publication:5554718
DOI10.1145/362848.362860zbMath0167.45802OpenAlexW1973779036MaRDI QIDQ5554718
T. P. Bogyo, W. H. Payne, J. R. Rabung
Publication date: 1969
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362848.362860
Related Items
Implementing a multiple recursive generator with mersenne prime modulus, Optimal strong primes, Decomposition with simulated division for efficiently generating random numbers, A brief and understandable guide to pseudo-random number generators and specific models for security, Finding the best portable congruential random number generators, Numerical evaluation of a multi-stream pseudo-random number generator, An Improved Range Estimator of Sigma for Determining Sample Sizes, Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus, White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane, Implicit enumeration algorithms for the set-partitioning problem, Thoughts on pseudorandom number generators, The revised recursive reduction for efficiently generating random numbers, Some comments on computer implementation of random number generators, A Complete Guide to Gamma Variate Generation, Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator, 64-bit and 128-bit DX random number generators, Uniformity of congruential pseudorandom number generators. Dependence on length of number sequence and resolution, Experimental comparison of the powers of the two-sample tests of wilcoxon and student under logistic parent distributions, Discrete event simulation modelling of computer systems for performance evaluation, Quasi-Monte Carlo methods and pseudo-random numbers, Testing the autoregressive parameter with the t statistic, A fast random number generator with good statistical properties, Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. (On the convergence ordre of difference methods approximating parabolic initial-boundary value problems), Some good multipliers for random number generators for 16-bit microcomputers
