Twisted GFSR generators II
DOI10.1145/189443.189445zbMATH Open0849.94015OpenAlexW2111433785MaRDI QIDQ4876037FDOQ4876037
Authors: Makoto Matsumoto, Yoshiharu Kurita 
Publication date: 12 November 1996
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Full work available at URL: http://ir.lib.hiroshima-u.ac.jp/00015034
Recommendations
- Twisted GFSR generators
- scientific article; zbMATH DE number 1014989
- Poisson twister generator by cumulative frequency technology
- GENERALIZING THE TWIST-AND-FLIP PARADIGM: II
- scientific article; zbMATH DE number 4063974
- Generalized twisted Gabidulin codes
- Torsion generators of the twist subgroup
- On fiducial generators
Random number generation in numerical analysis (65C10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (22)
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Random sampling from low-discrepancy sequences: applications to option pricing
- Random packing of hyperspheres and Marsaglia's parking lot test
- Tests of randomness by the gambler's ruin algorithm
- Good random number generators are (not so) easy to find
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Generating low-discrepancy sequences from the normal distribution: Box-Muller or inverse transform?
- Maximum likelihood estimators for ARMA and ARFIMA models: a Monte Carlo study.
- On pricing discrete barrier options using conditional expectation and importance sampling Monte Carlo
- Polynomial pseudo-random number generator via cyclic phase
- Improved long-period generators based on linear recurrences modulo 2
- Computation of the endogenous mortgage rates with randomized quasi-Monte Carlo simulations
- Randomized quasi-Monte Carlo methods in pricing securities
- A search for good pseudo-random number generators: survey and empirical studies
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- Uniform random number generation
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Maximally equidistributed pseudorandom number generators via linear output transformations
- Gambling tests for pseudorandom number generators
- High dimensional simulation
- Resolution-stationary random number generators
- A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
This page was built for publication: Twisted GFSR generators II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876037)
