Critical distances in pseudorandom sequences generated with composite moduli

DOI10.1080/00207169208804085zbMath0758.65003OpenAlexW2105531809MaRDI QIDQ4017023

A. De Matteis, Simonetta Pagnutti

Publication date: 16 January 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804085

zbMATH Keywords

pseudorandom numberslong-range correlationsparallel computationsperiodic sequencescomposite modulimultiplicative congruential generatorscritical distancesparallel Monte Carlo method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Random number generation in numerical analysis (65C10)

Related Items (2)

On the CRAY-System Random Number Generator ⋮ Good random number generators are (not so) easy to find

Cites Work

• Unnamed Item
• Long-range correlations in linear and non-linear random number generators
• Parallelization of random number generators and long-range correlations
• A remark on long-range correlations in multiplicative pseudo random number generators
• Optimal multipliers for pseudo-random number generation by the linear congruential method
• Pseudo-random numbers - a new proposal for the choice of multiplicators
• An a priori determination of serial correlation in computer generated random numbers

This page was built for publication: Critical distances in pseudorandom sequences generated with composite moduli