Coding the Lehmer pseudo-random number generator

DOI10.1145/362848.362860MaRDI QIDQ5554718zbMATH OpenOpenAlexFDO

Authors W. H. Payne, T. P. Bogyo, John 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

zbMATH Keywords

numerical analysis

Cited in

(25)

• Numerical evaluation of a multi-stream pseudo-random number generator
• Implicit enumeration algorithms for the set-partitioning problem
• Some comments on computer implementation of random number generators
• Uniformity of congruential pseudorandom number generators. Dependence on length of number sequence and resolution
• Discrete event simulation modelling of computer systems for performance evaluation
• Some good multipliers for random number generators for 16-bit microcomputers
• Decomposition with simulated division for efficiently generating random numbers
• Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
• A brief and understandable guide to pseudo-random number generators and specific models for security
• 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)
• The revised recursive reduction for efficiently generating random numbers
• Finding the best portable congruential random number generators
• A Complete Guide to Gamma Variate Generation
• An Improved Range Estimator of Sigma for Determining Sample Sizes
• Experimental comparison of the powers of the two-sample tests of wilcoxon and student under logistic parent distributions
• Quasi-Monte Carlo methods and pseudo-random numbers
• Implementing a multiple recursive generator with mersenne prime modulus
• 64-bit and 128-bit DX random number generators
• 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
• Derandomization with pseudorandomness
• Testing the autoregressive parameter with the t statistic
• Optimal strong primes
• Thoughts on pseudorandom number generators

This page was built for publication: Coding the Lehmer pseudo-random number generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554718)