An exhaustive analysis of multiplicative congruential random number generators with modulus 231-1
SIAM Journal on Scientific and Statistical Computing
A guide to simulation (2nd ed.)
A guide to simulation (2nd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fourier Analysis of Uniform Random Number Generators
Journal of the ACM (JACM)
A More Portable Fortran Random Number Generator
ACM Transactions on Mathematical Software (TOMS)
The k-distribution of generalized feedback shift register pseudorandom numbers
Communications of the ACM
Coding the Lehmer pseudo-random number generator
Communications of the ACM
Random number generators: good ones are hard to find
Communications of the ACM
Demonstrating the dangers of Pseudo-random numbers
ACM SIGCSE Bulletin
A fast uniform astronomical random number generator
ACM SIGSAC Review
Communications of the ACM - Special issue on simulation
Implementing a random number package with splitting facilities
ACM Transactions on Mathematical Software (TOMS)
Efficient and portable combined Tausworthe random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Traffic studies of unbuffered Delta networks
IBM Journal of Research and Development
Good pedagogical random number generators
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
A Unified Framework for Simulating Markovian Models of Highly Dependable Systems
IEEE Transactions on Computers
Implementation of classical mutual exclusion algorithms in Ada
ACM SIGAda Ada Letters
A comparison of four pseudo random number generators implemented in Ada
ACM SIGSIM Simulation Digest
A portable random number generator well suited for the rejection method
ACM Transactions on Mathematical Software (TOMS)
A search for good multiple recursive random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A note on the quality of random variates generated by the ratio of uniforms method
ACM Transactions on Modeling and Computer Simulation (TOMACS)
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
Radix-b extensions to some common empirical tests for pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Heuristics for Scheduling I/O Operations
IEEE Transactions on Parallel and Distributed Systems
I/O scheduling for digital continuous media
Multimedia Systems
Random variate generation for multivariate unimodal densities
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Bad subsequences of well-known linear congruential pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Neave effect also occurs with Tausworthe sequences
WSC '91 Proceedings of the 23rd conference on Winter simulation
On improving pseudo-random number generators
WSC '91 Proceedings of the 23rd conference on Winter simulation
Combining random number generators
WSC '91 Proceedings of the 23rd conference on Winter simulation
Noise generators for the simulation of digital communication systems
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Communications of the ACM
Inventing a new sorting algorithm: a case study
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Generalized Lehmer-Tausworthe random number generators
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Automated statistical methods for measuring the strength of block ciphers
Statistics and Computing
Methods for testing subblock patterns
Statistics and Computing
VMMP: A Practical Tool for the Development of Portable and Efficient Programs for Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
The first return time test of pseudorandom numbers
Journal of Computational and Applied Mathematics
Properties and prediction of flow statistics from sampled packet streams
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Estimating the number of components in a finite mixture model: the special case of homogeneity
Computational Statistics & Data Analysis
White-Box Cryptography and an AES Implementation
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Mathematics and Computers in Simulation
A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Efficient and portable multiple recursive generators of large order
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Small sample uniformity in random number generation
Computers & Mathematics with Applications
Quasi-random integration in high dimensions
Mathematics and Computers in Simulation
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Pseudorandom recursions: small and fast pseudorandom number generators for embedded applications
EURASIP Journal on Embedded Systems
Journal of Computational Physics
Double sampling for flow measurement on high speed links
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tile-based methods for interactive applications
ACM SIGGRAPH 2008 classes
Evolving descriptors for texture segmentation
Pattern Recognition
Finding the right level of abstraction for minimizing operational expenditure
Proceedings of the fourth workshop on High performance computational finance
A study of entropy sources in cloud computers: random number generation on cloud hosts
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
| Hi-index | 48.26 |
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, making up the proposed combined generators, satisfy stringent theoretical criteria for the quality of the sequence they produce (based on the Spectral Test) and are easy to implement in a portable way. The proposed simple combination method is new and produces a generator whose period is the least common multiple of the individual periods. Each proposed generator has been submitted to a comprehensive battery of statistical tests. We also describe portable implementations, using 16-bit or 32-bit integer arithmetic. The proposed generators have most of the beneficial properties of MLCGs. For example, each generator can be split into many independent generators and it is easy to skip a long subsequence of numbers without doing the work of generating them all.