✦ LIBER ✦

The random number generators of the Turbo Pascal family

✍ Scribed by Birgit Dohmann; Michael Falk; Karin Lessenich

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 370 KB
Volume: 12
Category: Article
ISSN: 0167-9473
DOI: 10.1016/0167-9473(91)90108-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pascal functions for the generation of r

Pascal functions for the generation of random numbers

✍ S.H. Bakry; M. Shatila 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Criteria for the assessment of random nu

Criteria for the assessment of random number generators

✍ Lothar Afflerbach 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 670 KB

The effect of random number generators o

The effect of random number generators on an application

✍ Edwin G. Landauer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A Test of the Equivalence of Four Random

A Test of the Equivalence of Four Random Number Generators – A Simulation Study

✍ Michael J. Rovine; Alexander von Eye; Constance J. Jones 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

On the number of generators of a module

✍ Joel M. Cohen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 704 KB

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d