Computationally easy, spectrally good multipliers for congruential pseudorandom number generators

January 15, 2020 Β· Declared Dead Β· πŸ› Software, Practice & Experience

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Guy Steele, Sebastiano Vigna arXiv ID 2001.05304 Category cs.DS: Data Structures & Algorithms Citations 8 Venue Software, Practice & Experience Last Checked 4 months ago
Abstract
Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag eight for generators with typical power-of-two moduli, analyzing in detail multipliers close to the square root of the modulus, whose product can be computed quickly.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted