A practical approach to testing random number generators in computer algebra systems

DOI10.1134/S096554252001008XzbMath1476.68310arXiv2004.08913OpenAlexW3098307239WikidataQ114616176 ScholiaQ114616176MaRDI QIDQ2206409

D. S. Kulyabov, A. V. Korol'kova, M. N. Gevorkyan, Anastasiya Demidova

Publication date: 22 October 2020

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08913

zbMATH Keywords

random number generation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Random number generation in numerical analysis (65C10)

Uses Software

• Maple
• Mathematica
• Matlab
• SymPy
• MersenneTwister
• gjrand
• GSL
• dieharder
• TestU01
• Diehard
• PractRand

Cites Work

• Unnamed Item
• \(E=I+T\): the internal extent formula for compacted tries
• TestU01
• Mersenne twister
• On the xorshift random number generators
• Статистический критерий типа критерия пустых ящиков