Fast random integer generation in an interval
From MaRDI portal
Publication:6600038
DOI10.1145/3230636zbMATH Open1544.65022MaRDI QIDQ6600038
Publication date: 8 September 2024
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random permutations on distributed, external and hierarchical memory
- Parallelization of random number generators and long-range correlations
- Stochastic simulation: Algorithms and analysis
- TestU01
- Random sampling with a reservoir
- Tables of linear congruential generators of different sizes and good lattice structure
- Random variate generation for multivariate unimodal densities
- Mersenne twister
- Latin supercube sampling for very high-dimensional simulations
- Using permutations in regenerative simulations to reduce variance
- On the xorshift random number generators
- Finding probably best systems quickly via simulations
- A variant of importance splitting for rare event estimation
- Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination
- A search for good multiple recursive random number generators
- Generating Random Permutations by Coin Tossing
- Algorithm 947
Related Items (2)
Replicated computational results (RCR) report for ``Fast random integer generation in an interval ⋮ Drawing random floating-point numbers from an interval
This page was built for publication: Fast random integer generation in an interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6600038)
