Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed

DOI10.1137/0217006MaRDI QIDQ3777296zbMATH OpenOpenAlexFDO

Authors Masanori Fushimi

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217006

zbMATH Keywords

M-sequenceGaussian elimination method0-1 integer linear programmingk-distributed sequenceTausworthe sequenceuniform random number generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Direct numerical methods for linear systems and matrix inversion (65F05) Applications of mathematical programming (90C90) Integer programming (90C10) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Recommendations

• scientific article; zbMATH DE number 1377848
• scientific article; zbMATH DE number 176879
• Uniform random number generators for parallel computers
• Uniform random number generation
• Toward a universal random number generator

Cited in

(5)

• A computational study of a genetic algorithm to solve the set covering problem
• Recent trends in random number and random vector generation
• Benchmark data set with service programs to approximately solve the set covering problem
• Random number generation: A combinatorial approach
• scientific article; zbMATH DE number 549220 (Why is no real title available?)

This page was built for publication: Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777296)