Efficient and portable combined Tausworthe random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
Strong deviations from randomness in m-sequences based on trinomials
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Tables of maximally equidistributed combined LFSR generators
Mathematics of Computation
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
Journal of the ACM (JACM)
Lattice computations for random numbers
Mathematics of Computation
Tables of 64-bit Mersenne twisters
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast combined multiple recursive generators with multipliers of the form a = ±2q ±2r
Proceedings of the 32nd conference on Winter simulation
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
SIAM Journal on Scientific Computing
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
Operations Research
Combined generators with components from different families
Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
On the xorshift random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Improved long-period generators based on linear recurrences modulo 2
ACM Transactions on Mathematical Software (TOMS)
WSC '05 Proceedings of the 37th conference on Winter simulation
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
An FPGA implementation of a parallelized MT19937 uniform random number generator
EURASIP Journal on Embedded Systems - FPGA supercomputing platforms, architectures, and techniques for accelerating computationally complex algorithms
Journal of Computational Physics
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Random number generators based on linear recurrences modulo 2 are among the fastest long-period generators currently available. The uniformity and independence of the points they produce, over their entire period length, can be measured by theoretical figures of merit that are easy to compute, and those having good values for these figures of merit are statistically reliable in general. Some of these generators can also provide disjoint streams and substreams efficiently. In this paper, we review the most interesting construction methods for these generators, examine their theoretical and empirical properties, and make comparisons.