Optimal multipliers for linear congruential pseudo-random number generators with prime moduli: Parallel computation and properties

DOI10.1023/A:1022333627834zbMath0935.65001OpenAlexW322602836MaRDI QIDQ1293242

K. Appert

Publication date: 4 May 2000

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022333627834

zbMATH Keywords

parallel computationdiscrepancysearch algorithmsspectral testcontinued fraction expansionlinear congruential pseudo-random number generators

Mathematics Subject Classification ID

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

Related Items (4)

A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs ⋮ A computational investigation of the optimal Halton sequence in QMC applications ⋮ On the optimal Halton sequence

This page was built for publication: Optimal multipliers for linear congruential pseudo-random number generators with prime moduli: Parallel computation and properties