Mersenne twister
From MaRDI portal
Publication:4228541
DOI10.1145/272991.272995zbMATH Open0917.65005OpenAlexW2095595785WikidataQ55871551 ScholiaQ55871551MaRDI QIDQ4228541FDOQ4228541
Authors: Makoto Matsumoto, Takuji Nishimura 
Publication date: 5 August 1999
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/files/public/1/15032/20141016122634147579/ACMTraModel_8_3.pdf
Recommendations
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Tables of 64-bit Mersenne twisters
- Implementing 64-bit Maximally Equidistributed F 2 -Linear Generators with Mersenne Prime Period
- Toward a universal random number generator
- Maximally equidistributed pseudorandom number generators via linear output transformations
- A new class of pseudo-random sequences from Mersenne numbers
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- On a multiplicative generator of pseudorandom numbers
computational complexityalgorithmrandom number generationMersenne primesfinite fieldsstatistical testsprimitive polynomialsMersenne twisterincomplete arraymultiple-recursive matrix method\(k\)-distributioninversive-decimation method
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (only showing first 100 items - show all)
- An analysis of chain characteristics in the cryptanalytic TMTO method
- A biased random-key genetic algorithm for single-round divisible load scheduling
- GenEx: a simple generator structure for exclusive processes in high energy collisions
- Walsh figure of merit for digital nets: an easy measure for higher order convergent QMC
- A comparison of methods for clustering longitudinal data with slowly changing trends
- A Python/C library for bound-constrained global optimization with continuous GRASP
- An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
- The worst response of mistuned bladed disk system using neural network and genetic algorithm
- Numerical modeling of discrete multi-crack growth applied to pattern formation in geological brittle media
- Computational aspects of sequential Monte Carlo filter and smoother
- Spectrum and entropy of C-systems MIXMAX random number generator
- Large eddy simulation of low-frequency unsteadiness in a turbulent shock-induced separation bubble
- Benchmark testing of algorithms for very robust regression: FS, LMS and LTS
- A biased random-key genetic algorithm for data clustering
- GRASP with path relinking heuristics for the antibandwidth problem
- Forbidden ordinal patterns in higher dimensional dynamics
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Flat histogram Monte Carlo simulations of triangulated fixed-connectivity surface models
- Chemotaxis and random motility in unsteady chemoattractant fields: a computational study
- The acceptance-rejection method for low-discrepancy sequences
- Stochastic Runge-Kutta methods with deterministic high order for ordinary differential equations
- The defeasible nature of coherentist justification
- A numerical approach to copolymers at selective interfaces
- Towards new directions of data mining by evolutionary fuzzy rules and symbolic regression
- A modelling approach to explore the critical environmental parameters influencing the growth and establishment of the invasive seaweed \textit{Undaria pinnatifida} in Europe
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- ISIM: A Program for Grand Canonical Monte Carlo Simulations of the Ionic Environment of Biomolecules
- Finding the best portable congruential random number generators
- ASCOT: solving the kinetic equation of minority particle species in tokamak plasmas
- The method and criterion for quality assessment of random number sequences
- RVGEN: a tool for generation of random variates
- Speeding up continuous GRASP
- Quasi-Monte Carlo methods for lattice systems: a first look
- Rationality Problem for Algebraic Tori
- A Newton's method for the continuous quadratic knapsack problem
- Simulation of stochastic processes using graphics hardware
- A biased random-key genetic algorithm for the Steiner triple covering problem
- Multi-level Monte Carlo finite volume methods for uncertainty quantification in nonlinear systems of balance laws
- The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems
- MersenneTwister
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Estimation for the distribution of two-dimensional discrete scan statistics
- A fast swap-based local search procedure for location problems
- Simulated annealing for the machine reassignment problem
- Randomized heuristics for the family traveling salesperson problem
- Generating good pseudo-random numbers
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
- Using a TSP heuristic for routing order pickers in warehouses
- The MIXMAX random number generator
- GRASP with path-relinking for the generalized quadratic assignment problem
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- Regulation of task differentiation in wasp societies: a bottom-up model of the ``common stomach
- Random numbers from a delay equation
- From rough path estimates to multilevel Monte Carlo
- GPU implementations of the Bond fluctuation model
- SIMD-oriented fast Mersenne twister: a 128-bit pseudorandom number generator
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- A bootstrap test for equality of variances
- Quantum systems for Monte Carlo methods and applications to fractional stochastic processes
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- A comparison between (quasi-)Monte Carlo and cubature rule based methods for solving high-dimensional integration problems
- Variance reduction in sample approximations of stochastic programs
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Entanglement negativity and conformal field theory: a Monte Carlo study
- Solving systems of nonlinear equations with continuous GRASP
- A dynamic self-adaptive harmony search algorithm for continuous optimization problems
- The multi-level Monte Carlo finite element method for a stochastic Brinkman problem
- GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
- Algorithmically generated rodent hepatic vascular trees in arbitrary detail
- A power study of goodness-of-fit tests for multivariate normality implemented in R
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- Supplement: Efficient weak second order stochastic Runge-Kutta methods for non-commutative Stratonovich stochastic differential equations
- Perturbing the hexagonal circle packing: a percolation perspective
- A semi-Lagrangian micro-macro method for viscoelastic flow calculations
- Variants of Mersenne Twister suitable for graphic processors
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Clone wars: distributed detection of clone attacks in mobile WSNs
- Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
- Resolution-stationary random number generators
- On the quasi-Monte Carlo method with halton points for elliptic PDEs with log-normal diffusion
- Random numbers for parallel computers: requirements and methods, with emphasis on gpus
- A reduced order model for a stable embedded boundary parametrized Cahn-Hilliard phase-field system based on cut finite elements
- Overlapping batches for the assessment of solution quality in stochastic programs
- GPU-accelerated Gibbs sampling: a case study of the horseshoe probit model
- Probing the quantum-classical boundary with compression software
- Site-bond percolation on simple cubic lattices: numerical simulation and analytical approach
- Solving the weighted capacitated planned maintenance problem and its variants
- Support points
- High-performance financial simulation using randomized quasi-Monte Carlo methods
- Improving the statistical quality of random number generators by applying a simple ratio transformation
- Checking the quality of approximation of \(p\)-values in statistical tests for random number generators by using a three-level test
- Conversion of mersenne twister to double-precision floating-point numbers
- Sum-discrepancy test on pseudorandom number generators
- An integer linear programming formulation for the minimum cardinality segmentation problem
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
- A quantum genetic algorithm with quantum crossover and mutation operations
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Random packing of hyperspheres and Marsaglia's parking lot test
This page was built for publication: Mersenne twister
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228541)
