Keywords
RandomnessRandom number generationTheory of computationFibonacci numberPseudorandom number generatorComputer scienceMathematicsSequence (biology)Discrete mathematicsAlgorithmStatistics
Affiliated Institutions
Related Publications
Randomness and degrees of irregularity.
The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to ...
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an incr...
Primality and Cryptography.
From the Publisher: A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretica...
Two fast implementations of the “minimal standard” random number generator
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.
Scale-sensitive dimensions, uniform convergence, and learnability
Learnability in Valiant's PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conve...
Publication Info
- Year
- 1994
- Type
- article
- Volume
- 53
- Issue
- 1
- Pages
- 77-120
- Citations
- 275
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
275
OpenAlex
Cite This
Pierre L’Ecuyer
(1994).
Uniform random number generation.
Annals of Operations Research
, 53
(1)
, 77-120.
https://doi.org/10.1007/bf02136827
Identifiers
- DOI
- 10.1007/bf02136827