Lothar Afflerbach/H. Grothe: The lattice structure of pseudo-random
vectors generated by matrix generators.
J. Comp. Appl. Math. 23 (1988), 127-131.

7212 Lothar Afflerbach/Juergen Lehn (ed.): Zufallszahlen und Simulationen.
Teubner 1986.

J. Altaber: Representations arithmetiques de grandeurs aleatoires.
Ann. Fac. Sci. Univ. Clermont-Ferrand 37 (1967), 1-61.

7573 Stuart Anderson: Random number generation on vector supercomputers and
other advanced architectures. SIAM Review 32 (1990), 221-251.

7566 Debra Andre'/Gary Mullen/Harald Niederreiter: Figures of merit for
digital multistep pseudorandom numbers. Math. Comp. 54 (1990), 737-748.

25918 David Bailey/Richard Crandall: Random generators and normal numbers.
Exp. Math. 11/4 (2002), 527-546.

26000 Lucilla Baldini: Analisi armonica e successioni automatiche generalizzate.
Tesi LM Ferrara 2015, 145.

26783 Lucilla Baldini/Josef Eschgfaeller: Random functions from coupled
dynamical systems. arXiv: 1609.01750 (2016), 17p.

Jerry Banks (ed.): Handbook of simulation. Wiley 1997.

24768 Elaine Barker/John Kelsey: Recommendation for random number generation
using deterministic random bit generators. NIST Special Publ. 800-90A,
NIST 2012, 136p.

L. Blum/M. Blum/M. Schub: A simple unpredictable pseudo-random number
generator. SIAM J. Comp. 15/2 (1986), 364-383.

7655 Wolfgang Blum: Die Zufallszahlen werden knapp.
Die Zeit 22. Maerz 1996, ...

J. Boyar: Inferring sequences produced by a linear congruential generator
missing low-order bits. J. Cryptology 1 (1989), 177-184.

G. Brassard (ed.): Advances in cryptology. Proceedings of Crypto '89.
SLN Computer Science 435 (1990).

Paul Bratley/Bennet Fox/Linus Schrage: A guide to simulation.
Springer 1987, 400p. 3-540-96467-3. DM 98.

19132 Richard Brent: The myth of equidistribution for high-dimensional
simulation. Internet 2007, 5p.

M. Brown/H. Solomon: On combining pseudorandom number generators.
Ann. Statist. 7 (1979), 691-695.

25824 Peter Buchholz: Modellgestützte Analyse und Optimierung. Vorl. TU Dortmund 2014, 220p.

W. Celmaster/K. Moriarty: A method for vectorized random number generators.
J. Comput. Phys. 64 (1986), 271-275.

G. Cenacchi/A. de Matteis: Pseudo-random numbers for comparative Monte Carlo
calculations. Num. Math. 16 (1970), 11-15.

7576 G. Cenacchi/A. de Matteis: Quasi-random sequences by power residues.
Num. Math. 20 (1972), 54-63.

9797 Roberta Centrella: Numeri casuali - teoria e generatori dicotomici.
Tesi, Univ. Roma 1997.

B. Collings: Compound random number generators. 
J. Am. Stat. Ass. 82 (1987), 525-527.

7239 Raymond Couture/Pierre L'Ecuyer: Linear recurrences with carry
as uniform random number generators. 
Proc. 1995 Winter Simulation Conf. 1995, ...

Raymond Couture/Pierre L'Ecuyer/S. Tezuka: On the distribution of
k-dimensional vectors for simple and combined Tausworthe sequences.
Math. Comp. 60 (1993), 749-761, S11-16.

R. Coveyou: Random number generation is too important to be left to
chance. Studies Appl. Math. 3 (1970), 70-111.

J. Dagpunar: Principles of random variate generation. Oxford UP 1988.

I. Deak: Random number generators and simulation. Ak. Kiado' 1989.

Ulrich Dieter: Schwierigkeiten bei der Erzeugung gleichverteilter
Zufallszahlen. Proc. Op. Res. 8 (1979), 249-272.

7436 Ulrich Dieter: Probleme bei der Erzeugung gleichverteilter Zufallszahlen.
In 7212 Afflerbach, 7-20.

5006 Ulrich Dieter: Erzeugung von gleichverteilten Zufallszahlen.
In 4731 Chatterji/, 25-44.

Ulrich Dieter/J. Ahrens: Uniform random numbers. Graz 1974.

24606 Christophe Dutang/Diethelm Wuertz: A note on random number generation.
Internet 2009, 30p.

M. Ermakov: Note on pseudorandom sequences.
Zh. Vychisl. Mat. 12 (1972), 1077-1082.

M. Ermakov: Die Monte-Carlo-Methode und verwandte Fragen. Oldenbourg 1975.

26578 Josef Eschgfaeller/Andrea Scarpante: Dichotomic random number generators.
arXiv:1603.08500 (2016), 35p.

25966 Henri Faure: Review of the book "Random number generation and quasi-Monte
Carlo methods" by Harald Niederreiter. MR1172997, 1p.

7562 G. Fishman: Multiplicative congruential random number generators with 
modulus 2^\beta. An exhaustive analysis for \beta=32 and a partial analysis for
\beta=48. Math. Comp. 54 (1990), 331-344.

5049 George Fishman: Monte Carlo. Springer 1996, 730p.

G. Fishman/L. Moore: An exhaustive analysis of multiplicative congruential
random number generators with modulus 2^{31}-1.
SIAM J. Sci. Stat. Comp. 7 (1986), 24-45, 1058.

24604 Francesco Fraccaroli: Metodo Monte Carlo e generazione di numeri casuali.
Tesi Univ. Padova 2012, 4op.

J. Franklin: On the equidistribution of pseudo-random numbers.
Quart. Appl. Math. 16 (1958), 183-188.

J. Franklin: Deterministic simulation of random processes.
Math. Comp. 17 (1963), 28-59.

25831 Jens Frey/Carsten Zajanz/Matthias Schwarz: Pseudozufallszahlen. Internet ca. 2005, 21p.

M. Fushimi: An equivalence relation between Tausworthe and GFSR sequences
and applications. Appl. Math. Lett. 2 (1989), ...

M. Fushimi/Shu Tezuka: The k-distribution of generalized feedback shift 
register pseudorandom numbers. Comm. ACM 26 (1983), 516-523.

S. Gass/C. Harris (ed.): Encyclopedia of Operations Research and Management
Science. Kluwer, ca. 1995.

Friedrich Gebhardt: Generating pseudo-random numbers by shuffling a Fibonacci
sequence. Math. Comp. 21 (1967), 708-709.

James Gentle: Computer implementation of random number generators.
J. Comp. Appl. Math. 31 (1990), 119-125.

19307 James Gentle: Random number generation and Monte Carlo methods.
Springer 2003, 380p. Eur 67.

25471 Oded Goldreich: A primer on pseudorandom generators.
Internet (author's website) 2010, 120p.

D. Golenko: Simulation and statistical analysis of pseudo-random numbers
on electronic computers. Nauka 1965 (Russian).

P. Gritzmann/R. Hettich/R. Horst/E. Sachs (ed.): Operations Research '91.
Physica 1992.

7438 H. Grothe: Matrixgeneratoren zur Erzeugung gleichverteilter Zufalls-
vektoren. In 7212 Afflerbach/, 29-34.

A. Grube: Mehrfach rekursiv erzeugte Zufallszahlen.
Dissertation, Karlsruhe 1973.

A. Haas: The multiple prime random number generator.
ACM Trans. Math. Software 13/4 (1987), 368-381.

25858 Shin Harase: On the F_2-linear relations of Mersenne twister pseudorandom number
generators. Math. Comp. Simul. 100 (2014), 103-113.

J. Hastad: Pseudorandom generators under uniform assumptions.
Proc. 22nd ACM Symp. Theory of Comp. (1990), 395-404.

7162 Peter Hellekalek: Study of algorithms for primitive polynomials.
Internet (Salzburg) April 1994, 20p.
This paper concerns random number generators for parallel processors,
pseudorandom number generation and primitive polynomials, and algorithms
for primitive polynomials.

Peter Hellekalek: Good random number generators are (not so) easy to find.
Math. and Comp. in Simulation 46 (1998), 485-505.

Peter Hellekalek/Gerhard Larcher (ed.): Random and quasi-random point
sets. Springer LN Statistics 138 (1998).

G. Hill: Cyclic properties of pseudo-random sequences of Mersenne prime
residues. Comput. J. 22 (1979), 80-85.

7406 Edmund Hlawka/Robert Tichy (ed.): Number-theoretic analysis.
SLN Math. 1452 (1990).

7337 Loo-Keng Hua/Yuan Wang: Applications of number theory to numerical
analysis. Springer 1981, 240p. 3-540-10382-1. DM 128.

T. Hull/A. Dobell: Random number generators.
SIAM Rev. 4 (1962), 230-254.

24721 Andrea Iacobucci: Introduzione ai metodi di generazione di numeri
pseudocasuali. Tesi LT Univ. Ferrara 2013, 58p.

25827 Bernd Paul Jäger/Torsten Philipp/Paul Eberhard Rudolph/Karl-Ernst Biebler:
Über Tests von Zufallszahlgeneratoren. Internet ca. 2006, 19p.

F. James: A review of pseudorandom number generators.
Comput. Phys. Commun. 60 (1990), 329-344.

Birger Jansson: Random number generators. Almqvist & Wiksell 1966.

7609 Robert Jenkins: ISAAC. Internet (HTML version) 1996, 10p.

K. Joeckel/G. Rothe/W. Sendler (ed.): Bootstrapping and related techniques.
SLN Economics and Mathematical Systems 376 (1992).

R. Kannan/A. Lenstra/L. Lovasz: Polynomial factorization and nonrandomness
of bits of algebraic and some transcendental numbers.
Math. Comp. 50 (1988), 235-250.

18250 Alexander Keller/Stefan Heinrich/Harald Niederreiter (ed.): 7th International
Conference on Monte Carlo and Quasi-Monte Carlo methods in Scientific Computing.
Ulm 2006, 170p.

2129 Donald Knuth: The art of computer programming.
Volume 2: Seminumerical algorithms. Addison-Wesley.

8586 Evangelos Kranakis: Primality and cryptography. DM 50.

H. Krawczyk: How to predict congruential generators.
cccIn Brassard 1990, 138-153.

Jeffrey Lagarias: Pseudorandom number generators in cryptography and number
theory. Proc. Symp. Appl. Math. 42 (1990), 115-143.

Jeffrey Lagarias: Pseudorandom numbers. Prob. and Algor. ... (1995), 65-85.

25913 Jeffrey Lagarias: Pseudorandom numbers. Stat. Sci. 8/1 (1993), 31-39.

25292 Gerhard Larcher/.../Arne Winterhof: The FWF-special research area "Quasi-Monte
Carlo methods - theory and applications. Intl. Math. Nachr. 226 (2014), 1-19.

A. Law/W. Kelton: Simulation modeling and analysis. McGraw-Hill 1991.

7615 Pierre L'Ecuyer: Efficient and portable combined random number generators.
Comm. ACM 31 (1988), 742-749, 774.

7237 Pierre L'Ecuyer: Uniform random number generation.
Annals of Operations Research 53 (1993), 77-120.

7240 Pierre L'Ecuyer: Random number generators.
In Gass/Harris, ca. 1995, ...

7616 P. L'Ecuyer, P.: Random numbers for computer simulation.
Communications of the ACM 33 (1990), 85-97.

7241 Pierre L'Ecuyer: Recent advances in uniform random number generators.
Proc. 1994 Winter Simulation Conf. 1994, ...

25415 Pierre L'Ecuyer: Combined multiple recursive random number generators.
Internet 1995, 16p.

8733 Pierre L'Ecuyer: Random number generation. In Banks 1997, chap. 4, 55p.

24605 Pierre L'Ecuyer: Random numbers.
Int. Enc. Soc. Behav. Sci. ... (2001), 9p.

25412 Pierre L'Ecuyer: Uniform random number generators. Internet 2004, 31p.

24608 L'Ecuyer: Random number generation.
In J. Gentle/W. Härdle/Y. Mori (ed.): Handbook of computational statistics.
Springer 2004, 35-70.

25411 Pierre L'Ecuyer: Pseudorandom number generators. Internet 2007, 13p.

8735 Pierre L'Ecuyer/Terry Andrest: A random number generator based on
the combination of four lcgs. Internet 1996, 11p.

Pierre L'Ecuyer/F. Blouin/R. Couture: A search for good multiple recursive
random number generators. ACM Trans. Modeling Comp. Sim. 3/2 (1993), 87-98.

Pierre L'Ecuyer/S. Cote': Implementing a random number package with
splitting facilities. ACM Trans. Math. Software 17 (1991), 98-111.

25854 Pierre L'Ecuyer/Jacinthe Granger-Piche': Combined generators with components
from different families. Math. Comp. Simul. 62 (2003), 395-404.

25410 Pierre L'Ecuyer/Peter Hellekalek: Random number generators - selection
criteria and testing. Internet ca. 2000, 43p.

Pierre L'Ecuyer/R. Proulx: About polynomial-time unpredictable generators.
Proc. 1989 Winter Simulation Conf., IEEE Press 1989, 467-476.

Pierre L'Ecuyer/S. Tezuka: Structural properties for two classes of
combined random number generators. Math. Comp. 57 (1991), 735-746.

7214 Hannes Leeb: Random numbers for computer simulation.
Diplomarbeit, Salzburg 1995.

Juergen Lehn: Special methods for pseudorandom number generation.
In Joeckel/Rothe/Sendler 1992, 13-19.

Juergen Lehn: Pseudorandom number generators.
In Gritzmann/Hettich/Horst/Sachs 1992, 9-13.

Juergen Lehn/H. Neunzert (ed.): Random numbers and simulation.
J. Comp. Appl. Math. 31 (special issue).

7711 Juergen Lehn/Stefan Rettig: On the choice and implementation of
pseudorandom number generators. TH Darmstadt, preprint 1584 (1993).

25400 Christiane Lemieux: Monte-Carlo and quasi-Monte Carlo sampling.
Springer 2009, 380p. Eur 108 (Ebook).

M. Levin: On the choice of parameters in generators of pseudorandom numbers.
Dokl. Ak. Nauk SSSR 307 (1989), 529-534 (Russian).

18282 Hua-ning Liu: New pseudorandom sequences constructed by quadratic residues
and Lehmer numbers. Proc. AMS ... (2006), ...

M. Luby: Pseudorandomness and cryptographic applications.
Princeton UP 1996, 230p. 0-691-02546-0. $25. Seems to be not so good.

M. MacLaren/George Marsaglia: Uniform random generators.
J. ACM 12 (1965), 83-89.

J. Macomber/C. White: An n-dimensional uniform random number generator
suitable for IBM-compatible microcomputers. Interfaces 20/3 (1990), 49-59.

25829 Y. Marhuenda/D. Morales/M. Pardo: Power results of tests for the uniform
distribution. Internet 2005, 37p.

George Marsaglia: The structure of linear congruential sequences.
In Zaremba 1972, 249-285.

25967 George Marsaglia: Review of the article "Quasi-Monte Carlo methods and
pseudo-random numbers" by Harald Niederreiter. MR508447, 1p.

George Marsaglia: The exact-approximation method for generating random
variabls in a computer. J. Am. Stat. Ass. 79 (1984), 218-221.

George Marsaglia/T. Bray: One-line random number generators and their use
in combinations. Comm. ACM 11 (1968), 757-759.

George Marsaglia/L.H. Tsay: Matrices and the structure of random number 
sequences. Linear Algebra and its Appl. 67 (1985), 147-156.

G. Marsaglia/A. Zaman: A new class of random number generators.
Ann. Appl. Prob. 1 (1991), 462-480. Compare 7712 Eichenauer-Herrmann, 3.

11341 Makoto Matsumoto/Takuji Nishimura: Mersenne Twister home page.
Internet 1997, 3p.

Makoto Matsumoto/Takuji Nishimura: [MT-19937].
ACM Trans. Modelling Computer Sim. 1 (1998), 3-30.

25830 Ueli Maurer: A universal statistical test for random bit generators.
J. Cryptology 5/2 (1992), 89-105.

J. Maurin: Simulation deterministe du hasard. Masson 1975.

A. McLeod: A remark on AS 183. An efficient and portable pseudorandom
number generator. Appl. Stat. 34 (1985), 198-200.

19196 Francesco Mezzadri: How to generate random matrices from the
classical groups. Notices AMS May 2007, 592-604.

J. Mogyorodi/I. Vincze/W. Wertz (ed.): Statistics and probability.
Wiley 1984.

22816 Thomas Morgenstern: Uniform random rational number generation.
Internet ca. 2007, 6p.

R. Nance/C. Overstreet: Bibliography 29. A bibliography on random number
generation. Comput. Rev. 13 (1972), 495-508.

R. Nance/C. Overstreet: Some experimental observations on the behaviour
of composite random number generators. Oper. Res. 26 (1978), 915-935.

7441 A. Neimanis/N. Schmitz: Faltungsbedingungen bei der Auswahl von linearen
Kongruenzgeneratoren. In 7212 Afflerbach/, 57-63.

T. Newman/P. Odell: The generation of random variates. Hafner 1971.

7461 Harald Niederreiter: On the distribution of pseudo-random numbers 
generated by the linear congruential method I.
Math. Comp. 26 (1972), 793-795.

7462 Harald Niederreiter: On the distribution of pseudo-random numbers 
generated by the linear congruential method II.
Math. Comp. 28 (1974), 1117-1134.

7463 Harald Niederreiter: On the distribution of pseudo-random numbers 
generated by the linear congruential method III.
Math. Comp. 30 (1976), 571-597.

Harald Niederreiter: Statistical independence of linear congruential
pseudorandom numbers. Bull. AMS 82 (1976), 927-929.

7569 Harald Niederreiter: On the cycle structure of linear recurring sequences.
Math. Scand. 38 (1976), 53-77.

7457 Harald Niederreiter: Pseudo-random numbers and optimal coefficients.
Adv. Math. 26 (1977), 99-181.

7330 Harald Niederreiter: Quasi-Monte-Carlo methods and pseudo-random
numbers. Bull. AMS 84 (1978), 957-1041.

7218 Harald Niederreiter: Nombres pseudo-aleatoires et equirepartition.
Asterisque 61 (1979), 155-164.

7411 Harald Niederreiter: Pseudorandom numbers generated from shift register
sequences. In 7406 Hlawka/, 165-177.

Harald Niederreiter: A pseudorandom vector generator based on finite
field arithmetic. Math. Japon. 31 (1986), 759-774.

Harald Niederreiter: Recent trends in random number and random vector
generation. Annals Operations Research 31 (1991), 323-345.

Harald Niederreiter: New methods for pseudorandom number and pseudorandom
vector generation. Proc. 1992 Winter Simulation Conference, IEEE Press
1992, 264-269.

7418 Harald Niederreiter: Random number generation and quasi-Monte-Carlo 
methods. SIAM 1992, 240p. 0-89871-295-5 (pb). DM 116. Authoritative account 
of recent developments in the theory of pseudo-random number generation.

Harald Niederreiter: Pseudorandom numbers and quasirandom points.
ZAMM 73 (1993), 648-694.

Harald Niederreiter: Factorization of polynomials and some linear-algebra
problems over finite fields. Linear Algebra Appl. 192 (1993), 301-328.

Harald Niederreiter: Pseudorandom numbers and quasirandom points.
Zeitschr. Angew. Math. Mech., ca. 1994.

7671 Harald Niederreiter: New developments in uniform pseudorandom number 
and vector generation. In 7668 Niederreiter/Shiue 1995, 87-120.

7449 Harald Niederreiter: The multiple-recursive matrix method for
pseudorandom number generation. Finite Fields 1 (1995), 3-30.

7558 Harald Niederreiter: Pseudorandom vector generation by the 
multiple-recursive matrix method. Math. Comp. 64 (1995), 279-294.

7506 Harald Niederreiter (ed.): Taetigkeitsbericht 1994-1995.
Institut fuer Informationsverarbeitung der Oesterreichischen Akademie der
Wissenschaften. Wien 1996.

Harald Niederreiter/Peter Shiue: Equidistribution of linear recurring
sequences in finite fields I-II.
Indag. Math. 80 (1977), 397-405, Acta Arithm. 38 (1980), 197-207.

7668 Harald Niederreiter/Peter Shiue (ed.): Monte Carlo and quasi-Monte-Carlo 
methods in scientific computing. Springer 1995, 390p. DM 78.

Harald Niederreiter/Peter Hellekalek/Gerhard Larcher/Peter Zinterhof (ed.):
Monte Carlo and quasi-Monte Carlo methods 1996. Proceedings of a conference
at the University of Salzburg, Austria, July 9--12, 1996.
Springer 1997. 3-540-98335-X.

25696 Carl Offner: Finite fields and pseudo-random number generation. Internet 2007, 74p.

7634 Stephen Park/Keith Miller: Random number generators: good ones are hard 
to find. Comm. ACM 31 (1988), 1192-1201.

24603 Daniela Picin: Generazione di numeri casuali. Internet ca. 2007, 50p.

Brian Ripley: Stochastic simulation. Wiley 1987, 240p. 0-471-81884-4. $75.
Contains both the mathematical aspects of the generation of random numbers
and its use in simulation.

Brian Ripley: Thoughts on pseudorandom number generators.
J. Comp. and Appl. Math. 31 (1990), 153-163.

8244 Harald Ritter: Zufallsbits basierend auf dem diskreten Logarithmus.
Diplomarbeit Univ. Frankfurt, 1992.

M. Rosenblatt: Multiply schemes and shuffling. Math. Comp. 29 (1975), 929-934.

A. Rotenberg: A new pseudo-random number generator.
J. ACM 7 (1960), 75-77.

7666 Rainer Rueppel: Analysis and design of stream ciphers.
Springer 1986, 250p. 3-540-16870-2. DM 136.

N. Schmitz/F. Lehmann: Monte-Carlo-Methoden I. Erzeugen und Testen von
Zufallszahlen. Hain 1976.

7614 Fatin Sezgin a.o.: Letters regarding random number generation.
Comm. ACM 32/8 (1989), 1019-1024.

I. Shparlinskii: A sequence of pseudorandom numbers.
Avtom. i Telemekh. 7 (1988), 185-188 (Russian).

25727 Vaclav Snasel/.../Ajith Abraham: Genetic algorithms evolving quasigroups
with good pseudorandom properties. Springer LNCS 6018 (2010), 472-482.

E. Sowey: A chronological and classified bibliography on random number
generation and testing. Int. Statist. Rev. 40 (1972), 355-371.

10578 J. Struckmeier: Fast generation of low-discrepancy sequences.
Internet, ca. 1995, 15p.

R. Tausworthe: Random numbers generated by linear recurrence modulo two.
Math. Comp. 19 (1965), 201-209.

D. Teichroew: A history of distribution sampling prior to the era of the
computer and its relevance to simulation. 
J. Am. Statist. Ass. 60 (1965), 27-49.

Shu Tezuka: Uniform random numbers. Theory and practice.
Kluwer 1996. 0-7923-9572-7. $105.

Shu Tezuka/M. Fushimi: A method of designing cellular automata as
pseudorandom number generators for built-in-self-test for VLSI.
Contemp. Math. 168 (1994), 363-367.

Shu Tezuka/Pierre L'Ecuyer: Efficient and portable combined Tausworthe
random number generators. ACM Trans. Mod. and Comp. Sim. 1 (1991), 99-112.

Thomson: ... Comp. J. 1 (1958), 83, 86.

9766 Robert Tichy: On the asymptotic distribution of linear recurrence
sequence. In 9745 Philippou/Bergum/Horadam, 273-291.

D. Wang/A. Compagner: On the use of reducible polynomials as random number
generators. Math. Comp. 60 (1993), 363-374.

W. Westlake: A uniform random number generator based on the combination
of two congruential generators. J. ACM 14 (1967), 337-340.

B. Wichmann/I. Hill: An efficient and portable pseudo-random number
generator. Appl. Stat. 31 (1982), 188-190, 33 (1984), 123.

B. Wichmann/I. Hill: Building a random-number generator.
Byte 12/3 (1987), 127-128.

25826 Wikipedia: Cryptographically secure pseudorandom generators. Wikipedia 2015, 5p.

25828 Wikipedia: Kryptographisch sicherer Zufallszahlengenerator. Wikipedia 2015, 4p.

S. Zaremba (ed.): Applications of number theory to numerical analysis.
Academic Press 1972.

Helmut Zechner: Selecting good linear congruential generators.
Diplomarbeit, TU Graz 1992, 77p.
Bei der Erzeugung von Zufallszahlen ist die Qualitaet des Zufallszahlen-
generators von grosser Wichtigkeit. In dieser Arbeit werden einige Methoden
zur Bewertung von linearen Kongruenzgeneratoren vorgestellt: Diskrepanz,
Beyer-Quotient und Untersuchung der Hyperebenenstruktur. In der Folge wird
der Frage nachgegangen, ob die Bewertungskriterien in einem Zusammenhang
stehen, und ob ein Zusammenhang innerhalb eines Kriteriums ueber mehrere
Dimensionen festgestellt werden kann. Dazu wurde eine Gesamtanalyse fuer
zwei bestimmte Moduli in Bezug auf die Diskrepanz in zwei Dimensionen
durchgefuehrt, und die daraus resultierenden guten Zerte von Dimension
zwei bis acht bezueglich ihrer Hyperebenenstruktur untersucht. Ferner wurde
eine auf dem euklidischen Algorithmus basierende Methode fuer 2-dimensional
gute Werte untersucht, sowie eine Arbeit von George Fishman ueber optimale
Generatoren neu untersucht. Written in English.

25825 ZZ: Pseudozufallszahlen und Monte-Carlo-Methoden. Internet, 18p.