✦ LIBER ✦

Modified Pseudorandom Number Generators

✍ Scribed by Ratz, Herbert C.; Hildebrand, J. V.

Book ID: 117903762
Publisher: Institute of Electrical and Electronics Engineers
Year: 1967
Tongue: English
Weight: 698 KB
Volume: EC-16
Category: Article
ISSN: 0367-7508
DOI: 10.1109/pgec.1967.264749

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Thoughts on pseudorandom number generato

Thoughts on pseudorandom number generators

✍ B.D. Ripley 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 855 KB

Pseudorandom number generators for Salfo

Pseudorandom number generators for Salford FTN77

✍ Kenneth G. Hamilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Previous articles compared and analyzed the pseudorandom number generators that are delivered with offthe-shelf Fortran compilers for personal computers, and updated two CPC library elements to support multiple Fortran compilers. In the current work, the standard generator that is provided with Salf

Pseudorandom number generators for perso

Pseudorandom number generators for personal computers II

✍ Kenneth G. Hamilton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A previous article [Comput. Phys. Commun. 75 (1993) 105] compared and analyzed the pseudorandom number generators that are delivered with off-the-shelf Fortran compilers for personal computers. Since the writing of that article, Microsoft has released a new 32-bit protected mode compiler which inclu

Pseudorandom Number Generators Based on

Pseudorandom Number Generators Based on Chaotic Dynamical Systems

✍ Janusz Szczepański; Zbigniew Kotulski 📂 Article 📅 2001 🏛 World Scientific Publishing Company 🌐 English ⚖ 211 KB

Intensive statistical complexity measure

Intensive statistical complexity measure of pseudorandom number generators

✍ H.A. Larrondo; C.M. González; M.T. Martín; A. Plastino; O.A. Rosso 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 245 KB

A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity (Phy

Matrix generator of pseudorandom numbers

✍ N.Z Akopov; G.K Savvidy; N.G Ter-Arutyunyan-Savvidy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 272 KB