%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.407",
%%%     date            = "29 April 2025",
%%%     time            = "11:42:29 MDT",
%%%     filename        = "prng.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "27479 121689 528178 5447961",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "AES-NI instruction set; binary Euclidean
%%%                        algorithm for gcd and extended gcd; Common
%%%                        Random Numbers; discrepancy; electrical noise
%%%                        generator; exponential distribution; extended
%%%                        Euclidean algorithm for gcd; generalized
%%%                        feedback shift register (GFSR) generator;
%%%                        Gaussian random number generator; greatest
%%%                        common denominator (GCD); greatest common
%%%                        divisor (GCD); Halton sequences; inversive
%%%                        congruential generator (ICG); lattice point
%%%                        distribution; lava lamp; linear congruential
%%%                        generator (LCG); linear feedback shift
%%%                        register (LFSR) generator; logarithmic
%%%                        distribution; Mersenne Twister; modular
%%%                        inverse; Monte Carlo; multiplicative
%%%                        congruential generator (MCG);
%%%                        multiply-with-carry (MWC) generator;
%%%                        nonuniform distribution; normal distribution;
%%%                        normal number; Philox generator; Poisson
%%%                        distribution; pseudorandom number generator
%%%                        (PRNG); quantum noise generator; quasi-Monte
%%%                        Carlo; random-number generator (RNG); random
%%%                        variables; random variates; RANDU; RdRand
%%%                        instruction; rn01; true random number
%%%                        generator; uniform distribution; ziggurat
%%%                        method",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This file collects references on pseudorandom
%%%                        number generation, sampling, selection,
%%%                        simulation, distribution, and testing.  Such
%%%                        numbers are used in many different fields
%%%                        (reflected in their descriptions in articles
%%%                        in more than 570 different journals).  While
%%%                        entries in this bibliography are drawn from a
%%%                        large corpus of bibliographic data (more than
%%%                        1,593,000 entries in Summer 2020), coverage is
%%%                        necessarily selective.  Nevertheless, most of
%%%                        the important publications in the field that
%%%                        are frequently referenced by others are
%%%                        likely to be found here.  Particular
%%%                        attention is given to including historical
%%%                        sources.
%%%
%%%                        The related, and huge, field of Monte Carlo
%%%                        techniques is touched only by fewer than 160
%%%                        entries.  The introduction in entry
%%%                        James:1980:MCT provides two reasonable
%%%                        definitions:
%%%
%%%                        * ``A Monte Carlo technique is any technique
%%%                          making use of random numbers to solve a
%%%                          problem.''
%%%
%%%                        * ``the Monte Carlo method is defined as
%%%                          representing the solution of a problem as a
%%%                          parameter of a hypothetical population, and
%%%                          using a random sequence of numbers to
%%%                          construct a sample of the population, from
%%%                          which statistical estimates of the
%%%                          parameter can be obtained.''
%%%
%%%                        At version 1.407, the year coverage looked
%%%                        like this:
%%%
%%%                             1900 (   1)    1942 (   5)    1984 (  50)
%%%                             1901 (   0)    1943 (   5)    1985 (  61)
%%%                             1902 (   0)    1944 (   5)    1986 (  65)
%%%                             1903 (   0)    1945 (   1)    1987 (  61)
%%%                             1904 (   0)    1946 (   2)    1988 (  88)
%%%                             1905 (   0)    1947 (   3)    1989 (  88)
%%%                             1906 (   0)    1948 (   8)    1990 ( 123)
%%%                             1907 (   0)    1949 (  10)    1991 (  85)
%%%                             1908 (   1)    1950 (   8)    1992 ( 121)
%%%                             1909 (   1)    1951 (  15)    1993 ( 107)
%%%                             1910 (   0)    1952 (   6)    1994 ( 132)
%%%                             1911 (   0)    1953 (  15)    1995 ( 123)
%%%                             1912 (   0)    1954 (  19)    1996 ( 108)
%%%                             1913 (   0)    1955 (   9)    1997 (  91)
%%%                             1914 (   1)    1956 (  21)    1998 ( 106)
%%%                             1915 (   0)    1957 (   9)    1999 (  82)
%%%                             1916 (   1)    1958 (  16)    2000 (  81)
%%%                             1917 (   0)    1959 (  19)    2001 ( 108)
%%%                             1918 (   0)    1960 (  24)    2002 (  92)
%%%                             1919 (   0)    1961 (  34)    2003 (  76)
%%%                             1920 (   0)    1962 (  27)    2004 (  80)
%%%                             1921 (   0)    1963 (  24)    2005 (  86)
%%%                             1922 (   2)    1964 (  33)    2006 (  84)
%%%                             1923 (   0)    1965 (  27)    2007 (  73)
%%%                             1924 (   0)    1966 (  23)    2008 ( 142)
%%%                             1925 (   1)    1967 (  33)    2009 ( 118)
%%%                             1926 (   0)    1968 (  36)    2010 ( 132)
%%%                             1927 (   2)    1969 (  32)    2011 ( 125)
%%%                             1928 (   0)    1970 (  46)    2012 (  89)
%%%                             1929 (   1)    1971 (  37)    2013 (  56)
%%%                             1930 (   1)    1972 (  55)    2014 (  43)
%%%                             1931 (   2)    1973 (  40)    2015 (  44)
%%%                             1932 (   0)    1974 (  46)    2016 (  38)
%%%                             1933 (   3)    1975 (  38)    2017 (  36)
%%%                             1934 (   3)    1976 (  63)    2018 (  34)
%%%                             1935 (   0)    1977 (  39)    2019 (  31)
%%%                             1936 (   1)    1978 (  43)    2020 (  16)
%%%                             1937 (   2)    1979 (  51)    2021 (  19)
%%%                             1938 (   6)    1980 (  47)    2022 (  23)
%%%                             1939 (   7)    1981 (  34)    2023 (  17)
%%%                             1940 (   1)    1982 (  35)    2024 (  14)
%%%                             1941 (   4)    1983 (  50)    2025 (   2)
%%%                             19xx (   1)
%%%                             20xx (   3)
%%%
%%%                             Article:       2897
%%%                             Book:           236
%%%                             InBook:           4
%%%                             InCollection:    84
%%%                             InProceedings:  541
%%%                             Manual:          12
%%%                             MastersThesis:   16
%%%                             Misc:            97
%%%                             PhdThesis:       21
%%%                             Proceedings:    159
%%%                             TechReport:     219
%%%                             Unpublished:      2
%%%
%%%                             Total entries: 4288
%%%
%%%                        Users of random-number generators need to be
%%%                        aware that much of what has been published in
%%%                        the field before about 1990 has largely been
%%%                        obsoleted by newer methods, because the
%%%                        generated sequences of random numbers have
%%%                        been shown to be defective in one or more
%%%                        ways.  Examples of such deficiencies include:
%%%
%%%                        * lack of randomness, or correlations, in
%%%                          sequences of bits within single numbers;
%%%
%%%                        * correlations between number subsequences;
%%%
%%%                        * correlations at constant stepsizes in the
%%%                          number sequences (see the famous paper
%%%                          Marsaglia:1968:RNF);
%%%
%%%                        * short periods that are too readily
%%%                          exhausted (in 2010, periods of $2^{32}$ can
%%%                          be traversed in a few seconds, and periods
%%%                          of $2^{64}$ can be covered in about 30
%%%                          minutes on one million cores: see entry
%%%                          Salmon:2011:PRN);
%%%
%%%                        * fragility with respect to user-specific
%%%                          initial seeds, with some seeds producing
%%%                          good sequences, and other seeds, bad
%%%                          sequences, usually without warning;
%%%
%%%                        * fragility with respect to internal generator
%%%                          algorithm parameters (for example, with the
%%%                          long-used linear congruential generators,
%%%                          just one satisfactory 32-bit multiplier was
%%%                          found for every 1,300,000 multipliers
%%%                          tested; see entries Fishman:1986:EAM and
%%%                          Park:1988:RNG);
%%%
%%%                        * fragility with respect to nonunit steps in
%%%                          the sequences (for a linear congruential
%%%                          generator, sampling every n-th value can be
%%%                          shown to be equivalent to a different
%%%                          choice of multiplier and constant, and that
%%%                          choice may exhibit strong correlations,
%%%                          even if the original parameters have been
%%%                          shown to produce largely-satisfactory
%%%                          sequences: see entry Marsaglia:1968:RNF,
%%%                          and page 12 of entry Coddington:1997:RNG);
%%%
%%%                        * impracticality for parallel computation
%%%                          because of the need for excessive internal
%%%                          state (see entry Salmon:2011:PRN);
%%%
%%%                        * inability to produce independent
%%%                          simultaneous streams of random numbers from
%%%                          the generator, as is needed in parallel
%%%                          computations;
%%%
%%%                        * lack of algorithm details;
%%%
%%%                        * lack of cross-platform portability, such as
%%%                          through dependence on low-level
%%%                          architecture-dependent (and even
%%%                          chip-model-dependent) details of computer
%%%                          arithmetic;
%%%
%%%                        * lack of source-code access;
%%%
%%%                        * lack of knowledge of generator period,
%%%                          generator interval, and generator interval
%%%                          end points;
%%%
%%%                        * difficulty of implementing in common
%%%                          programming languages;
%%%
%%%                        * need for multiple-precision arithmetic,
%%%                          or excessive computation for a single
%%%                          random number;
%%%
%%%                        * large Monte Carlo computations in physics
%%%                          and chemistry have sometimes been shown to
%%%                          be extremely sensitive to long-range
%%%                          corrections in sequences of random numbers,
%%%                          and may even converge to an incorrect
%%%                          answer with one generator, and a correct
%%%                          result with another (see entries
%%%                          Coldwell:1974:CDS, Kalle:1984:PRN,
%%%                          Berdnicov:1991:MCS, Ferrenberg:1992:MCS,
%%%                          Grassberger:1993:CGR, Kankaala:1993:BLC,
%%%                          Selke:1993:CFM, Coddington:1994:ARN,
%%%                          Holian:1994:PNG, Vattulainen:1994:PTR,
%%%                          Compagner:1995:OCR, Schmid:1995:EMC,
%%%                          Vattulainen:1995:CSS, Vattulainen:1995:PMT,
%%%                          Bromley:1996:QNG, Coddington:1997:RNG,
%%%                          Shchur:1997:CMC, Shchur:1997:SDR,
%%%                          DSouza:1998:SBD, Gammel:1998:HRR,
%%%                          Resende:1998:URN, Mertens:2003:EPR,
%%%                          Bauke:2004:PRC, Mertens:2004:EPR,
%%%                          Ossola:2004:SED, Hongo:2010:RNG,
%%%                          Click:2011:QRN, and Ghersi:2017:CQR).
%%%
%%%                        An ideal pseudorandom-number generator must
%%%                        be able to produce identical sequences on all
%%%                        platforms on which it can be made to run.
%%%                        Otherwise, it is impossible to reproduce a
%%%                        numerical experiment, violating one of the
%%%                        key tenets of the scientific method.  It is
%%%                        also impossible to debug a program that
%%%                        cannot be made to run reproducibly.  In
%%%                        addition, an identical stream of random
%%%                        numbers is essential if one is to compare
%%%                        multiple statistical models of some process;
%%%                        otherwise, it is likely to be difficult to
%%%                        assign differences in predictions of the
%%%                        models as due to features of those models, or
%%%                        just due to variations in input data.  Papers
%%%                        in the modeling, simulation, and statistics
%%%                        literature refer to such streams with the
%%%                        capitalized phrase Common Random Numbers
%%%                        (CRN) and describe them as `variance
%%%                        reducing' (see chapter 11 of entries
%%%                        Law:1991:SMA, Law:2000:SMA, and Law:2006:SMA,
%%%                        and, in year order, entries
%%%                        Kleijnen:1975:AVC, Heikes:1976:UCR,
%%%                        Heidelberger:1979:CSS, Kleijnen:1979:ASC,
%%%                        Wright:1979:ECR, Gal:1984:OEC,
%%%                        Clark:1986:BSP, Kleijnen:1988:ASE,
%%%                        Yang:1989:OUC, Yang:1991:UCR,
%%%                        Glasserman:1992:SGG, Kleijnen:1992:RMS,
%%%                        Nelson:1992:CRN, Nelson:1993:CVM,
%%%                        Nelson:1993:RMC, Nelson:1995:UCR,
%%%                        Dai:1997:RCD, Kleinman:1999:SBO, and
%%%                        Chick:2001:NPS).  See also this article:
%%%
%%%                            http://en.wikipedia.org/wiki/Variance_reduction
%%%
%%%                        While there are many algorithms for uniformly
%%%                        distributed pseudorandom numbers that have
%%%                        the essential property of reproducible
%%%                        streams, most methods for converting such
%%%                        numbers to nonuniform distributions cannot
%%%                        make that guarantee.  Repairing such defects
%%%                        remains an open research problem.
%%%
%%%                        For lengthy treatments of the problem of
%%%                        converting random numbers from uniform
%%%                        distributions to nonuniform ones, see, in
%%%                        year order, Knuth:1976:CNR, Devroye:1986:NUR,
%%%                        Law:1991:SMA (chapter 8), Hormann:1993:QNU,
%%%                        Schrift:1993:UTN, Cheng:1998:RVG,
%%%                        Law:2000:SMA (chapter 8), Leydold:2002:FPN,
%%%                        Hormann:2004:ANR, Beliakov:2005:UNR,
%%%                        Law:2006:SMA (chapter 8), Cowles:2007:BRA,
%%%                        deSchryver:2010:NHE, and LEcuyer:2011:NUR,
%%%
%%%                        Several publications listed here cover the
%%%                        early, and pre-, history of the use of random
%%%                        numbers in sampling and simulation.  Besides
%%%                        the several bibliographies cited later, see
%%%                        particularly these entries (in year order):
%%%                        Pearson:1900:CGS, Student:1908:PEM,
%%%                        Ore:1948:NTH, Brown:1949:HRR, Brown:1951:HRR,
%%%                        Hull:1962:RNG, Teichroew:1965:HDS, and
%%%                        Good:1969:HRR.
%%%
%%%                        Before computers became available, generating
%%%                        random numbers was a tedious and error-prone
%%%                        task, and several compilations of such
%%%                        numbers, and comments on them, were published
%%%                        to reduce the burden on others. Various
%%%                        believed-to-be random sources, including
%%%                        electromechanical devices, roulette wheels,
%%%                        shuffled cards, and drawing from large
%%%                        collections of numbered objects, were used to
%%%                        generate the tabulated random numbers.  For
%%%                        the years prior to 1960, see entries (in year
%%%                        order) Tippett:1927:RSN,
%%%                        Mahalanobis:1934:TRS, Kermack:1937:SDA,
%%%                        Kermack:1937:TRS, Fisher:1938:STB,
%%%                        Kendall:1938:RRS,o Nair:1938:TRS,
%%%                        Yule:1938:TTR, Kendall:1939:SPR,
%%%                        Peatman:1942:TRN, Fisher:1943:STB,
%%%                        Gage:1943:CTR, Swed:1943:TTR, Brown:1948:STR,
%%%                        Wold:1948:RND, Brown:1949:HRR,
%%%                        Fisher:1949:STB, Stevens:1949:TRD,
%%%                        Brown:1951:HRR, Forsythe:1951:GTRa,
%%%                        Forsythe:1951:GTRb, Tippett:1952:RSN,
%%%                        Fisher:1953:STBa, Fisher:1953:STBb,
%%%                        Meyer:1954:GTR, Schwartz:1954:RPC,
%%%                        Fieller:1955:CRN, RAND:1955:MRD,
%%%                        Tompkins:1956:RJS, Tompkins:1956:RMR,
%%%                        Fisher:1957:STBa, Fisher:1957:STBb,
%%%                        Sengupta:1958:TRN, Sterzer:1959:RNG,
%%%                        Thomson:1959:EMS, and Tippett:1959:RSN.
%%%
%%%                        Entry Yule:1927:RS documents the problems of
%%%                        bias introduced when humans, even
%%%                        well-intentioned and disinterested ones,
%%%                        record data.
%%%
%%%                        I. J. Good remarks in entry Good:1969:HRR
%%%                        ``Various tables of random digits have been
%%%                        published. As the editor, Ernest Rubin, says,
%%%                        these are all random, but some are more
%%%                        random than others. The question has been
%%%                        asked `Can a table of random digits have just
%%%                        one misprint?' This will be left as an
%%%                        exercise for the reader.''
%%%
%%%                        Several entries in this bibliography are for
%%%                        publications that describe physical devices
%%%                        for generating random numbers from haphazard
%%%                        phenomena, such as acoustic, electrical, or
%%%                        optical noise, lava lamps, quantum
%%%                        interference, and radioactive decay.  While
%%%                        such numbers are likely to be humanly
%%%                        ``unpredictable'', they are not necessarily
%%%                        ``uniformly random'' in the sense that large
%%%                        collections of random numbers on [0,1] should
%%%                        be uniformly distributed over the unit
%%%                        interval, and have a limiting average of 1/2:
%%%                        tests of some of those devices have shown
%%%                        biases in favor of lower or higher values.
%%%
%%%                        Entries Kubota:1995:DRE, Mikov:1996:LSA,
%%%                        Gentle:1990:CIR, and Saiprasert:2010:OHA
%%%                        discuss rounding errors when random numbers
%%%                        from one range are converted to numbers in
%%%                        another range.
%%%
%%%                        See entries Gentle:1990:CIR,
%%%                        Mascagni:2000:ASS, and Brent:2006:FRR for
%%%                        good discussions of desirable properties for
%%%                        algorithms and software for generation of
%%%                        random numbers.
%%%
%%%                        The question of when a sequence of digits, in
%%%                        some specified base, is random was apparently
%%%                        first raised in 1909 (see entry
%%%                        Borel:1909:PDL, and the remark in entry
%%%                        Borel:1914:LTF).  Such numbers are called
%%%                        ``normal numbers'', but only a few have been
%%%                        proved to have that property, the first
%%%                        perhaps being Champernowne's number (see
%%%                        entry Champernowne:1933:CDN).  The constant
%%%                        pi is believed to be a normal number, but the
%%%                        proof remains elusive; see Chapter 4 of entry
%%%                        Borwein:2004:MEP.  Normality does NOT mean
%%%                        that short digit sequences are random: the
%%%                        sequences 0123456789 and 7777777777 both
%%%                        occur within the first 22,900,000,000 decimal
%%%                        digits of pi.  The six-digit sequence 999999
%%%                        appears at the 762nd decimal place, and is
%%%                        called the ``Feynman point'', after Physics
%%%                        Nobel laureate Richard Feynman: for
%%%                        background, see
%%%
%%%                            http://en.wikipedia.org/wiki/Feynman_point
%%%
%%%                        Most algorithmic random-number generators
%%%                        produce a sequence of distinct integers that
%%%                        eventually repeats, and the count of values
%%%                        produced to that point is called the
%%%                        ``period''.  Adjacent numbers are never
%%%                        identical, unlike the digits of a normal
%%%                        number.
%%%
%%%                        For testing the quality of random-number
%%%                        generators, most of the early recommendations
%%%                        (e.g., see extensive coverage in
%%%                        Knuth:1997:SA) have the problem that while
%%%                        they may readily identify really bad
%%%                        generators, they are rarely helpful in
%%%                        distinguishing the mediocre from the good,
%%%                        and good from the superb.  What is instead
%%%                        needed is a suite of several sophisticated
%%%                        tests, and experience with those tests on a
%%%                        variety of generators.  Notable examples of
%%%                        such test facilities include the Marsaglia
%%%                        Diehard Test Suite (entries
%%%                        Marsaglia:1985:CVR and Marsaglia:1996:DBT),
%%%                        the L'Ecuyer/Simard TestU01 suite (entries
%%%                        LEcuyer:2001:TSL, LEcuyer:2002:TSL,
%%%                        LEcuyer:2006:TSL, and LEcuyer:2007:TCL), the
%%%                        Marsaglia/Tsang tuftest suite (entry
%%%                        Marsaglia:2002:SDP), and the NIST 800-22
%%%                        suite (entry Rukhin:2001:STS).  See also
%%%                        entry Haramoto:2009:AST for a discussion of
%%%                        how adaptive testing can be used to
%%%                        distinguish test failure (indicated by
%%%                        p-values close to 0 or 1) from algorithm
%%%                        failure.
%%%
%%%                        Such test facilities need to be available at
%%%                        all end-user sites where random-number
%%%                        generator code is compiled, used, or written,
%%%                        so that researchers can verify for themselves
%%%                        whether the generator that they are using has
%%%                        the expected properties of randomness.
%%%                        Subtle differences in compiler
%%%                        code-generation order, compiler errors, and
%%%                        model-dependent hardware variations, can all
%%%                        be sources of outright generator failure, or
%%%                        worse (because the failure might not be
%%%                        detected), substandard quality.  In
%%%                        particular, it is essential to record in
%%%                        program output the initial seeds, as well as
%%%                        short selected sequences of random numbers,
%%%                        such as the first and last 100 numbers
%%%                        generated in a run.  Also, no single
%%%                        simulation should be trusted until it has
%%%                        been compared with results obtained from one
%%%                        or more completely-different generators.
%%%
%%%                        Researchers and software designers who
%%%                        contemplate using, or producing, random
%%%                        number generators for serious, and
%%%                        widespread, use need to be aware of the
%%%                        impact of their algorithm choice on the
%%%                        reliability of results of models based on
%%%                        random numbers.  For a story of how an entire
%%%                        field of research was put at risk by a poor
%%%                        choice in a widely-used software package, see
%%%                        entry Umlauft:2009:GNS.
%%%
%%%                        In this bibliographer's view, relatively few
%%%                        of the many journals in which random-number
%%%                        algorithms have been proposed have been found
%%%                        to be generally-reliable sources in this
%%%                        area.  Examples of recommended journals
%%%                        include the ones abbreviated j-CACM,
%%%                        j-IBM-JRD, j-IBM-SYS-J, j-JACM,
%%%                        j-J-COMPUT-APPL-MATH, j-PARALLEL-COMPUTING,
%%%                        j-TOMACS, and j-TOMS, all of whose
%%%                        random-number articles should be present in
%%%                        this bibliography.
%%%
%%%                        While there are many authors of the
%%%                        publications listed in this bibliography, a
%%%                        few stand out by having made large numbers of
%%%                        important, influential, and insightful
%%%                        contributions.  They include George
%%%                        Marsaglia, Pierre L'Ecuyer, Juergen
%%%                        Eichenauer-Herrmann, Harald Niederreiter, and
%%%                        Richard P. Brent.  Their deep understanding,
%%%                        and clear writing, on the problems of
%%%                        generating and testing pseudorandom numbers
%%%                        is worthy of study.  See also Marsaglia's
%%%                        publication bibliography at
%%%
%%%                            https://www.math.utah.edu/pub/bibnet/authors/m/
%%%
%%%                        At version 0.56, this file was extended with
%%%                        the 148 bibliography entries given in a fine
%%%                        survey \cite{Hull:1962:RNG}; its authors
%%%                        report on their first page:
%%%
%%%                            ``The bibliography is intended to be
%%%                            complete with respect to references
%%%                            concerned with the generation of random
%%%                            numbers on computers. It contains
%%%                            substantially all such references to the
%%%                            open literature, as well as many
%%%                            references to government and company
%%%                            reports. In addition it contains a number
%%%                            of references concerning each of the
%%%                            related topics which are considered in
%%%                            this paper.''
%%%
%%%                        The numbered entries from that bibliography
%%%                        are identified by HDnumber values in entries
%%%                        in this file.
%%%
%%%                        While it is impossible to claim completeness
%%%                        in a subject-specific bibliography, their
%%%                        work nevertheless gives a good survey of what
%%%                        was known about computer generation of
%%%                        pseudo-random numbers in early 1962.  Since
%%%                        then, the literature on the subject has
%%%                        exploded, and covers far more material than
%%%                        we can usefully collect here.  In particular,
%%%                        the unavoidable correlations in congruential
%%%                        generators were not known until six years
%%%                        later (Marsaglia:1968:RNF), and the
%%%                        cryptographic insecurities of many generators
%%%                        were not even considered by Hull and Dobell
%%%                        in 1962 (see Shi:1975:SRP, Reeds:1977:CRN,
%%%                        Reeds:1979:CMC, Plumstead:1982:ISG,
%%%                        Plumstead:1983:ISP, Blum:1984:HGC,
%%%                        Frieze:1984:LCG, Knuth:1985:DLC,
%%%                        Stern:1987:SLC, Frieze:1988:RTI,
%%%                        Lagarias:1988:UEP, Shi:1988:SRP
%%%                        Boyar:1989:ISPa, Boyar:1989:ISPb,
%%%                        Krawczyk:1990:HPC, Brickell:1992:CSR,
%%%                        Krawczyk:1992:HPC, Schneier:1996:ACP,
%%%                        Bach:1998:EPM, Marsaglia:2003:RNG,
%%%                        Contini:2005:SAA, Gutierrez:2007:ISP,
%%%                        Rose:2011:KBT, and Gutierrez:2013:PML).
%%%
%%%                        The annotated bibliographies of Sowey
%%%                        (Sowey:1972:CCB, Sowey:1978:SCB,
%%%                        Sowey:1986:TCB) contain 300 references from
%%%                        1927 to 1971 (6.7/year), 130 references from
%%%                        1972 to 1976 (26/year), and 300 references
%%%                        from 1977--1984 (37/year), demonstrating the
%%%                        publication growth.  Entry Page:1967:GPR
%%%                        also contains a bibliography of earlier work,
%%%                        and entry Sahai:1980:SSB supplements Sowey's
%%%                        work.  Another early bibliography is entry
%%%                        Nance:1972:BRN.
%%%
%%%                        A search of the IEEE eXplore database for the
%%%                        decade 2000--2009 found 522 articles with
%%%                        titles containing 'pseudo-random',
%%%                        `pseudorandom', and `pseudo random', or about
%%%                        52/year.  The MathSciNet database shows about
%%%                        31/year for that period.
%%%
%%%                        A Google Scholar search for the same period
%%%                        finds 1130 article titles with
%%%                        `pseudorandom', 1400 with `pseudo-random',
%%%                        1480 with `pseudo random', and 846 with
%%%                        `random number generator', or about 485/year.
%%%
%%%                        Warning: Cryptographic applications of random
%%%                        numbers may have quite different requirements
%%%                        than modeling, sampling, and simulation do,
%%%                        and sequence reproducibility is likely to be
%%%                        undesirable, because the random numbers are
%%%                        used to generate secret, and unguessable,
%%%                        cryptographic keys.  It is possible that even
%%%                        a limited sequence of random values from an
%%%                        algorithmic generator can be used to reveal
%%%                        properties and parameters of that generator,
%%%                        and thus allow prediction of past and future
%%%                        values.  Such a crack has already been
%%%                        demonstrated for linear congruential
%%%                        generators: see the remarks above on
%%%                        cryptographic insecurities of random-number
%%%                        streams.  Attacks on other algorithms have
%%%                        also been demonstrated: see entries
%%%                        Kannan:1988:PFN and Just:1990:IRA.  Instead,
%%%                        hardware-assisted sources of truly random
%%%                        numbers may be needed.  Examples include the
%%%                        Intel AES-NI instruction-set extension (see
%%%                        entry Salmon:2011:PRN), the Intel RdRand
%%%                        instruction (see entry Taylor:2011:DR), the
%%%                        pseudodevices /dev/random and /dev/urandom on
%%%                        various Unix flavors, and cryptographic
%%%                        accelerator boards available from some
%%%                        hardware vendors.  Just because the random
%%%                        numbers come from a physical device does NOT
%%%                        mean that they are necessarily uniformly
%%%                        distributed, or pass tests of randomness:
%%%                        see, for example, entry Tsoi:2003:CFB.
%%%
%%%                        Entries in this bibliography that discuss
%%%                        generation of random numbers from physical
%%%                        sources have the phrase ``true random numbers
%%%                        from physical sources'' in their keywords
%%%                        values. See also
%%%
%%%                            http://en.wikipedia.org/wiki/Comparison_of_hardware_random_number_generators
%%%                            http://en.wikipedia.org/wiki/Hardware_random_number_generator
%%%                            http://en.wikipedia.org/wiki//dev/random
%%%
%%%                        See entries Gutmann:2004:CSA, Barak:2005:MAP,
%%%                        and Gutterman:2006:ALR for discussion of the
%%%                        problem of generating data for hardware
%%%                        pseudodevices, the problem of code complexity
%%%                        and excessive patching, and demonstration of
%%%                        bugs and other flaws that affect
%%%                        cryptographic uses and compromise system
%%%                        security, despite the large effort in
%%%                        designing, and then widely deploying, such
%%%                        devices.  The last-cited paper notes: ``[the
%%%                        Linux pseudodevice] complexity does not
%%%                        improve its security but rather hides its
%%%                        weaknesses. We suggest that future
%%%                        constructions of pseudo-random number
%%%                        generators follow the BH (Barak--Halevi)
%%%                        construction (and in general, try to `keep it
%%%                        simple').''
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi" #
    "\ifx \cftil \undefined     \def \cftil#1{\~#1} \fi" #
    "\ifx \undefined \cprime    \def \cprime {$'$} \fi" #
    "\ifx \undefined \flqq      \def \flqq {\ifmmode \ll \else \leavevmode \raise 0.2ex \hbox{$\scriptscriptstyle \ll $}\fi}\fi" #
    "\ifx \undefined \frqq      \def \frqq {\ifmmode \gg \else \leavevmode \raise 0.2ex \hbox{$\scriptscriptstyle \gg $}\fi}\fi" #
    "\ifx \undefined \k         \let \k = \c \fi" #
    "\ifx \undefined \mathbb    \def \mathbb #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathbf    \def \mathbf #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathrm    \def \mathrm #1{{\rm #1}}\fi" #
    "\ifx \undefined \pkg       \def \pkg       #1{{{\tt #1}}} \fi" #
    "\ifx \undefined \scr       \let \scr = \cal \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

@String{ack-r-project = "R Project Team"}

%%% ====================================================================
%%% Institution abbreviations:

@String{inst-ARGONNE            = "Argonne National Laboratory"}
@String{inst-ARGONNE:adr        = "Argonne, IL, USA"}

@String{inst-ATT-BELL           = "AT\&T Bell Laboratories"}
@String{inst-ATT-BELL:adr       = "Murray Hill, NJ, USA"}

@String{inst-BOEING-SRL         = "Boeing Scientific Research Laboratories"}
@String{inst-BOEING-SRL:adr     = "Seattle, WA, USA"}

@String{inst-LANL               = "Los Alamos National Laboratory"}
@String{inst-LANL:adr           = "Los Alamos, NM, USA"}

@String{inst-LASL               = "Los Alamos Scientific Laboratory"}
@String{inst-LASL:adr           = "Los Alamos, NM, USA"}

@String{inst-MATHWORKS          = "The MathWorks, Inc."}
@String{inst-MATHWORKS:adr      = "3 Apple Hill Drive, Natick, MA 01760-2098,
                                  USA"}

@String{inst-SRC-IDA            = "Supercomputing Research Center: IDA"}
@String{inst-SRC-IDA:adr        = "Lanham, MD, USA"}

@String{inst-STAN-CS            = "Stanford University, Department of Computer
                                  Science"}
@String{inst-STAN-CS:adr        = "Stanford, CA, USA"}

@String{inst-UIUC-CSRD          = "University of Illinois at Urbana-Champaign,
                                  Center for Supercomputing Research and
                                  Development"}
@String{inst-UIUC-CSRD:adr      = "Urbana, IL 61801, USA"}

@String{inst-UTAH-MATH          = "University of Utah, Department of Mathematics"}
@String{inst-UTAH-MATH:adr      = "Salt Lake City, UT 84112-0090, USA"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-ABH-MATH-SEMIN-UNIV-HAMBG = "Abhandlungen aus dem Mathematischen
                                  Seminar der Universit{\"a}t Hamburg"}

@String{j-ABSTR-PAP-AM-CHEM-SOC = "Abstracts of Papers of the {American
                                  Chemical Society}"}

@String{j-ACM-COMM-COMP-ALGEBRA = "ACM Communications in Computer Algebra"}

@String{j-ACTA-ARITHMETICA      = "Acta Arithmetica"}

@String{j-ACTA-CRYSTAL-A-FOUND-CRYST = "Acta crystallographica. Section A,
                                  Foundations of crystallography"}

@String{j-ACTA-MATH-HUNG        = "Acta mathematica Academiae Scientiarum
                                  Hungaricae"}

@String{j-ACTA-MATH-SINICA      = "Acta Mathematica Sinica (New Series)"}

@String{j-ADA-LETT              = "Ada Letters"}

@String{j-ADA-USER-J            = "Ada User Journal"}

@String{j-ADV-APPL-MATH         = "Advances in Applied Mathematics"}

@String{j-ADV-APPL-PROB         = "Advances in Applied Probability"}

@String{j-ADV-APPL-STAT         = "Advances and Applications in Statistics"}

@String{j-ADV-COMPUT-MATH       = "Advances in Computational Mathematics"}

@String{j-ADV-MATH              = "Advances in Mathematics"}

@String{j-ADV-SCI-LETT          = "Advanced Science Letters"}

@String{j-AIP-CONF-PROC         = "AIP Conference Proceedings"}

@String{j-ALGORITHMICA          = "Algorithmica"}

@String{j-ALGORITHMS-BASEL      = "Algorithms ({Basel})"}

@String{j-AM-J-MATH-MANAGE-SCI  = "American Journal of Mathematical and
                                  Management Sciences"}

@String{j-AM-SCI                = "American Scientist"}

@String{j-AMER-J-PHYSICS        = "American Journal of Physics"}

@String{j-AMER-MATH-MONTHLY     = "American Mathematical Monthly"}

@String{j-AMER-STAT             = "The American Statistician"}

@String{j-ANG-INFO-ELEK-DATEN   = "Angewandte Informatik (Elektron.
                                  Datenverarbeitung)"}

@String{j-ANN-APPL-PROBAB       = "Annals of Applied Probability"}

@String{j-ANN-HIST-COMPUT       = "Annals of the History of Computing"}

@String{j-ANN-INST-STAT-MATH-TOKYO = "Annals of the Institute of Statistical
                                  Mathematics (Tokyo)"}

@String{j-ANN-MAT-PURA-APPL-4   = "Annali di matematica pura ed applicata.
                                  Series 4"}

@String{j-ANN-MATH              = "Annals of Mathematics"}

@String{j-ANN-MATH-STAT         = "Annals of Mathematical Statistics"}

@String{j-ANN-NY-ACAD-SCI       = "Annals of the New York Academy of Sciences"}

@String{j-ANN-OPER-RESEARCH     = "Annals of Operations Research"}

@String{j-ANN-PROBAB            = "Annals of Probability"}

@String{j-ANN-STAT              = "Annals of Statistics"}

@String{j-ANZIAM-J              = "The ANZIAM Journal"}

@String{j-ANZJS                 = "Australian \& New Zealand Journal of
                                  Statistics"}

@String{j-APPL-ALGEBRA-ENG-COMMUN-COMPUT = "Applicable algebra in engineering,
                                  communication and computing"}

@String{j-APPL-MATH-COMP        = "Applied Mathematics and Computation"}

@String{j-APPL-MATH-LETT        = "Applied Mathematics Letters"}

@String{j-APPL-MATH-SER-NBS     = "Applied Mathematics Series / National Bureau
                                  of Standards"}

@String{j-APPL-NUM-MATH         = "Applied Numerical Mathematics: Transactions
                                  of IMACS"}

@String{j-APPL-OPTICS           = "Applied Optics"}

@String{j-APPL-PHYS-EXPRESS     = "Applied Physics Express"}

@String{j-APPL-PHYS-LET         = "Applied Physics Letters"}

@String{j-APPL-STAT             = "Applied Statistics"}

@String{j-ARCH-MATH             = "Archiv der Mathematik"}

@String{j-ARS-COMB              = "Ars Combinatoria. The Canadian Journal of
                                  Combinatorics"}

@String{j-ATT-BELL-LAB-TECH-J   = "AT\&T Bell Laboratories Technical Journal"}

@String{j-ATT-TECH-J            = "AT\&T Technical Journal"}

@String{j-AUST-J-STAT           = "Australian Journal of Statistics"}

@String{j-AUSTRALIAN-COMP-J     = "Australian Computer Journal"}

@String{j-AUSTRALIAN-J-PHYS     = "Australian Journal of Physics"}

@String{j-AUTOMATION-REMOTE-CTL = "Automation and Remote Control"}

@String{j-BEHAV-RES-METH-INSTR  = "Behavior Research Methods and
                                  Instrumentation"}

@String{j-BEHAV-RES-METH-INSTR-COMP = "Behavior Research Methods, Instruments,
                                  and Computers"}

@String{j-BELL-SYST-TECH-J      = "The Bell System Technical Journal"}

@String{j-BIOMETRICAL-J         = "Biometrical Journal"}

@String{j-BIOMETRIKA            = "Biometrika"}

@String{j-BIT                   = "BIT (Nordisk tidskrift for
                                  informationsbehandling)"}

@String{j-BIT-NUM-MATH          = "BIT Numerical Mathematics"}

@String{j-BOLL-UNIONE-MAT-ITAL  = "Bollettino della Unione matematica
                                  italiana"}

@String{j-BULL-AMS              = "Bulletin of the American Mathematical
                                  Society"}

@String{j-BULL-INST-MATH-STAT   = "Bulletin --- Institute of Mathematical
                                  Statistics"}

@String{j-BYTE                  = "BYTE Magazine"}

@String{j-C-PLUS-PLUS-REPORT    = "C++ Report"}

@String{j-C-R-ACAD-SCI-PARIS-SER-AB = "Comptes Rendus Hebdomadaires des
                                  S{\'e}ances de l'Acad{\'e}mie des Sciences.
                                  S{\'e}ries A et B"}

@String{j-CACM                  = "Communications of the ACM"}

@String{j-CAD                   = "Computer Aided Design"}

@String{j-CALCOLO               = "Calcolo: a quarterly on numerical analysis
                                  and theory of computation"}

@String{j-CAN-J-MATH            = "Canadian Journal of Mathematics = Journal
                                  canadien de math{\'e}matiques"}

@String{j-CAN-MATH-BULL         = "Canadian mathematical bulletin = Bulletin
                                  canadien de math{\'e}matiques"}

@String{j-CCCUJ                 = "C/C++ Users Journal"}

@String{j-CCPE                  = "Concurrency and Computation: Prac\-tice and
                                   Experience"}

@String{j-CGF                   = "Computer Graphics Forum"}

@String{j-CGIP                  = "Computer Graphics and Image Processing"}

@String{j-CHANCE                = "Chance"}

@String{j-CHAOS-SOLITONS-FRACTALS = "Chaos, Solitons \& Fractals"}

@String{j-CHIFFRES              = "Chiffres: Revue de l'Association
                                  fran{\c{c}}aise de Calcul"}

@String{j-CHIN-PHYS-LETT        = "Chinese Physics Letters"}

@String{j-COLLEGE-MATH-J        = "College Mathematics Journal"}

@String{j-COLLOQ-MATH-BOLYAI    = "Colloquia Mathematica Societatis J{\'a}nos Bolyai"}

@String{j-COMBIN-PROBAB-COMPUT  = "Combinatorics, Probability and Computing"}

@String{j-COMBINATORICA         = "Combinatorica"}

@String{j-COMM-NONLIN-SCI-NUM-SIM = "Communications in Nonlinear Science and
                                  Numerical Simulation"}

@String{j-COMM-STAT             = "Communications in Statistics"}

@String{j-COMMUN-STAT-THEORY-METH = "Communications in Statistics: Theory and
                                  Methods"}

@String{j-COMMUN-INF-SYST       = "Communications in Information and Systems"}

@String{j-COMMUN-STAT-SIMUL-COMPUT = "Communications in Statistics: Simulation
                                  and Computation"}

@String{j-COMP-AUTO             = "Computers and Automation"}

@String{j-COMP-GEOSCI           = "Computers and Geosciences"}

@String{j-COMP-J                = "The Computer Journal"}

@String{j-COMP-LANG-MAG         = "Computer Language Magazine"}

@String{j-COMP-LANGS            = "Computer Languages"}

@String{j-COMP-MATH             = "Computational Mathematics"}

@String{j-COMP-NET-AMSTERDAM    = "Computer Networks (Amsterdam, Netherlands: 1999)"}

@String{j-COMP-REV              = "Computing Reviews"}

@String{j-COMP-STAT             = "Computational Statistics"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMPUT-MATH-APPL      = "Computers and Mathematics and Applications"}

@String{j-COMPUT-MATH-APPL-B    = "Computers and Mathematics with Applications.
                                   Part B"}

@String{j-COMPUT-SOFTW-BIG-SCI  = "Computing and Software for Big Science"}

@String{j-COMP-OP-RES           = "Computers and Operations Research"}

@String{j-COMP-PHYS-COMM        = "Computer Physics Communications"}

@String{j-COMPUT-PHYS           = "Computers in Physics"}

@String{j-COMPUT-SECUR          = "Computers \& Security"}

@String{j-COMPUT-AND-BIOMED-RES = "Computers and Biomedical Research"}

@String{j-COMPUT-APPL-MATH      = "Journal of Computational and Applied
                                  Mathematics"}

@String{j-COMPUT-BULL           = "The Computer Bulletin"}

@String{j-COMPUT-IND-ENG        = "Computers \& Industrial Engineering"}

@String{j-COMPUT-METH-PROG-BIOMED = "Computer Methods and Programs in
                                  Biomedicine"}

@String{j-COMPUT-PROGRAMS-BIOMED = "Computer Programs in Biomedicine"}

@String{j-COMPUT-SCI-ENG        = "Computing in Science and Engineering"}

@String{j-COMPUT-STAT-DATA-ANAL = "Computational Statistics \& Data Analysis"}

@String{j-COMPUT-STAT-Q         = "Computational Statistics Quarterly"}

@String{j-COMPUT-SYST-SCI-ENG   = "Computer Systems Science and Engineering"}

@String{j-COMPUTABILITY         = "Computability"}

@String{j-COMPUTER              = "Computer"}

@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}

@String{j-COMPUTING             = "Computing: Archiv f{\"u}r Informatik und
                                  Numerik"}

@String{j-CONTEMP-MATH          = "Contemporary Mathematics (American
                                  Mathematical Society)"}

@String{j-CRYPTOGR-COMMUN       = "Cryptography and Communications"}

@String{j-CRYPTOLOGIA           = "Cryptologia"}

@String{j-CUJ                   = "C Users Journal"}

@String{j-CVGIP                 = "Computer Vision, Graphics, and Image
                                  Processing"}

@String{j-CVGIP-GMIP            = "Computer Vision, Graphics, and Image
                                  Processing. Graphical Models and Image
                                  Processing"}

@String{j-CVGIP-IU              = "Computer Vision, Graphics, and Image
                                  Processing. Image Understanding"}

@String{j-CYBER                 = "Cybernetics"}

@String{j-CZECH-J-PHYS          = "Czechoslovak Journal of Physics"}

@String{j-CZECH-MATH-J          = "Czechoslovak mathematical journal = Chekhoslovatskii matematicheskii zhurnal"}

@String{j-DDJ                   = "Dr. Dobb's Journal of Software Tools"}

@String{j-DESIGNS-CODES-CRYPTOGR = "Designs, Codes, and Cryptography"}

@String{j-DISTRIB-COMPUT        = "Distributed Computing"}

@String{j-DOKL-AKAD-NAUK        = "Doklady Akademii Nauk SSSR"}

@String{j-DUKE-MATH-J           = "Duke Mathematical Journal"}

@String{j-ECONOMETRICA          = "Econometrica"}

@String{j-EDU-PSYCH-MEASUREMENT = "Educational and Psychological Measurement"}

@String{j-ELECT-LETTERS         = "Electronics Letters"}

@String{j-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI = "Electronics and communications in
                                   Japan. Part 3, Fundamental electronic
                                   science"}

@String{j-ELECTRON-COMMUN-PROBAB = "Electronic Communications in Probability"}

@String{j-ELECTRON-ENG          = "Electronic Engineering"}

@String{j-ELECTRON-J-PROBAB     = "Electronic Journal of Probability"}

@String{j-ELECTRON-TRANS-NUMER-ANAL = "Electronic Transactions on Numerical
                                  Analysis (ETNA)"}

@String{j-ELECTRONIC-DESIGN     = "Electronic Design"}

@String{j-ELECTRONICS           = "Electronics"}

@String{j-ELEK-INFO-KYBER       = "Elektronische Informationsverarbeitung und
                                  Kybernetik (EIK)"}

@String{j-ESAIM-PROBAB-STATIST  = "ESAIM: Probability and Statistics"}

@String{j-EUR-J-OPER-RES        = "European Journal of Operational Research"}

@String{j-EUR-J-PHYS            = "European Journal of Physics"}

@String{j-EUR-PHYS-J-SPEC-TOP   = "European Physical Journal --- Special
                                  Topics"}

@String{j-EURASIP-J-EMBED-SYS   = "EURASIP Journal on Embedded Systems"}

@String{j-EUROPHYS-LETT         = "Europhysics Letters"}

@String{j-EXP-MATH              = "Experimental Mathematics"}

@String{j-FIB-QUART             = "Fibonacci Quarterly"}

@String{j-FINITE-FIELDS-APPL    = "Finite Fields and their Applications"}

@String{j-FORTRAN-FORUM         = "ACM Fortran Forum"}

@String{j-FUT-GEN-COMP-SYS      = "Future Generation Computer Systems"}

@String{j-FUTURE-INTERNET       = "Future Internet"}

@String{j-GEOBYTE               = "Geobyte"}

@String{j-HEWLETT-PACKARD-J     = "Hew\-lett-Pack\-ard Journal: technical
                                  information from the laboratories of
                                  Hew\-lett-Pack\-ard Company"}

@String{j-IBM-JRD               = "IBM Journal of Research and Development"}

@String{j-IBM-SYS-J             = "IBM Systems Journal"}

@String{j-IBM-TDB               = "IBM Technical Disclosure Bulletin"}

@String{j-IEE-PROC-COMPUT-DIGIT-TECH = "IEE Proceedings. Computers and Digital
                                  Techniques"}

@String{j-IEE-PROC-E            = "IEE proceedings, E: Computers and digital
                                  techniques"}

@String{j-IEEE-ANN-HIST-COMPUT  = "IEEE Annals of the History of Computing"}

@String{j-IEEE-CGA              = "IEEE Computer Graphics and Applications"}

@String{j-IEEE-COMMUN-LET       = "IEEE Communications Letters"}

@String{j-IEEE-COMPUT-ARCHIT-LETT = "IEEE Computer Architecture Letters"}

@String{j-IEEE-COMPUT-SCI-ENG   = "IEEE Computational Science \& Engineering"}

@String{j-IEEE-DES-TEST-COMPUT  = "IEEE Design \& Test of Computers"}

@String{j-IEEE-INT-SYMP-INF-THEORY = "IEEE International Symposium on
                                  Information Theory"}

@String{j-IEEE-J-SOLID-STATE-CIRCUITS = "IEEE Journal of Solid-State Circuits"}

@String{j-IEEE-MICRO            = "IEEE Micro"}

@String{j-IEEE-PHOTONICS-TECHNOL-LETT = "IEEE Photonics Technology Letters"}

@String{j-IEEE-SEC-PRIV         = "IEEE Security \& Privacy"}

@String{j-IEEE-SPECTRUM         = "IEEE Spectrum"}

@String{j-IEEE-TRANS-APPL-SUPERCOND = "IEEE Transactions on Applied
                                  Superconductivity"}

@String{j-IEEE-TRANS-BIG-DATA   = "IEEE Transactions on Big Data"}

@String{j-IEEE-TRANS-CAD-ICS    = "IEEE Transactions on Computer-Aided Design of
                                  Integrated Circuits and Systems"}

@String{j-IEEE-TRANS-CIRCUITS-SYST = "IEEE Transactions on Circuits and
                                  Systems"}

@String{j-IEEE-TRANS-CIRCUITS-SYST-1 = "IEEE Transactions on Circuits and
                                  Systems I: Regular Papers"}

@String{j-IEEE-TRANS-CIRCUITS-SYST-I-FUNDAM-THEORY-APPL = "IEEE Transactions on
                                  Circuits and Systems I: Fundamental
                                  Theory and Application"}

@String{j-IEEE-TRANS-COMM       = "IEEE Transactions on Communications"}

@String{j-IEEE-TRANS-COMPUT     = "IEEE Transactions on Computers"}

@String{j-IEEE-TRANS-ELEC-COMPUT = "IEEE Transactions on Electronic Computers"}

@String{j-IEEE-TRANS-EMERG-TOP-COMPUT = "IEEE Transactions on Emerging Topics in
                                  Computing"}

@String{j-IEEE-TRANS-INF-FOREN-SEC = "IEEE Transactions on Information Forensics
                                  and Security"}

@String{j-IEEE-TRANS-INF-THEORY = "IEEE Transactions on Information Theory"}

@String{j-IEEE-TRANS-INSTRUM-MEAS = "IEEE Transactions on Instrumentation and Measurement"}

@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}

@String{j-IEEE-TRANS-NUCL-SCI   = "IEEE Transactions on Nuclear Science"}

@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
                                  Distributed Systems"}

@String{j-IEEE-TRANS-POWER-DELIV = "IEEE Transactions on Power Delivery"}

@String{j-IEEE-TRANS-RELIAB     = "IEEE Transactions on Reliability"}

@String{j-IEEE-TRANS-SOFTW-ENG  = "IEEE Transactions on Software Engineering"}

@String{j-IEEE-TRANS-VLSI-SYST  = "IEEE Transactions on Very Large Scale
                                  Integration (VLSI) Systems"}

@String{j-IIE-TRANS             = "IIE Transactions"}

@String{j-IJCSS                 = "International Journal of Computer Science and
                                  Security (IJCSS)"}

@String{j-IJSAHPC               = "The International Journal of Supercomputer
                                  Applications and High Performance Computing"}

@String{j-ILL-J-MATH            = "Illinois Journal of Mathematics"}

@String{j-IMAGE-VIS-COMPUT      = "Image and Vision Computing"}

@String{j-INDAG-MATH            = "Indagationes Mathematic{\ae}"}

@String{j-INF-CONTROL           = "Information and Control"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-INFOR                 = "INFOR"}

@String{j-INFORMS-J-COMPUT      = "INFORMS Journal on Computing"}

@String{j-INSUR-MATH-ECON       = "Insurance, Mathematics and Economics"}

@String{j-INT-J-APPL-CRYPTOGR   = "International Journal of Applied
                                  Cryptography. IJACT"}

@String{j-INT-J-APPROX-REASONING = "International Journal of Approximate
                                  Reasoning"}

@String{j-INT-J-CIRCUIT-THEORY-APPL = "International Journal of Circuit Theory
                                  and Applications"}

@String{j-INT-J-COMP-APPL       = "International Journal of Computer
                                  Applications"}

@String{j-INT-J-COMPUT-APPL     = "International Journal of Computers and
                                  Applications"}

@String{j-INT-J-COMPUT-MATH     = "International Journal of Computer
                                  Mathematics"}

@String{j-INT-J-COMPUT-INF-SCI  = "International Journal of Computer and
                                  Information Sciences"}

@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations
                                  of Computer Science (IJFCS)"}

@String{j-INT-J-HIGH-SPEED-COMPUTING = "International Journal of High Speed
                                  Computing (IJHSC)"}

@String{j-INT-J-INFO-SEC        = "International Journal of Information
                                  Security"}

@String{j-INT-J-MATH-EDU-SCI-TECH = "International Journal of Mathematical
                                  Education in Science and Technology"}

@String{j-INT-J-MATH-MATH-SCI   = "International Journal of Mathematics and
                                  Mathematical Sciences"}

@String{j-INT-J-MOD-PHYS-C      = "International Journal of Modern Physics C
                                  [Physics and Computers]"}

@String{j-INT-J-MODELLING-SIMUL = "International Journal of Modelling and
                                  Simulation"}

@String{j-INT-J-NUMBER-THEORY   = "International Journal of Number Theory"}

@String{j-INT-J-PARALLEL-PROG   = "International Journal of Parallel
                                   Programming"}

@String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel,
                                  Emergent and Distributed Systems: IJPEDS"}

@String{j-INT-J-THEOR-PHYS      = "International Journal of Theoretical
                                  Physics"}

@String{j-INT-STAT-REV          = "International Statistical Review =
                                  Revue Internationale de Statistique"}

@String{j-INT-STUD-PHILOS-SCI   = "International Studies in the Philosophy of
                                  Science"}

@String{j-INTERFACE             = "Interface"}

@String{j-INTERFACES            = "Interfaces"}

@String{j-IRE-TRANS-ELEC-COMPUT = "IRE Transactions on Electronic Computers"}

@String{j-J-ACM                 = "Journal of the ACM"}

@String{j-J-ACOUST-SOC-AM       = "Journal of the Acoustical Society of
                                  America"}

@String{j-J-ALG                 = "Journal of Algorithms"}

@String{j-J-AM-STAT-ASSOC       = "Journal of the American Statistical
                                  Association"}

@String{j-J-APPL-ECONOMETRICS   = "Journal of Applied Econometrics"}

@String{j-J-APPL-PHYS           = "Journal of Applied Physics"}

@String{j-J-APPL-PROBAB         = "Journal of Applied Probability"}

@String{j-J-APPL-STAT           = "Journal of Applied Statistics"}

@String{j-J-ASTRONAUTICAL-SCIENCES = "Journal of the Astronautical Sciences"}

@String{j-J-CHEM-PHYS           = "Journal of Chemical Physics"}

@String{j-J-CHEM-THEORY-COMPUT  = "Journal of Chemical Theory and Computation"}

@String{j-J-COMP-SECUR          = "Journal of Computer Security"}

@String{j-J-COMP-SYS-SCI        = "Journal of Computer and System Sciences"}

@String{j-J-COMPLEXITY          = "Journal of Complexity"}

@String{j-J-COMPUT-APPL-MATH    = "Journal of Computational and Applied
                                  Mathematics"}

@String{j-J-COMPUT-CHEM         = "Journal of Computational Chemistry"}

@String{j-J-COMPUT-GRAPH-STAT   = "Journal of Computational and Graphical
                                  Statistics"}

@String{j-J-COMPUT-PHYS         = "Journal of Computational Physics"}

@String{j-J-COMPUT-SCI          = "Journal of Computational Science"}

@String{j-J-CRYPTO-ENG          = "Journal of Cryptographic Engineering"}

@String{j-J-CRYPTOLOGY          = "Journal of Cryptology: the journal of the
                                  International Association for Cryptologic
                                  Research"}

@String{j-J-DISCR-MATH-SCI-CRYPTO = "Journal of Discrete Mathematical Sciences
                                  and Cryptography"}

@String{j-J-ECON-DYN-CONTROL    = "Journal of Economic Dynamics and Control"}

@String{j-J-ECON-LIT            = "Journal of Economic Literature"}

@String{j-J-FUNCT-PROGRAM       = "Journal of Functional Programming"}

@String{j-J-INF-OPTIM-SCI       = "Journal of Information \& Optimization Sciences"}

@String{j-J-INFO-SEC-APPL       = "Journal of Information Security and
                                 Applications (JISA)"}

@String{j-J-JAPAN-SOC-COMPUT-STAT = "Journal of Japanese Society of
                                  Computational Statistics"}

@String{j-J-LOND-MATH-SOC       = "Journal of the London Mathematical Society"}

@String{j-J-MATH-ARTS           = "Journal of Mathematics and the Arts"}

@String{j-J-MATH-CRYPTOL        = "Journal of Mathematical Cryptology"}

@String{j-J-MATH-KYOTO-UNIV     = "Journal of Mathematics of Kyoto University"}

@String{j-J-MATH-PHYS           = "Journal of Mathematical Physics"}

@String{j-J-MOD-APPL-STAT-METH  = "Journal of Modern Applied Statistical
                                  Methods"}

@String{j-J-MOD-OPT             = "Journal of Modern Optics"}

@String{j-J-NETW-COMPUT-APPL    = "Journal of Network and Computer
                                  Applications"}

@String{j-J-NUMBER-THEORY       = "Journal of Number Theory"}

@String{j-J-NUMER-METHODS-COMPUT-APPL = "Journal on Numerical Methods and
                                  Computer Applications"}

@String{j-J-OPER-RES-SOC        = "OR: the journal of the Operational Research
                                  Society"}

@String{j-J-OPER-RES-SOC-JPN    = "Journal of the Operations Research Society of
                                  Japan"}

@String{j-J-PAR-DIST-COMP       = "Journal of Parallel and Distributed
                                  Computing"}

@String{j-J-PARAPSYCHOL         = "Journal of Parapsychology"}

@String{j-J-PAS-ADA-MOD         = "Journal of Pascal, Ada and Modula-2"}

@String{j-J-PHILOS-LOGIC        = "Journal of Philosophical Logic"}

@String{j-J-PHYS-A              = "Journal of Physics A (Mathematical and
                                  General)"}

@String{j-J-PHYS-CHEM-B         = "Journal of Physical Chemistry. B. Condensed
                                  matter, materials, surfaces,
                                  interfaces \& biophysical"}

@String{j-J-PHYS-E              = "Journal of Physics. E: Scientific
                                  Instruments"}

@String{j-J-PSYCHOL             = "Journal of Psychology"}

@String{j-J-R-STAT-SOC          = "Journal of the Royal Statistical Society"}

@String{j-J-R-STAT-SOC-SER-A-GENERAL = "Journal of the Royal Statistical
                                  Society. Series A (General)"}

@String{j-J-R-STAT-SOC-SER-B-METHODOL = "Journal of the Royal Statistical
                                  Society. Series B (Methodological)"}

@String{j-J-R-STAT-SOC-SER-D-STATISTICIAN = "Journal of the Royal Statistical
                                  Society. Series D (The Statistician)"}

@String{j-J-RES-NATL-BUR-STAND-1934 = "Journal of Research of the National
                                  Bureau of Standards (1934)"}

@String{j-J-RES-NATL-BUR-STAND-B = "Journal of Research of the National Bureau
                                  of Standards. Section B, Mathematics
                                  and Mathematical Physics"}

@String{j-J-SIAM                = "Journal of the Society for Industrial and
                                  Applied Mathematics"}

@String{j-J-SIMUL               = "Journal of Simulation"}

@String{j-J-STAT-COMPUT-SIMUL   = "Journal of Statistical Computation and
                                  Simulation"}

@String{j-J-STAT-PHYS           = "Journal of Statistical Physics"}

@String{j-J-STAT-PLANN-INFERENCE = "Journal of Statistical Planning and
                                  Inference"}

@String{j-J-STAT-SOFT           = "Journal of Statistical Software"}

@String{j-J-STAT-THEORY-PRACT   = "Journal of Statistical Theory and Practice"}

@String{j-J-SUPERCOMPUTING      = "The Journal of Supercomputing"}

@String{j-J-SYMBOLIC-COMP       = "Journal of Symbolic Computation"}

@String{j-J-SYST-SOFTW          = "The Journal of Systems and Software"}

@String{j-J-UCS                 = "J.UCS: Journal of Universal Computer
                                  Science"}

@String{j-J-VLSI-SIGNAL-PROC    = "Journal of VLSI Signal Processing"}

@String{j-J-WASH-ACAD-SCI       = "Journal of the Washington Academy of
                                  Sciences"}

@String{j-JAPAN-J-INDUST-APPL-MATH = "Japan Journal of Industrial and Applied
                                  Mathematics"}

@String{j-JETC                  = "ACM Journal on Emerging Technologies
                                  in Computing Systems (JETC)"}

@String{j-JETP-LETT             = "JETP Letters"}

@String{j-LASER-PHYS-LETT       = "Laser Physics Letters"}

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

@String{j-LECT-NOTES-CONTROL-INF-SCI = "Lecture Notes in Control and Information
                                  Sciences"}

@String{j-LECT-NOTES-MATH       = "Lecture Notes in Mathematics"}

@String{j-LIGHTWAVE-TECHNOL     = "Journal of Lightwave Technology"}

@String{j-LINEAR-ALGEBRA-APPL   = "Linear Algebra and its Applications"}

@String{j-LOGIN                 = ";login: the USENIX Association newsletter"}

@String{j-LOS-ALAMOS-SCIENCE    = "Los Alamos Science"}

@String{j-MANAGEMENT-SCIENCE    = "Management Science"}

@String{j-MANUSCR-MATH          = "Manuscripta Mathematica"}

@String{j-MAPLE-TECH-NEWS       = "Maple Technical Newsletter"}

@String{j-MATH-ANN              = "Mathematische Annalen"}

@String{j-MATH-COMP-MODELLING   = "Mathematical and Computer Modelling"}

@String{j-MATH-COMP-SIM         = "Mathematics and Computers in Simulation"}

@String{j-MATH-COMPUT           = "Mathematics of Computation"}

@String{j-MATH-GEOL             = "Mathematical Geology"}

@String{j-MATH-INTEL            = "The Mathematical Intelligencer"}

@String{j-MATH-JAPON            = "Mathematica Japonica"}

@String{j-MATH-OP-RES           = "Mathematics of Operations Research"}

@String{j-MATH-PROG             = "Mathematical Programming"}

@String{j-MATH-PROG-STUDY       = "Mathematical Programming Study"}

@String{j-MATH-REV              = "Mathematical Reviews"}

@String{j-MATH-SCAND            = "Mathematica Scandinavica"}

@String{j-MATH-SCI-ENG          = "Mathematics in Science and Engineering"}

@String{j-MATH-SLOVACA          = "Mathematica Slovaca"}

@String{j-MATH-TABLES-OTHER-AIDS-COMPUT = "Mathematical Tables and Other Aids
                                  to Computation"}

@String{j-MATH-Z                = "Mathematische Zeitschrift"}

@String{j-MATHEMATICA-J         = "Mathematica Journal"}

@String{j-MDMV                  = "Mitteilungen der Deutschen
                                  Mathematiker-Vereinigung"}

@String{j-MEASUREMENT           = "Measurement: Journal of the International
                                  Measurement Confederation"}

@String{j-METRIKA               = "Metrika. International Journal for
                                  Theoretical and Applied Statistics."}

@String{j-METRON                = "Metron"}

@String{j-MICROELECT-RELIABILITY = "Microelectronics and Reliability"}

@String{j-MICROSYS-TECH         = "Microsystem Technologies: Sensors, Actuators,
                                  Systems Integration"}

@String{j-MONAT-MATH            = "Monatshefte f{\"u}r Mathematik"}

@String{j-MONTE-CARLO-METHODS-APPL = "Monte Carlo Methods and Applications"}

@String{j-NACH-ELEK             = "Nachrichtentechnik Elektronik"}

@String{j-NAMS                  = "Notices of the American Mathematical
                                  Society"}

@String{j-NATURE                = "Nature"}

@String{j-NATURE-PHOTONICS      = "Nature Photonics"}

@String{j-NATURE-PHYSICS        = "Nature Physics"}

@String{j-NEUROCOMPUTING        = "Neurocomputing"}

@String{j-NEW-GEN-COMP          = "New Generation Computing"}

@String{j-NEW-SCIENTIST         = "New Scientist"}

@String{j-NONLINEAR-ANAL        = "Nonlinear Analysis, Theory, Methods and
                                  Applications"}

@String{j-NONLINEARITY          = "Nonlinearity (Bristol)"}

@String{j-NORDISK-TIDSKR-INFORM-BEHAND = "Nordisk Tidskrift for
                                  Informationsbehandling"}

@String{j-NRL                   = "Naval Research Logistics"}

@String{j-NUCL-GEOPHYS          = "Nuclear Geophysics"}

@String{j-NUCL-PHYS-B           = "Nuclear Physics B"}

@String{j-NUCL-PHYS-B-PROC-SUPPL = "Nuclear Physics B, Proceedings Supplements"}

@String{j-NUCL-SCI-ENG          = "Nuclear Science and Engineering"}

@String{j-NUM-MATH              = "Numerische Mathematik"}

@String{j-NUMER-ALGORITHMS      = "Numerical Algorithms"}

@String{j-NY-TIMES              = "New York Times"}

@String{j-OPER-RES              = "Operations Research"}

@String{j-OPER-RES-VERFAHREN    = "{Operations Research-Verfahren}"}

@String{j-ORG-BEHAV-HUM-DECIS-PROCESS = "Organizational Behavior and Human
                                  Decision Processes"}

@String{j-ORSA-J-COMPUT         = "ORSA Journal on Computing"}

@String{j-OPT-EXPRESS           = "Optics Express"}

@String{j-OPT-LET               = "Optics Letters"}

@String{j-PAC-J-MATH            = "Pacific Journal of Mathematics"}

@String{j-PACMPL                = "Proceedings of the ACM on Programming
                                  Languages (PACMPL)"}

@String{j-PARALLEL-COMPUTING    = "Parallel Computing"}

@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}

@String{j-PERCEPTUAL-MOTOR-SKILLS = "Perceptual and Motor Skills"}

@String{j-PERIOD-MATH-HUNGAR    = "Periodica Mathematica Hungarica"}

@String{j-PHIL-MAGAZINE         = "Philosophical Magazine"}

@String{j-PHYS-LET-A            = "Physics Letters A"}

@String{j-PHYS-PLASMAS          = "Physics of Plasmas"}

@String{j-PHYS-REV              = "Physical Review"}

@String{j-PHYS-REV-A            = "Physical Review A (Atomic, Molecular, and
                                  Optical Physics)"}

@String{j-PHYS-REV-E            = "Physical Review E (Statistical physics,
                                  plasmas, fluids, and related
                                  interdisciplinary topics)"}

@String{j-PHYS-REV-LET          = "Physical Review Letters"}

@String{j-PHYS-REV-X            = "Physical Review X"}

@String{j-PHYS-TODAY            = "Physics Today"}

@String{j-PHYSICA-A             = "Physica A, Statistical Mechanics and its Applications"}

@String{j-PHYSICA-D             = "Physica D, Nonlinear phenomena"}

@String{j-PLANET-SPACE-SCI      = "Planetary and Space Science"}

@String{j-PROB-ENG-MECH         = "Probabilistic Engineering Mechanics"}

@String{j-PROBAB-ENGRG-INFORM-SCI = "Probability in the Engineering and
                                  Informational Sciences"}

@String{j-PROBAB-THEORY-RELAT-FIELDS = "Probability theory and related fields"}

@String{j-PROBL-INF-TRANSM      = "Problems of Information Transmission"}

@String{j-PROC-AM-MATH-SOC      = "Proceedings of the American Mathematical
                                  Society"}

@String{j-PROC-CAMBRIDGE-PHIL-SOC = "Proceedings of the Cambridge
                                  Philosophical Society. Mathematical and
                                  physical sciences"}

@String{j-PROC-IEEE             = "Proceedings of the IEEE"}

@String{j-PROC-NATL-ACAD-SCI-USA = "Proceedings of the {National Academy of
                                  Sciences of the United States of America}"}

@String{j-PROC-R-SOC-EDINB      = "Proceedings of the Royal Society of
                                  Edinburgh"}

@String{j-PROC-R-SOC-LOND-SER-A-MATH-PHYS-SCI = "Proceedings of the Royal
                                  Society of London. Series A,
                                  Mathematical and physical sciences"}

@String{j-PROC-STEKLOV-INST-MATH = "Trudy Matematicheskogo instituta imeni V. A.
                                  Steklova = Proceedings of the Steklov
                                  Institute of Mathematics"}

@String{j-PROC-SPIE             = "Proceedings of the SPIE --- The
                                  International Society for Optical
                                  Engineering"}

@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}

@String{j-PROG-COMP-SOFT        = "Programming and Computer Software;
                                  translation of Programmirovaniye
                                  (Moscow, USSR) Plenum"}

@String{j-PROGRESS-NUCLEAR-ENERGY = "Progress in Nuclear Energy"}

@String{j-QUAL-QUANT            = "Quality \& Quantity"}

@String{j-QUART-APPL-MATH       = "Quarterly of Applied Mathematics"}

@String{j-QUEUE                 = "ACM Queue: Tomorrow's Computing Today"}

@String{j-R-JOURNAL             = "The R Journal"}

@String{j-R-NEWS                = "R News: the Newsletter of the R Project"}

@String{j-RELIABLE-COMPUTING    = "Reliable Computing = Nadezhnye vychisleniia"}

@String{j-REND-CIRC-MAT         = "Rendiconti del Circolo matematico di Palermo"}

@String{j-REP-PROG-PHYS         = "Reports on Progress in Physics"}

@String{j-REV-INST-INT-STAT     = "Revue de l'Institut international de
                                  statistique = Review of the
                                  International Statistical Institute"}

@String{j-REV-MOD-PHYS          = "Reviews of Modern Physics"}

@String{j-REV-SCI-INSTRUM       = "Review of Scientific Instruments"}

@String{j-RISK-ANAL             = "Risk Analysis"}

@String{j-RUSS-J-NUM-ANAL-MATH-MODEL = "Russian Journal of Numerical Analysis
                                  and Mathematical Modelling"}

@String{j-SANKHYA               = "Sankhy{\=a} (Indian Journal of Statistics)"}

@String{j-SANKHYA-A             = "Sankhy{\={a}} (Indian Journal of
                                  Statistics), Series A. Methods and
                                  Techniques"}

@String{j-SANKHYA-B             = "Sankhy{\=a} (Indian Journal of Statistics),
                                  Series B. Methodological"}

@String{j-SCAND-ACTUAR-J        = "Scandinavian Actuarial Journal"}

@String{j-SCI-AMER              = "Scientific American"}

@String{j-SCI-CHINA-SER-E-TECH-SCI = "Science in {China}. Series {E},
                                  Technological sciences"}

@String{j-SCI-COMPUT            = "Scientific Computing"}

@String{j-SCIENCE               = "Science"}

@String{j-SCIENCE-NEWS          = "Science News (Washington, DC)"}

@String{j-SIAM-J-ALG-DISC-METH =  "SIAM Journal on Algebraic and
                                  Discrete Methods"}

@String{j-SIAM-J-APPL-MATH      = "SIAM Journal on Applied Mathematics"}

@String{j-SIAM-J-COMPUT         = "SIAM Journal on Computing"}

@String{j-SIAM-J-DISCR-MATH     = "SIAM Journal on Discrete Mathematics"}

@String{j-SIAM-J-IMAGING-SCI    = "SIAM Journal on Imaging Sciences"}

@String{j-SIAM-J-MATH-ANA       = "SIAM Journal on Mathematical Analysis"}

@String{j-SIAM-J-NUMER-ANAL     = "SIAM Journal on Numerical Analysis"}

@String{j-SIAM-J-SCI-COMP       = "SIAM Journal on Scientific Computing"}

@String{j-SIAM-J-SCI-STAT-COMP  = "SIAM Journal on Scientific and Statistical
                                  Computing"}

@String{j-SIAM-NEWS             = "SIAM News"}

@String{j-SIAM-REVIEW           = "SIAM Review"}

@String{j-SIGACT                = "ACM SIGACT News"}

@String{j-SIGADA-LETTERS        = "ACM SIGADA Ada Letters"}

@String{j-SIGBIO-NEWSLETTER     = "ACM SIGBIO Newsletter"}

@String{j-SIGCSE                = "SIGCSE Bulletin (ACM Special Interest Group
                                  on Computer Science Education)"}

@String{j-SIGMETRICS            = "ACM SIGMETRICS Performance Evaluation
                                  Review"}

@String{j-SIGMOD                = "SIGMOD Record (ACM Special Interest
                                  Group on Management of Data)"}

@String{j-SIGNUM                = "ACM SIGNUM Newsletter"}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

@String{j-SIGSAC-REVIEW         = "SIGSAC Review"}

@String{j-SIM-MODEL-PRACT-THEORY = "Simulation Modelling Practice and Theory"}

@String{j-SIM-PRACT-THEORY      = "Simulation Practice and Theory"}

@String{j-SIMULATION            = "Simulation"}

@String{j-SIMULETTER            = "ACM Simuletter"}

@String{j-SOFTW-CONCEPTS-TOOLS  = "Software --- Concepts and Tools"}

@String{j-SOV-MATH-PROVIDENCE   = "Soviet Mathematics"}

@String{j-SOVIET-MATH-DOKL      = "Soviet Mathematics. Doklady"}

@String{j-SPE                   = "Soft\-ware --- Prac\-tice and Experience"}

@String{j-STAT-COMPUT           = "Statistics and Computing"}

@String{j-STAT-METHODOL         = "Statistical Methodology"}

@String{j-STAT-NEERLANDICA      = "Statistica Neerlandica. Journal of the
                                  Netherlands Society for Statistics and
                                  Operations Research"}

@String{j-STAT-PAPERS           = "Statistical Papers"}

@String{j-STAT-PROB-LETT        = "Statistics \& Probability Letters"}

@String{j-STAT-SCI              = "Statistical Science"}

@String{j-STAT-SINICA           = "Statistica Sinica"}

@String{j-STATIST-PAPERS        = "Statistical Papers = Statistische Hefte"}

@String{j-STATISTICA-BOLOGNA    = "Statistica (Bologna)"}

@String{j-STATISTICS            = "Statistics: a Journal of Theoretical
                                  and Applied Statistics"}

@String{j-STATISTICS-BERLIN     = "Statistics (Berlin, DDR)"}

@String{j-STOCH-PROC-APPL       = "Stochastic Processes and Their
                                  Applications"}

@String{j-STUD-HIST-PHILOS-MOD-PHYS = "Studies in History and Philosophy of
                                  Modern Physics"}

@String{j-STUDIA-MATH           = "Studia Mathematica"}

@String{j-STUDIES-APPL-MATH     = "Studies in Applied Mathematics"}

@String{j-SUNSERVER             = "SunServer"}

@String{j-SUPERCOMPUTER         = "Supercomputer"}

@String{j-SYS-ADMIN             = "Sys Admin: The Journal for UNIX Systems
                                  Administrators"}

@String{j-SYS-COMP-JAPAN        = "Systems and computers in Japan"}

@String{j-TACO                  = "ACM Transactions on Architecture and
                                  Code Optimization"}

@String{j-TALG                  = "ACM Transactions on Algorithms"}

@String{j-TECHNOMETRICS         = "Technometrics"}

@String{j-TECS                  = "ACM Transactions on Embedded Computing
                                  Systems"}

@String{j-THEOR-COMP-SCI        = "Theoretical Computer Science"}

@String{j-THEOR-MATH-PHYS       = "Theoretical and Mathematical Physics"}

@String{j-THEORY-COMPUT-SYST    = "Theory of Computing Systems"}

@String{j-THEORY-PROBAB-APPL    = "Theory of Probability and its Applications"}

@String{j-J-TIME-SER-ANAL       = "Journal of Time Series Analysis"}

@String{j-TISSEC                = "ACM Transactions on Information and System
                                  Security"}

@String{j-TKDD                  = "ACM Transactions on Knowledge Discovery
                                  from Data (TKDD)"}

@String{j-TOCL                  = "ACM Transactions on Computational Logic"}

@String{j-TOCS                  = "ACM Transactions on Computer Systems"}

@String{j-TOCT                  = "ACM Transactions on Computation Theory"}

@String{j-TODAES                = "ACM Transactions on Design Automation of
                                   Electronic Systems"}

@String{j-TODS                  = "ACM Transactions on Database Systems"}

@String{j-TOG                   = "ACM Transactions on Graphics"}

@String{j-TOIT                  = "ACM Transactions on Internet Technology
                                  (TOIT)"}

@String{j-TOMACS                = "ACM Transactions on Modeling and Computer
                                  Simulation"}

@String{j-TOMS                  = "ACM Transactions on Mathematical Software"}

@String{j-TOPC                  = "ACM Transactions on Parallel Computing
                                  (TOPC)"}

@String{j-TOPS                  = "ACM Transactions on Privacy and Security
                                  (TOPS)"}

@String{j-TRANS-AM-MATH-SOC     = "Transactions of the American Mathematical
                                  Society"}

@String{j-TRANS-AM-NUCL-SOC     = "Transactions of the American Nuclear
                                  Society"}

@String{j-TRANS-INFO-PROCESSING-SOC-JAPAN = "Transactions of the Information
                                  Processing Society of Japan"}

@String{j-TRANS-SOC-INST-CONTROL-ENG = "Transactions of the Society of
                                  Instrument and Control Engineers"}

@String{j-TRETS                 = "ACM Transactions on Reconfigurable
                                  Technology and Systems (TRETS)"}

@String{j-TUGboat               = "TUGboat (Journal of the {\TeX} Users
                                  Group)"}

@String{j-TWO-YEAR-COLL-MATH-J  = "Two-Year College Mathematics Journal"}

@String{j-USSR-COMP-MATH-MATH-PHYS = "U.S.S.R. Computational Mathematics and
                                  Mathematical Physics"}

@String{j-VISUAL-COMPUTER       = "Visual Computer"}

@String{j-VLDB-J                = "VLDB Journal: Very Large Data Bases"}

@String{j-WIRED                 = "Wired"}

@String{j-WIRES                 = "WIREs Computational Statistics"}

@String{j-Z-ANGE-MATH-MECH      = "{Zeitschrift f{\"u}r Angewandte Mathematik
                                  und Mechanik}"}

@String{j-Z-ANGE-MATH-PHYS      = "{Zeitschrift f{\"u}r Angewandte Mathematik
                                  und Physik = Journal of Applied Mathematics
                                  and Physics}"}

@String{j-Z-MATH-LOGIK-GRUNDL-MATH = "{Zeitschrift f{\"u}r mathematische Logik
                                  und Grundlagen der Mathematik}"}

@String{j-Z-PHYSIK              = "{Zeitschrift f{\"u}r Physik}"}

@String{j-Z-WAHRSCHEINLICHKEITSTHEOR-VERW-GEB = "{Zeitschrift f{\"u}r
                                  Wahrscheinlichkeitstheorie und
                                  verwandte Gebiete}"}

%%% ====================================================================
%%% Publishers and their addresses:

@String{pub-A-K-PETERS          = "A. K. Peters, Ltd."}
@String{pub-A-K-PETERS:adr      = "Wellesley, MA, USA"}

@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, NY, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-AEGEAN-PARK         = "Aegean Park Press"}
@String{pub-AEGEAN-PARK:adr     = "Laguna Hills, CA, USA"}

@String{pub-AFIPS               = "AFIPS Press"}
@String{pub-AFIPS:adr           = "Montvale, NJ, USA"}

@String{pub-AIP                 = "American Institute of Physics"}
@String{pub-AIP:adr             = "Woodbury, NY, USA"}

@String{pub-AMS                 = "American Mathematical Society"}
@String{pub-AMS:adr             = "Providence, RI, USA"}

@String{pub-ARTECH             = "Artech House Inc."}
@String{pub-ARTECH:adr         = "Norwood, MA, USA"}

@String{pub-ASME                = "American Society of Mechanical Engineers"}
@String{pub-ASME:adr            = "345 E. 47th St., New York, NY 10017, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-BIRKHAUSER-BOSTON   = "Birkh{\"a}user Boston Inc."}
@String{pub-BIRKHAUSER-BOSTON:adr = "Cambridge, MA, USA"}

@String{pub-CAMBRIDGE           = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr       = "Cambridge, UK"}

@String{pub-CHAPMAN-HALL        = "Chapman and Hall, Ltd."}
@String{pub-CHAPMAN-HALL:adr    = "London, UK"}

@String{pub-CHAPMAN-HALL-CRC    = "Chapman and Hall/CRC"}
@String{pub-CHAPMAN-HALL-CRC:adr = "Boca Raton, FL, USA"}

@String{pub-CLARENDON           = "Clarendon Press"}
@String{pub-CLARENDON:adr       = "New York, NY, USA"}

@String{pub-CRC                 = "CRC Press"}
@String{pub-CRC:adr             = "2000 N.W. Corporate Blvd., Boca Raton,
                                  FL 33431-9868, USA"}

@String{pub-CSLI                = "CSLI Publications"}
@String{pub-CSLI:adr            = "Stanford, CA, USA"}

@String{pub-DEKKER              = "Marcel Dekker, Inc."}
@String{pub-DEKKER:adr          = "New York, NY, USA"}

@String{pub-DOVER               = "Dover Publications, Inc."}
@String{pub-DOVER:adr           = "New York, NY, USA"}

@String{pub-ELLIS-HORWOOD       = "Ellis Horwood"}
@String{pub-ELLIS-HORWOOD:adr   = "New York, NY, USA"}

@String{pub-ELS                 = "Elsevier Science Publishers B.V."}
@String{pub-ELS:adr             = "Amsterdam, The Netherlands"}

@String{pub-ELSEVIER            = "Elsevier"}
@String{pub-ELSEVIER:adr        = "Amsterdam, The Netherlands"}

@String{pub-ELSEVIER-ACADEMIC   = "Elsevier Academic Press"}
@String{pub-ELSEVIER-ACADEMIC:adr = "Amsterdam, The Netherlands"}

@String{pub-FREE                = "Free Press"}
@String{pub-FREE:adr            = "New York, NY, USA"}

@String{pub-GAUTHIER-VILLARS    = "Gauthier-Villars"}
@String{pub-GAUTHIER-VILLARS:adr = "Paris, France"}

@String{pub-HARVARD             = "Harvard University Press"}
@String{pub-HARVARD:adr         = "Cambridge, MA, USA"}

@String{pub-HMSO                = "Her Majesty's Stationary Office"}
@String{pub-HMSO:adr            = "London, England"}

@String{pub-HOLDEN-DAY          = "Holden-Day"}
@String{pub-HOLDEN-DAY:adr      = "San Francisco, CA, USA"}

@String{pub-IBM                 = "IBM Corporation"}
@String{pub-IBM:adr             = "Poughkeepsie, NY, USA"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300, Silver
                                  Spring, MD 20910, USA"}

@String{pub-KLUWER              = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht, The
                                    Netherlands"}

@String{pub-MCGRAW-HILL         = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr     = "New York, NY, USA"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-MORGAN-KAUFMANN     = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adrsf = "San Francisco, CA, USA"}

@String{pub-NAP                 = "National Academy Press"}
@String{pub-NAP:adr             = "Washington, DC, USA"}

@String{pub-NBS                 = "U.S. National Bureau of Standards"}
@String{pub-NBS:adr             = "Gaithersburg, MD, USA"}

@String{pub-NIST                = "National Institute for Standards and
                                  Technology"}
@String{pub-NIST:adr            = "Gaithersburg, MD, USA"}

@String{pub-NORTH-HOLLAND       = "North-Hol{\-}land"}
@String{pub-NORTH-HOLLAND:adr   = "Amsterdam, The Netherlands"}

@String{pub-OLIVER-BOYD         = "Oliver and Boyd"}
@String{pub-OLIVER-BOYD:adr     = "Edinburgh, UK; London, UK"}

@String{pub-OXFORD              = "Oxford University Press"}
@String{pub-OXFORD:adr          = "Walton Street, Oxford OX2 6DP, UK"}

@String{pub-PALGRAVE-MACMILLAN  = "Palgrave Macmillan"}
@String{pub-PALGRAVE-MACMILLAN:adr = "Houndmills, Basingstoke, Hampshire
                                  England and New York, NY, USA"}

@String{pub-PANTHEON            = "Pantheon Books"}
@String{pub-PANTHEON:adr        = "New York, NY, USA"}

@String{pub-PERGAMON            = "Pergamon"}
@String{pub-PERGAMON:adr        = "New York, NY, USA"}

@String{pub-PETROCELLI-CHARTER  = "Petrocelli\slash Charter"}
@String{pub-PETROCELLI-CHARTER:adr = "New York, NY, USA"}

@String{pub-PH                  = "Pren{\-}tice-Hall"}
@String{pub-PH:adr              = "Upper Saddle River, NJ, USA"}

@String{pub-PHYSICA-VERLAG      = "Physica-Verlag"}
@String{pub-PHYSICA-VERLAG:adr  = "Vienna, Austria"}

@String{pub-PLENUM              = "Plenum Press"}
@String{pub-PLENUM:adr          = "New York, NY, USA; London, UK"}

@String{pub-PRINCETON           = "Princeton University Press"}
@String{pub-PRINCETON:adr       = "Princeton, NJ, USA"}

@String{pub-R-E-KRIEGER         = "Robert E. Krieger Publishing Company"}
@String{pub-R-E-KRIEGER:adr     = "Huntington, NY, USA"}

@String{pub-REIDEL              = "D. Reidel"}
@String{pub-REIDEL:adr          = "Dordrecht, The Netherlands; Boston,
                                   MA, USA; Lancaster, UK; Tokyo, Japan"}

@String{pub-SIAM                = "Society for Industrial and Applied
                                  Mathematics"}
@String{pub-SIAM:adr            = "Philadelphia, PA, USA"}

@String{pub-SOC-COMPUT-SIM      = "Society for Computer Simulation"}
@String{pub-SOC-COMPUT-SIM:adr  = "San Diego, CA, USA"}

@String{pub-SPIE                = "Society of Photo-optical
                                  Instrumentation Engineers (SPIE)"}
@String{pub-SPIE:adr            = "Bellingham, WA, USA"}

@String{pub-STANFORD            = "Stanford University Press"}
@String{pub-STANFORD:adr        = "Stanford, CA, USA"}

@String{pub-SUN-MICROSYSTEMS-PRESS = "Sun Microsystems Press"}
@String{pub-SUN-MICROSYSTEMS-PRESS:adr = "Palo Alto, CA, USA"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}

@String{pub-TAYLOR-FRANCIS      = "Taylor and Francis"}
@String{pub-TAYLOR-FRANCIS:adr  = "Boca Raton, FL, USA"}

@String{pub-TEUBNER             = "Teubner"}
@String{pub-TEUBNER:adr         = "Stuttgart, Germany; Leipzig, Germany"}

@String{pub-U-CAL               = "University of California Press"}
@String{pub-U-CAL:adr           = "Berkeley, CA, USA"}

@String{pub-U-MICHIGAN          = "University of Michigan Press"}
@String{pub-U-MICHIGAN:adr      = "Ann Arbor, MI, USA"}

@String{pub-U-NC                = "University of North Carolina Press"}
@String{pub-U-NC:adr            = "Chapel Hill, NC, USA"}

@String{pub-NORTON              = "W. W. Norton \& Co."}
@String{pub-NORTON:adr          = "New York, NY, USA"}

@String{pub-USENIX              = "USENIX"}
@String{pub-USENIX:adr          = "Berkeley, CA, USA"}

@String{pub-USGPO               = "United States Government Printing Office"}
@String{pub-USGPO:adr           = "Washington, DC, USA"}

@String{pub-VAN-NOSTRAND-REINHOLD = "Van Nostrand Reinhold"}
@String{pub-VAN-NOSTRAND-REINHOLD:adr = "New York, NY, USA"}

@String{pub-W-H-FREEMAN         = "W. H. {Freeman and Company}"}
@String{pub-W-H-FREEMAN:adr     = "New York, NY, USA"}

@String{pub-WI                  = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WI:adr              = "New York, NY, USA"}

@String{pub-WILEY               = "Wiley"}
@String{pub-WILEY:adr           = "New York, NY, USA"}

@String{pub-WORLD-SCI           = "World Scientific Publishing
                                  Co. Pte. Ltd."}
@String{pub-WORLD-SCI:adr       = "P. O. Box 128, Farrer Road,
                                  Singapore 9128"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-APPL-MATH-SER-NBS   = "Applied Mathematics Series / National Bureau
                                  of Standards"}

@String{ser-BOSTON-STUD-PHILOS-SCI = "Boston Studies in the Philosophy of
                                  Science"}

@String{ser-LECT-NOTES-MATH     = "Lecture Notes in Mathematics"}

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

@String{ser-LNMATH              = "Lecture Notes in Mathematics"}

%%% ====================================================================
%%% Bibliography entries, sorted by year, and then by citation label:

@Article{Pearson:1900:CGS,
  author =       "Karl Pearson",
  title =        "On a Criterion that a Given System of Deviations from
                 the Probable in the Case of a Correlated System of
                 Variables is Such That it can be Reasonably Supposed to
                 Have Arisen in Random Sampling",
  journal =      j-PHIL-MAGAZINE,
  volume =       "50",
  number =       "302",
  pages =        "157--175",
  month =        jul # "\slash " # dec,
  year =         "1900",
  CODEN =        "PHMAA4",
  DOI =          "https://doi.org/10.1080/14786440009463897",
  ISSN =         "0031-8086",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/pdf/10.1080/14786440009463897",
  acknowledgement = ack-nhfb,
  fjournal =     "The London, Edinburgh, and Dublin Philosophical
                 Magazine and Journal of Science",
  journal-URL =  "http://www.tandfonline.com/loi/tphm19",
  remark =       "This is the paper in which Pearson introduces the
                 chi-square measure, which the magazine Science 84
                 (November 1984) ranked among the top twenty scientific
                 discoveries of the 20th Century that changed our
                 lives.",
}

@Article{Student:1908:PEM,
  author =       "{Student}",
  title =        "The Probable Error of a Mean",
  journal =      j-BIOMETRIKA,
  volume =       "6",
  number =       "1",
  pages =        "1--25",
  month =        mar,
  year =         "1908",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2331554",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 13:37:25 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315351;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1900.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2331554",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  HDnumber =     "116",
  journal-URL =  "http://www.jstor.org/journals/00063444.html",
  remark =       "Was the author really W. S. Gossett?",
}

@Article{Borel:1909:PDL,
  author =       "{\'E}mile Borel",
  title =        "Les probabilit{\'e}s d{\'e}nombrables et leurs
                 applications arithm{\'e}tiques. ({French}) [{Countable}
                 probabilities and their arithmetic applications]",
  journal =      j-REND-CIRC-MAT,
  volume =       "27",
  number =       "??",
  pages =        "247--271",
  month =        "????",
  year =         "1909",
  CODEN =        "RCMMAR",
  DOI =          "https://doi.org/10.1007/BF03019651",
  ISSN =         "0009-725X (print), 1973-4409 (electronic)",
  ISSN-L =       "0009-725X",
  bibdate =      "Thu Dec 22 08:18:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://springerlink.com/content/121284",
  ZMnumber =     "40.0283.01",
  acknowledgement = ack-nhfb,
  fjournal =     "Rendiconti del Circolo Matematico di Palermo
                 (1884--1940)",
  language =     "French",
  remark =       "This is believed to be the paper in which Borel
                 introduced the notion of a ``normal number'', one whose
                 digits, in a specified base, are truly random. On page
                 260, Borel writes: ``La probabilit{\'e} {\em pour que
                 la fr{\'e}quence totale d'un chiffre d{\'e}termin{\'e}
                 existe et soit {\'e}gale {\`a} $ 1 / 10 $ \/} a pour
                 valeur l'unit{\'e}. La probabilit{\'e} pour que la
                 fr{\'e}quence des dix chiffres existe et soit {\'e}gale
                 {\`a} $ 1 / 10 $ pour chacun d'eux a aussi pour valeur
                 l'unit{\'e}. Lorsque la condition pr{\'e}c{\'e}dente
                 est r{\'e}alis{\'e} par une fraction d{\'e}cimale, nous
                 dirons que le nombre {\'e}gal {\`a} cette fraction est
                 {\em simplement normal\/} par rapport {\`a} la base $
                 10 $. Un nombre simplement normal est done
                 caract{\'e}ris{\'e} par le fait que, $ c_0, c_1, c_2,
                 \ldots {}, c_8, c_9 $ d{\'e}signant les nombres
                 respectifs de fois que figurent les chiffres $ 0, 1, 2,
                 \ldots {}, 8, 9 $ parmi les $n$ premi{\`e}res
                 d{\'e}cimales, chacun des rapports: $ c_0 / n, c_1 / n,
                 c_1 / n, \ldots {}, c_8 / n, c_9 / n $ a pour limite $
                 1 / 10 $ lorsque $n$ augmente ind{\`e}finiment.'' [The
                 probability that the total frequency determined by a
                 number exists and is equal to $ 1 / 10 $ is set to
                 unity. The likelihood that the frequency of the ten
                 digits exists and is equal to $ 1 / 10 $ for each value
                 is also unity. When the condition above is satisfied by
                 a decimal fraction, we say that the number equal to
                 this fraction is simply normal to the base $ 10 $. A
                 simply-normal number is thus characterized by the fact
                 that, $ c_0, c_1, c_2, \ldots {}, c_8, c_9 $
                 representing the respective number of times that the
                 digits $ 0, 1, 2, \ldots {}, 8, 9 $ among the first $n$
                 decimals, each of the ratios $ c_0 / n, c_1 / n, c_1 /
                 n, \ldots {}, c_8 / n, c_9 / n $ has the limit $ 1 / 10
                 $ when $n$ increases without limit.]",
  remark-2 =     "Submitted from Paris on 3 November 1908.",
}

@Book{Borel:1914:LTF,
  author =       "{\'E}mile Borel",
  title =        "Le{\c{c}}ons sur la Th{\'e}orie des Fonctions.
                 ({French}) [{Lectures} on the theory of functions]",
  publisher =    pub-GAUTHIER-VILLARS,
  address =      pub-GAUTHIER-VILLARS:adr,
  edition =      "Second",
  pages =        "x + 259",
  year =         "1914",
  LCCN =         "????",
  bibdate =      "Wed Dec 21 06:24:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1871--1956",
  language =     "French",
  remark =       "First edition 1898. On pages 182--216, this book
                 introduced the notion of a normal number: roughly, one
                 whose digits are random. From \cite[page
                 242]{Kannan:1988:PFN}: ``When are the bits of a real
                 number random? (The phrase 'the bits of a real number'
                 will mean the binary expansion of the fractional part
                 of the number.) The classical definition was provided
                 by Borel in 1909 \cite{Borel:1909:PDL,Borel:1914:LTF}.
                 The gist of it follows: Define a real number $a$ to be
                 normal with respect to the base $2$ if for any natural
                 number $k$, each of the $ 2^k $ possible $0$--$1$
                 strings of length $k$ occur with equal probability in
                 the bits of $a$. A similar definition can be made for
                 other bases. It was not difficult to show that most
                 real numbers are normal. It was shown by Champernowne
                 \cite{Champernowne:1933:CDN} in 1933 that the real
                 number $ a_0 $ which equals the infinite decimal $
                 0.123456789101112 \ldots {} $ (whose digits are obtained
                 by juxtaposing the digits of the integers $ 1, 2, 3, 4,
                 \ldots {} $ ) is normal to the base $ 10 $. Copeland
                 and Erdos generalized this to any basis and a class of
                 reals including $ a_0 $ and $ a_1 = 0.2357111317 \ldots
                 {} $ whose digits are obtained by juxtaposing the
                 digits of successive primes.''",
}

@Article{Weyl:1916:GZM,
  author =       "H. Weyl",
  title =        "{{\"U}ber die Gleichverteilung Zahlen modulo Eins}.
                 ({German}) [{On} the uniform distribution of numbers
                 modulo one]",
  journal =      j-MATH-ANN,
  volume =       "77",
  number =       "3",
  pages =        "313--352",
  month =        sep,
  year =         "1916",
  CODEN =        "MAANA3",
  DOI =          "https://doi.org/10.1007/BF01475864",
  ISSN =         "0025-5831 (print), 1432-1807 (electronic)",
  ISSN-L =       "0025-5831",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://resolver.sub.uni-goettingen.de/purl?GDZPPN002266423",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematische Annalen",
  HDnumber =     "140",
  journal-URL =  "http://link.springer.com/journal/208",
  language =     "German",
}

@Article{Fisher:1922:ICT,
  author =       "R. A. Fisher",
  title =        "On the Interpretation of $ \chi^2 $ from Contingency
                 Tables, and the Calculation of {$P$}",
  journal =      j-J-R-STAT-SOC,
  volume =       "85",
  number =       "1",
  pages =        "87--94",
  month =        jan,
  year =         "1922",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Mon Jan 16 14:58:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2340521",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
}

@Article{Yule:1922:AMA,
  author =       "G. Udny Yule",
  title =        "On the application of the $ \chi^2 $ method to
                 association and contingency tables, with experimental
                 illustrations",
  journal =      j-J-R-STAT-SOC,
  volume =       "85",
  number =       "1",
  pages =        "95--104",
  month =        jan,
  year =         "1922",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Mon Jan 16 14:58:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2340522",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
}

@Article{Tippett:1925:EIR,
  author =       "L. H. C. Tippett",
  title =        "On the Extreme Individuals and the Range of Samples
                 Taken from a Normal Population",
  journal =      j-BIOMETRIKA,
  volume =       "17",
  number =       "3/4",
  pages =        "364--387",
  month =        dec,
  year =         "1925",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2332087",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 13:38:03 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315377;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1920.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2332087",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  HDnumber =     "122",
  journal-URL =  "http://www.jstor.org/journals/00063444.html",
}

@Book{Tippett:1927:RSN,
  author =       "Leonard Henry Caleb Tippett",
  title =        "Random sampling numbers",
  volume =       "15",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 26",
  year =         "1927",
  LCCN =         "QA47 .T7 no. 15",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With a foreword by editor Karl Pearson.",
  series =       "Tracts for computers",
  acknowledgement = ack-nhfb,
  HDnumber =     "123",
  remark =       "At head of title: Department of applied statistics
                 (Computing section) University of London, University
                 college. At the time, the term `computer' in the series
                 title referred to a human calculational drudge, using
                 female.",
  subject =      "Mathematics; Tables; Sampling (Statistics)",
}

@Article{Yule:1927:RS,
  author =       "G. Udny Yule",
  title =        "On Reading a Scale",
  journal =      j-J-R-STAT-SOC,
  volume =       "90",
  number =       "3",
  pages =        "570--587",
  month =        "????",
  year =         "1927",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Wed Nov 23 12:29:25 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See related later work \cite{Preece:1981:DFD}.",
  URL =          "http://www.jstor.org/stable/2341205",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
  remark =       "This paper reports on human bias in the recording of
                 last digits in measurements, or from roundings, or from
                 later scale conversions.",
}

@Article{Klein:1929:SSD,
  author =       "O. Klein and T. Nishina",
  title =        "{{\"U}ber die Streuung von Strahlung durch freie
                 Elektronen nach der neuen relativistischen
                 Quantendynamik von Dirac}. ({German}) [{On} the
                 scattering of radiation by free electrons according to
                 the new relativistic quantum dynamics of {Dirac}]",
  journal =      j-Z-PHYSIK,
  volume =       "52",
  number =       "11--12",
  pages =        "853--868",
  month =        nov,
  year =         "1929",
  CODEN =        "ZEPYAA",
  DOI =          "https://doi.org/10.1007/BF01366453",
  ISSN =         "0044-3328",
  bibdate =      "Mon Feb 27 10:09:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This paper introduces the Klein--Nishina distribution
                 of random numbes.",
  URL =          "http://www.springerlink.com/content/p6606272608242k2/",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r Physik}",
  journal-URL =  "http://link.springer.com/journal/218",
  language =     "German",
}

@Article{Baker:1930:RSN,
  author =       "G. A. Baker",
  title =        "Random sampling from non-homogeneous populations",
  journal =      j-METRON,
  volume =       "8",
  number =       "??",
  pages =        "67--88",
  month =        "????",
  year =         "1930",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  bibdate =      "Mon Jan 16 14:20:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1930.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
}

@Article{Ward:1931:DRS,
  author =       "Morgan Ward",
  title =        "The distribution of residues in a sequence satisfying
                 a linear recursion relation",
  journal =      j-TRANS-AM-MATH-SOC,
  volume =       "33",
  number =       "1",
  pages =        "166--190",
  month =        "????",
  year =         "1931",
  CODEN =        "TAMTAM",
  DOI =          "https://doi.org/10.2307/1989465",
  ISSN =         "0002-9947 (print), 1088-6850 (electronic)",
  ISSN-L =       "0002-9947",
  MRclass =      "11A07 (39A10)",
  MRnumber =     "1501583",
  bibdate =      "Wed Nov 12 08:28:33 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Trans. AMS",
  fjournal =     "Transactions of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/tran/",
  remark =       "Cited in \cite[page 34]{Reiser:1977:AAR}",
}

@Article{Wilson:1931:DCS,
  author =       "Edwin B. Wilson and Margaret M. Hilferty",
  title =        "The distribution of chi-square",
  journal =      j-PROC-NATL-ACAD-SCI-USA,
  volume =       "17",
  number =       "12",
  pages =        "684--688",
  day =          "1",
  month =        dec,
  year =         "1931",
  CODEN =        "PNASA6",
  DOI =          "https://doi.org/10.1073/pnas.17.12.684",
  ISSN =         "0027-8424 (print), 1091-6490 (electronic)",
  ISSN-L =       "0027-8424",
  bibdate =      "Tue Nov 29 09:10:03 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.pnas.org/doi/abs/10.1073/pnas.17.12.684",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the National Academy of Sciences of the
                 United States of America",
  journal-URL =  "http://www.pnas.org/content/by/year",
}

@Article{Champernowne:1933:CDN,
  author =       "D. G. Champernowne",
  title =        "The construction of decimals normal in the scale of
                 ten",
  journal =      j-J-LOND-MATH-SOC,
  volume =       "8",
  number =       "4",
  pages =        "254--260",
  month =        "????",
  year =         "1933",
  CODEN =        "JLMSAK",
  DOI =          "https://doi.org/10.1112/jlms/s1-8.4.254",
  ISSN =         "0024-6107 (print), 1469-7750 (electronic)",
  ISSN-L =       "0024-6107",
  bibdate =      "Wed Dec 21 06:41:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the London Mathematical Society",
  journal-URL =  "http://jlms.oxfordjournals.org/content/by/year",
  remark =       "``Normal numbers'' are those whose digits are random
                 in some specified base. This paper shows that the
                 number $ 0.123456789101112 \ldots {} $ formed by the
                 juxtaposition of consequence integers is normal in base
                 ten.",
}

@Article{Glivenko:1933:SDE,
  author =       "V. I. Glivenko",
  title =        "Sulla determinazione empirica delle leggi di
                 probabilit{\`a}. ({Italian}) [{On} the empirical
                 determination of a probability law]",
  journal =      "Giornale dell'Istituto Italiano degli Attuari",
  volume =       "4",
  number =       "??",
  pages =        "92--99",
  month =        "????",
  year =         "1933",
  CODEN =        "????",
  ISSN =         "0390-5780",
  bibdate =      "Wed Jan 18 08:25:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Italian",
}

@Article{Kolmogorov:1933:SDE,
  author =       "Andrei Nikolaevich Kolmogorov",
  title =        "Sulla Determinazione Empirica di una Legge di
                 Distributione. ({Italian}) [{On} the empirical
                 determination of a distribution law]",
  journal =      "Giornale dell'Istituto Italiano degli Attuari",
  volume =       "4",
  number =       "??",
  pages =        "83--91",
  month =        "????",
  year =         "1933",
  CODEN =        "????",
  ISSN =         "0390-5780",
  bibdate =      "Tue Jan 17 21:35:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Italian",
  remark =       "This paper, together with \cite{Smirnov:1939:OUE}, is
                 the origin of the Kolmogorov--Smirnov test for goodness
                 of fit.",
  xxpages =      "1--11",
}

@Article{Mahalanobis:1934:TRS,
  author =       "P. C. Mahalanobis",
  title =        "Tables of random samples from a normal population",
  journal =      j-SANKHYA,
  volume =       "1",
  number =       "2--3",
  pages =        "289--328",
  month =        may,
  year =         "1934",
  CODEN =        "SNKYA5",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "With the cooperation of Subhendu Sekhar Bose, Prabhat
                 Ranjan Ray, and Sudhir Kumar Banerji.",
  URL =          "http://www.jstor.org/stable/40383681",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series A.
                 Methods and Techniques",
  HDnumber =     "73",
  journal-URL =  "https://www.jstor.org/journal/sankhya",
}

@Article{Pearson:1934:NMD,
  author =       "Karl Pearson",
  title =        "On a New Method of Determining {``Goodness} of Fit''",
  journal =      j-BIOMETRIKA,
  volume =       "26",
  number =       "4",
  pages =        "425--442",
  month =        dec,
  year =         "1934",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2331988",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 14:32:13 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315388;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1930.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "According to \cite[page 36]{Teichroew:1965:HDS}, this
                 paper introduced the $ P_n(\lambda) $ test for
                 ``determining whether a sample of size $n$, supposed to
                 have been drawn at random from a parent population
                 having a known probability integral has probably been
                 drawn at random.'' See \cite{Nair:1938:TRS} for its
                 first use on random numbers from a uniform
                 distribution.",
  URL =          "http://www.jstor.org/stable/2331988",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://www.jstor.org/journals/00063444.html",
}

@Article{Working:1934:RDS,
  author =       "Holbrook Working",
  title =        "A random-difference series for use in the analysis of
                 time series",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "29",
  number =       "185",
  pages =        "11--24",
  month =        mar,
  year =         "1934",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jan 16 14:53:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2278456",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  remark =       "The random difference series in this paper are derived
                 from Tippett's random numbers
                 \cite{Tippett:1927:RSN}.",
}

@Book{Kadyrov:1936:TRN,
  author =       "M. Kadyrov",
  title =        "Tables of random numbers",
  publisher =    "Izdat. Sredne-Aziatkogo Gos. Univ.",
  address =      "Ta{\v{s}}kent, USSR",
  pages =        "????",
  year =         "1936",
  LCCN =         "????",
  bibdate =      "Thu Jan 19 07:00:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Kermack:1937:SDA,
  author =       "W. O. Kermack and A. G. McKendrick",
  title =        "Some distributions associated with a randomly arranged
                 set of numbers",
  journal =      j-PROC-R-SOC-EDINB,
  volume =       "57",
  number =       "??",
  pages =        "332--376",
  year =         "1937",
  CODEN =        "PRSEAE",
  ISSN =         "0080-4541 (print), 2053-5902 (electronic)",
  ISSN-L =       "0080-4541",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Royal Society of Edinburgh",
  HDnumber =     "65",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=PRE",
}

@Article{Kermack:1937:TRS,
  author =       "W. O. Kermack and A. G. McKendrick",
  title =        "Tests for randomness in a series of numerical
                 observations",
  journal =      j-PROC-R-SOC-EDINB,
  volume =       "57",
  number =       "??",
  pages =        "228--240",
  year =         "1937",
  CODEN =        "PRSEAE",
  ISSN =         "0080-4541 (print), 2053-5902 (electronic)",
  ISSN-L =       "0080-4541",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Royal Society of Edinburgh",
  HDnumber =     "64",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=PRE",
  remark =       "This paper tests Tippett's random numbers
                 \cite{Tippett:1927:RSN}.",
}

@Book{Fisher:1938:STB,
  author =       "Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical Tables for Biological, Agricultural and
                 Medical Research",
  publisher =    pub-OLIVER-BOYD,
  address =      pub-OLIVER-BOYD:adr,
  pages =        "viii + 90 + 1",
  year =         "1938",
  LCCN =         "HA33 .F53",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fisher-ronald-aylmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (17 February 1890--29 July
                 1962)",
  remark =       "First edition; see also 2nd (1943) to 6th (1963)
                 editions. This book contains one of the early
                 pre-computer tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc",
  xxaddress =    "Harlow, Essex, UK",
  xxpublisher =  "Longman",
}

@Article{Hey:1938:NME,
  author =       "G. B. Hey",
  title =        "A New Method of Experimental Sampling Illustrated on
                 Certain Non-Normal Populations",
  journal =      j-BIOMETRIKA,
  volume =       "30",
  number =       "1/2",
  pages =        "68--80",
  month =        jun,
  year =         "1938",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2332225",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 14:32:18 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315396;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1930.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2332225",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
  remark =       "According to \cite[page 37]{Teichroew:1965:HDS}, this
                 paper was the first to ask the question ``How much
                 sampling must be done to reduce the error due to
                 sampling fluctuations?''.",
}

@Article{Kendall:1938:RRS,
  author =       "M. G. Kendall and B. Babington-Smith",
  title =        "Randomness and random sampling numbers",
  journal =      j-J-R-STAT-SOC,
  volume =       "101",
  number =       "??",
  pages =        "147--166",
  year =         "1938",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Roy. Stat. Soc.",
  fjournal =     "Journal of the Royal Statistical Society",
  HDnumber =     "61",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
}

@Article{Lehmer:1938:PSE,
  author =       "D. H. Lehmer",
  title =        "Problems and Solutions: Elementary Problems:
                 Solutions: {Euclid}'s Algorithm for Large Numbers",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "45",
  number =       "4",
  pages =        "227--233",
  month =        apr,
  year =         "1938",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:38:53 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Nair:1938:TRS,
  author =       "K. N. Nair",
  title =        "On {Tippett}'s random sampling numbers",
  journal =      j-SANKHYA,
  volume =       "4",
  number =       "1",
  pages =        "65--72",
  year =         "1938",
  CODEN =        "SNKYA5",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/40383888",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics)",
  HDnumber =     "89",
  journal-URL =  "https://www.jstor.org/journal/sankhya",
}

@Article{Yule:1938:TTR,
  author =       "G. Udny Yule",
  title =        "A test of {Tippett}'s random sampling numbers",
  journal =      j-J-R-STAT-SOC,
  volume =       "101",
  number =       "1",
  pages =        "167--172",
  year =         "1938",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2980656",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Roy. Stat. Soc.",
  fjournal =     "Journal of the Royal Statistical Society",
  HDnumber =     "142",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
}

@Article{Dietze:1939:CCN,
  author =       "E. Dietze and W. D. {Goodale, Jr.}",
  title =        "The Computation of the Composite Noise Resulting from
                 Random Variable Sources",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "18",
  number =       "4",
  pages =        "605--623",
  month =        oct,
  year =         "1939",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:53 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1939/BSTJ.1939.1804.html;
                 http://www.alcatel-lucent.com/bstj/vol18-1939/bstj-vol18-issue04.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol18/bstj18-4-605.pdf;
                 http://www.alcatel-lucent.com/bstj/vol18-1939/articles/bstj18-4-605.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Kendall:1939:SPR,
  author =       "M. G. Kendall and B. Babington-Smith",
  title =        "Second paper on random sampling numbers",
  journal =      "J. Roy. Stat. Soc., Supplement",
  volume =       "6",
  number =       "1",
  pages =        "51--61",
  month =        "????",
  year =         "1939",
  CODEN =        "????",
  ISSN =         "1466-6162",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2983623",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Roy. Stat. Soc., Supplement",
  fjournal =     "Supplement to the Journal of the Royal Statistical
                 Society",
  HDnumber =     "62",
}

@Book{Kendall:1939:TRS,
  author =       "Maurice G. (Maurice George) Kendall and Bernard
                 Babington-Smith",
  title =        "Tables of random sampling numbers",
  volume =       "24",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 60",
  year =         "1939",
  LCCN =         "QA47 .T7 no.24",
  bibdate =      "Mon Jun 27 15:04:05 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Tracts for Computers",
  acknowledgement = ack-nhfb,
  author-dates = "1907--1983",
  HDnumber =     "63",
  remark-1 =     "On cover: Department of Statistics. University of
                 London, University College.",
  remark-2 =     "See \cite{Wold:1948:RND} for a transformation to
                 normally-distributed random numbers.",
  subject =      "Sampling (Statistics); Mathematics; Tables",
}

@Article{Mahler:1939:UKK,
  author =       "Kurt Mahler",
  title =        "{Ein {\"U}bertragungsprinzip f{\"u}r konvexe
                 K{\"o}rper}. ({German}) [{A} theorem on transfer for
                 convex bodies]",
  journal =      "{\v{C}}asopis pro p{\v{e}}stov{\'a}n{\'\i} matematiky
                 a fysiky",
  volume =       "68",
  number =       "3--4",
  pages =        "93--102",
  month =        "????",
  year =         "1939",
  CODEN =        "????",
  ISSN =         "0528-2195",
  MRnumber =     "MR 0001242",
  bibdate =      "Mon Dec 26 11:20:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dml.cz/dmlcz/109441",
  ZMnumber =     "65.0175.02; 0021.10403",
  acknowledgement = ack-nhfb,
  ajournal =     "{\v{C}}asopis Mat. Fysik., Praha",
  language =     "German",
  remark =       "Incompletely cited in \cite{Ripley:1983:LSP} as a
                 source of part of a proof on lattice hyperplane
                 spacing.",
  xxISSN =       "1802-114X",
}

@Article{Smirnov:1939:EDB,
  author =       "N. Smirnov",
  title =        "On the estimation of the discrepancy between empirical
                 curves of distribution for two independent samples",
  journal =      "Bulletin Math{\'e}matique de l'Universit{\'e} de
                 {Moscou}, S{\'e}rie internationale 2",
  volume =       "2",
  number =       "2",
  pages =        "1--16",
  month =        "????",
  year =         "1939",
  CODEN =        "????",
  ISSN =         "????",
  MRclass =      "62.0X",
  MRnumber =     "MR0002062 (1,345f)",
  bibdate =      "Wed Jan 18 08:29:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0023.24902",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin de l'Universit{\'e} d'{\'e}tat {\'a}
                 {Moscou}. S{\'e}rie internationale. Section A:
                 Math{\'e}matiques et m{\'e}canique",
  pagecount =    "16",
  xxauthor =     "V. I. Smirnov",
}

@Article{Smirnov:1939:OUE,
  author =       "N. V. Smirnov",
  title =        "Ob uklonenijah empiri{\v{c}}eskoi krivoi
                 raspredelenija. ({Russian}). [Sur les {\'e}carts de la
                 courbe de distribution empirique. ({French})] [{On}
                 deviations from the empirical distribution curve]",
  journal =      "Recueil Math{\'e}matique (Matemati{\v{c}}eski{\u\i}
                 Sbornik), {N.S.}",
  volume =       "6",
  number =       "48",
  pages =        "3--26",
  month =        "????",
  year =         "1939",
  CODEN =        "MATSAB",
  ISSN =         "0368-8666",
  MRclass =      "60.0X",
  MRnumber =     "MR0001483 (1,246b)",
  bibdate =      "Tue Jan 17 21:38:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Matematicheski{\u\i} sbornik / izdavaemy{\u\i}
                 Moskovskim matematicheskim obshchestvom = Recueil
                 math{\'e}matique de la Soci{\'e}t{\'e} math{\'e}matique
                 de Moscou",
  language =     "Russian and French",
  remark =       "This paper, in Russian with a French summary, together
                 with \cite{Kolmogorov:1933:SDE}, is the origin of the
                 Kolmogorov--Smirnov test for goodness of fit.",
}

@Article{Vickery:1939:DRS,
  author =       "C. W. Vickery",
  title =        "On drawing a random sample from a set of punched
                 cards",
  journal =      "J. Roy. Stat. Soc., Supplement",
  volume =       "6",
  number =       "1",
  pages =        "62--66",
  year =         "1939",
  CODEN =        "????",
  ISSN =         "1466-6162",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2983624",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Roy. Stat. Soc., Supplement",
  fjournal =     "Supplement to the Journal of the Royal Statistical
                 Society",
  HDnumber =     "131",
}

@Article{Church:1940:CRS,
  author =       "A. Church",
  title =        "On the concept of a random sequence",
  journal =      j-BULL-AMS,
  volume =       "46",
  number =       "??",
  pages =        "130--135",
  month =        "????",
  year =         "1940",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  bibdate =      "Mon Jan 16 22:55:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
}

@Article{Kendall:1941:TR,
  author =       "M. G. Kendall",
  title =        "A Theory of Randomness",
  journal =      j-BIOMETRIKA,
  volume =       "32",
  number =       "1",
  pages =        "1--15",
  month =        jan,
  year =         "1941",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2332245",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 14:32:23 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315397;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1940.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2332245",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Kolmogoroff:1941:CLU,
  author =       "A. Kolmogoroff",
  title =        "Confidence limits for an unknown distribution
                 function",
  journal =      j-ANN-MATH-STAT,
  volume =       "12",
  number =       "4",
  pages =        "461--463",
  month =        dec,
  year =         "1941",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Wed Jan 18 08:22:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2235958",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Nair:1941:DSC,
  author =       "A. N. K. Nair",
  title =        "Distribution of {Student}'s '$t$' and the correlation
                 coefficient in samples from non-normal populations",
  journal =      j-SANKHYA,
  volume =       "5",
  number =       "??",
  pages =        "383--400",
  month =        "????",
  year =         "1941",
  CODEN =        "SNKYA5",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jan 16 14:46:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics)",
  journal-URL =  "https://www.jstor.org/journal/sankhya",
}

@Article{Young:1941:ROS,
  author =       "L. C. Young",
  title =        "On randomness in ordered sequences",
  journal =      j-ANN-MATH-STAT,
  volume =       "12",
  number =       "3",
  pages =        "293--300",
  month =        sep,
  year =         "1941",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jan 16 22:55:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2235858",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Dodd:1942:CTR,
  author =       "Edward L. Dodd",
  title =        "Certain tests for randomness applied to data grouped
                 into small sets",
  journal =      j-ECONOMETRICA,
  volume =       "10",
  number =       "??",
  pages =        "249--257",
  month =        "????",
  year =         "1942",
  CODEN =        "ECMTA7",
  ISSN =         "0012-9682",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Econometrica",
  HDnumber =     "22",
  journal-URL =  "http://www.jstor.org/journal/econometrica",
  remark =       "This paper tests Tippett's random numbers
                 \cite{Tippett:1927:RSN}.",
}

@Article{Dodd:1942:TTR,
  author =       "Edward L. Dodd",
  title =        "A transformation of {Tippett} random sampling numbers
                 into numbers normally distributed",
  journal =      "Bolet{\'\i}n de Matem{\'a}ticas",
  volume =       "15",
  number =       "??",
  pages =        "73--77",
  month =        "????",
  year =         "1942",
  CODEN =        "BOMAD4",
  ISSN =         "0120-0380",
  MRclass =      "62.0X",
  MRnumber =     "MR0008668 (5,43b)",
  bibdate =      "Mon Jan 16 14:22:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxjournal =    "Bolletin Matim{\'a}tico",
}

@Article{Mann:1942:CNC,
  author =       "H. B. Mann and A. Wald",
  title =        "On the Choice of the Number of Class Intervals in the
                 Application of the Chi Square Test",
  journal =      j-ANN-MATH-STAT,
  volume =       "13",
  number =       "3",
  pages =        "306--317",
  month =        sep,
  year =         "1942",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177731569",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Sat May 31 09:10:28 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177731569;
                 http://www.jstor.org/stable/2235942",
  ZMnumber =     "Zbl 0063.03772",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Peatman:1942:TRN,
  author =       "J. G. Peatman and R. Shafer",
  title =        "A table of random numbers from {Selective Service}
                 numbers",
  journal =      j-J-PSYCHOL,
  volume =       "14",
  number =       "??",
  pages =        "295--305",
  month =        "????",
  year =         "1942",
  CODEN =        "JOPSAM",
  ISSN =         "0022-3980 (print), 1940-1019 (electronic)",
  ISSN-L =       "0022-3980",
  bibdate =      "Mon Jan 16 14:48:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Psychology",
}

@Article{Rosander:1942:UIT,
  author =       "A. C. Rosander",
  title =        "The use of inversions as a test of random order",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "37",
  number =       "219",
  pages =        "352--358",
  month =        sep,
  year =         "1942",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2279003",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Amer. Stat. Assoc.",
  fjournal =     "Journal of the American Statistical Association",
  HDnumber =     "106",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  remark =       "This paper tests Tippett's random numbers
                 \cite{Tippett:1927:RSN}.",
}

@Book{Fisher:1943:STB,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural, and
                 medical research",
  publisher =    pub-OLIVER-BOYD,
  address =      pub-OLIVER-BOYD:adr,
  edition =      "Second",
  pages =        "98",
  year =         "1943",
  LCCN =         "HA33 .F53 1943",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc",
}

@Article{Forsythe:1943:CSI,
  author =       "G. E. Forsythe",
  title =        "{Ces{\`a}ro} summability of independent random
                 variables",
  journal =      j-DUKE-MATH-J,
  volume =       "10",
  number =       "??",
  pages =        "397--428",
  year =         "1943",
  CODEN =        "DUMJAO",
  DOI =          "https://doi.org/10.1215/S0012-7094-43-01034-8",
  ISSN =         "0012-7094 (print), 1547-7398 (electronic)",
  ISSN-L =       "0012-7094",
  bibdate =      "Tue Nov 22 09:08:17 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.dmj/1077471948",
  ZMnumber =     "0063.01410",
  acknowledgement = ack-nhfb,
  fjournal =     "Duke Mathematical Journal",
  journal-URL =  "http://projecteuclid.org/info/euclid.dmj",
}

@Article{Gage:1943:CTR,
  author =       "Robert Gage",
  title =        "Contents of {Tippett}'s {``Random Sampling
                 Numbers''}",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "38",
  number =       "222",
  pages =        "223--227",
  month =        jun,
  year =         "1943",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 06:10:35 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314101;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2279542",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  HDnumber =     "32",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  remark =       "This paper tests Tippett's random numbers
                 \cite{Tippett:1927:RSN}.",
}

@Article{Swed:1943:TTR,
  author =       "Frieda S. Swed and C. Eisenhart",
  title =        "Tables for testing randomness of grouping in a
                 sequence of alternatives",
  journal =      j-ANN-MATH-STAT,
  volume =       "14",
  number =       "1",
  pages =        "66--87",
  month =        mar,
  year =         "1943",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177731494;
                 http://www.jstor.org/stable/2236004",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "117",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Wald:1943:ETR,
  author =       "A. Wald and J. Wolfowitz",
  title =        "An exact test for randomness in the non-parametric
                 case, based on serial correlation",
  journal =      j-ANN-MATH-STAT,
  volume =       "14",
  number =       "4",
  pages =        "378--388",
  month =        dec,
  year =         "1943",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jan 16 22:54:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2235925",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Dixon:1944:FCP,
  author =       "W. J. Dixon",
  title =        "Further Contributions to the Problem of Serial
                 Correlation",
  journal =      j-ANN-MATH-STAT,
  volume =       "15",
  number =       "2",
  pages =        "119--144",
  month =        jun,
  year =         "1944",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Tue Jan 31 12:08:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236194",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Levene:1944:CMR,
  author =       "H. Levene and J. Wolfowitz",
  title =        "The covariance matrix of runs up and down",
  journal =      j-ANN-MATH-STAT,
  volume =       "15",
  number =       "1",
  pages =        "58--69",
  month =        mar,
  year =         "1944",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177731314",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177731314;
                 http://www.jstor.org/stable/2236211",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "70",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Onsager:1944:CST,
  author =       "Lars Onsager",
  title =        "Crystal Statistics. {I}. {A} Two-Dimensional Model
                 with an Order-Disorder Transition",
  journal =      j-PHYS-REV,
  volume =       "65",
  number =       "3--4",
  pages =        "117--149",
  month =        feb,
  year =         "1944",
  CODEN =        "PHRVAO",
  DOI =          "https://doi.org/10.1103/PhysRev.65.117",
  ISSN =         "0031-899X (print), 1536-6065 (electronic)",
  ISSN-L =       "0031-899X",
  bibdate =      "Thu Feb 16 18:18:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRev.65.117",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review",
  journal-URL =  "http://pra.aps.org/browse",
  remark =       "This is the famous paper in which Osager (winner of
                 the 1968 Nobel Prize in Chemistry) derives an exact
                 solution for the two-dimensional Ising lattice, a
                 problem that is often used in testing of random-number
                 generators for use in Monte Carlo simulations in
                 physics.",
}

@Article{Rice:1944:MAR,
  author =       "S. O. Rice",
  title =        "Mathematical Analysis of Random Noise",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "23",
  number =       "3",
  pages =        "282--332",
  month =        jul,
  year =         "1944",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  MRclass =      "60.0X",
  MRnumber =     "0010932 (6,89b)",
  MRreviewer =   "M. Kac",
  bibdate =      "Tue Nov 9 11:15:53 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1944/BSTJ.1944.2303.html;
                 http://www.alcatel-lucent.com/bstj/vol23-1944/bstj-vol23-issue03.html;
                 https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol23/bstj23-3-282.pdf;
                 http://www.alcatel-lucent.com/bstj/vol23-1944/articles/bstj23-3-282.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Wolfowitz:1944:ADR,
  author =       "J. Wolfowitz",
  title =        "Asymptotic distribution of runs up and down",
  journal =      j-ANN-MATH-STAT,
  volume =       "15",
  number =       "2",
  pages =        "163--172",
  month =        jun,
  year =         "1944",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jan 16 22:53:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236196",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Rice:1945:MAR,
  author =       "S. O. Rice",
  title =        "Mathematical Analysis of Random Noise",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "24",
  number =       "1",
  pages =        "46--156",
  month =        jan,
  year =         "1945",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  MRclass =      "60.0X",
  MRnumber =     "0011918 (6,233i)",
  MRreviewer =   "M. Kac",
  bibdate =      "Tue Nov 9 11:15:54 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1945/BSTJ.1945.2401.html;
                 http://www.alcatel-lucent.com/bstj/vol24-1945/bstj-vol24-issue01.html;
                 https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol24/bstj24-1-46.pdf;
                 http://www.alcatel-lucent.com/bstj/vol24-1945/articles/bstj24-1-46.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Copeland:1946:NNN,
  author =       "A. H. Copeland and P. Erd{\H{o}}s",
  title =        "Note on normal numbers",
  journal =      j-BULL-AMS,
  volume =       "52",
  number =       "??",
  pages =        "857--860",
  month =        "????",
  year =         "1946",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  bibdate =      "Wed Dec 21 06:39:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
  remark =       "``Normal numbers'' are those whose digits are random
                 in some specified base.",
}

@Article{Olmstead:1946:DSA,
  author =       "P. S. Olmstead",
  title =        "Distribution of sample arrangements for runs up and
                 down",
  journal =      j-ANN-MATH-STAT,
  volume =       "17",
  number =       "1",
  pages =        "24--33",
  month =        mar,
  year =         "1946",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jan 16 22:52:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2235901",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Forsythe:1947:NSR,
  author =       "George E. Forsythe",
  title =        "On {N{\"o}rlund} summability of random variables to
                 zero",
  journal =      j-BULL-AMS,
  volume =       "53",
  number =       "??",
  pages =        "302--313",
  year =         "1947",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  MRclass =      "60.0X",
  MRnumber =     "MR0020738 (8,591b)",
  MRreviewer =   "M. Kac",
  bibdate =      "Tue Nov 22 09:08:17 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.bams/1183510599",
  ZMnumber =     "0037.08105",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
  keywords =     "Probability theory",
}

@Article{Moran:1947:RDI,
  author =       "P. A. P. Moran",
  title =        "The random division of an interval",
  journal =      "J. Roy. Stat. Soc., Supplement",
  volume =       "9",
  number =       "??",
  pages =        "92--98",
  month =        "????",
  year =         "1947",
  ISSN =         "1466-6162",
  bibdate =      "Wed Feb 08 19:06:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ulam:1947:CSD,
  author =       "S. M. Ulam and John von Neumann",
  title =        "On combinations of stochastic and deterministic
                 processes",
  journal =      j-BULL-AMS,
  volume =       "53",
  number =       "11",
  pages =        "1120--1120",
  month =        nov,
  year =         "1947",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/nld.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The abstract notes ``\ldots{} starting with almost
                 every $ x_1 $ (in the sense of Lebesgue measure) and
                 {\em iterating\/} the function $ f(x) = 4 \cdot (1 - x)
                 $ one obtains a sequence of numbers on $ (0, 1) $ with
                 a computable algebraic distribution. By playing
                 suitable games with numbers `drawn' in this fashion,
                 one can obtain various other distributions, either
                 given explicitly or satisfying given differential or
                 integral equations.''",
  URL =          "http://www.ams.org/journals/bull/1947-53-11/S0002-9904-1947-08918-7/S0002-9904-1947-08918-7.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
  keywords =     "logistic map, deterministic model, stochastic model",
  received =     "3 September 1947",
  remark =       "One-paragraph abstract.",
}

@TechReport{Brown:1948:STR,
  author =       "Bernice Brown",
  title =        "Some Tests of the Randomness of a Million Digits",
  type =         "Report",
  number =       "RAND RAOP-44",
  institution =  "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  pages =        "????",
  year =         "1948",
  bibdate =      "Tue Sep 20 07:20:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "This report is about the RAND million-random-digit
                 corpus.",
}

@Article{Feller:1948:KSL,
  author =       "W. Feller",
  title =        "On {the Kolmogorov--Smirnov} limit theorems for
                 empirical distributions",
  journal =      j-ANN-MATH-STAT,
  volume =       "19",
  number =       "2",
  pages =        "177--189",
  month =        jun,
  year =         "1948",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Wed Jan 18 08:58:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236265",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Hamaker:1948:RFE,
  author =       "H. C. Hamaker",
  title =        "Random frequencies, expedient for the construction of
                 artificial samples of large size",
  journal =      "Statistica Rijswijk",
  volume =       "2",
  number =       "??",
  pages =        "129--137",
  month =        "????",
  year =         "1948",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jan 16 14:27:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "I cannot find this journal in any of dozens of library
                 catalogs.",
}

@Article{Hamaker:1948:RSN,
  author =       "H. C. Hamaker",
  title =        "Random sampling numbers",
  journal =      "Statistica Rijswijk",
  volume =       "2",
  number =       "??",
  pages =        "97--106",
  month =        "????",
  year =         "1948",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jan 16 14:27:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "I cannot find this journal in any of dozens of library
                 catalogs.",
}

@Article{Horton:1948:MOR,
  author =       "H. Burke Horton",
  title =        "A method for obtaining random numbers",
  journal =      j-ANN-MATH-STAT,
  volume =       "19",
  number =       "1",
  pages =        "81--85",
  month =        mar,
  year =         "1948",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177730294",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Sat Sep 17 10:12:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236060",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "52",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Book{Ore:1948:NTH,
  author =       "{\O}ystein {\O}re",
  title =        "Number theory and its history",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "x + 370",
  year =         "1948",
  LCCN =         "QA241 .O7",
  bibdate =      "Mon Jun 27 15:30:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1899--1968",
  HDnumber =     "92",
  subject =      "Number theory; Mathematics; History",
}

@Article{Smirnov:1948:TEG,
  author =       "N. Smirnov",
  title =        "Tables for Estimating the Goodness of Fit of Empirical
                 Distributions",
  journal =      j-ANN-MATH-STAT,
  volume =       "19",
  number =       "2",
  pages =        "279--281",
  month =        jun,
  year =         "1948",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "62.0X",
  MRnumber =     "MR0025109 (9,599j)",
  bibdate =      "Tue Jan 17 21:52:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236278",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  remark =       "Reproduction of tables from \cite{Smirnov:1939:EDB}.",
}

@Book{Wold:1948:RND,
  author =       "Herman O. A. Wold and Maurice G. (Maurice George)
                 Kendall",
  title =        "Random normal deviates: 25,000 items compiled from
                 Tract no. {XXIV} {(M. G. Kendall and B.
                 Babington-Smith's Tables of random sampling numbers)}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 51",
  year =         "1948",
  LCCN =         "QA47 .T7 no.25",
  bibdate =      "Mon Jun 27 16:30:11 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 library.ox.ac.uk:210/ADVANCE",
  note =         "See \cite{Kendall:1939:TRS}.",
  acknowledgement = ack-nhfb,
  author-dates = "Herman O. A. Wold (1908--1992); Maurice G. (Maurice
                 George) Kendall (1907--1983)",
  HDnumber =     "141",
  subject =      "Sampling (Statistics); Mathematics; Tables",
}

@TechReport{Brown:1949:HRR,
  author =       "George W. Brown",
  title =        "History of {RAND}'s random digits---summary",
  type =         "Report",
  number =       "P-113",
  institution =  "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  pages =        "6",
  month =        jun,
  year =         "1949",
  bibdate =      "Tue Sep 20 07:57:17 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.rand.org/pubs/papers/2008/P113.pdf",
  acknowledgement = ack-nhfb,
  remark =       "This report describes how the RAND corpus of a million
                 random digits \cite{RAND:1955:MRD} was initially
                 produced from an electronic simulation of a roulette
                 wheel. When chi-squared tests suggested a slight lack
                 of randomness, the 20,000 punched cards, each with 50
                 random decimal digits, were reprocessed. From page 4 of
                 the original technical report: ``We added (mod 10) the
                 digits in each card, digit by digit, to the
                 corresponding digits of the previous card. The derived
                 table of one million digits was then subjected to the
                 various standard tests, frequency tests, serial tests,
                 poker tests, etc. These million digits have a clean
                 bill of health and have been adopted as RAND's table of
                 random digits.''",
}

@Article{Doob:1949:HAK,
  author =       "J. L. Doob",
  title =        "Heuristic Approach to the {Kolmogorov--Smirnov}
                 Theorems",
  journal =      j-ANN-MATH-STAT,
  volume =       "20",
  number =       "3",
  pages =        "393--403",
  month =        sep,
  year =         "1949",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Tue Jan 17 21:51:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236535",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Book{Fisher:1949:STB,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural, and
                 medical research",
  publisher =    "Hafner Pub. Co.",
  address =      "New York",
  edition =      "Third",
  pages =        "viii + 112",
  year =         "1949",
  LCCN =         "HA33 .F53 1949",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc",
}

@Article{Hamaker:1949:RSF,
  author =       "H. C. Hamaker",
  title =        "Random sampling frequencies: an implement for rapidly
                 constructing large-size artificial samples",
  journal =      "Proceedings of the Koninklijke Nederlandse Akademie
                 van Wetenschappen",
  volume =       "52",
  number =       "??",
  pages =        "432--439",
  month =        "????",
  year =         "1949",
  CODEN =        "PKNAAU",
  ISSN =         "0370-0348",
  bibdate =      "Mon Jan 16 14:30:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hamaker:1949:STP,
  author =       "H. C. Hamaker",
  title =        "A simple technique for producing random sampling
                 numbers",
  journal =      "Proceedings of the Koninklijke Nederlandse Akademie
                 van Wetenschappen",
  volume =       "52",
  number =       "??",
  pages =        "145--150",
  year =         "1949",
  CODEN =        "PKNAAU",
  ISSN =         "0370-0348",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Nederl. Akad. Wetensch. Proc.",
  HDnumber =     "48",
}

@Article{Horton:1949:DMP,
  author =       "H. Burke Horton and R. Tynes {Smith III}",
  title =        "A direct method for producing random digits in any
                 number system",
  journal =      j-ANN-MATH-STAT,
  volume =       "20",
  number =       "1",
  pages =        "82--90",
  month =        mar,
  year =         "1949",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177730092",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236805",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "53",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@TechReport{Mauchly:1949:PRN,
  author =       "J. W. Mauchly",
  title =        "Pseudo-random numbers",
  type =         "Report",
  number =       "??",
  institution =  "Eckert-Mauchly Computer Corporation",
  address =      "????",
  year =         "1949",
  bibdate =      "Mon Jun 27 15:21:18 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "81",
}

@Article{Metropolis:1949:MCM,
  author =       "Nicholas Metropolis and S. Ulam",
  title =        "The {Monte Carlo} method",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "44",
  number =       "247",
  pages =        "335--341",
  month =        sep,
  year =         "1949",
  CODEN =        "JSTNAL",
  DOI =          "https://doi.org/10.2307/2280232",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "65.0X",
  MRnumber =     "MR0031341 (11,138c)",
  MRreviewer =   "J. L. Doob",
  bibdate =      "Tue Nov 5 08:02:08 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280232",
  ZMnumber =     "0033.28807",
  acknowledgement = ack-nhfb,
  annote =       "This is one of the earliest published articles on the
                 Monte Carlo method; see \cite{Hurd:1985:NEM}.",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  keywords =     "ENIAC; probability theory",
}

@Book{Stevens:1949:TRD,
  author =       "W. H. S. Stevens",
  title =        "Table of 105,000 random decimal digits",
  volume =       "4914",
  publisher =    "Interstate Commerce Commission",
  address =      "Washington, DC, USA",
  year =         "1949",
  LCCN =         "QA276.5 .U5 1949",
  bibdate =      "Sat Jan 7 12:05:57 MST 2012",
  bibsource =    "catalog.princeton.edu:7090/voyager;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  subject =      "sampling (statistics); statistics; graphic methods",
}

@Article{Walsh:1949:CCR,
  author =       "John E. Walsh",
  title =        "Concerning compound randomization in the binary
                 system",
  journal =      j-ANN-MATH-STAT,
  volume =       "20",
  number =       "4",
  pages =        "580--589",
  month =        dec,
  year =         "1949",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177729950",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177729950;
                 http://www.jstor.org/stable/2236313",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "137",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@InProceedings{Eisenhart:1950:RDD,
  author =       "C. Eisenhart and L. S. Deming",
  booktitle =    "{National Bureau of Standards Seminar, February 17,
                 Washington, DC}",
  title =        "On the randomness of the digits of $ \pi $ and $e$ to
                 2000 decimal places",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1950",
  bibdate =      "Mon Jan 16 14:24:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Good:1950:PWE,
  author =       "Irving John Good",
  title =        "Probability and the weighing of evidence",
  publisher =    "C. Griffin",
  address =      "London, UK",
  pages =        "viii + 119",
  year =         "1950",
  LCCN =         "QA273 .G65",
  bibdate =      "Sat Jan 7 11:03:33 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "From \cite[page 43]{Good:1969:HRR}, the author
                 reports: ``If two random sequences are thus combined
                 [by adding modulo a small number] the result will be
                 flatter than either of them, so the device is useful
                 for improving the quality of random digits. The theory
                 behind this remark was submitted by the writer in 1946
                 to the Proc. Cambridge Phil. Soc. It was rejected on
                 the grounds that the device of adding digits in order
                 to make them more random was useless since `there are
                 other and more satisfactory methods of producing random
                 numbers'. This `useless' idea has since been used by
                 RAND, as mentioned above, and by ERNIE, by SWAC [9],
                 etcetera, etcetera, etcetera. Referees are fallible
                 like people. The theory was published as an exercise in
                 \cite[page 58]{Good:1950:PWE}\ldots{}''.",
  subject =      "Probabilities",
  tableofcontents = "Theories of probability \\
                 The origin of the axioms \\
                 The abstract theory \\
                 The theory and technique of probability \\
                 Probability distributions \\
                 Weighing evidence \\
                 Statistics and probability \\
                 Appendices: I. The error function \\
                 II. Dirichlet's multiple integral \\
                 III. On the conventionality of the addition and product
                 laws",
}

@Article{Gruenberger:1950:TRD,
  author =       "Fred Gruenberger",
  title =        "Tests of random digits",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "4",
  number =       "32",
  pages =        "244--245",
  year =         "1950",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "45",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Kac:1950:DMP,
  author =       "Mark Kac and Harry Pollard",
  title =        "The distribution of the maximum of partial sums of
                 independent random variables",
  journal =      j-CAN-J-MATH,
  volume =       "2",
  number =       "??",
  pages =        "375--384",
  month =        "????",
  year =         "1950",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1950-034-9",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  MRclass =      "60.0X",
  MRnumber =     "0036465 (12,114b)",
  MRreviewer =   "M. Lo{\`e}ve",
  bibdate =      "Sat Sep 10 15:38:24 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v2/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/canjmath1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{Korobov:1950:SQU,
  author =       "N. M. Korobov",
  title =        "On some questions of uniform distribution",
  journal =      "Izv. Akad. Nauk SSSR",
  volume =       "14",
  number =       "3",
  pages =        "215--238",
  month =        "????",
  year =         "1950",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Wed Jan 18 11:04:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Massey:1950:NED,
  author =       "Frank J. {Massey, Jr.}",
  title =        "A Note on the Estimation of a Distribution Function by
                 Confidence Limits",
  journal =      j-ANN-MATH-STAT,
  volume =       "21",
  number =       "1",
  pages =        "116--119",
  month =        mar,
  year =         "1950",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177729891",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Sat May 31 09:10:40 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177729891;
                 http://www.jstor.org/stable/2236559",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  remark =       "This paper contains a practical algorithm for
                 computing the Kolmogorov--Smirnov probabilities for
                 small sample sizes.",
}

@Article{Metropolis:1950:STV,
  author =       "N. C. Metropolis and G. Reitwiesner and J. von
                 Neumann",
  title =        "Statistical treatment of values of first $ 2 {, }000 $
                 decimal digits of $e$ and of $ \pi $ calculated on the
                 {ENIAC}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "4",
  number =       "30",
  pages =        "109--111",
  year =         "1950",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  MRclass =      "65.0X",
  MRnumber =     "MR0037598 (12,286j)",
  MRreviewer =   "R. P. Boas, Jr.",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  abstract =     "From the article: ``The first 2,000 decimal digits of
                 $e$ and $ \pi $ were calculated on the ENIAC by Mr. G.
                 Reitwiesner and several members of the ENIAC Branch of
                 the Ballistic Research Laboratories at Aberdeen,
                 Maryland \cite{Reitwiesner:1950:EDM}. A statistical
                 survey of this material has failed to disclose an
                 significant deviations from randomness for $ \pi $, but
                 it has indicated quite serious ones for $e$.''",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "Footnote to title: ``Both $e$ and $ 1 / e $ were
                 computed somewhat beyond 2500\,D and the results
                 checked by actual multiplication.''",
}

@Article{Williams:1950:CNW,
  author =       "C. Arthur {Williams, Jr.}",
  title =        "On the Choice of the Number and Width of Classes for
                 the Chi-square Test for Goodness of Fit",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "45",
  number =       "249",
  pages =        "77--86",
  month =        mar,
  year =         "1950",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Tue Jan 17 21:54:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280429",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@InCollection{Brown:1951:HRR,
  author =       "George W. Brown",
  title =        "History of {RAND}'s random digits---summary",
  crossref =     "Householder:1951:MCM",
  pages =        "31--32",
  year =         "1951",
  bibdate =      "Mon Jun 27 12:18:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "9",
}

@TechReport{Cameron:1951:MCE,
  author =       "J. M. Cameron",
  title =        "{Monte Carlo} experiments on {SEAC}",
  type =         "Working Paper",
  number =       "SEL-52-5",
  institution =  pub-NBS,
  address =      pub-NBS:adr,
  pages =        "??",
  day =          "27",
  month =        oct,
  year =         "1951",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "13",
}

@Article{Forsythe:1951:GTRa,
  author =       "George E. Forsythe",
  title =        "Generation and testing of random digits at the
                 {National Bureau of Standards, Los Angeles}",
  journal =      j-APPL-MATH-SER-NBS,
  volume =       "12",
  number =       "??",
  pages =        "34--35",
  month =        "????",
  year =         "1951",
  CODEN =        "????",
  ISSN =         "1049-4685",
  bibdate =      "Wed Jul 01 11:00:59 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied mathematics series / National Bureau of
                 Standards",
  HDnumber =     "30",
}

@Article{Forsythe:1951:GTRb,
  author =       "George E. Forsythe",
  title =        "Generation and testing of 1,217,370 `random' binary
                 digits on the {SWAC}",
  journal =      j-BULL-AMS,
  volume =       "57",
  number =       "??",
  pages =        "304--304",
  month =        "????",
  year =         "1951",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  bibdate =      "Mon Jun 27 13:41:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Abstract only.",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  HDnumber =     "29",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
}

@Article{Gruenberger:1951:TRD,
  author =       "Fred Gruenberger and A. M. Mark",
  title =        "The $ d^2 $ test of random digits",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "5",
  number =       "??",
  pages =        "109--110",
  year =         "1951",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "46",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InCollection{Hammer:1951:MSM,
  author =       "Preston C. Hammer",
  booktitle =    "{Monte Carlo} Method",
  title =        "The mid-square method of generating digits",
  crossref =     "Householder:1951:MCM",
  pages =        "33--33",
  year =         "1951",
  bibdate =      "Mon Jun 27 12:18:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "49",
}

@Article{Kahn:1951:EPT,
  author =       "Herman Kahn and T. E. Harris",
  title =        "9. Estimation of particle transmission by random
                 sampling",
  journal =      "Journal of Research of the National Bureau of
                 Standards. Applied Mathematics Series",
  volume =       "12",
  number =       "??",
  pages =        "27--30",
  year =         "1951",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Wed Oct 02 17:53:08 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dornsifecms.usc.edu/assets/sites/520/docs/kahnharris.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Research Nat. Bur. Stand., Appl. Math. Series",
}

@InProceedings{Lehmer:1951:MML,
  author =       "D. H. Lehmer",
  title =        "Mathematical methods in large-scale computing units",
  crossref =     "Anonymous:1951:PSS",
  pages =        "141--146",
  year =         "1951",
  MRclass =      "65.0X",
  MRnumber =     "0044899 (13,495f)",
  MRreviewer =   "R. Hamming",
  bibdate =      "Tue Dec 21 16:17:16 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The aim of this paper is to discuss in a general way
                 certain features of the mathematics that are
                 characteristic of the large scale digital computing
                 machines. Special attention is given to the problem of
                 generating random numbers. The author's proposal for
                 generating a sequence of ``random'' 8 decimal numbers $
                 u_n $ is to start with some number $ u_0 \neq 0 $,
                 multiply it by 23, and subtract the two digit overflow
                 on the left from the two right hand digits to obtain a
                 new number $ u_1 $. By repeating this process he
                 generates a sequence $ u_n $ which he shows has a
                 repetition period of 5,882,352. An IBM 602A was used to
                 generate 5000 numbers of such a sequence. Four standard
                 tests (unspecified) were applied to check the
                 ``randomness'' and the sequence passed all four. The
                 author observes, however, that all of the members of
                 the sequence he chose were divisible by 17.",
  acknowledgement = ack-nhfb,
  HDnumber =     "67",
  remark =       "This paper is claimed to be the origin of the idea of
                 linear congruential generators (LCGs).",
  xxauthor =     "D. H. (Derrick Henry) Lehmer",
}

@PhdThesis{Marsaglia:1951:SPC,
  author =       "George Marsaglia",
  title =        "Stochastic Processes and Classes of Random Variables",
  type =         "{Ph.D.} thesis",
  school =       "The Ohio State University",
  address =      "Columbus, OH, USA",
  pages =        "46",
  year =         "1951",
  bibdate =      "Wed Jun 22 07:10:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ezproxy.lib.utah.edu/docview/302068737?accountid=14677",
  acknowledgement = ack-nhfb,
}

@Article{Massey:1951:KST,
  author =       "Frank J. {Massey, Jr.}",
  title =        "The {Kolmogorov--Smirnov} test for goodness of fit",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "46",
  number =       "253",
  pages =        "68--78",
  month =        mar,
  year =         "1951",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jan 16 14:40:03 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314132;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280095",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@TechReport{Richtmyer:1951:EDI,
  author =       "R. D. Richtmyer",
  title =        "The evaluation of definite integrals, and a
                 {Quasi-Monte-Carlo} method based on the properties of
                 algebraic numbers",
  type =         "Report",
  number =       "LA-1342",
  institution =  "Los Alamos Scientific Laboratory",
  address =      "Los Alamos, NM, USA",
  year =         "1951",
  bibdate =      "Mon Jun 27 15:40:02 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "102",
}

@InProceedings{vonNeumann:1951:VTU,
  author =       "John von Neumann",
  title =        "13. {Various} techniques used in connection with
                 random digits",
  crossref =     "Householder:1951:MCM",
  pages =        "36--38",
  year =         "1951",
  bibdate =      "Tue Jun 07 16:15:00 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Summary written by G. E. Forsythe. Reprinted in
                 \cite[Paper 23, pp. 768--770]{Taub:1963:JNCa}.",
  URL =          "https://dornsifecms.usc.edu/assets/sites/520/docs/VonNeumann-ams12p36-38.pdf",
  acknowledgement = ack-nhfb,
  HDnumber =     "133",
  remark =       "Anyone who considers arithmetical methods of producing
                 random digits is, of course, in a state of sin. [via
                 enews]",
}

@Article{Votaw:1951:HSS,
  author =       "D. F. {Votaw, Jr.} and J. A. Rafferty",
  title =        "High Speed Sampling",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "5",
  number =       "33",
  pages =        "1--8",
  month =        jan,
  year =         "1951",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "134",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Anderson:1952:ATC,
  author =       "T. W. Anderson and D. A. Darling",
  title =        "Asymptotic theory of certain `goodness of fit'
                 criteria based on stochastic processes",
  journal =      j-ANN-MATH-STAT,
  volume =       "23",
  number =       "2",
  pages =        "193--212",
  month =        jun,
  year =         "1952",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177729437",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "62.0X",
  MRnumber =     "0050238 (14,298h)",
  MRreviewer =   "R. Fortet",
  bibdate =      "Sat May 31 09:10:44 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177729437;
                 http://www.jstor.org/stable/2236446",
  abstract =     "The statistical problem treated is that of testing the
                 hypothesis that $n$ independent, identically
                 distributed random variables have a specified
                 continuous distribution function $ F(x) $.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Anonymous:1952:RD,
  author =       "Anonymous",
  title =        "Random Digits (1--6000)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "47",
  number =       "260",
  pages =        "710--714",
  month =        dec,
  year =         "1952",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314139;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280798",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Cameron:1952:RST,
  author =       "J. M. Cameron",
  title =        "Results of some tests of randomness on pseudo-random
                 on numbers (preliminary report)",
  journal =      j-ANN-MATH-STAT,
  volume =       "23",
  number =       "1",
  pages =        "138--138",
  month =        mar,
  year =         "1952",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Abstract only.",
  URL =          "http://www.jstor.org/stable/2236409",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "14",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  remark =       "One-paragraph comment on the analysis of random
                 numbers produced on the SEAC by Olga Taussky-Todd.",
}

@Article{Goodman:1952:EPSa,
  author =       "A. W. Goodman and W. M. Zaring",
  title =        "Elementary Problems and Solutions: Solutions:
                 {Euclid}'s Algorithm and the Least-Remainder
                 Algorithm",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "59",
  number =       "3",
  pages =        "156--159",
  month =        mar,
  year =         "1952",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:38 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2308186",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Ore:1952:GCR,
  author =       "{\O}ystein {\O}re",
  title =        "The General {Chinese} Remainder Theorem",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "59",
  number =       "6",
  pages =        "365--370",
  month =        jun # "\slash " # jul,
  year =         "1952",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:45 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Book{Tippett:1952:RSN,
  author =       "Leonard Henry Caleb Tippett",
  title =        "Random sampling numbers",
  volume =       "15",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 26",
  year =         "1952",
  LCCN =         "QA47 .T7 no. 15",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With a foreword by editor Karl Pearson.",
  series =       "Tracts for computers",
  acknowledgement = ack-nhfb,
  HDnumber =     "123",
  remark =       "This is a reprint of \cite{Tippett:1927:RSN}.",
  subject =      "Mathematics; Tables; Sampling (Statistics)",
}

@Article{Anonymous:1953:RDa,
  author =       "Anonymous",
  title =        "Random Digits (6001--6100)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "48",
  number =       "261",
  pages =        "167--167",
  month =        mar,
  year =         "1953",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314140;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280898",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1953:RDb,
  author =       "Anonymous",
  title =        "Random Digits (6501--6875)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "48",
  number =       "262",
  pages =        "383--383",
  month =        jun,
  year =         "1953",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314141;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281306",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1953:RDc,
  author =       "Anonymous",
  title =        "Random Digits (6876--8125)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "48",
  number =       "263",
  pages =        "672--672",
  month =        sep,
  year =         "1953",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314142;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281029",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1953:RDd,
  author =       "Anonymous",
  title =        "Random Digits (9001--13,750)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "48",
  number =       "264",
  pages =        "931--934",
  month =        dec,
  year =         "1953",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314143;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281094",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Curtiss:1953:MCM,
  author =       "J. H. Curtiss",
  title =        "{``Monte Carlo''} methods for the iteration of linear
                 operators",
  journal =      j-J-MATH-PHYS,
  volume =       "32",
  number =       "??",
  pages =        "209--232",
  month =        "????",
  year =         "1953",
  CODEN =        "JMAPAQ",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Mathematical Physics",
  HDnumber =     "20",
  journal-URL =  "http://jmp.aip.org/",
}

@TechReport{Duparc:1953:RSI,
  author =       "H. J. A. Duparc and C. G. Lekkerkerker and W.
                 Peremans",
  title =        "Reduced sequences of integers and pseudo-random
                 numbers",
  type =         "Report",
  number =       "ZW 1953-002",
  institution =  "Mathematisch Centrum",
  address =      "Amsterdam, The Netherlands",
  year =         "1953",
  bibdate =      "Mon Jun 27 13:30:34 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "23",
}

@Book{Fisher:1953:STBa,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural and
                 medical research",
  publisher =    pub-OLIVER-BOYD,
  address =      pub-OLIVER-BOYD:adr,
  edition =      "Fourth",
  pages =        "xi + 126",
  year =         "1953",
  LCCN =         "QA276 .F498 1953a",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc; Mathematical
                 statistics",
}

@Book{Fisher:1953:STBb,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural, and
                 medical research",
  publisher =    "Hafner Pub. Co.",
  address =      "New York, NY, USA",
  edition =      "Fourth",
  pages =        "126",
  year =         "1953",
  LCCN =         "QA276 .F498 1953",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc; Mathematical
                 statistics",
}

@TechReport{Gilbert:1953:QRB,
  author =       "E. N. Gilbert",
  title =        "Quasi-random binary sequences",
  type =         "Report",
  number =       "MM-53-1400-42",
  institution =  "Bell Telephone Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "27",
  month =        nov,
  year =         "1953",
  bibdate =      "Mon Jun 27 14:22:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "33",
}

@Article{Good:1953:STS,
  author =       "I. J. Good",
  title =        "The serial test for sampling numbers and other tests
                 for randomness",
  journal =      j-PROC-CAMBRIDGE-PHIL-SOC,
  volume =       "49",
  number =       "??",
  pages =        "276--284",
  year =         "1953",
  CODEN =        "PCPSA4",
  ISSN =         "0008-1981",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Cambridge Philosophical Society.
                 Mathematical and physical sciences",
  HDnumber =     "38",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=PSP",
}

@TechReport{Juncosa:1953:RNG,
  author =       "M. L. Juncosa",
  title =        "Random number generation on the {BRL} high-speed
                 computing machines",
  type =         "Report",
  number =       "855",
  institution =  "Ballistic Research Laboratories",
  address =      "Aberdeen Proving Ground, MD, USA",
  year =         "1953",
  bibdate =      "Mon Jun 27 14:57:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "58",
}

@Article{Metropolis:1953:ESC,
  author =       "Nicholas Metropolis and Arianna W. Rosenbluth and
                 Marshall N. Rosenbluth and Augusta H. Teller and Edward
                 Teller",
  title =        "Equation of State Calculations by Fast Computing
                 Machines",
  journal =      j-J-CHEM-PHYS,
  volume =       "21",
  number =       "6",
  pages =        "1087--1092",
  month =        jun,
  year =         "1953",
  CODEN =        "JCPSA6",
  DOI =          "https://doi.org/10.1063/1.1699114",
  ISSN =         "0021-9606 (print), 1089-7690 (electronic)",
  ISSN-L =       "0021-9606",
  bibdate =      "Thu Oct 6 14:28:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This article introduces the Metropolis algorithm,
                 which the journal {\em Computing in Science and
                 Engineering\/} cited in the top 10 algorithms having
                 the ``greatest influence on the development and
                 practice of science and engineering in the 20th
                 Century.'' See \cite{Balazs:2000:ONC,Beichl:2000:MA},
                 and the Hasting--Metropolis generalization in
                 \cite{Hastings:1970:MCS}. See also
                 \cite{Barker:1965:MCC,Peskun:1973:OMC,Hitchcock:2003:HMH}.",
  URL =          "http://link.aip.org/link/doi/10.1063/1.1699114;
                 http://pubs.acs.org/cgi-bin/chemport/version=1.0&coi=1:CAS:528:DyaG3sXltlKhsw%253D%253D&pissn=0095-2338&pyear=2005&&md5=2eba6ee7d50b361b924c3ff8efeda4b1",
  abstract =     "A general method, suitable for fast computing
                 machines, for investigating such properties as
                 equations of state for substances consisting of
                 interacting individual molecules is described. The
                 method consists of a modified Monte Carlo integration
                 over configuration space. Results for the 2-D rigid
                 sphere system have been obtained on the Los Alamos
                 MANIAC and are presented here. These results are
                 compared to the free volume equation of state and to
                 the four-term virial coefficient expansion.",
  acknowledgement = ack-nhfb,
  author-dates = "Edward Teller (1908--2003)",
  fjournal =     "Journal of Chemical Physics",
  journal-URL =  "http://scitation.aip.org/content/aip/journal/jcp/browse",
  keywords =     "Gibbs sampling; jrnl; Metropolis algorithm; Monte
                 Carlo integration; Monte Carlo process; simulated
                 annealing; stochastic search",
  LSnumber =     "85",
}

@Article{Moore:1953:STR,
  author =       "P. G. Moore",
  title =        "A Sequential Test for Randomness",
  journal =      j-BIOMETRIKA,
  volume =       "40",
  number =       "1/2",
  pages =        "111--115",
  month =        jun,
  year =         "1953",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2333102",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "62.0X",
  MRnumber =     "0055641 (14,1104a)",
  MRreviewer =   "J. Kiefer",
  bibdate =      "Sat Jun 21 14:32:41 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315420;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2333102",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Peck:1953:UDA,
  author =       "L. G. Peck",
  title =        "On uniform distribution of algebraic numbers",
  journal =      j-PROC-AM-MATH-SOC,
  volume =       "4",
  number =       "??",
  pages =        "440--443",
  year =         "1953",
  CODEN =        "PAMYAR",
  ISSN =         "0002-9939 (print), 1088-6826 (electronic)",
  ISSN-L =       "0002-9939",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the American Mathematical Society",
  HDnumber =     "98",
  journal-URL =  "http://www.ams.org/journals/proc",
}

@PhdThesis{Teichroew:1953:DSH,
  author =       "Daniel Teichroew",
  title =        "Distribution sampling with high speed computers",
  type =         "{Ph.D.} dissertation",
  school =       "North Carolina State College",
  address =      "Chapel Hill, NC, USA",
  pages =        "vi + 147",
  year =         "1953",
  bibdate =      "Mon Jun 27 17:31:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://search.lib.unc.edu/search?R=UNCb3222025",
  acknowledgement = ack-nhfb,
  HDnumber =     "119",
}

@Article{Anonymous:1954:RDa,
  author =       "Anonymous",
  title =        "Random Digits (12,876--15,125)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "49",
  number =       "265",
  pages =        "206--207",
  month =        mar,
  year =         "1954",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314144;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281062",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1954:RDb,
  author =       "Anonymous",
  title =        "Random Digits (15,126--17,375)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "49",
  number =       "266",
  pages =        "410--411",
  month =        jun,
  year =         "1954",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314145;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2280958",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1954:RDc,
  author =       "Anonymous",
  title =        "Random Digits (17,376--20,875)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "49",
  number =       "267",
  pages =        "682--684",
  month =        sep,
  year =         "1954",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:31 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314146;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281154",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Anonymous:1954:RDd,
  author =       "Anonymous",
  title =        "Random Digits (20,876--21,875)",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "49",
  number =       "268",
  pages =        "928--928",
  month =        dec,
  year =         "1954",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:31 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314147;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281560",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Bartholomew:1954:NUS,
  author =       "D. J. Bartholomew",
  title =        "Note on the Use of {Sherman}'s Statistic as a Test for
                 Randomness",
  journal =      j-BIOMETRIKA,
  volume =       "41",
  number =       "3/4",
  pages =        "556--558",
  month =        dec,
  year =         "1954",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2332738",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "62.0X",
  MRnumber =     "0065097 (16,383a)",
  bibdate =      "Sat Jun 21 14:32:45 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315423;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2332738",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
  keywords =     "random numbers",
}

@Article{Hammersley:1954:PMM,
  author =       "J. M. Hammersley and K. W. Morton",
  title =        "Poor Man's {Monte Carlo}",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "16",
  number =       "??",
  pages =        "23--28",
  month =        "????",
  year =         "1954",
  CODEN =        "JSTBAJ",
  ISSN =         "0035-9246",
  bibdate =      "Sat Jan 07 11:54:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@Article{Lehmer:1954:DRN,
  author =       "D. H. Lehmer",
  title =        "Description of {``Random} number generation on the
                 {BRL} high-speed computing machines''",
  journal =      j-MATH-REV,
  volume =       "15",
  number =       "??",
  pages =        "559--559",
  month =        "????",
  year =         "1954",
  CODEN =        "MAREAR",
  ISSN =         "0025-5629",
  bibdate =      "Mon Jan 23 18:01:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Reviews",
}

@TechReport{Meyer:1954:GTR,
  author =       "H. A. Meyer and L. S. Gephart and N. L. Rasmussen",
  title =        "On the generation and testing of random digits",
  type =         "WADC Technical Report",
  number =       "54--55",
  institution =  "Air Res. Dev. Command",
  address =      "Wright-Patterson Air Force Base, OH, USA",
  year =         "1954",
  bibdate =      "Mon Jun 27 15:23:55 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "84",
}

@Article{Moshman:1954:GPR,
  author =       "Jack Moshman",
  title =        "The Generation of Pseudo-Random Numbers on a Decimal
                 Calculator",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "88--91",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320772.320775",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "85",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Page:1954:MCS,
  author =       "E. S. Page",
  title =        "The {Monte Carlo} solution of some integral
                 equations",
  journal =      j-PROC-CAMBRIDGE-PHIL-SOC,
  volume =       "50",
  number =       "??",
  pages =        "414--425",
  year =         "1954",
  CODEN =        "PCPSA4",
  ISSN =         "0008-1981",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Cambridge Philosophical Society.
                 Mathematical and physical sciences",
  HDnumber =     "93",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=PSP",
}

@Article{Rosenbluth:1954:FRM,
  author =       "Marshall N. Rosenbluth and Arianna W. Rosenbluth",
  title =        "Further results on {Monte Carlo} equations of state",
  journal =      j-J-CHEM-PHYS,
  volume =       "22",
  number =       "5",
  pages =        "881--884",
  month =        may,
  year =         "1954",
  CODEN =        "JCPSA6",
  DOI =          "https://doi.org/10.1063/1.1740207",
  ISSN =         "0021-9606 (print), 1089-7690 (electronic)",
  ISSN-L =       "0021-9606",
  bibdate =      "Sun Jun 23 19:07:39 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://scienze-como.uninsubria.it/bressanini/montecarlo-history/rosenbluth-1954.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Chemical Physics",
  journal-URL =  "http://scitation.aip.org/content/aip/journal/jcp/browse",
  received =     "15 September 1953",
}

@Article{Royo:1954:TNA,
  author =       "Jose Royo and Sebastian Ferrer",
  title =        "Tabla de numeros aleatorios obtenida de los numeros de
                 la {Loteria Nacional Espa{\~n}ola}. ({Spanish})
                 [{Tables} of random numbers obtained from numbers in
                 the {Spanish National Lottery}]",
  journal =      "Trabajos de Estad{\'\i}stica y de Investigaci{\'o}n
                 Operativa",
  volume =       "5",
  number =       "2",
  pages =        "247--256",
  month =        "????",
  year =         "1954",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/BF03028546",
  ISSN =         "0213-8190",
  bibdate =      "Mon Jan 16 22:48:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Spanish",
}

@Article{Schwartz:1954:RPC,
  author =       "Lorraine Schwartz",
  title =        "Review of {P. C. Mahalanobis, {\em Tables of random
                 samples from a normal population}}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "8",
  number =       "??",
  pages =        "228--??",
  month =        "????",
  year =         "1954",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 15:46:11 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "108",
  journal-URL =  "http://www.ams.org/mcom/",
}

@TechReport{Taussky:1954:GTP,
  author =       "Olga Taussky and John Todd",
  title =        "Generation and Testing of Pseudo-Random Numbers",
  type =         "Report",
  number =       "3370",
  institution =  pub-NBS,
  address =      pub-NBS:adr,
  pages =        "ii + 16",
  day =          "22",
  month =        jun,
  year =         "1954",
  DOI =          "https://doi.org/10.6028/nbs.rpt.3370",
  bibdate =      "Thu Mar 29 10:01:35 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/taussky-todd-olga.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://nvlpubs.nist.gov/nistpubs/Legacy/RPT/nbsreport3370.pdf",
  abstract =     "We shall confine our attention to generation and
                 testing of sequences of pseudo-random numbers by
                 arithmetical processes on automatic high speed digital
                 computers. We shall also confine our attention mainly
                 to a uniform distribution of random numbers not random
                 digits. The approximation of normal deviates and other
                 random variates by polynomials in uniform variates has
                 been discussed in detail by Teichroew [13]; for other
                 methods, e.g., acceptance or rejection methods, see von
                 Neumann [6, 36--38] and Votaw and Rafferty [l6].",
  acknowledgement = ack-nhfb,
  author-dates = "Olga Taussky-Todd (30 August 1906--7 October 1995);
                 John Todd (16 May 1911--21 June 2007)",
}

@Article{Tocher:1954:AAC,
  author =       "K. D. Tocher",
  title =        "The application of automatic computers to sampling
                 experiments",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "16",
  number =       "1",
  pages =        "39--61",
  year =         "1954",
  CODEN =        "JSTBAJ",
  ISSN =         "0035-9246",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Discussion pp. 61-75.",
  URL =          "http://www.jstor.org/stable/2984009",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  HDnumber =     "124",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@Article{Todd:1954:ESD,
  author =       "John Todd",
  title =        "Experiments in the solution of differential equations
                 by {Monte Carlo} methods",
  journal =      j-J-WASH-ACAD-SCI,
  volume =       "44",
  number =       "12",
  pages =        "377--381",
  month =        dec,
  year =         "1954",
  CODEN =        "JWASA3",
  ISSN =         "0043-0439",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/24533326",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Washington Academy of Sciences",
  HDnumber =     "125",
  journal-URL =  "http://www.jstor.org/journal/jwashacadscie",
}

@InProceedings{vanWijngaarden:1954:MC,
  author =       "A. van Wijngaarden",
  title =        "Mathematics and computing",
  crossref =     "Anonymous:1954:ADC",
  pages =        "125--129",
  year =         "1954",
  bibdate =      "Mon Jun 27 16:14:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "130",
}

@Article{vonSchelling:1954:CCU,
  author =       "H. von Schelling",
  title =        "Coupon collecting for unequal probabilities",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "61",
  number =       "??",
  pages =        "306--311",
  month =        "????",
  year =         "1954",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jan 16 22:49:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Book{Fieller:1955:CRN,
  author =       "E. C. Fieller and T. Lewis and E. S. Pearson",
  title =        "Correlated random normal deviates; 3,000 sets of
                 deviates, each giving 9 random pairs with correlations
                 $ 0.1 (0 \times 1) 0 \times 9 $",
  volume =       "26",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "60",
  year =         "1955",
  LCCN =         "QA47 .T7 no.26",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Compiled from Herman Wold's Table of random normal
                 deviates (Tract no. XXV) by E. C. Fieller, T. Lewis,
                 and E. S. Pearson: {\em Random normal deviates}.",
  series =       "Tracts for computers",
  acknowledgement = ack-nhfb,
  HDnumber =     "27",
  subject =      "Probabilities; Tables; Sampling (Statistics)",
}

@TechReport{Gilbert:1955:MCR,
  author =       "E. N. Gilbert",
  title =        "Machine Computation of random numbers",
  type =         "Report",
  number =       "MM-56-114-3",
  institution =  "Bell Telephone Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "12",
  month =        mar,
  year =         "1955",
  bibdate =      "Mon Jun 27 14:22:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "34",
}

@TechReport{Golomb:1955:SRP,
  author =       "S. W. Golomb",
  title =        "Sequences with randomness properties",
  type =         "Report",
  institution =  "Glenn L. Martin Co.",
  address =      "Baltimore, MD, USA",
  pages =        "????",
  year =         "1955",
  bibdate =      "Thu Jan 19 06:49:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Greenwood:1955:CCT,
  author =       "Robert E. Greenwood",
  title =        "Coupon Collector's Test for Random Digits",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "9",
  number =       "49",
  pages =        "1--5",
  month =        jan,
  year =         "1955",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "43",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Book{Hastings:1955:ADC,
  author =       "Cecil {Hastings, Jr.}",
  title =        "Approximations for Digital Computers",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 201",
  year =         "1955",
  ISBN =         "0-691-07914-5",
  ISBN-13 =      "978-0-691-07914-1",
  LCCN =         "QA76 .H37",
  bibdate =      "Mon Oct 01 15:59:48 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Assisted by Jeanne T. Hayward and James P. Wong, Jr.",
  series =       "The Rand series",
  acknowledgement = ack-nhfb,
  remark-1 =     "Reprinted 1957, 1959, 1962, 1966, and 1970. I have
                 fourth printing (1962).",
  remark-2 =     "Hastings gives a polynomial approximation for
                 computing random numbers from a normal distribution.",
  subject =      "Electronic digital computers; Numerical analysis",
  tableofcontents = "Preface / v \\
                 Part I \\
                 1: Concerning Best Fit / 3 \\
                 2: Linear Weights / 19 \\
                 3: An Iterative Procedure / 27 \\
                 4: Solution of Equations / 35 \\
                 5: Chebyshev Polynomials / 47 \\
                 6: Concerning Weights / 65 \\
                 7: Function With a Peak / 75 \\
                 8: Rates of Convergence / 83 \\
                 9: Choice of Form / 95 \\
                 10: A Scoring-Camera Problem / 115 \\
                 Part II \\
                 1: $\log_{10} x$ / 125 \\
                 5: $\phi(x) = (1 - e^{-x}) / x$ / 129 \\
                 8: $\arctan x$ / 132 \\
                 14: $\sin (\pi/2) x$ / 138 \\
                 17: $10^x$ / 141 \\
                 21: $W(x) = e^{-x} / (1 + e^{-x})^2$ / 145 \\
                 24: $P_k(x) = 1.72 + 42 x^2$ or $0.136 / x^2$ / 148 \\
                 27: $E'(x) = (1 / \sqrt{2 \pi}) e^{-(1/2)x^2}$ / 151
                 \\
                 30: ``Total Klein-Nishina Cross Section'' Function /
                 154 \\
                 31: $\Gamma(1 + x)$ / 155 \\
                 35: $\arcsin x$ / 159 \\
                 40: $\log_2 x$ / 164 \\
                 43: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \,
                 dt$ / 167 \\
                 46: $K(k) = \int_0^{\pi/2} (1 / \sqrt{1 - k^2 \sin^2
                 \phi}) \, d\phi$ / 170 \\
                 49: $E(k) = \int_0^{\pi/2} \sqrt{1 - k^2 \sin^2 \phi}
                 \, d\phi$ / 173 \\
                 52: $\ln(1 + x)$ / 176 \\
                 57: $e^{-x}$ / 181 \\
                 61: $\Phi(x) = (2 / \sqrt{\pi}) \int_0^x e^{-t^2} \,
                 dt$ / 185 \\
                 64: $-{\rm Ei}(-x) = \int_x^\infty (e^{-t} / t) \, dt$
                 / 188 \\
                 67: $q = (1 / \sqrt{2 \pi}) \int_{x(q)}^\infty
                 e^{-(1/2)t^2} \, dt$ / 191 \\
                 69: $W(z) = \int_0^\infty (e^(-u z) / (K_1^2(u) + \pi^2
                 I_1^2(u))) (1/u) \, du$ / 193 \\
                 71: $P(x) = \int_x^\infty (\sin(t - x) / t) \, dt$ /
                 195 \\
                 74: $Q(x) = \int_x^\infty (\cos(t - x) / t) \, dt$ /
                 195 \\
                 References for Part II / 201",
}

@Article{McCracken:1955:MCM,
  author =       "Daniel D. McCracken",
  title =        "The {Monte Carlo} Method",
  journal =      j-SCI-AMER,
  volume =       "192",
  number =       "5",
  pages =        "90--??",
  month =        may,
  year =         "1955",
  CODEN =        "SCAMAC",
  ISSN =         "0036-8733 (print), 1946-7087 (electronic)",
  ISSN-L =       "0036-8733",
  bibdate =      "Tue May 19 18:01:43 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Scientific American",
  journal-URL =  "http://www.nature.com/scientificamerican",
  keywords =     "Buffon needle problem; mathematics; Monte Carlo
                 method; probability; random numbers",
}

@Article{Neovius:1955:ATT,
  author =       "G{\"o}sta Neovius",
  title =        "Artificial traffic trials using digital computers",
  journal =      "Ericsson Technics",
  volume =       "11",
  number =       "??",
  pages =        "279--291",
  year =         "1955",
  CODEN =        "????",
  ISSN =         "0014-018X",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "90",
}

@Book{RAND:1955:MRD,
  author =       "{RAND Corporation}",
  title =        "A Million Random Digits With 100,000 Normal Deviates",
  publisher =    pub-FREE,
  address =      pub-FREE:adr,
  pages =        "xxv + 400 + 200",
  year =         "1955",
  ISBN =         "0-02-925790-5",
  ISBN-13 =      "978-0-02-925790-6",
  LCCN =         "QA276.5 .R3",
  bibdate =      "Sat Aug 23 07:58:03 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reprinted in 1966 and 2001 \cite{RAND:2001:MRD}. See
                 also
                 \cite{Tippett:1927:RSN,Brown:1949:HRR,Brown:1951:HRR}.",
  URL =          "http://www.rand.org/pubs/monograph_reports/MR1418.html",
  acknowledgement = ack-nhfb,
  HDnumber =     "100",
}

@Article{Spenser:1955:RNT,
  author =       "Gordon Spenser",
  title =        "Random numbers and their generation",
  journal =      j-COMP-AUTO,
  volume =       "4",
  number =       "??",
  pages =        "10--11, 23",
  year =         "1955",
  CODEN =        "CPAUAJ",
  ISSN =         "0010-4795, 0887-4549",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Automation",
  HDnumber =     "114",
}

@Article{Barton:1956:SNO,
  author =       "D. E. Barton and F. N. David",
  title =        "Some notes on ordered random intervals",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "18",
  number =       "1",
  pages =        "79--94",
  month =        "????",
  year =         "1956",
  CODEN =        "JSTBAJ",
  ISSN =         "0035-9246",
  bibdate =      "Sun Feb 19 06:48:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2983737",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@InProceedings{Butler:1956:MSG,
  author =       "James W. Butler",
  title =        "Machine sampling from given probability
                 distributions",
  crossref =     "Meyer:1956:SMC",
  pages =        "249--264",
  year =         "1956",
  bibdate =      "Mon Jun 27 12:23:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "12",
}

@Article{Davis:1956:SMC,
  author =       "P. Davis and P. Rabinowitz",
  title =        "Some {Monte Carlo} Experiments in Computing Multiple
                 Integrals",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "10",
  number =       "53",
  pages =        "1--8",
  month =        jan,
  year =         "1956",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "21",
  journal-URL =  "http://www.ams.org/mcom/",
}

@TechReport{Farrington:1956:GPR,
  author =       "Carl C. {Farrington, Jr.}",
  title =        "Generating pseudo-random numbers in the {Illiac}",
  type =         "Report",
  number =       "74",
  institution =  "Digital Computer Laboratory, University of Illinois",
  address =      "Champaign-Urbana, IL, USA",
  year =         "1956",
  bibdate =      "Mon Jun 27 13:33:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "26",
}

@Article{Isida:1956:RNG,
  author =       "Masatugu Isida and Hiroji Ikeda",
  title =        "Random number generator",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "8",
  number =       "??",
  pages =        "119--126",
  year =         "1956",
  CODEN =        "AISXAD",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  MRnumber =     "MR 86369",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics
                 (Tokyo)",
  HDnumber =     "4'",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Johnson:1956:GTP,
  author =       "D. L. Johnson",
  title =        "Generating and Testing Pseudo Random Numbers on the
                 {IBM Type 701}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "10",
  number =       "53",
  pages =        "8--13",
  month =        jan,
  year =         "1956",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "57",
  journal-URL =  "http://www.ams.org/mcom/",
}

@TechReport{Kahn:1956:AMC,
  author =       "Herman Kahn",
  title =        "Applications of {Monte Carlo}",
  type =         "Research Memorandum",
  number =       "RM-1237",
  institution =  "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  year =         "1956",
  bibdate =      "Mon Jun 27 14:58:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Also appeared as AECU 3259",
  URL =          "http://www.rand.org/pubs/research_memoranda/RM1237.html",
  abstract =     "A discussion of some of the ideas and techniques of
                 the Monte Carlo method (applying probability theory and
                 statistics to applied mathematics) that have proved
                 useful in the solution of various problems. The study
                 considers techniques with random variables, evaluating
                 integrals, integral or matrix equations, and ordinary
                 differential equations.",
  acknowledgement = ack-nhfb,
  HDnumber =     "59",
}

@InProceedings{Kahn:1956:UDM,
  author =       "Herman Kahn",
  title =        "Use of different {Monte Carlo} sampling techniques",
  crossref =     "Meyer:1956:SMC",
  pages =        "146--190",
  year =         "1956",
  bibdate =      "Mon Jun 27 14:59:48 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "60",
}

@InProceedings{Lytle:1956:DGT,
  author =       "Ernest J. {Lytle, Jr.}",
  title =        "A description of the generation and testing of a set
                 of random normal deviates",
  crossref =     "Meyer:1956:SMC",
  pages =        "234--248",
  year =         "1956",
  bibdate =      "Mon Jun 27 14:59:48 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "72",
}

@InProceedings{Marshall:1956:UMS,
  author =       "Andrew W. Marshall",
  title =        "The use of multi-stage sampling schemes in {Monte
                 Carlo} computations",
  crossref =     "Meyer:1956:SMC",
  pages =        "123--140",
  year =         "1956",
  bibdate =      "Mon Jun 27 15:19:05 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "79",
}

@InProceedings{Metropolis:1956:DGT,
  author =       "N. Metropolis",
  title =        "A description of the generation and testing of a set
                 of random normal deviates",
  crossref =     "Meyer:1956:SMC",
  pages =        "234--248",
  year =         "1956",
  bibdate =      "Mon Jun 27 14:59:48 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Metropolis:1956:PSM,
  author =       "N. Metropolis",
  title =        "Phase shifts --- middle squares --- wave equations",
  crossref =     "Meyer:1956:SMC",
  pages =        "29--36",
  year =         "1956",
  MRclass =      "65.3X",
  MRnumber =     "MR0088787 (19,580c)",
  MRreviewer =   "M. A. Hyman",
  bibdate =      "Thu Dec 22 07:41:05 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Lecture notes in statistics",
  acknowledgement = ack-nhfb,
  HDnumber =     "82",
}

@Article{Pawlak:1956:FFG,
  author =       "Z. Pawlak",
  title =        "Flip-flop as generator of random binary digits",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "10",
  number =       "??",
  pages =        "28--30",
  year =         "1956",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 15:35:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "96",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Sprowls:1956:ACF,
  author =       "R. Clay Sprowls",
  title =        "An Automatic Coin Flipper for Sampling
                 Demonstrations",
  journal =      j-AMER-STAT,
  volume =       "10",
  number =       "2",
  pages =        "12--13",
  month =        apr,
  year =         "1956",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 08:42:51 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326299;
                 https://www.math.utah.edu/pub/tex/bib/amstat1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2681598",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Stuart:1956:ETR,
  author =       "Alan Stuart",
  title =        "The efficiencies of tests of randomness,
                 distribution-free methods vs. normal alternatives",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "51",
  number =       "274",
  pages =        "285--287",
  month =        jun,
  year =         "1956",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jan 16 22:46:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281348",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@InProceedings{Taussky:1956:GTP,
  author =       "Olga Taussky and John Todd",
  title =        "Generation and testing of pseudo-random numbers",
  crossref =     "Meyer:1956:SMC",
  pages =        "15--28",
  year =         "1956",
  MRnumber =     "MR 80382",
  bibdate =      "Mon Jun 27 12:23:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "118",
}

@InProceedings{Tompkins:1956:MAP,
  author =       "C. B. Tompkins",
  title =        "Machine attacks on problems whose variables are
                 permutations",
  crossref =     "Curtiss:1956:NAP",
  pages =        "195--212",
  year =         "1956",
  bibdate =      "Mon Jun 27 16:11:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "129",
}

@Article{Tompkins:1956:RJS,
  author =       "C. B. Tompkins",
  title =        "Review of {{\em Japanese Standards Association, random
                 number generating icosahedral dice}}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "15",
  number =       "73",
  pages =        "94--95",
  month =        jan,
  year =         "1956",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "127",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Tompkins:1956:RMR,
  author =       "C. B. Tompkins",
  title =        "Review of {{\em A Million Random Digits With 100,000
                 Normal Deviates}}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "10",
  number =       "53",
  pages =        "39--43",
  month =        jan,
  year =         "1956",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "127",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Cook:1957:RFP,
  author =       "J. M. Cook",
  title =        "Rational Formulae for the Production of a Spherically
                 Symmetric Probability Distribution",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "11",
  number =       "58",
  pages =        "81--82",
  month =        apr,
  year =         "1957",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Feb 27 08:05:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2002156",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "Extension to the surface of a sphere of von Neumann's
                 method for producing a uniform distribution of random
                 value on the circumference of the unit circle.",
}

@Article{Davis:1957:CJH,
  author =       "Harold Davis",
  title =        "Comment: {J. Halcomb Laning, Jr., and Richard H.
                 Battin, \booktitle{Random Processes in Automatic
                 Control}, McGraw-Hill Series in Control Systems
                 Engineering, McGraw-Hill Book Co., Inc., New York,
                 1956, ix + 434 p., 23 cm. Price \$10.00}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "11",
  number =       "58",
  pages =        "112--112",
  month =        apr,
  year =         "1957",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Mon Feb 27 08:05:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2002157",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Book{Fisher:1957:STBa,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural, and
                 medical research",
  publisher =    pub-OLIVER-BOYD,
  address =      pub-OLIVER-BOYD:adr,
  edition =      "Fifth",
  pages =        "138",
  year =         "1957",
  LCCN =         "QA276 .F498 1957a",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc; Mathematical
                 statistics",
}

@Book{Fisher:1957:STBb,
  author =       "Sir Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical tables for biological, agricultural, and
                 medical research",
  publisher =    "Hafner Pub. Co.",
  address =      "New York, NY, USA",
  edition =      "Fifth",
  pages =        "138",
  year =         "1957",
  LCCN =         "QA276 .F498 1957",
  bibdate =      "Thu Dec 22 09:30:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (1890--1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc; Mathematical
                 statistics",
}

@Article{Gabai:1957:DCS,
  author =       "H. Gabai",
  title =        "On the discrepancy of certain sequences mod $1$",
  journal =      "Ill. J. Math.",
  volume =       "1",
  pages =        "1--12",
  year =         "1957",
  bibdate =      "Wed Mar 28 06:06:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0146.06303",
  acknowledgement = ack-nhfb,
  keywords =     "number theory",
  language =     "English",
}

@Article{Good:1957:STR,
  author =       "I. J. Good",
  title =        "On the serial test for random sequences",
  journal =      j-ANN-MATH-STAT,
  volume =       "28",
  number =       "1",
  pages =        "262--264",
  month =        mar,
  year =         "1957",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177707053",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177707053;
                 http://www.jstor.org/stable/2237039",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "39",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Savage:1957:ITR,
  author =       "Richard Savage",
  title =        "On the Independence of Tests of Randomness and Other
                 Hypotheses",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "52",
  number =       "277",
  pages =        "53--57",
  month =        mar,
  year =         "1957",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:32 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314156;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281400",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{vonHoerner:1957:HZR,
  author =       "Sebastian von Hoerner",
  title =        "{Herstellung von Zufallszahlen auf Rechenautomaten}.
                 ({German}) [{Production} of random numbers on automatic
                 computers]",
  journal =      j-Z-ANGE-MATH-PHYS,
  volume =       "8",
  number =       "??",
  pages =        "26--52",
  year =         "1957",
  CODEN =        "ZAMPDB",
  ISSN =         "0044-2275 (print), 1420-9039 (electronic)",
  ISSN-L =       "0044-2275",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r Angewandte Mathematik und Physik
                 = Journal of Applied Mathematics and Physics}",
  HDnumber =     "132",
  journal-URL =  "http://link.springer.com/journal/33",
  language =     "German",
}

@Article{Walsh:1957:EMO,
  author =       "John E. Walsh",
  title =        "An experimental method for obtaining random digits and
                 permutations",
  journal =      j-SANKHYA,
  volume =       "17",
  number =       "5",
  pages =        "355--360",
  month =        feb,
  year =         "1957",
  CODEN =        "SNKYA5",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/25048325",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics)",
  HDnumber =     "138",
  journal-URL =  "https://www.jstor.org/journal/sankhya",
}

@Article{Bass:1958:MMC,
  author =       "J. Bass and J. Guilloud",
  title =        "{M{\'e}thode} de {Monte-Carlo} et suites
                 uniform{\'e}ment denses. ({French}) [{The Monte Carlo
                 Method} and sequences of uniformly-distributed
                 numbers]",
  journal =      j-CHIFFRES,
  volume =       "1",
  number =       "??",
  pages =        "149--156",
  month =        "????",
  year =         "1958",
  CODEN =        "????",
  ISSN =         "0245-9922",
  bibdate =      "Mon Jun 27 12:08:40 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Chiffres: Revue de l'Association fran{\c{c}}aise de
                 Calcul",
  HDnumber =     "2",
  language =     "French",
}

@Article{Bauer:1958:MCM,
  author =       "W. F. Bauer",
  title =        "The {Monte Carlo} Method",
  journal =      j-J-SIAM,
  volume =       "6",
  number =       "4",
  pages =        "438--451",
  month =        dec,
  year =         "1958",
  CODEN =        "JSIMAV",
  ISSN =         "0368-4245 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Society for Industrial and Applied
                 Mathematics",
  HDnumber =     "4",
  journal-URL =  "http://epubs.siam.org/loi/smjmap.1",
}

@Book{Bendat:1958:PAR,
  author =       "Julius S. Bendat",
  title =        "Principles and Applications of Random Noise Theory",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "431",
  year =         "1958",
  LCCN =         "TK5101 .B37",
  bibdate =      "Sun Nov 30 07:47:29 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Random noise theory",
}

@Article{Bofinger:1958:PPP,
  author =       "Eve Bofinger and V. J. Bofinger",
  title =        "On a Periodic Property of Pseudo-Random Sequences",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "261--265",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320932.320937",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "5",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Box:1958:NGR,
  author =       "G. E. P. Box and Mervin E. Muller",
  title =        "A note on the generation of random normal deviates",
  journal =      j-ANN-MATH-STAT,
  volume =       "29",
  number =       "2",
  pages =        "610--611",
  month =        jun,
  year =         "1958",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177706645",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Sat Sep 17 10:06:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177706645;
                 http://www.jstor.org/stable/2237361",
  abstract =     "Sampling experiments often require the generation of
                 large numbers of random normal deviates. When an
                 electronic computer is used it is desirable to arrange
                 for the generation of such normal deviates within the
                 machine itself rather than to rely on tables. Pseudo
                 random numbers can be generated by a variety of methods
                 within the machine and the purpose of this note is to
                 give what is believed to be a new method for generating
                 normal deviates from independent random numbers. This
                 approach can be used on small as well as large scale
                 computers. A detailed comparison of the utility of this
                 approach with other known methods (such as: (1) the
                 inverse Gaussian function of the uniform deviates, (2)
                 Teichroew's approach, (3) a rational approximation such
                 as that developed by Hastings, (4) the sum of a fixed
                 number of uniform deviates and (5) rejection-type
                 approach), has been made elsewhere [1] by one of the
                 authors (M. E. M.). It is shown that the present
                 approach not only gives higher accuracy than previous
                 methods but also compares in speed very favourably with
                 other methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "8",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Certaine:1958:SPR,
  author =       "J. Certaine",
  title =        "On Sequences of Pseudo-Random Numbers of Maximal
                 Length",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "353--356",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:19 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "16",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Franklin:1958:EPR,
  author =       "J. N. Franklin",
  title =        "On the equidistribution of pseudo-random numbers",
  journal =      j-QUART-APPL-MATH,
  volume =       "16",
  number =       "??",
  pages =        "183--188",
  month =        "????",
  year =         "1958",
  CODEN =        "QAMAAY",
  ISSN =         "0033-569x (print), 1552-4485 (electronic)",
  ISSN-L =       "0033-569X",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Quarterly of Applied Mathematics",
  HDnumber =     "31",
  journal-URL =  "http://dl.acm.org/citation.cfm?id=J641;
                 http://www.ams.org/journals/qam",
}

@TechReport{Gross:1958:AGP,
  author =       "O. Gross and S. M. Johnson",
  title =        "Additive generation of pseudorandom numbers",
  type =         "Research Memorandum",
  number =       "RM-2132",
  institution =  "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  year =         "1958",
  bibdate =      "Mon Jun 27 14:33:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.rand.org/pubs/research_memoranda/RM2132.html",
  abstract =     "The calculation of the cycle lengths of sequences of
                 certain special cases of pseudorandom vectors generated
                 by a new addition technique. These cycle lengths are
                 comparable to those obtained by the established
                 multiplicative methods, and relevant theorems are
                 included. A pseudorandom sequence of numbers is defined
                 as a completely determined sequence having some of the
                 more easily tested statistical properties of truly
                 random sequences.",
  acknowledgement = ack-nhfb,
  HDnumber =     "44",
}

@Article{Leslie:1958:PSM,
  author =       "P. H. Leslie and J. C. Gower",
  title =        "The Properties of a Stochastic Model for two Competing
                 Species",
  journal =      j-BIOMETRIKA,
  volume =       "45",
  number =       "3/4",
  pages =        "316--330",
  month =        dec,
  year =         "1958",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2333181",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "92.00 (60.00)",
  MRnumber =     "0102448 (21 \#1241)",
  MRreviewer =   "M. A. Stone",
  bibdate =      "Sat Jun 21 14:32:58 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315431;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2333181",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  HDnumber =     "69",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Muller:1958:IMG,
  author =       "Mervin E. Muller",
  title =        "An Inverse Method for the Generation of Random Normal
                 Deviates on Large-Scale Computers",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "12",
  number =       "63",
  pages =        "167--174",
  month =        jul,
  year =         "1958",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  HDnumber =     "86",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Renyi:1958:ODP,
  author =       "Alfr{\'e}d R{\'e}nyi",
  title =        "On a one-dimensional problem concerning random space
                 filling",
  journal =      "Magyar Tud. Akad. Mat. Kutat{\'o} Int. K{\"o}zl.",
  volume =       "3",
  number =       "1--2",
  pages =        "109--127",
  month =        "????",
  year =         "1958",
  bibdate =      "Wed Feb 29 21:10:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Publ. Math. Inst. Hung. Acad. Sci.",
  fjournal =     "A Magyar Tudom{\'a}nyos Akad{\'e}mia Matematikai
                 {\'e}s Fizikai Tudom{\'a}nyok Oszt{\'a}ly{\'a}nak
                 K{\"o}zlem{\'e}nyei",
  keywords =     "parking-lot test; sphere packing",
  language =     "Hungarian (with English and Russian summaries)",
}

@TechReport{Richtmyer:1958:NRS,
  author =       "R. D. Richtmyer",
  title =        "A non-random sampling method, based on congruences,
                 for {``Monte Carlo''} problems",
  type =         "Report",
  number =       "NYO-8674",
  institution =  "AEC Computational and Applied Mathematics Center, New
                 York University",
  address =      "New York, NY, USA",
  year =         "1958",
  bibdate =      "Mon Jun 27 15:40:58 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "103",
}

@Article{Schmid:1958:KSL,
  author =       "Paul Schmid",
  title =        "On the {Kolmogorov} and {Smirnov} limit theorems for
                 discontinuous distribution functions",
  journal =      j-ANN-MATH-STAT,
  volume =       "29",
  number =       "4",
  pages =        "1011--1027",
  month =        dec,
  year =         "1958",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Wed Jan 18 08:24:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2236943",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Sengupta:1958:TRN,
  author =       "J. M. Sengupta and Nikhilesh Bhattacharya",
  title =        "Tables of random normal deviates",
  journal =      j-SANKHYA,
  volume =       "20",
  number =       "3/4",
  pages =        "249--286",
  month =        dec,
  year =         "1958",
  CODEN =        "SNKYA5",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics)",
  HDnumber =     "109",
  journal-URL =  "https://www.jstor.org/journal/sankhya",
}

@Article{Sobol:1958:PRN,
  author =       "I. M. Sobol'",
  title =        "Pseudo-random numbers for the machine {``Strela''}",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "3",
  number =       "2",
  pages =        "192--197",
  month =        "????",
  year =         "1958",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1103019",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/3/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  HDnumber =     "111",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1958",
}

@Article{Thomson:1958:MCM,
  author =       "W. E. Thomson",
  title =        "A modified congruence method of generating
                 pseudo-random numbers",
  journal =      j-COMP-J,
  volume =       "1",
  number =       "2",
  pages =        "83, 86",
  month =        jul,
  year =         "1958",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:55:03 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_02/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_02/010083.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_01/Issue_02/tiff/83.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  HDnumber =     "120",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Bolshev:1959:TRV,
  author =       "L. N. Bol'shev",
  title =        "On transformations of random variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "4",
  number =       "2",
  pages =        "136--149",
  month =        "????",
  year =         "1959",
  CODEN =        "TPRBAU",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Wed Jan 18 11:09:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
}

@Book{Cashwell:1959:PMM,
  author =       "E. D. Cashwell and C. J. (Cornelius Joseph) Everett",
  title =        "A practical manual on the {Monte Carlo} method for
                 random walk problems",
  volume =       "1",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "ix + 153",
  year =         "1959",
  LCCN =         "QC174.5 .C3",
  bibdate =      "Mon Jun 27 12:30:13 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "International tracts in computer science and
                 technology and their application",
  acknowledgement = ack-nhfb,
  HDnumber =     "15",
  subject =      "Quantum statistics; Probabilities; Computers",
  tableofcontents = "1. Basic principles (pseudo-random numbers) \\
                 2. The source routine \\
                 3. The mean free path and transmission \\
                 4. The collision or escape routine \\
                 5. The collision routine for neutrons \\
                 6. Photon collisions \\
                 7. Direction parameters after collision \\
                 8. Terminal classification \\
                 9. Remarks on computation \\
                 10. Statistical considerations \\
                 Appendix: Summary of problems run on Maniac I",
}

@Article{Cook:1959:RRP,
  author =       "J. M. Cook",
  title =        "Remarks on a Recent Paper: {``An Efficient Method for
                 Generating Uniformly Distributed Points on the Surface
                 of an $n$-Dimensional Sphere'' ({\bf 2}, No. 4 (1959),
                 17)}",
  journal =      j-CACM,
  volume =       "2",
  number =       "10",
  pages =        "26--26",
  month =        oct,
  year =         "1959",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/368453.1127876",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Mar 17 12:26:12 2012",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm2.html#Cook59;
                 https://www.math.utah.edu/pub/tex/bib/cacm1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Hicks:1959:EMG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  oldlabel =     "Cook59",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Cook59",
}

@Article{Ehrlich:1959:MCS,
  author =       "Louis W. Ehrlich",
  title =        "{Monte Carlo} Solutions of Boundary Value Problems
                 Involving the Difference Analogue of $ \partial^2 u /
                 \partial x^2 + \partial^2 u / \partial y^2 + ({K} /
                 y)(\partial u / \partial y) = 0 $",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "204--218",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320964.320977",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "25",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Golenko:1959:DCS,
  author =       "D. I. Golenko",
  title =        "Determination of characteristics of some stochastic
                 processes by {Monte Carlo} methods",
  journal =      j-COMP-MATH,
  volume =       "??",
  number =       "5",
  pages =        "93--108",
  year =         "1959",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Mathematics",
  HDnumber =     "36",
  language =     "Russian",
}

@Article{Golenko:1959:FRN,
  author =       "D. I. Golenko",
  title =        "Formation of random numbers with arbitrary law of
                 distribution",
  journal =      j-COMP-MATH,
  volume =       "??",
  number =       "5",
  pages =        "83--92",
  year =         "1959",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Mathematics",
  HDnumber =     "35",
  language =     "Russian",
}

@Article{Green:1959:ETA,
  author =       "Bert F. {Green, Jr.} and J. E. Keith Smith and Laura
                 Klem",
  title =        "Empirical Tests of an Additive Random Number
                 Generator",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "527--537",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320998.321006",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "40",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Hicks:1959:EMG,
  author =       "J. S. Hicks and R. F. Wheeling",
  title =        "An Efficient Method for Generating Uniformly
                 Distributed Points on the Surface of an $n$-Dimensional
                 Sphere",
  journal =      j-CACM,
  volume =       "2",
  number =       "4",
  pages =        "17--19",
  month =        apr,
  year =         "1959",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/377939.377945",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Wed Jul 14 15:48:22 MDT 2004",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm2.html#HicksW59;
                 http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1950.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remarks \cite{Cook:1959:RRP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  oldlabel =     "HicksW59",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HicksW59",
}

@Manual{IBM:1959:RNG,
  author =       "{IBM}",
  title =        "Random number generation and testing",
  organization = "International Business Machines Corporation",
  address =      "New York, NY, USA",
  year =         "1959",
  bibdate =      "Mon Jun 27 14:55:25 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reference manual C20-8011.",
  acknowledgement = ack-nhfb,
  HDnumber =     "56",
}

@InProceedings{Lehmer:1959:CPD,
  author =       "D. H. Lehmer",
  title =        "Combinatorial problems with digital computers",
  crossref =     "Macphail:1959:PFC",
  pages =        "160--173",
  year =         "1959",
  bibdate =      "Mon Jun 27 15:08:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "68",
}

@Article{Muller:1959:CMG,
  author =       "Mervin E. Muller",
  title =        "A Comparison of Methods for Generating Normal Deviates
                 on Digital Computers",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "376--383",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320986.320992",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:33:26 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  descriptors =  "RVG",
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "87",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Muller:1959:NMG,
  author =       "Mervin E. Muller",
  title =        "A Note on a Method for Generating Points Uniformly on
                 {$N$}-Dimensional Spheres",
  journal =      j-CACM,
  volume =       "2",
  number =       "4",
  pages =        "19--20",
  month =        apr,
  year =         "1959",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Wed Jul 14 15:48:22 MDT 2004",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm2.html#Muller59;
                 http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  HDnumber =     "88",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  oldlabel =     "Muller59",
  remark =       "See also \cite{Cheng:1998:RVG} for random points on an
                 $n$-sphere.",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Muller59",
}

@Article{Page:1959:PRE,
  author =       "E. S. Page",
  title =        "Pseudo-Random Elements for Computers",
  journal =      j-APPL-STAT,
  volume =       "8",
  number =       "2",
  pages =        "124--131",
  month =        jun,
  year =         "1959",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:16:50 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  HDnumber =     "94",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Schulz-Arenstorff:1959:PDP,
  author =       "Richard Schulz-Arenstorff and James C. Morelock",
  title =        "The Probability Distribution of the Product of $n$
                 Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "66",
  number =       "2",
  pages =        "95--99",
  month =        feb,
  year =         "1959",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:39:17 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Sterzer:1959:RNG,
  author =       "Fred Sterzer",
  title =        "Random number generator using subharmonic
                 oscillators",
  journal =      j-REV-SCI-INSTRUM,
  volume =       "30",
  number =       "4",
  pages =        "241--243",
  year =         "1959",
  CODEN =        "RSINAK",
  DOI =          "https://doi.org/10.1063/1.1716525",
  ISSN =         "1089-7623, 0034-6748",
  ISSN-L =       "0034-6748",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A random number generator which uses two 2000 Mc
                 subharmonic oscillators is described. This generator
                 can produce random binary digits at a maximum rate of
                 approximately $ 3 \times 10^7 $ digits per second.
                 Statistical tests performed on over a quarter million
                 digits produced by this generator indicate that they
                 were at least as random as digits produced by other
                 slower contemporary means.",
  acknowledgement = ack-nhfb,
  fjournal =     "Review of scientific instruments",
  HDnumber =     "115",
  journal-URL =  "http://rsi.aip.org/",
}

@Article{Thomson:1959:EMS,
  author =       "W. E. Thomson",
  title =        "{ERNIE} --- a mathematical and statistical analysis",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "122",
  number =       "3",
  pages =        "301--324",
  year =         "1959",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Discussion pp. 324-333.",
  URL =          "http://www.jstor.org/stable/2342795",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  HDnumber =     "121",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
  keywords =     "ERNIE (Electronic Random Number Generator Indicator
                 Equipment)",
  xxpages =      "301--333",
}

@Book{Tippett:1959:RSN,
  author =       "Leonard Henry Caleb Tippett",
  title =        "Random sampling numbers",
  volume =       "15",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 26",
  year =         "1959",
  LCCN =         "QA47 .T7 no. 15",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With a foreword by editor Karl Pearson.",
  series =       "Tracts for computers",
  acknowledgement = ack-nhfb,
  HDnumber =     "123",
  remark =       "This is a reprint of \cite{Tippett:1927:RSN}.",
  subject =      "Mathematics; Tables; Sampling (Statistics)",
}

@Article{Zierler:1959:LRS,
  author =       "Neal Zierler",
  title =        "Linear Recurring Sequences",
  journal =      j-J-SIAM,
  volume =       "7",
  number =       "1",
  pages =        "31--48",
  month =        mar,
  year =         "1959",
  CODEN =        "JSIMAV",
  ISSN =         "0368-4245 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Society for Industrial and Applied
                 Mathematics",
  HDnumber =     "143",
  journal-URL =  "http://epubs.siam.org/loi/smjmap.1",
}

@Article{Bazley:1960:AMC,
  author =       "N. W. Bazley and P. J. Davis",
  title =        "Accuracy of {Monte Carlo} methods in computing finite
                 {Markov} chains",
  journal =      j-J-RES-NATL-BUR-STAND-1934,
  volume =       "64B",
  number =       "??",
  pages =        "211--215",
  month =        "????",
  year =         "1960",
  CODEN =        "????",
  ISSN =         "0091-0635",
  bibdate =      "Mon Jun 27 12:11:11 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Research of the National Bureau of
                 Standards (1934)",
  HDnumber =     "3",
  journal-URL =  "https://www.nist.gov/nist-research-library/journal-research-nist/past-papers",
}

@InProceedings{Butcher:1960:SR,
  author =       "J. C. Butcher",
  editor =       "????",
  booktitle =    "Proceedings of the First Australian Computer
                 Conference",
  title =        "The simulation of randomness",
  publisher =    "????",
  address =      "????",
  pages =        "12/1/1--12/1/2",
  year =         "1960",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 22:40:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "????",
  acknowledgement = ack-nhfb,
}

@Book{Clark:1960:EDR,
  author =       "Charles E. (Charles Erwin) Clark and Betty Weber
                 Holz",
  title =        "Exponentially distributed random numbers",
  publisher =    "Published for Operations Research Office, Johns
                 Hopkins University by Johns Hopkins Press",
  address =      "Baltimore, MD, USA",
  pages =        "249",
  year =         "1960",
  LCCN =         "QA276 .C49",
  bibdate =      "Mon Jun 27 12:32:41 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  HDnumber =     "18",
  subject =      "Numbers, Random",
}

@Article{Clark:1960:USR,
  author =       "Charles E. Clark",
  title =        "The utility of statistics of random numbers",
  journal =      j-OPER-RES,
  volume =       "8",
  number =       "2",
  pages =        "185--195",
  month =        mar # "\slash " # apr,
  year =         "1960",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.8.2.185",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Mon Jun 27 12:17:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/167201",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  HDnumber =     "17",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{Coveyou:1960:SCG,
  author =       "R. R. Coveyou",
  title =        "Serial Correlation in the Generation of Pseudo-Random
                 Numbers",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "72--74",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321008.321018",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:31 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "19",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@TechReport{DeMatteis:1960:PRS,
  author =       "A. {De Matteis} and B. Faleschini",
  title =        "Pseudo-random sequences of equal length",
  type =         "Report",
  number =       "88",
  institution =  "Comitato AND Nazionale per l'Energia Nucleare",
  address =      "Bologna, Italy",
  year =         "1960",
  bibdate =      "Mon Jun 27 15:20:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "80",
}

@Article{Edmonds:1960:GPR,
  author =       "A. R. Edmonds",
  title =        "The generation of pseudo-random numbers on electronic
                 digital computers",
  journal =      j-COMP-J,
  volume =       "2",
  number =       "4",
  pages =        "181--185",
  month =        jan,
  year =         "1960",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:55:16 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/020181.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/tiff/181.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/tiff/182.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/tiff/183.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/tiff/184.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_02/Issue_04/tiff/185.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  HDnumber =     "24",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Golenko:1960:SRN,
  author =       "D. I. Golenko and V. P. Smiriagin",
  title =        "A source of random numbers which are equidistributed
                 in $ [0, 1] $",
  journal =      "Publications Math. Inst., Hungarian Acad. Sci.",
  volume =       "5A",
  number =       "3",
  pages =        "241--253",
  year =         "1960",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "English abstract.",
  acknowledgement = ack-nhfb,
  HDnumber =     "37",
  language =     "Russian",
}

@InCollection{Good:1960:MCM,
  author =       "I. J. Good",
  booktitle =    "{McGraw-Hill} Encyclopedia of Science and Technology",
  title =        "{Monte Carlo} Method",
  volume =       "8",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "586--587",
  year =         "1960",
  LCCN =         "????",
  bibdate =      "Sat Jan 07 11:52:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Halton:1960:BEC,
  author =       "J. H. Halton",
  title =        "{Berichtigung: ``On the efficiency of certain
                 quasi-random sequences of points in evaluating
                 multi-dimensional integrals'' [Num. Math. {\bf 2},
                 84--90 (1960)]}. ({German}) [{Correction}]",
  journal =      j-NUM-MATH,
  volume =       "2",
  pages =        "196--196",
  month =        dec,
  year =         "1960",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon Oct 18 21:30:25 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Halton:1960:ECQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  language =     "German, English",
}

@Article{Halton:1960:ECQ,
  author =       "J. H. Halton",
  title =        "On the efficiency of certain quasi-random sequences of
                 points in evaluating multi-dimensional integrals",
  journal =      j-NUM-MATH,
  volume =       "2",
  pages =        "84--90",
  month =        dec,
  year =         "1960",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Sun Oct 17 19:01:15 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See correction \cite{Halton:1960:BEC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  HDnumber =     "47",
  journal-URL =  "http://link.springer.com/journal/211",
}

@Article{Hammersley:1960:MCM,
  author =       "J. M. Hammersley",
  title =        "{Monte Carlo} methods for solving multivariable
                 problems",
  journal =      j-ANN-NY-ACAD-SCI,
  volume =       "86",
  number =       "??",
  pages =        "844--874",
  year =         "1960",
  CODEN =        "ANYAA9",
  ISSN =         "0077-8923 (print), 1749-6632 (electronic)",
  ISSN-L =       "0077-8923",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the New York Academy of Sciences",
  HDnumber =     "50",
  journal-URL =  "http://www.nyas.org/Publications/Archive.aspx",
}

@Article{Hunter:1960:NTR,
  author =       "D. G. N. Hunter",
  title =        "Note on a test for repeating cycles in a pseudo-random
                 number generator",
  journal =      j-COMP-J,
  volume =       "3",
  number =       "1",
  pages =        "9--9",
  month =        apr,
  year =         "1960",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:55:18 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_01/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_01/030009.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_01/tiff/9.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  HDnumber =     "55",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@TechReport{Kleinrock:1960:PTS,
  author =       "L. Kleinrock",
  title =        "A Program for Testing Sequences of Random Numbers",
  type =         "Report",
  number =       "51G-0018",
  institution =  "MIT Lincoln Laboratory",
  address =      "Cambridge, MA, USA",
  day =          "25",
  month =        oct,
  year =         "1960",
  bibdate =      "Thu Feb 02 17:32:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1960:GED,
  author =       "George Marsaglia",
  title =        "On generating exponentially distributed random
                 variables",
  type =         "Report",
  number =       "??",
  institution =  "Boeing Scientific Research Labs",
  address =      "Seattle, WA, USA",
  pages =        "??",
  month =        "????",
  year =         "1960",
  bibdate =      "Tue Jun 21 18:58:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Pakov:1960:GRC,
  author =       "G. K. Pakov",
  title =        "Generation of a random correlated quantity on a
                 high-speed electronic computer",
  journal =      "Soviet developments in information processing and
                 machine translation",
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1960",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jun 27 15:33:40 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "U. S. Joint Publ. Res. Service JPRS: 5784, Nov.,
                 1960",
  acknowledgement = ack-nhfb,
  ajournal =     "Soviet Develop. Infor. Proc. Machine Translat.",
  HDnumber =     "95",
  keywords =     "true random numbers from physical sources",
}

@Article{Postnikov:1960:AMR,
  author =       "A. G. Postnikov",
  title =        "Arithmetic modeling of random processes",
  journal =      j-PROC-STEKLOV-INST-MATH,
  volume =       "57",
  number =       "??",
  pages =        "1--84",
  month =        "????",
  year =         "1960",
  CODEN =        "TMISAF",
  ISSN =         "0371-9685",
  MRclass =      "10.50",
  MRnumber =     "0148639 (26 \#6146)",
  MRreviewer =   "A. R{\'e}nyi",
  bibdate =      "Thu Jan 19 08:10:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Trudy Matematicheskogo instituta imeni V. A. Steklova
                 = Proceedings of the Steklov Institute of Mathematics",
}

@Article{Rotenburg:1960:NPR,
  author =       "A. Rotenburg",
  title =        "A New Pseudo-Random Number Generator",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "75--77",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321008.321019",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:32 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  descriptors =  "RNG; linear congruential generator",
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "107",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Schmidt:1960:NN,
  author =       "Wolfgang M. Schmidt",
  title =        "On normal numbers",
  journal =      j-PAC-J-MATH,
  volume =       "10",
  pages =        "661--672",
  year =         "1960",
  CODEN =        "PJMAAI",
  ISSN =         "0030-8730 (print), 1945-5844 (electronic)",
  ISSN-L =       "0030-8730",
  MRclass =      "10.00",
  MRnumber =     "0117212 (22 \#7994)",
  MRreviewer =   "F. Herzog",
  bibdate =      "Sat Jan 7 16:44:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.pjm/1103038420",
  ZMnumber =     "0093.05401",
  acknowledgement = ack-nhfb,
  fjournal =     "Pacific Journal of Mathematics",
  journal-URL =  "http://msp.org/pjm",
  remark =       "From the first section of the paper: ``In this paper
                 we solve the following problem. {\em Under what
                 conditions on $r$, $s$ is every number $ \xi $ which is
                 normal to base $r$ also normal to base $s$ ?} The
                 answer is given by: THEOREM 1. {\bf A} Assume $ r \sim
                 s $. Then any number normal to base $r$ is normal to
                 base $s$. {\bf B} If $ r \not \sim s $, then the set of
                 numbers $ \xi $ which are normal to base $r$ but not
                 even simply normal to base $s$ has the power of the
                 continuum.'' Here, the relation $ r \sim s $ means that
                 the exist integer $m$ and $n$ such that $ r^m = s^n
                 $.",
}

@Article{Wall:1960:FSM,
  author =       "D. D. Wall",
  title =        "{Fibonacci} Series Modulo $m$",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "67",
  number =       "6",
  pages =        "525--532",
  month =        jun # "\slash " # jul,
  year =         "1960",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:35:58 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  HDnumber =     "135",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@InProceedings{Wall:1960:RNT,
  author =       "Donald D. Wall",
  title =        "A random number test for large samples",
  crossref =     "Anonymous:1960:PFI",
  pages =        "7--11",
  year =         "1960",
  bibdate =      "Mon Jun 27 16:20:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "136",
}

@Article{Yamada:1960:PPN,
  author =       "S. Yamada",
  title =        "On the period of pseudorandom numbers generated by
                 {Lehmer}'s congruential method",
  journal =      "J. Op. Research Soc. Japan",
  volume =       "3",
  number =       "??",
  pages =        "113--123",
  month =        "????",
  year =         "1960",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jan 16 22:43:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Biuslenko:1961:MCM,
  author =       "N. P. Biuslenko and Ju. A. Sreider",
  title =        "The {Monte-Carlo} method and how it is carried out on
                 digital computers",
  publisher =    "Gosudarstv. Izdat. Fiz-Mat. Lit.",
  address =      "Moscow, USSR",
  pages =        "????",
  year =         "1961",
  CODEN =        "????",
  ISSN =         "????",
  LCCN =         "????",
  bibdate =      "Mon Jun 27 16:32:37 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "1'",
  language =     "Russian",
}

@Article{Bofinger:1961:GTR,
  author =       "Eve Bofinger and V. J. Bofinger",
  title =        "The gap test for random sequences",
  journal =      j-ANN-MATH-STAT,
  volume =       "32",
  number =       "2",
  pages =        "524--534",
  month =        jun,
  year =         "1961",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177705058",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jun 27 12:13:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177705058;
                 http://www.jstor.org/stable/2237761",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "6",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Bofinger:1961:NPW,
  author =       "Eve Bofinger and V. J. Bofinger",
  title =        "A note on the paper by {W. E. Thomson, on {\em ERNIE
                 --- a mathematical and statistical analysis}}",
  journal =      j-J-R-STAT-SOC,
  volume =       "A124",
  number =       "??",
  pages =        "240--243",
  month =        "????",
  year =         "1961",
  CODEN =        "????",
  ISSN =         "0952-8385",
  bibdate =      "Mon Jun 27 12:14:09 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Roy. Stat. Soc.",
  fjournal =     "Journal of the Royal Statistical Society",
  HDnumber =     "7",
  journal-URL =  "http://www.jstor.org/journals/09528385.html",
  keywords =     "ERNIE (Electronic Random Number Generator Indicator
                 Equipment)",
}

@Article{Bofinger:1961:RTS,
  author =       "Eve Bofinger and V. J. Bofinger",
  title =        "A Runs Test for Sequences of Random Digits",
  journal =      j-AUST-J-STAT,
  volume =       "3",
  number =       "2",
  pages =        "37--41",
  month =        aug,
  year =         "1961",
  CODEN =        "AUJSA3",
  DOI =          "https://doi.org/10.1111/j.1467-842X.1961.tb00307.x",
  ISSN =         "0004-9581",
  ISSN-L =       "0004-9581",
  bibdate =      "Fri Jul 15 14:27:36 MDT 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anzjs.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Journal of Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-842X/issues",
}

@Article{Brandt:1961:GCT,
  author =       "A. Brandt",
  title =        "A generalization of a combinatorial theorem of {Sparre
                 Andersen} about sums of random variables",
  journal =      j-MATH-SCAND,
  volume =       "9",
  pages =        "325--358",
  year =         "1961",
  CODEN =        "MTSCAN",
  ISSN =         "0025-5521 (print), 1903-1807 (electronic)",
  ISSN-L =       "0025-5521",
  bibdate =      "Fri Jan 6 09:58:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/brandt-achi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Scandinavica",
  journal-URL =  "http://www.mscand.dk/issue/archive",
}

@Article{Butcher:1961:PTP,
  author =       "J. C. Butcher",
  title =        "A Partition Test for Pseudo-Random Numbers (in
                 {Technical Notes and Short Papers})",
  journal =      j-MATH-COMPUT,
  volume =       "15",
  number =       "74",
  pages =        "198--199",
  month =        apr,
  year =         "1961",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "10",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Butcher:1961:RSN,
  author =       "J. C. Butcher",
  title =        "Random sampling from the normal distribution",
  journal =      j-COMP-J,
  volume =       "3",
  number =       "4",
  pages =        "251--253",
  month =        jan,
  year =         "1961",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:55:25 MDT 2000",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/Pre.1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_04/030251.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_04/tiff/251.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_04/tiff/252.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_03/Issue_04/tiff/253.tif",
  acknowledgement = ack-nhfb,
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7085",
  fjournal =     "The Computer Journal",
  HDnumber =     "11",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Corrsin:1961:CLS,
  author =       "S. Corrsin and O. M. Phillips",
  title =        "Contour Length and Surface Area of Multiple-Valued
                 Random Variables",
  journal =      j-J-SIAM,
  volume =       "9",
  number =       "3",
  pages =        "395--404",
  month =        sep,
  year =         "1961",
  CODEN =        "JSIMAV",
  ISSN =         "0368-4245 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Society for Industrial and Applied
                 Mathematics",
  journal-URL =  "http://epubs.siam.org/loi/smjmap.1",
}

@Article{Fisser:1961:STA,
  author =       "H. Fisser",
  title =        "Some tests applied to pseudo-random numbers generated
                 by {v. H{\"o}rner}'s rule",
  journal =      j-NUM-MATH,
  volume =       "3",
  pages =        "247--249",
  month =        dec,
  year =         "1961",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Sun Oct 17 19:01:15 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  HDnumber =     "28",
  journal-URL =  "http://link.springer.com/journal/211",
}

@Article{Greenberger:1961:NNP,
  author =       "Martin Greenberger",
  title =        "Notes on a New Pseudo-Random Number Generator",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "163--167",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321062.321065",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:28 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "The IBM RNG!",
  descriptors =  "RNG; linear congruential generator",
  fjournal =     "Journal of the Association for Computing Machinery",
  HDnumber =     "41",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Greenberger:1961:PDS,
  author =       "Martin Greenberger",
  title =        "An a Priori Determination of Serial Correlation in
                 Computer Generated Random Numbers",
  journal =      j-MATH-COMPUT,
  volume =       "15",
  number =       "76",
  pages =        "383--389",
  month =        oct,
  year =         "1961",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See also corrigenda, Math. Comp. {\bf 16} (1962), p.
                 126.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "42",
  journal-URL =  "http://www.ams.org/mcom/",
}

@TechReport{Herrmann:1961:SER,
  author =       "R. G. Herrmann",
  title =        "The Statistical Evaluation of Random Number Generating
                 Sequences for Digital Computers",
  type =         "Report",
  number =       "APEX - 635",
  institution =  "General Electric Co.",
  address =      "????",
  year =         "1961",
  bibdate =      "Mon Jan 16 22:38:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "U.S. Dept. of Commerce, Office of Technical
                 Services.",
  acknowledgement = ack-nhfb,
}

@Article{Hlawka:1961:FBV,
  author =       "Edmund Hlawka",
  title =        "{Funktionen von beschr{\"a}nkter Variation in der
                 Theorie der Gleichverteilung}. ({German}) [{Functions}
                 of bounded variation in the theory of uniform
                 distribution]",
  journal =      j-ANN-MAT-PURA-APPL-4,
  volume =       "54",
  number =       "??",
  pages =        "325--333",
  month =        "????",
  year =         "1961",
  CODEN =        "ANLMAE",
  ISSN =         "0003-4622",
  MRclass =      "10.33 (10.50)",
  MRnumber =     "0139597 (25 \#3029)",
  MRreviewer =   "W. J. LeVeque",
  bibdate =      "Thu Jan 19 08:35:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annali di matematica pura ed applicata. Series 4",
  language =     "German",
}

@Article{Kiefer:1961:LDE,
  author =       "J. Kiefer",
  title =        "On large deviations of the empiric d.f. of vector
                 chance variables and a law of the iterated logarithm",
  journal =      j-PAC-J-MATH,
  volume =       "11",
  number =       "??",
  pages =        "649--660",
  month =        "????",
  year =         "1961",
  CODEN =        "PJMAAI",
  ISSN =         "0030-8730 (print), 1945-5844 (electronic)",
  ISSN-L =       "0030-8730",
  bibdate =      "Tue Dec 27 11:15:50 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Pacific Journal of Mathematics",
  journal-URL =  "http://msp.org/pjm",
}

@Article{Kuehn:1961:BPR,
  author =       "Heidi G. Kuehn",
  title =        "A $ 48 $-bit pseudo-random number generator",
  journal =      j-CACM,
  volume =       "4",
  number =       "8",
  pages =        "350--352",
  month =        aug,
  year =         "1961",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68.00",
  MRnumber =     "26\#2034",
  bibdate =      "Fri Nov 25 18:19:34 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A new 48-bit pseudo-random number generator, suitable
                 for several computers, was tested statistically for
                 randomness to determine its adequacy for use in Monte
                 Carlo programs. Frequency tests, distributions of
                 certain low-order moments, runs up and down, and runs
                 above and below the mean were applied to one-half
                 million generated numbers lying within the interval $
                 (0, 1) $ and to three sets of integers obtained from
                 specified bits within the generated numbers. These
                 tests substantiated the randomness of all numbers
                 except for the set of integers coming from the least
                 significant bits.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  HDnumber =     "66",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
  ZMreviewer =   "M. E. Muller",
}

@Article{Liniger:1961:MDH,
  author =       "Werner Liniger",
  title =        "On a Method by {D. H. Lehmer} for the Generation of
                 Pseudo Random Numbers",
  journal =      j-NUM-MATH,
  volume =       "3",
  pages =        "265--270",
  month =        dec,
  year =         "1961",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Tue Dec 21 16:29:06 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  HDnumber =     "71",
  journal-URL =  "http://link.springer.com/journal/211",
}

@Article{Mamangakis:1961:MNR,
  author =       "S. E. Mamangakis",
  title =        "Mathematical Notes: Remarks on the {Fibonacci} Series
                 Modulo $m$",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "68",
  number =       "7",
  pages =        "648--649",
  month =        aug # "\slash " # sep,
  year =         "1961",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:24 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  HDnumber =     "74",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Manelis:1961:GRN,
  author =       "J. B. Manelis",
  title =        "Generating random noise",
  journal =      j-ELECTRONICS,
  volume =       "??",
  number =       "??",
  pages =        "66--69",
  day =          "8",
  month =        sep,
  year =         "1961",
  ISSN =         "0883-4989",
  bibdate =      "Thu Feb 02 17:48:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronics",
  journal-URL =  "https://www.mdpi.com/journal/electronics",
}

@Article{Marsaglia:1961:ERV,
  author =       "G. Marsaglia",
  title =        "Expressing a random variable in terms of uniform
                 random variables",
  journal =      j-ANN-MATH-STAT,
  volume =       "32",
  number =       "3",
  pages =        "894--898",
  month =        sep,
  year =         "1961",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177704983",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "65.15",
  MRnumber =     "23 \#B3122",
  MRreviewer =   "M. E. Muller",
  bibdate =      "Thu Dec 22 07:41:29 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://projecteuclid.org/euclid.aoms/1177704983;
                 http://www.jstor.org/stable/2237849",
  ZMnumber =     "0139.35604",
  abstract =     "This note suggests that expressing a distribution
                 function as a mixture of suitably chosen distribution
                 functions leads to improved methods for generating
                 random variables in a computer. The idea is to choose a
                 distribution function which is close to the original
                 and use it most of the time, applying the correction
                 only infrequently. Mixtures allow this to be done in
                 probability terms rather than in the more elaborate
                 ways of conventional numerical analysis, which must be
                 applied every time.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "75",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  keywords =     "probability theory",
}

@Article{Marsaglia:1961:GER,
  author =       "G. Marsaglia",
  title =        "Generating exponential random variables",
  journal =      j-ANN-MATH-STAT,
  volume =       "32",
  number =       "3",
  pages =        "899--900",
  month =        sep,
  year =         "1961",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177704984",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "65.15",
  MRnumber =     "23 \#B3123",
  MRreviewer =   "M. E. Muller",
  bibdate =      "Thu Dec 22 07:41:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://projecteuclid.org/euclid.aoms/1177704984;
                 http://www.jstor.org/stable/2237850",
  ZMnumber =     "0139.35603",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  HDnumber =     "76",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  keywords =     "probability theory",
}

@TechReport{Marsaglia:1961:PGN,
  author =       "George Marsaglia",
  title =        "Procedures for Generating Normal Random Variables,
                 {II}",
  type =         "Mathematical note",
  number =       "243",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  month =        oct,
  year =         "1961",
  bibdate =      "Tue Jun 21 18:56:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method for generating a normal random variable in
                 terms of uniform random variables is described. The
                 method is based on representing a density function as a
                 mixture of simpler densities. It is fast and requires
                 little storage (60 constants). It is not quite as fast
                 as other methods, but it is simpler, with less chance
                 for prospective users being set adrift in a sea of
                 details",
  acknowledgement = ack-nhfb,
  HDnumber =     "78",
}

@TechReport{Marsaglia:1961:RGR,
  author =       "G. Marsaglia",
  title =        "Remark on generating a random variable having a nearly
                 linear density function",
  type =         "Mathematical Note",
  number =       "242",
  institution =  "Boeing Scientific Research Labs",
  address =      "Seattle, WA, USA",
  year =         "1961",
  bibdate =      "Mon Jun 27 15:17:02 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "77",
}

@Article{Marsaglia:1961:SPT,
  author =       "George Marsaglia",
  title =        "Some probability theory associated with
                 clustered-rocket flights",
  journal =      j-PLANET-SPACE-SCI,
  volume =       "4",
  number =       "??",
  pages =        "194--201",
  month =        jan,
  year =         "1961",
  CODEN =        "PLSSAE",
  DOI =          "https://doi.org/10.1016/0032-0633(61)90132-5",
  ISSN =         "0032-0633 (print), 1873-5088 (electronic)",
  ISSN-L =       "0032-0633",
  bibdate =      "Wed Jun 22 06:45:09 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0032063361901325",
  abstract =     "The primary purpose of this note is to provide the
                 probability distribution of the amount of propellant
                 remaining in a cluster of rocket engines at the times
                 that the first and second burnouts occur. In addition,
                 various other random variables associated with the
                 random behavior of the engines of a cluster (pitch and
                 yaw moments, time between successive burnouts, etc.)
                 are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Planetary and Space Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00320633",
}

@Book{Orcutt:1961:MSS,
  author =       "Guy H. Orcutt and Martin Greenberger and John Korbel
                 and Alice M. Rivlin",
  title =        "Microanalysis of socioeconomic systems; a simulation
                 study",
  publisher =    "Harper",
  address =      "New York, NY, USA",
  pages =        "xviii + 425",
  year =         "1961",
  LCCN =         "H61 .O7",
  bibdate =      "Mon Jun 27 15:30:08 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  HDnumber =     "91",
  remark =       "First of a series relating to the work of the Social
                 Systems Research Institute at the University of
                 Wisconsin.",
  subject =      "Social sciences; Simulation methods; United States;
                 Population; Working class",
}

@Article{Peach:1961:BPR,
  author =       "Paul Peach",
  title =        "Bias in pseudo-random numbers",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "56",
  number =       "295",
  pages =        "610--618",
  month =        sep,
  year =         "1961",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2282083",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  HDnumber =     "97",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Pinkham:1961:DFS,
  author =       "Roger S. Pinkham",
  title =        "On the Distribution of First Significant Digits",
  journal =      j-ANN-MATH-STAT,
  volume =       "32",
  number =       "4",
  pages =        "1223--1230",
  month =        dec,
  year =         "1961",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177704862",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Sat May 31 09:10:59 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://links.jstor.org/sici?sici=0003-4851%28196112%2932%3A4%3C1223%3AOTDOFS%3E2.0.CO%3B2-T;
                 http://projecteuclid.org/euclid.aoms/1177704862;
                 http://www.jstor.org/stable/2237922",
  abstract =     "It has been noticed by astute observers that well used
                 tables of logarithms are invariably dirtier at the
                 front than at the back. Upon reflection one is led to
                 inquire whether there are more physical constants with
                 low order first significant digits than high. Actual
                 counts by Benford [2] show that not only is this the
                 case but that it seems to be an empirical truth that
                 whenever one has a large body of physical data,
                 Farmer's Almanac, Census Reports, Chemical Rubber
                 Handbook, etc., the proportion of these data with first
                 significant digit $n$ or less is approximately $
                 \log_{10}(n + 1) $. Any reader formerly unaware of this
                 ``peculiarity'' will find an actual sampling experiment
                 wondrously tantalizing. Thus, for example,
                 approximately $ 0.7 $ of the physical constants in the
                 Chemical Rubber Handbook begin with $4$ or less ($
                 \log_{10}(4 + 1) = 0.699 $ ). This is to be contrasted
                 with the widespread intuitive evaluation $ 4 / 9 $
                 ths.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  keywords =     "Benford's Law; Law of Anomalous Numbers; Zipf's Law",
  remark =       "From p. 1223: ``\ldots{} the proportion of these data
                 with first significant digit $n$ or less is
                 approximately $ \log_{10}(n + 1) $.''\par

                 \ldots{} ``The only distribution for first significant
                 digits which is invariant under scale change of the
                 underlying distribution is $ \log_{10}(n + 1) $.
                 Contrary to suspicion this is a non-trivial
                 mathematical result, for the variable $n$ is
                 discrete.''.\par

                 From p. 1230: ``The foregoing results bear on questions
                 of round-off in computing machines. Since $ d(u v) = u
                 d v + v d u $, the error resulting from multiplying two
                 rounded numbers will be governed primarily by the first
                 significant digits of the two numbers being multiplied.
                 Now the distribution of first significant digits,
                 favoring as it does low order digits, tends to produce
                 less error than would be the case if first significant
                 digits were uniform as has sometimes been
                 assumed.''\par

                 Cited in \cite{Sterbenz:1974:FPC}.",
}

@Article{Rao:1961:GRP,
  author =       "C. Radhakrishna Rao",
  title =        "Generation of random permutations of given number of
                 elements using random sampling numbers",
  journal =      j-SANKHYA-A,
  volume =       "23",
  number =       "??",
  pages =        "305--307",
  year =         "1961",
  CODEN =        "SANABS",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series A.
                 Methods and Techniques",
  HDnumber =     "101",
  journal-URL =  "https://www.jstor.org/journal/sankhyaseriesa",
}

@InProceedings{Richtmyer:1961:MCM,
  author =       "R. D. Richtmyer",
  title =        "{Monte Carlo} methods",
  crossref =     "Birkhoff:1961:NRT",
  pages =        "190--205",
  year =         "1961",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "104",
}

@Article{Riffenburgh:1961:RPI,
  author =       "Robert H. Riffenburgh",
  title =        "Recent Publications: {{\em Introduction to Probability
                 and Random Variables}}, by {George P. Wadsworth and
                 Joseph G. Bryan}",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "68",
  number =       "5",
  pages =        "518--518",
  month =        may,
  year =         "1961",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:19 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Sibuya:1961:EOR,
  author =       "Masaaki Sibuya",
  title =        "On exponential and other random variable generators",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "13",
  number =       "1",
  pages =        "231--237",
  month =        dec,
  year =         "1961",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02868873",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 16:59:46 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02868873",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Book{Solomon:1961:SIA,
  editor =       "Herbert Solomon",
  title =        "Studies in item analysis and prediction",
  volume =       "6",
  publisher =    pub-STANFORD,
  address =      pub-STANFORD:adr,
  pages =        "310",
  year =         "1961",
  LCCN =         "BF39 .S64",
  bibdate =      "Mon Jun 27 15:52:30 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With contributions by Rosedith Sitgreaves and
                 others.",
  series =       "Stanford mathematical studies in the social sciences",
  acknowledgement = ack-nhfb,
  HDnumber =     "112",
  subject =      "Psychometrics; Prediction (Psychology); Psychological
                 tests",
}

@Book{Wendel:1961:LMC,
  author =       "James G. Wendel",
  title =        "Lectures on {Monte Carlo}: University of Michigan
                 Summer Session Courses on Numerical Analysis",
  publisher =    pub-U-MICHIGAN,
  address =      pub-U-MICHIGAN:adr,
  pages =        "??--??",
  year =         "1961",
  LCCN =         "????",
  bibdate =      "Mon Jun 27 16:25:40 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "139",
}

@Article{Wouk:1961:DDR,
  author =       "Arthur Wouk",
  title =        "On Digit Distributions for Random Variables",
  journal =      j-J-SIAM,
  volume =       "9",
  number =       "4",
  pages =        "597--603",
  month =        dec,
  year =         "1961",
  CODEN =        "JSIMAV",
  ISSN =         "0368-4245 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Society for Industrial and Applied
                 Mathematics",
  journal-URL =  "http://epubs.siam.org/loi/smjmap.1",
}

@Article{Barnett:1962:BPR,
  author =       "V. D. Barnett",
  title =        "The Behavior of Pseudo-Random Sequences Generated on
                 Computers by the Multiplicative Congruential Method",
  journal =      j-MATH-COMPUT,
  volume =       "16",
  number =       "77",
  pages =        "63--69",
  month =        jan,
  year =         "1962",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2003811.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "1",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Behrenz:1962:AR,
  author =       "Peter G. Behrenz",
  title =        "{Algorithm 133}: {RANDOM}",
  journal =      j-CACM,
  volume =       "5",
  number =       "11",
  pages =        "553--553",
  month =        nov,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:42 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Behrenz:1962:RAR,
  author =       "Peter G. Behrenz",
  title =        "Remark on {Algorithm 133}: {Random}",
  journal =      j-CACM,
  volume =       "5",
  number =       "12",
  pages =        "606--606",
  month =        dec,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:43 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Clark:1962:CMM,
  author =       "G. Miller Clark",
  title =        "Corrections to {Mervin E. Muller, {\em A Note on a
                 Method for Generating Points Uniformly on
                 $N$-Dimensional Spheres}}",
  journal =      j-MATH-COMPUT,
  volume =       "16",
  number =       "78",
  pages =        "261--261",
  year =         "1962",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Mon Jun 27 14:07:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Muller:1959:NMG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "2'",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Dillard:1962:EGR,
  author =       "G. M. Dillard and R. E. Simmons",
  title =        "An Electronic Generator of Random Numbers",
  journal =      j-IRE-TRANS-ELEC-COMPUT,
  volume =       "EC-11",
  number =       "2",
  pages =        "284--284",
  month =        apr,
  year =         "1962",
  CODEN =        "IRELAO",
  DOI =          "https://doi.org/10.1109/TEC.1962.5219362",
  ISSN =         "0367-9950",
  bibdate =      "Thu Jul 14 09:11:50 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments \cite{Barnes:1963:CEG}.",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219362",
  acknowledgement = ack-nhfb,
  fjournal =     "IRE Transactions on Electronic Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5407885",
}

@Article{Fan:1962:DSP,
  author =       "C. T. Fan and Mervin E. Muller and Ivan Rezucha",
  title =        "Development of Sampling Plans by Using Sequential
                 (Item by Item) Selection Techniques and Digital
                 Computers",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "57",
  number =       "298",
  pages =        "387--402",
  month =        jun,
  year =         "1962",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:36 MST 2012",
  bibsource =    "Database/Wiederhold.bib;
                 http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314179;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2281647",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  remark =       "The authors discuss an algorithm for sampling $n$ of
                 $N$ values, with time cost $ O(N) $. See
                 \cite{Rouzankin:1999:CAR} for a discussion of this
                 algorithm, and others, one with storage cost $ O(N) $
                 and time $ O(n) $, a second with storage cost $ O(n) $
                 and time cost $ O(n^2) $, and more complex algorithms
                 with time cost $ O(n \log n) $ and $ O(n) $. See also
                 \cite{Bentley:1980:GSL} for a short algorithm with
                 worst case time $ O(n) $ with storage $ O(1) $ (with
                 immediate output) or $ O(n) $ with array output, and
                 the selected values are sorted.",
}

@Article{Foster:1962:MRS,
  author =       "Malcolm B. Foster",
  title =        "A method of representation, storage and retrieval of $
                 13 $ random codes in a $4$-digit number or $ 16 $
                 random codes in a $5$-digit number",
  journal =      j-CACM,
  volume =       "5",
  number =       "3",
  pages =        "165--165",
  month =        mar,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:37 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@TechReport{Franklin:1962:DSR,
  author =       "Joel N. Franklin",
  title =        "Deterministic simulation of random processes",
  type =         "Technical Report",
  number =       "118",
  institution =  "Computing Center, California Institute of Technology",
  address =      "Pasadena, CA, USA",
  year =         "1962",
  bibdate =      "Mon Jun 27 16:38:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "3'",
}

@InBook{Galler:1962:RNG,
  author =       "Bernard A. Galler",
  booktitle =    "The Language of Computers",
  title =        "Random number generators",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  bookpages =    "x + 244",
  pages =        "56--59",
  year =         "1962",
  LCCN =         "QA76.5 .G3",
  bibdate =      "Mon Jan 16 22:35:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  subject =      "MAD (Computer program language); Programming languages
                 (Electronic computers)",
}

@Article{Gordon:1962:SND,
  author =       "Basil Gordon and W. H. Mills and L. R. Welch",
  title =        "Some new difference sets",
  journal =      j-CAN-J-MATH,
  volume =       "14",
  number =       "??",
  pages =        "614--625",
  month =        "????",
  year =         "1962",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1962-052-2",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:38:31 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v14/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Book{Hamming:1962:NMS,
  author =       "R. W. (Richard Wesley) Hamming",
  title =        "Numerical methods for scientists and engineers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xvii + 411",
  year =         "1962",
  LCCN =         "QA297 .H28",
  MRclass =      "65.00",
  MRnumber =     "0137279",
  MRreviewer =   "G. E. Forsythe",
  bibdate =      "Mon Aug 6 07:24:38 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "International Series in Pure and Applied Mathematics",
  acknowledgement = ack-nhfb,
  HDnumber =     "51",
  remark =       "Cited in \cite{Sterbenz:1974:FPC}.",
  subject =      "Numerical analysis; Electronic digital computers;
                 random numbers",
  tableofcontents = "1. The difference calculus \\
                 2. Roundoff noise \\
                 3. The summation calculus \\
                 4. Evaluation of infinite series \\
                 5. Finite difference equations \\
                 6. The finite Fourier series \\
                 7--9. Polynomial approximation introduction \\
                 10. A uniform method for finding formulas \\
                 11. On finding the error term of a formula \\
                 12. Formulas for definite integrals \\
                 13. Indefinite integrals \\
                 14. Introduction to differential equations \\
                 15. A general theory of predictor-corrector methods \\
                 16. Special methods of integrating ordinary
                 differential equations \\
                 17--18. Least squares theory and practice \\
                 19. Chebyshev polynomials \\
                 20. Rational functions \\
                 21--22. Periodic functions --- Fourier series \\
                 23. Nonperiodic functions --- the Fourier integral \\
                 24. Linear filters --- smoothing and differentiating
                 \\
                 25. Integrals and differential equations \\
                 26. Exponential approximation \\
                 27. Singularities \\
                 28. On finding zeros \\
                 29. Simultaneous linear algebraic equations \\
                 30. Inversion of matrices and eigenvalues \\
                 31. Some examples of the simulation of situations and
                 processes \\
                 32. Random numbers and Monte Carlo methods \\
                 $N+1$: The art of computing for scientists and
                 engineers",
}

@Article{Hlawka:1962:ABM,
  author =       "Edmund Hlawka",
  title =        "{Zur angen{\"a}herten Berechnung mehrfacher
                 Integrale}. ({German}) [{Toward} approximate
                 calculation of multiple integrals]",
  journal =      j-MONAT-MATH,
  volume =       "66",
  number =       "2",
  pages =        "140--151",
  month =        apr,
  year =         "1962",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01387711",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "65.55",
  MRnumber =     "0143329 (26 \#888)",
  MRreviewer =   "J. F. Koksma",
  bibdate =      "Thu Jan 19 08:38:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/g5m4457x5525866p/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
  language =     "German",
}

@Article{Hull:1962:RNG,
  author =       "T. E. Hull and A. R. Dobell",
  title =        "Random Number Generators",
  journal =      j-SIAM-REVIEW,
  volume =       "4",
  number =       "3",
  pages =        "230--254",
  month =        jul,
  year =         "1962",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1004061",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Wed Jun 22 07:53:49 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://link.aip.org/link/?SIR/4/230/1;
                 https://dspace.library.uvic.ca:8443/bitstream/handle/1828/3142/Random_Number_Generators.pdf?sequence=3",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
}

@TechReport{Marsaglia:1962:FPG,
  author =       "G. Marsaglia and M. D. Maclaren and T. A. Bray",
  title =        "A Fast Procedure for Generating Normal Random
                 Variables",
  type =         "Mathematical note",
  number =       "282",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  month =        aug,
  year =         "1962",
  bibdate =      "Tue Jun 21 18:58:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/cgi-bin/GetTRDoc?Location=U2&doc=GetTRDoc.pdf&AD=AD0296195",
  abstract =     "A discussion is given of the generation of normal
                 random variables very rapidly in a computer --- for
                 example, at the rate of 10,000--15,000 per second in
                 the IBM 7090. The method is suitable for any computer.
                 The incorporation of successive improvements has led to
                 a procedure which is fairly easy to program, requires
                 little storage, 300--400 constants, is very fast (it
                 takes about as long to generate the normal $x$ as the
                 uniform $u$ from which it comes), and is completely
                 accurate, in the sense that in theory the procedure
                 returns a random variable with exactly the required
                 distribution; in practice the result is an
                 approximation influenced only by the capacity (word
                 length) of the computer.",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1962:IPM,
  author =       "George Marsaglia",
  title =        "Improving the Polar Method for Generating a Pair of
                 Normal Random Variables",
  type =         "Technical report",
  number =       "D1-82-0203",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  month =        sep,
  year =         "1962",
  bibdate =      "Tue Jun 21 18:17:38 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1962:RVC,
  author =       "George Marsaglia",
  title =        "Random Variables and Computers",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "??",
  month =        may,
  year =         "1962",
  bibdate =      "Wed Nov 12 07:29:32 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0278358",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1962:SPG,
  author =       "George Marsaglia and T. A. Bray",
  title =        "A small procedure for generating normal random
                 variables",
  type =         "Mathematical note",
  number =       "283",
  institution =  "Boeing Scientific Research Labs",
  address =      "Seattle, WA, USA",
  pages =        "??",
  month =        nov,
  year =         "1962",
  bibdate =      "Wed Jun 22 09:24:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{MendesFrance:1962:CMF,
  author =       "M. {Mend{\`e}s France}",
  title =        "Calcul des moyennes des fonctions al{\'e}atoires ou
                 pseudo-al{\'e}atoires par {\'e}chantillonnage.
                 ({French}) [Averaging functions of random or
                 pseudo-random sampling]",
  journal =      "Publ. Inst. Statist. Univ. Paris",
  volume =       "11",
  number =       "??",
  pages =        "225--256",
  month =        "????",
  year =         "1962",
  CODEN =        "????",
  ISSN =         "????",
  MRnumber =     "MR 150793",
  bibdate =      "Thu Jan 19 07:14:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Pathria:1962:SSR,
  author =       "R. K. Pathria",
  title =        "A Statistical Study of Randomness Among the First $
                 10, 000 $ Digits of $ \pi $",
  journal =      j-MATH-COMPUT,
  volume =       "16",
  number =       "78",
  pages =        "188--197",
  month =        apr,
  year =         "1962",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "5'",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Richtmyer:1962:CFE,
  author =       "R. D. Richtmyer and Marjorie Devaney and N.
                 Metropolis",
  title =        "Continued fraction expansions of algebraic numbers",
  journal =      j-NUM-MATH,
  volume =       "4",
  pages =        "68--84",
  month =        dec,
  year =         "1962",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "10.09",
  MRnumber =     "MR0136574 (25 \#44)",
  MRreviewer =   "H. Cohn",
  bibdate =      "Thu Dec 22 07:42:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0101.28101",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  HDnumber =     "105",
  journal-URL =  "http://link.springer.com/journal/211",
}

@Article{Scheuer:1962:GNR,
  author =       "E. M. Scheuer and D. S. Stoller",
  title =        "On the Generation of Normal Random Vectors",
  journal =      j-TECHNOMETRICS,
  volume =       "4",
  number =       "??",
  pages =        "278--281",
  month =        "????",
  year =         "1962",
  CODEN =        "TCMTA2",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html;
                 http://www.tandfonline.com/loi/utch20",
}

@Article{Shanks:1962:CD,
  author =       "Daniel Shanks and John W. {Wrench, Jr.}",
  title =        "Calculation of $ \pi $ to 100,000 Decimals",
  journal =      j-MATH-COMPUT,
  volume =       "16",
  number =       "77",
  pages =        "76--99",
  month =        jan,
  year =         "1962",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  HDnumber =     "110",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Sibuya:1962:FCN,
  author =       "Masaaki Sibuya",
  title =        "Further consideration on normal random variable
                 generator",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "14",
  number =       "1",
  pages =        "159--165",
  month =        dec,
  year =         "1962",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02868636",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 16:59:47 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02868636",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Spanier:1962:UAM,
  author =       "J. Spanier",
  title =        "A Unified Approach to {Monte Carlo} methods and an
                 Application to a Multigroup Calculation of Absorption
                 Rates",
  journal =      j-SIAM-REVIEW,
  volume =       "4",
  number =       "2",
  pages =        "115--134",
  month =        apr,
  year =         "1962",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1004030",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:04:51 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/4/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://www.jstor.org/stable/2028365",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  HDnumber =     "113",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "April 1962",
}

@Book{Todd:1962:SNA,
  editor =       "John Todd",
  title =        "Survey of Numerical Analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xvi + 589",
  year =         "1962",
  LCCN =         "????",
  bibdate =      "Mon Jun 27 16:07:06 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  HDnumber =     "126",
}

@Book{Walsh:1962:HNS,
  author =       "J. E. Walsh",
  title =        "Handbook of Nonparametric Statistics",
  publisher =    "Van Nostrand",
  address =      "Princeton, NJ, USA",
  pages =        "xxvi + 549",
  year =         "1962",
  LCCN =         "QA278.8 .W34",
  bibdate =      "Mon Jan 16 22:37:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Tests of randomness",
}

@Article{Allard:1963:MCR,
  author =       "J. L. Allard and A. R. Dobell and T. E. Hull",
  title =        "Mixed Congruential Random Number Generators for
                 Decimal Machines",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "2",
  pages =        "131--141",
  month =        apr,
  year =         "1963",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321160.321163",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Anonymous:1963:BRBd,
  author =       "Anonymous",
  title =        "Book Review: {{\booktitle{Random Variables and
                 Probability Distributions}} by H. Cram{\'e}r}",
  journal =      j-BIOMETRIKA,
  volume =       "50",
  number =       "1/2",
  pages =        "232--233",
  month =        jun,
  year =         "1963",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2333784",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 14:33:11 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315447;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2333784",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://www.jstor.org/journals/00063444.html",
}

@Article{Barnes:1963:CEG,
  author =       "George H. Barnes",
  title =        "Comment on {``An Electronic Generator of Random
                 Numbers''}",
  journal =      j-IEEE-TRANS-ELEC-COMPUT,
  volume =       "EC-12",
  number =       "1",
  pages =        "22--22",
  month =        feb,
  year =         "1963",
  CODEN =        "IEECA8",
  DOI =          "https://doi.org/10.1109/PGEC.1963.263393",
  ISSN =         "0367-7508",
  bibdate =      "Thu Jul 14 08:10:36 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Dillard:1962:EGR}.",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037766",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Electronic Computers",
}

@Article{Bolshev:1963:APT,
  author =       "L. N. Bol'shev",
  title =        "Asymptotically {Pearson} Transformations",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "8",
  number =       "2",
  pages =        "121--146",
  month =        "????",
  year =         "1963",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1108012",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:34:47 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/8/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1963",
}

@Article{DeMatteis:1963:SAP,
  author =       "A. {De Matteis} and B. Faleschini",
  title =        "Some arithmetical properties in connection with
                 pseudo-random numbers",
  journal =      j-BOLL-UNIONE-MAT-ITAL,
  volume =       "18",
  number =       "??",
  pages =        "171--184",
  month =        "????",
  year =         "1963",
  CODEN =        "BLUMAM",
  ISSN =         "0041-7084",
  bibdate =      "Fri Jan 6 10:17:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bollettino della Unione matematica italiana",
}

@Article{Firestone:1963:CNU,
  author =       "C. D. Firestone and J. E. Hanson",
  title =        "Classroom Notes: Uncorrelated {Gaussian} Dependent
                 Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "70",
  number =       "6",
  pages =        "659--660",
  month =        jun # "\slash " # jul,
  year =         "1963",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:37:09 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Book{Fisher:1963:STB,
  author =       "{Sir} Ronald Aylmer Fisher and Frank Yates",
  title =        "Statistical Tables for Biological, Agricultural and
                 Medical Research",
  publisher =    pub-OLIVER-BOYD,
  address =      pub-OLIVER-BOYD:adr,
  edition =      "Sixth",
  pages =        "x + 146",
  year =         "1963",
  ISBN =         "0-05-000872-2, 0-582-44525-6",
  ISBN-13 =      "978-0-05-000872-0, 978-0-582-44525-3",
  LCCN =         "QH324 .F52 1963",
  bibdate =      "Mon Jun 29 11:28:52 2020",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fisher-ronald-aylmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Ronald Aylmer Fisher (17 February 1890--29 July
                 1962)",
  remark =       "This book contains one of the early pre-computer
                 tabulations of pseudorandom numbers.",
  subject =      "Statistics; Charts, diagrams, etc",
  xxaddress =    "Burnt Mill, UK",
  xxpublisher =  "Longman",
}

@Article{Franklin:1963:DSR,
  author =       "Joel N. Franklin",
  title =        "Deterministic Simulation of Random Processes",
  journal =      j-MATH-COMPUT,
  volume =       "17",
  number =       "81",
  pages =        "28--59",
  month =        jan,
  year =         "1963",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2003733",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Gabai:1963:DCSa,
  author =       "H. Gabai",
  title =        "On the discrepancy of certain sequences $ \bmod 1 $",
  journal =      "Nederl. Akad. Wetensch. Proc. Ser. A",
  volume =       "66",
  number =       "??",
  pages =        "603--605",
  month =        "????",
  year =         "1963",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 06:46:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0129.03102",
  acknowledgement = ack-nhfb,
  fjournal =     "Nederlandse Akademie van Wetenschappen. Proceedings.
                 Series A. Indagationes Mathematicae",
}

@Article{Gabai:1963:DCSb,
  author =       "H. Gabai",
  title =        "On the discrepancy of certain sequences $ \bmod 1 $",
  journal =      j-INDAG-MATH,
  volume =       "25",
  number =       "??",
  pages =        "603--605",
  month =        "????",
  year =         "1963",
  CODEN =        "IMTHBJ",
  ISSN =         "0019-3577, 0023-3358",
  ISSN-L =       "0019-3577",
  MRnumber =     "MR 155812",
  bibdate =      "Thu Jan 19 06:46:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Indagationes Mathematic{\ae}",
}

@Article{George:1963:ANR,
  author =       "R. George",
  title =        "{Algorithm 200}: {Normal} Random",
  journal =      j-CACM,
  volume =       "6",
  number =       "8",
  pages =        "444",
  month =        aug,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu Sep 08 09:31:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Pike:1965:CAGb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Gill:1963:WDP,
  author =       "Arthur Gill",
  title =        "On a Weight Distribution Problem, with Application to
                 the Design of Stochastic Generators",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "110--122",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321150.321159",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Hoeffding:1963:PIS,
  author =       "Wassily Hoeffding",
  title =        "Probability inequalities for sums of bounded random
                 variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "58",
  number =       "301",
  pages =        "13--30",
  month =        mar,
  year =         "1963",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Fri Jan 6 09:58:25 2012",
  bibsource =    "Ai/colt.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2282952",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Jagerman:1963:AFS,
  author =       "David L. Jagerman",
  title =        "The autocorrelation function of a sequence uniformly
                 distributed modulo $1$",
  journal =      j-ANN-MATH-STAT,
  volume =       "34",
  number =       "4",
  pages =        "1243--1252",
  month =        dec,
  year =         "1963",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Mon Jan 16 22:32:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2238334",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Kolmogorov:1963:TRN,
  author =       "A. N. Kolmogorov",
  title =        "On tables of random numbers",
  journal =      j-SANKHYA-A,
  volume =       "25",
  number =       "??",
  pages =        "369--376",
  month =        "????",
  year =         "1963",
  CODEN =        "SANABS",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jan 16 22:33:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series A.
                 Methods and Techniques",
  journal-URL =  "https://www.jstor.org/journal/sankhyaseriesa",
}

@Article{Laughlin:1963:RAR,
  author =       "Donald L. Laughlin",
  title =        "Remark on {Algorithm 133}: {Random}",
  journal =      j-CACM,
  volume =       "6",
  number =       "3",
  pages =        "105--105",
  month =        mar,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:45 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@TechReport{MacLaren:1963:FPG,
  author =       "M. D. MacLaren and G. Marsaglia and T. A. Bray",
  title =        "A Fast Procedure for Generating Exponential Random
                 Variables",
  type =         "Report",
  number =       "??",
  institution =  "Boeing Scientific Research Labs",
  address =      "Seattle, WA, USA",
  pages =        "??",
  month =        jan,
  year =         "1963",
  bibdate =      "Tue Jun 21 18:58:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A very fast method for generating exponential random
                 variables in a digital computer is presented. The
                 method is exact, in the sense that in theory it returns
                 a random variable with exactly the exponential
                 distribution. In practice the result is an
                 approximation, but the accuracy of the approximation
                 depends only on the word length of the computer.",
  acknowledgement = ack-nhfb,
  remark =       "Published in \cite{MacLaren:1964:FPG}.",
}

@TechReport{Magleby:1963:SNF,
  author =       "K. B. Magleby",
  title =        "The synthesis of nonlinear feedback shift registers",
  type =         "Report",
  number =       "TR 6207-1",
  institution =  "Stanford Electronics Laboratory",
  address =      "Stanford, CA, USA",
  year =         "1963",
  bibdate =      "Tue Feb 07 11:14:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:1963:GDR,
  author =       "G. Marsaglia",
  title =        "Generating discrete random variables in a computer",
  journal =      j-CACM,
  volume =       "6",
  number =       "1",
  pages =        "37--38",
  month =        jan,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:44 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7628",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@TechReport{Marsaglia:1963:RNF,
  author =       "George Marsaglia",
  title =        "Random numbers fall mainly in the planes",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "9",
  month =        aug,
  year =         "1963",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0685578",
  abstract =     "Most of the world's computer centers use congruential
                 random number generators. This note points out that
                 such random number generators produce points in $ 2, 3,
                 4, \ldots {} $ dimensions which are too regular for
                 many Monte Carlo calculations. The trouble is that the
                 points fall exactly on a lattice with quite a gross
                 structure. The paper gives details of the degree of
                 regularity of such generators in terms of sets of
                 relatively few parallel hyperplanes which contain all
                 of the points produced by the generator.",
  acknowledgement = ack-nhfb,
}

@Book{Moses:1963:TRP,
  author =       "Lincoln E. Moses and Robert V. Oakford",
  title =        "Tables of random permutations",
  publisher =    pub-STANFORD,
  address =      pub-STANFORD:adr,
  pages =        "233",
  year =         "1963",
  LCCN =         "QA165 .M6",
  bibdate =      "Thu Mar 1 08:41:02 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Permutations; Tables; Stochastic processes",
}

@Article{Poore:1963:CAR,
  author =       "Jesse H. {Poore, Jr.}",
  title =        "Certification of {Algorithm 133}: {Random}",
  journal =      j-CACM,
  volume =       "6",
  number =       "4",
  pages =        "167--167",
  month =        apr,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:46 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Tucker:1963:QCS,
  author =       "Howard G. Tucker",
  title =        "Quasi-Convergent Series of Independent Random
                 Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "70",
  number =       "7",
  pages =        "718--722",
  month =        aug # "\slash " # sep,
  year =         "1963",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:37:11 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Ahsanullah:1964:RVE,
  author =       "Mohammad Ahsanullah",
  title =        "Record values of exponentially distributed random
                 variables",
  journal =      j-STAT-PAPERS,
  volume =       "22",
  number =       "2",
  pages =        "121--127",
  month =        jun,
  year =         "1964",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02933548",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  bibdate =      "Sun Feb 1 10:11:57 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statpapers.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02933548",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers",
  journal-URL =  "http://link.springer.com/journal/362",
}

@Article{Alanen:1964:TFF,
  author =       "J. D. Alanen and Donald E. Knuth",
  title =        "Tables of finite fields",
  journal =      j-SANKHYA-A,
  volume =       "26",
  number =       "??",
  pages =        "305--328",
  year =         "1964",
  CODEN =        "SANABS",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  MRclass =      "12.20 (33.00)",
  MRnumber =     "32 #4122",
  MRreviewer =   "J. J. Stone",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series A.
                 Methods and Techniques",
  journal-URL =  "https://www.jstor.org/journal/sankhyaseriesa",
}

@Article{Bekessy:1964:RBD,
  author =       "Andr{\'a}s B{\'e}k{\'e}ssy",
  title =        "Remarks on beta distributed random numbers",
  journal =      "Magyar Tud. Akad. Mat. Kutat{\'o} Int. K{\"o}zl.",
  volume =       "9",
  pages =        "565--571",
  year =         "1964",
  MRclass =      "65.15",
  MRnumber =     "MR0195232 (33 #3435)",
  MRreviewer =   "J. H. Halton",
  bibdate =      "Thu Mar 8 21:21:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Publications of the Mathematical Institute of the
                 Hungarian Academy of Sciences, Series B, Fascicle 4",
}

@Article{Brillinger:1964:BRI,
  author =       "David R. Brillinger",
  title =        "Book Reviews: {{\em Information and Information
                 Stability of Random Variables and Processes}}, by {M.
                 S. Pinsker} and {Amiel Feinstein}",
  journal =      j-APPL-STAT,
  volume =       "13",
  number =       "2",
  pages =        "134--135",
  year =         "1964",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:18:17 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Chow:1964:RNG,
  author =       "D. K. Chow",
  title =        "Random number generator test procedures applied to a
                 modified, multiplicative, congruential generator
                 method",
  number =       "UIUCDCS-R-1964-612",
  institution =  "Department of Computer Science, University of Illinois
                 at Urbana-Champaign",
  address =      "Urbana, Illinois",
  year =         "1964",
  bibdate =      "Tue Mar 06 20:45:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Durstenfeld:1964:ARP,
  author =       "Richard Durstenfeld",
  title =        "{Algorithm 235}: {Random} permutation",
  journal =      j-CACM,
  volume =       "7",
  number =       "7",
  pages =        "420--420",
  month =        jul,
  year =         "1964",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/364520.364540",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:54 MST 2005",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Esmenjaud-Bonnardel:1964:PGN,
  author =       "M. Esmenjaud-Bonnardel",
  title =        "Un proc{\'e}d{\'e} de g{\'e}n{\'e}ration de nombres
                 `pseudo-al{\'e}atoires' pour {CAB 500}. ({French}) [{A}
                 procedure for the generation of pseudorandom numbers on
                 the {CAB 500}]",
  journal =      j-CHIFFRES,
  volume =       "7",
  number =       "??",
  pages =        "185--197",
  month =        "????",
  year =         "1964",
  CODEN =        "????",
  ISSN =         "0245-9922",
  bibdate =      "Mon Jan 16 22:28:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Chiffres: Revue de l'Association fran{\c{c}}aise de
                 Calcul",
  language =     "French",
  xxISSN =       "0556-7823",
  xxjournal =    "Revue Fran{\c{c}}aise de Traitement de l'Information",
}

@Article{Gebhardt:1964:GND,
  author =       "Friedrich Gebhardt",
  title =        "Generating Normally Distributed Random Numbers by
                 Inverting the Normal Distribution Function (in
                 {Technical Notes and Short Papers})",
  journal =      j-MATH-COMPUT,
  volume =       "18",
  number =       "86",
  pages =        "302--306",
  month =        apr,
  year =         "1964",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7308",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Halton:1964:ARI,
  author =       "J. H. Halton",
  title =        "{Algorithm 247}: {Radical}-inverse quasi-random point
                 sequence",
  journal =      j-CACM,
  volume =       "7",
  number =       "12",
  pages =        "701--702",
  month =        dec,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:57 MST 2005",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Hammer:1964:GRN,
  author =       "C. Hammer and L. Green",
  title =        "Generation of Random Numbers",
  journal =      "Instruments and Control Systems",
  volume =       "37",
  number =       "5",
  pages =        "149--150",
  month =        "????",
  year =         "1964",
  CODEN =        "INCSA7",
  ISSN =         "0020-4404",
  bibdate =      "Mon Jan 16 22:29:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Hammersley:1964:MCM,
  author =       "J. M. Hammersley and D. C. Handscomb",
  title =        "{Monte Carlo} methods",
  publisher =    "Methuen",
  address =      "London, UK",
  pages =        "vii + 178",
  year =         "1964",
  LCCN =         "QA273 .H354 1964",
  bibdate =      "Fri Jan 06 10:30:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Methuen's monographs on applied probability and
                 statistics",
  acknowledgement = ack-nhfb,
  remark =       "Co-published by Wiley.",
  tableofcontents = "1. The general nature of Monte Carlo methods \\
                 2. Short resume of statistical terms \\
                 3. Random, pseudorandom, and quasirandom numbers \\
                 4. Direct simulation \\
                 S. General principles of the Monte Carlo method \\
                 6. Conditioned Monte Carlo \\
                 7. Solution of linear operator equations \\
                 8. Radiation shielding and reactor criticality \\
                 9. Problems in statistical mechanics \\
                 10. Long polymer molecules \\
                 11. Percolation processes \\
                 12. Multivariate problems",
}

@Article{Hull:1964:MCR,
  author =       "T. E. Hull and A. R. Dobell",
  title =        "Mixed Congruential Random Number Generators for Binary
                 Machines",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "31--40",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321208",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Random number generators of the mixed congruential
                 type have recently been proposed. They appear to have
                 some advantages over those of the multiplicative type,
                 except that their statistical behavior is
                 unsatisfactory in some cases. It is shown theoretically
                 that a certain class of these mixed generators should
                 be expected to fail statistical tests for randomness.
                 Extensive testing confirms this hypothesis and makes
                 possible a more precise definition of the
                 unsatisfactory class. It is concluded that the
                 advantages of mixed generators can be realized only in
                 special circumstances. On machines with relatively
                 short multiplication times the multiplicative
                 generators are to be preferred.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Jagerman:1964:AJD,
  author =       "David L. Jagerman",
  title =        "The Autocorrelation and Joint Distribution Functions
                 of the Sequences $ \bigg \{ \frac {a}{m}j^2 \bigg \},
                 \bigg \{ \frac {a}{m}(j + \tau)^2 \bigg \} $",
  journal =      j-MATH-COMPUT,
  volume =       "18",
  number =       "86",
  pages =        "211--232",
  month =        apr,
  year =         "1964",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Jansson:1964:ABP,
  author =       "Birger Jansson",
  title =        "Autocorrelations between Pseudo-Random Numbers",
  journal =      j-NORDISK-TIDSKR-INFORM-BEHAND,
  volume =       "4",
  number =       "1",
  pages =        "6--27",
  month =        mar,
  year =         "1964",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01939521",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 18:52:08 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=4&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=4&issue=1&spage=6",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Jansson:1964:GRB,
  author =       "Birger Jansson",
  title =        "Generation of Random Bivariate Normal Deviates and
                 Computation of Related Integrals",
  journal =      j-NORDISK-TIDSKR-INFORM-BEHAND,
  volume =       "4",
  number =       "4",
  pages =        "205--212",
  month =        dec,
  year =         "1964",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01939512",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 18:52:08 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=4&issue=4;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=4&issue=4&spage=205",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Johnk:1964:EBG,
  author =       "M. D. J{\"o}hnk",
  title =        "{Erzeugung von betaverteilten und gammaverteilten
                 Zufallszahlen}. ({German}) [{Production} of beta- and
                 gamma-distributed random numbers]",
  journal =      j-METRIKA,
  volume =       "8",
  number =       "1",
  pages =        "5--15",
  month =        dec,
  year =         "1964",
  CODEN =        "MTRKA8",
  DOI =          "https://doi.org/10.1007/BF02613706",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Mon Feb 2 16:27:32 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metrika.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02613706",
  ZMnumber =     "0117.13203",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika",
  journal-URL =  "http://link.springer.com/journal/184",
  keywords =     "{probability theory}",
  language =     "German",
}

@Article{Kronmal:1964:EPN,
  author =       "Richard Kronmal",
  title =        "Evaluation of a Pseudorandom Normal Number Generator",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "357--363",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321229.321238",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:45:35 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  descriptors =  "RVG",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InProceedings{Liu:1964:MFS,
  author =       "R. Liu and J. Massey",
  editor =       "????",
  booktitle =    "Proceedings of the 2nd Allerton Conference on Circuit
                 and System Theory. University of Illinois, Urbana,
                 1964",
  title =        "Monotone feedback shift registers",
  publisher =    "????",
  address =      "????",
  pages =        "860--874",
  year =         "1964",
  LCCN =         "????",
  bibdate =      "Tue Feb 07 11:12:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{MacLaren:1964:FPG,
  author =       "M. D. MacLaren and G. Marsaglia and T. A. Bray",
  title =        "A fast procedure for generating exponential random
                 variables",
  journal =      j-CACM,
  volume =       "7",
  number =       "5",
  pages =        "298--300",
  month =        may,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:53 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0127.09101",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7614",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "numerical analysis; PRNG (pseudo-random number
                 generator)",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Marsaglia:1964:CMG,
  author =       "G. Marsaglia and T. A. Bray",
  title =        "A Convenient Method for Generating Normal Variables",
  journal =      j-SIAM-REVIEW,
  volume =       "6",
  number =       "3",
  pages =        "260--264",
  month =        "????",
  year =         "1964",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1006063",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65.15",
  MRnumber =     "30 \#2660",
  MRreviewer =   "D. H. Lehmer",
  bibdate =      "Thu Mar 27 09:05:15 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/6/3;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib;
                 MathSciNet database",
  URL =          "http://www.jstor.org/stable/2027592",
  ZMnumber =     "0125.08001",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  keywords =     "numerical analysis",
  onlinedate =   "July 1964",
}

@Article{Marsaglia:1964:FPG,
  author =       "G. Marsaglia and M. D. MacLaren and T. A. Bray",
  title =        "A fast procedure for generating normal random
                 variables",
  journal =      j-CACM,
  volume =       "7",
  number =       "1",
  pages =        "4--10",
  month =        jan,
  year =         "1964",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/363872.363883",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:51 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0127.09005",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7637",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "numerical analysis; PRNG (pseudo-random number
                 generator)",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@TechReport{Marsaglia:1964:MPR,
  author =       "George Marsaglia",
  title =        "A Method for Producing Random Variables in a
                 Computer",
  type =         "Mathematical note",
  number =       "342",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  pages =        "13",
  month =        feb,
  year =         "1964",
  bibdate =      "Tue Jun 21 18:14:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper describes a general procedure for producing
                 random variables in a computer. The idea is to
                 represent the required $X$ in the form: $ X = C (M +
                 U_1 + U_2 + U_3) $, some 97--99\% of the time, where c
                 is constant, $M$ is a discrete random variable taking
                 perhaps $8$ values, and the $U$'s are uniform random
                 variables; the other 1--3\% of the time, $X$ is
                 generated from a residual density by the rejection
                 technique. These two methods for producing $X$ are
                 combined in the proper proportions in order that the
                 resulting distribution for $X$ be correct. The method
                 is general in that it applies to a wide variety of
                 density functions. Programs based on this procedure are
                 very fast and require little computer storage space ---
                 typically, 18 constants and 20 instructions.",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1964:RDA,
  author =       "George Marsaglia",
  title =        "The Radiation Dose Accumulated by Blood Diverted
                 Through a Shunt",
  type =         "Mathematical note",
  number =       "357",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  pages =        "8",
  month =        jul,
  year =         "1964",
  bibdate =      "Tue Jun 21 19:32:04 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Modern techniques have made it possible to divert a
                 portion of the circulating blood through a shunt
                 outside the body --- for example in heart-lung
                 machines, artificial kidneys, and coiled tubes where
                 the blood may be exposed to radiation without danger to
                 body tissues. There is some probability theory
                 connected with such procedures, for the cells of the
                 blood are thoroughly mixed in the body, and hence the
                 number of times a blood cell passes through the shunt
                 is a random variable. Several papers have been written
                 to describe such systems by differential equations;
                 this paper discusses the problem directly in terms of
                 probability theory, finding the exact distribution of
                 the number of times a blood cell has passed through the
                 shunt and, in addition, a normal approximation which
                 makes calculation of accumulated doses a matter of
                 simple arithmetic.",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1964:RNV,
  author =       "George Marsaglia",
  title =        "Ratios of normal variables and ratios of sums of
                 variables",
  type =         "Mathematical note",
  number =       "D1-82-0348",
  institution =  "Mathematics Research Laboratory, Boeing Scientific
                 Research Laboratories",
  address =      "Seattle, WA, USA",
  pages =        "iii + 13 + 3",
  month =        apr,
  year =         "1964",
  bibdate =      "Wed Nov 12 07:14:08 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0600972;
                 http://www.dtic.mil/dtic/tr/fulltext/u2/600972.pdf;
                 http://www.dtic.mil/get-tr-doc/pdf?AD=AD0600972",
  abstract =     "The principal part of this paper is devoted to the
                 study of the distribution and density functions of the
                 ratio of two normal random variables. It gives several
                 representations of the distribution function in terms
                 of the bivariate normal distribution and Nicholson's
                 $V$ function, both of which have been extensively
                 studied, and for which tables and computational
                 procedures are readily available. One of these
                 representations leads to an easy derivation of the
                 density function in terms of the Cauchy density and the
                 normal density and integral. A number of graphs of the
                 possible shapes of the density are given, together with
                 an indication of when the density is unimodal or
                 bimodal.\par

                 The last part of the paper discusses the distribution
                 of the ratio $ (u_1 + \cdots + u_n) / (v_1 + \cdots +
                 v_m)$ where the $u$'s and $v$'s are, independent,
                 uniform variables. The distribution for all $n$ and $m$
                 is given, and some approximations discussed.",
  acknowledgement = ack-nhfb,
  remark =       "Published in \cite{Marsaglia:1965:RNV}.",
}

@InCollection{Marsaglia:1964:RVC,
  author =       "George Marsaglia",
  title =        "Random variables and computers",
  crossref =     "Kozesnik:1964:TTP",
  pages =        "499--512",
  year =         "1964",
  MRclass =      "65.05 (65.15)",
  MRnumber =     "29 \#1721",
  bibdate =      "Fri Jan 6 09:58:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0123.36205",
  acknowledgement = ack-nhfb,
  keywords =     "probability theory",
}

@TechReport{Marsaglia:1964:SPIa,
  author =       "George Marsaglia",
  title =        "Some Problems Involving Circular and Spherical
                 Targets",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "19",
  month =        apr,
  year =         "1964",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0600566",
  abstract =     "This article is concerned with some problems which
                 occur in certain tactical considerations: how should
                 one place $k$ circles (spheres) in the plane (3-space)
                 so that their union has the greatest standard normal
                 probability measure, that is, so as to maximize the
                 probability that a random normal point will fall in one
                 or more of the circles (spheres). For $ k > 3$ the
                 problem seems hopeless, (except for certain special
                 situations); the case for $ k = 3$ is still unresolved
                 and is being worked on by a number of investigators,
                 and the case for $ k = 2$ is solved completely in this
                 paper. The results for $ k = 2$ have some practical
                 value when applied to actual problems arising in
                 tactical considerations, and some theoretical value, as
                 a method of attacking the problem for $ k > 3$.",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:1964:SPIb,
  author =       "George Marsaglia",
  title =        "Some Problems Involving Circular and Spherical
                 Targets",
  journal =      j-OPER-RES,
  volume =       "13",
  number =       "1",
  pages =        "18--27",
  month =        jan # "\slash " # feb,
  year =         "1964",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.13.1.18",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Tue Jun 21 18:50:19 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/167951",
  abstract =     "This article is concerned with some problems that
                 occur in certain tactical considerations: how should
                 one place $k$ circles [spheres] in the plane [3-space]
                 so that their union has the greatest standard normal
                 probability measure, that is, so as to maximize the
                 probability that a random normal point will fall in one
                 or more of the circles [spheres]. For $ k > 3 $ the
                 problem seems hopeless, (except for certain special
                 situations); the case for $ k = 3 $ is still unresolved
                 and is being worked on by a number of investigators,
                 and the case for $ k = 2 $ is solved completely in this
                 paper. The results for $ k = 2 $ have some practical
                 value when applied to actual problems arising in
                 tactical considerations, and some theoretical value, as
                 a method of attacking the problem for $ k \geq 3 $.",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Book{Onicescu:1964:NSA,
  author =       "O. Onicescu",
  title =        "Nombres et syst{\`e}mes al{\'e}atoires. ({French})
                 [Random numbers and systems]",
  publisher =    "{\'E}ditions Eyrolles",
  address =      "Paris, France",
  pages =        "280",
  year =         "1964",
  LCCN =         "????",
  MRnumber =     "MR 172314",
  bibdate =      "Thu Jan 19 07:59:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0105.11404",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Book{Poore:1964:CPG,
  author =       "Jesse H. Poore",
  title =        "Computational procedures for generating and testing
                 random numbers",
  publisher =    "Division of Business and Economic Research, School of
                 Business Administration, Louisiana Polytechnic
                 Institute",
  address =      "Ruston, UK",
  pages =        "36",
  year =         "1964",
  LCCN =         "QA273 .P78",
  bibdate =      "Tue Apr 29 20:39:05 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat1960.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities",
}

@Article{Sobol:1964:PPR,
  author =       "I. M. Sobol'",
  title =        "Periods of pseudo-random sequences",
  journal =      "Teor. Verojatnost. i Primenen.",
  volume =       "9",
  pages =        "367--373",
  year =         "1964",
  CODEN =        "????",
  ISSN =         "0040-361X",
  MRclass =      "60.99 (65.15)",
  MRnumber =     "0163334 (29 \#637)",
  MRreviewer =   "G. E. Noether",
  bibdate =      "Thu Jan 19 08:19:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Akademija Nauk SSSR. Teorija Verojatnoste{\u\i} i ee
                 Primenenija",
}

@Article{Stockmal:1964:CPR,
  author =       "Frank Stockmal",
  title =        "Calculations with Pseudo-Random Numbers",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "41--52",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321209",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Book{Tocher:1964:AS,
  author =       "K. D. Tocher",
  title =        "The Art of Simulation",
  publisher =    "Van Nostrand",
  address =      "Princeton, NJ, USA",
  pages =        "viii + 184",
  year =         "1964",
  LCCN =         "TA177 .T6",
  bibdate =      "Tue Jun 19 05:33:49 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Simulation methods",
  tableofcontents = "1. Introduction \\
                 2. Sampling from a distribution \\
                 3. More sampling methods \\
                 4. Random number tables \\
                 5. Random number generators \\
                 6. Pseudo-random numbers \\
                 7. Elementary sampling experiments \\
                 8. Flow diagrams \\
                 9. Estimation \\
                 10. Simple queuing problems \\
                 11. Further queue problems \\
                 12. General simulation problems \\
                 13. Design of simulation experiments",
}

@Article{Barker:1965:MCC,
  author =       "A. A. Barker",
  title =        "{Monte Carlo} Calculations of the Radial Distribution
                 Functions for a Proton-Electron Plasma",
  journal =      j-AUSTRALIAN-J-PHYS,
  volume =       "18",
  number =       "??",
  pages =        "119--133",
  month =        "????",
  year =         "1965",
  CODEN =        "AUJPAS",
  ISSN =         "0004-9506 (print), 1446-5582 (electronic)",
  ISSN-L =       "0004-9506",
  bibdate =      "Tue Feb 07 12:05:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Journal of Physics",
  journal-URL =  "http://www.publish.csiro.au/ph/content/allissues",
  remark =       "See \cite[page 255, column 2]{Hitchcock:2003:HMH} and
                 \cite{Peskun:1973:OMC} for the relation of this work to
                 \cite{Metropolis:1953:ESC}.",
}

@Book{Barnett:1965:RNE,
  author =       "Vic D. Barnett",
  title =        "Random negative exponential deviates; 2 pair-wise
                 correlated sets of 10,000 observations: with facilities
                 for the generation of random $ \chi^2 $ deviates on any
                 integral number of degrees of freedom",
  volume =       "27",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxii + 89",
  year =         "1965",
  LCCN =         "QA47 .T7 no. 27",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Tracts for computers",
  acknowledgement = ack-nhfb,
  subject =      "Sampling (Statistics); Stochastic processes",
}

@Article{Franklin:1965:NSS,
  author =       "Joel N. Franklin",
  title =        "Numerical Simulation of Stationary and Non-Stationary
                 {Gaussian} Random Processes",
  journal =      j-SIAM-REVIEW,
  volume =       "7",
  number =       "1",
  pages =        "68--80",
  month =        "????",
  year =         "1965",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1007007",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRnumber =     "MR 179913",
  bibdate =      "Thu Mar 27 09:05:20 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/7/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "January 1965",
}

@Book{Golenko:1965:MSA,
  author =       "D. I. Golenko",
  title =        "Modelirovanie i statisticheskii analiz
                 psevdosluchainykh chisel na elektronnykh
                 vychislitelnykh mashinakh. ({Russian}) [{The} method of
                 statistical testing (The {Monte Carlo} method)]",
  publisher =    "Izdatelstvo ``Nauka''",
  address =      "Moscow, USSR",
  pages =        "227",
  year =         "1965",
  LCCN =         "????",
  MRclass =      "65.15 (10.03)",
  MRnumber =     "0187370 (32 \#4822)",
  MRreviewer =   "D. H. Lehmer",
  bibdate =      "Wed Jan 18 18:08:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Greenberger:1965:MR,
  author =       "Martin Greenberger",
  title =        "Method in randomness",
  journal =      j-CACM,
  volume =       "8",
  number =       "3",
  pages =        "177--179",
  month =        mar,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:59 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Certain nonrandom properties of a commonly used random
                 number generator are described and analyzed.",
  acknowledgement = ack-nhfb,
  checked =      "19940404",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "CDC 1604; floating-point arithmetic; PRNG
                 (pseudo-random number generator); triple-precision
                 floating-point arithmetic",
  sjb =          "Points out that random number generators aren't always
                 particularly random and that you should test the
                 randomness properties of an algorithm yourself before
                 using it in your code.",
}

@Article{Hampton:1965:EUP,
  author =       "Robert L. Hampton",
  title =        "Experiments Using Pseudo-Random Noise",
  journal =      j-SIMULATION,
  volume =       "4",
  number =       "4",
  pages =        "246--254",
  month =        apr,
  year =         "1965",
  CODEN =        "SIMUA2",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 12:00:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/4/4/246.abstract",
  abstract =     "This paper describes the results of experiments per
                 formed with pseudo-random noise sequences. It is shown
                 that Gaussian noise can be easily produced from such
                 sequences. It is also demonstrated that the sequences
                 themselves have a binomial probability
                 distribution.\par

                 The correlation technique investigated, using
                 pseudo-random noise, makes possible a continuous
                 recording of a system's impulse response without the
                 use of any sophisticated hardware. The impulse response
                 obtained from the cross-correlation experiment can be
                 approached from either the positive or negative
                 direction, i.e., $ \tau $ can be made not only a time
                 delay, but also a time advance. This enables one to
                 observe the trailing end of a waveform before viewing
                 its leading end. It also permits a quick experimental
                 verification of the correlation property that $ R_{x,
                 y}(\tau) = R_{y, r}( - \tau) $. Examples for a first-
                 and second-order system are given.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Hampton:1965:HAD,
  author =       "R. L. T. Hampton",
  title =        "A Hybrid Analog-Digital Pseudo Random Noise
                 Generator",
  journal =      j-SIMULATION,
  volume =       "4",
  number =       "3",
  pages =        "179--199",
  month =        mar,
  year =         "1965",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754976500400315",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 12:11:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/4/3/179.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Jagerman:1965:STC,
  author =       "D. L. Jagerman",
  title =        "Some Theorems Concerning Pseudo-Random Numbers",
  journal =      j-MATH-COMPUT,
  volume =       "19",
  number =       "91",
  pages =        "418--426",
  month =        jul,
  year =         "1965",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InProceedings{Jansson:1965:ASP,
  author =       "B. Jansson",
  editor =       "????",
  booktitle =    "Proceedings of the {IFIP} Congress",
  title =        "Analytical studies of pseudorandom number generators
                 of the congruential type",
  publisher =    "????",
  address =      "????",
  pages =        "371--372",
  year =         "1965",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 22:24:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:1965:CRS,
  author =       "Donald E. Knuth",
  title =        "Construction of a random sequence",
  journal =      j-NORDISK-TIDSKR-INFORM-BEHAND,
  volume =       "5",
  number =       "4",
  pages =        "246--250",
  year =         "1965",
  CODEN =        "BITTEL, NBITAB",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "10.50 (10.33)",
  MRnumber =     "33 #5599",
  MRreviewer =   "J. H. Halton",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{MacLaren:1965:URN,
  author =       "M. Donald MacLaren and George Marsaglia",
  title =        "Uniform Random Number Generators",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "83--89",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321250.321257",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "65.15",
  MRnumber =     "30 \#687 (MR 170449)",
  bibdate =      "Mon Jan 22 17:05:44 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0143.40101",
  abstract =     "This paper discusses the testing of methods for
                 generating uniform random numbers in a computer---the
                 commonly used multiplicative and mixed congruential
                 generators as well as two new methods. Tests proposed
                 here are more stringent than those usually applied,
                 because the usual tests for randomness have passed
                 several of the commonly-used procedures which
                 subsequently gave poor results in actual Monte Carlo
                 calculations. The principal difficulty seems to be that
                 certain simple functions of $n$-tuples of uniform
                 random numbers do not have the distribution that
                 probability theory predicts.\par

                 Two alternative generating methods are described, one
                 of them using a table of uniform numbers, the other one
                 combining two congruential generators. Both of these
                 methods passed the tests, whereas the conventional
                 multiplicative and mixed congruential methods did
                 not.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "numerical analysis",
  oldlabel =     "MacLarenM65",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/jacm/MacLarenM65",
}

@TechReport{Marsaglia:1965:SAM,
  author =       "George Marsaglia",
  title =        "Still Another Method for Producing Normal Variables in
                 a Computer",
  type =         "Mathematical note",
  number =       "??",
  institution =  "Boeing Scientific Research Laboratories",
  address =      "Seattle, WA, USA",
  pages =        "8",
  month =        jan,
  year =         "1965",
  bibdate =      "Tue Jun 21 18:58:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method for producing normal random variables in
                 terms of uniform random variables $ U_1, U_2, U_3,
                 \ldots {} $. If $ Y = U_1 + U_2 + U_3 $, then choosing
                 one of the four random variables $ 2 Y - 3 $, $ (4 Y -
                 6) / 3 $, $ (Y - 7) / 2 $ or $ (Y + 4) / 2 $ in the
                 proportions $ 0.8365 $, $ 0.11506 $, $ 0.00372 $ and $
                 0.00372 $ will produce the required normal variate $
                 98.6 $ per cent of the time. The other $ 1.4 $ per cent
                 is devoted to the tail or a rejection technique in
                 order that the composite be exact. The method leads to
                 very fast computer programs which are easy to code and
                 occupy little space in the computer.",
  acknowledgement = ack-nhfb,
}

@Book{Papoulis:1965:PRV,
  author =       "Athanasios Papoulis",
  title =        "Probability, random variables, and stochastic
                 processes",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xi + 583",
  year =         "1965",
  ISBN =         "0-07-048448-1, 0-07-085971-X",
  ISBN-13 =      "978-0-07-048448-1, 978-0-07-085971-5",
  LCCN =         "QA273 .P2",
  bibdate =      "Tue Jan 17 09:49:51 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "See other editions
                 \cite{Papoulis:1984:PRV,Papoulis:1991:PRV,Papoulis:2002:PRV}.",
}

@Article{Pike:1965:AAP,
  author =       "M. C. Pike and I. D. Hill",
  title =        "{ACM Algorithm 266}: Pseudo-Random Numbers",
  journal =      j-CACM,
  volume =       "8",
  number =       "10",
  pages =        "605--606",
  month =        oct,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu Sep 08 09:32:34 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See certification \cite{Sullins:1972:CAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Pike:1965:APR,
  author =       "M. C. Pike and I. D. Hill",
  title =        "{Algorithm 266}: {Pseudo}-random numbers [{G5}]",
  journal =      j-CACM,
  volume =       "8",
  number =       "10",
  pages =        "605--606",
  month =        oct,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:02 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See certification \cite{Sullins:1972:CAP} and remarks
                 \cite{Hansson:1966:RAG,Pike:1966:RAG}",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Pike:1965:ARN,
  author =       "M. C. Pike",
  title =        "{Algorithm 267}: {Random} normal deviate [{G5}]",
  journal =      j-CACM,
  volume =       "8",
  number =       "10",
  pages =        "606--606",
  month =        oct,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:02 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Pike:1965:CAGb,
  author =       "M. C. Pike",
  title =        "Certification of {Algorithm 200} [{G5}]: {Normal}
                 random",
  journal =      j-CACM,
  volume =       "8",
  number =       "9",
  pages =        "556--556",
  month =        sep,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:02 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{George:1963:ANR}.",
  acknowledgement = ack-nhfb,
  checked =      "19940408",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Potter:1965:CNS,
  author =       "J. E. Potter",
  title =        "Classroom Notes: Sets of {Gaussian} Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "72",
  number =       "2",
  pages =        "171--173",
  month =        feb,
  year =         "1965",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Thu Jul 8 18:23:41 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Pyke:1965:S,
  author =       "R. Pyke",
  title =        "Spacings",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "27",
  number =       "??",
  pages =        "395--434",
  month =        "????",
  year =         "1965",
  CODEN =        "JSTBAJ",
  ISSN =         "0035-9246",
  bibdate =      "Wed Feb 08 19:09:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@Article{Reeves:1965:AUR,
  author =       "C. M. Reeves",
  title =        "Algorithm 8: a uniform random number generator",
  journal =      j-COMPUT-BULL,
  volume =       "9",
  number =       "??",
  pages =        "105--??",
  month =        "????",
  year =         "1965",
  CODEN =        "COBUAH",
  ISSN =         "0010-4531 (print), 1464-357X (electronic)",
  ISSN-L =       "0010-4531",
  bibdate =      "Mon Jan 16 22:27:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Bulletin",
}

@Article{Rosenberg:1965:CNN,
  author =       "Lloyd Rosenberg",
  title =        "Classroom Notes: Nonnormality of Linear Combinations
                 of Normally Distributed Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "72",
  number =       "8",
  pages =        "888--890",
  month =        oct,
  year =         "1965",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:38:00 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Scheinok:1965:DFR,
  author =       "P. Scheinok",
  title =        "The Distribution Functions of Random Variables in
                 Arithmetic Domains Modulo $a$",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "72",
  number =       "2",
  pages =        "128--134",
  month =        feb,
  year =         "1965",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Thu Jul 8 18:23:41 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Seshadri:1965:RVW,
  author =       "V. Seshadri",
  title =        "On random variables which have the same distribution
                 as their reciprocals",
  journal =      j-CAN-MATH-BULL,
  volume =       "8",
  number =       "??",
  pages =        "819--824",
  month =        "????",
  year =         "1965",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1965-062-7",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:03:13 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v8/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Shapiro:1965:DAA,
  author =       "Jesse M. Shapiro",
  title =        "Domains of Attraction for Absolute Values of Random
                 Variables",
  journal =      j-J-SIAM,
  volume =       "13",
  number =       "1",
  pages =        "129--135",
  month =        mar,
  year =         "1965",
  CODEN =        "JSIMAV",
  ISSN =         "0368-4245 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Society for Industrial and Applied
                 Mathematics",
  journal-URL =  "http://epubs.siam.org/loi/smjmap.1",
}

@Article{Stoneham:1965:SDT,
  author =       "R. G. Stoneham",
  title =        "A study of the 60,000 digits of the transcendental
                 `$e$'",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "72",
  number =       "4",
  pages =        "483--506",
  month =        apr,
  year =         "1965",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Sat Jan 07 11:35:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Tausworthe:1965:RNG,
  author =       "Robert C. Tausworthe",
  title =        "Random Numbers Generated by Linear Recurrence Modulo
                 Two",
  journal =      j-MATH-COMPUT,
  volume =       "19",
  number =       "90",
  pages =        "201--209",
  month =        apr,
  year =         "1965",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65.15",
  MRnumber =     "32 \#1878",
  MRreviewer =   "J. H. Halton",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2003345",
  acknowledgement = ack-nhfb,
  annote =       "Many situations arise in various fields of interest
                 for which the mathematical model utilizes a random
                 sequence of numbers, events, or both. In many of these
                 applications, it is often extremely advantageous to
                 generate, by some deterministic means, a sequence which
                 appears to be random, even if, upon closer and longer
                 observations, certain regularities become evident. For
                 example, electronic computer programs for generating
                 random numbers to be \ldots{}",
  date =         "09/06/82",
  descriptors =  "Tausworthe generator; method; RNG; test; Shift
                 register sequences",
  enum =         "3054",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  location =     "RWTH-AC-DFV: MB; PKI-OG: Li-Ord.Le",
  references =   "8",
  revision =     "21/04/91",
}

@Article{Teichroew:1965:HDS,
  author =       "Daniel Teichroew",
  title =        "A history of distribution sampling prior to the era of
                 the computer and its relevance to simulation",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "60",
  number =       "309",
  pages =        "27--49",
  month =        mar,
  year =         "1965",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon Jan 9 17:34:07 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2283135",
  acknowledgement = ack-nhfb,
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7970",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Chaitin:1966:LPC,
  author =       "Gregory J. Chaitin",
  title =        "On the Length of Programs for Computing Finite Binary
                 Sequences",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "547--569",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321356.321363",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The use of Turing machines for calculating finite
                 binary sequences is studied from the point of view of
                 information theory and the theory of recursive
                 functions. Various results are obtained concerning the
                 number of:instructions ia programs. A modified form of
                 Turing machine is studied from the same point of view.
                 Aa application to the problem of defining a patternless
                 sequence is proposed in terms of the concepts here
                 developed.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  rawdata =      "Chaitin, Gregory J. (1966) ``On the Lengths of
                 Programs for Computing Finite Binary Sequences,'' {\it
                 Journal of the ACM}, {\bf13}(4):547--569, October.",
}

@Article{Chiang:1966:ERR,
  author =       "C. L. Chiang",
  title =        "On the Expectation of the Reciprocal of a Random
                 Variable",
  journal =      j-AMER-STAT,
  volume =       "20",
  number =       "4",
  pages =        "28--28",
  month =        oct,
  year =         "1966",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:37 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326494;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2685960",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Dyadkin:1966:SRE,
  author =       "I. G. Dyad'kin",
  title =        "Simulation of the random energy of a gamma quantum
                 scattered as a result of the {Compton} effect",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "6",
  number =       "2",
  pages =        "274--276",
  month =        "????",
  year =         "1966",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(66)90077-2",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Feb 27 09:47:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "English translation of Russian original published in
                 Zh. vychisl. Mat. mat. Fiz. {\bf 6}(2) 384--385,
                 1966.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0041555366900772",
  abstract =     "When the Monte Carlo method is used to solve problems
                 on the propagation of gamma quanta in a material, the
                 greater part of the computer time is expended in
                 simulating the Compton effect. An economic algorithm is
                 proposed below for converting random numbers, uniformly
                 distributed over the interval $ (0, 1) $, into the
                 energy of the scattered gamma quantum.",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@Article{Fleiss:1966:NER,
  author =       "Joseph L. Fleiss",
  title =        "A Note on the Expectation of the Reciprocal of a
                 Random Variable",
  journal =      j-AMER-STAT,
  volume =       "20",
  number =       "1",
  pages =        "25--25",
  month =        feb,
  year =         "1966",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:37 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326344;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2681673",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Gorenstein:1966:APN,
  author =       "S. Gorenstein",
  title =        "Another pseudorandom number generator",
  journal =      j-CACM,
  volume =       "9",
  number =       "9",
  pages =        "711",
  month =        sep,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 16 22:21:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  xxmonth =      oct,
  xxnote =       "Article missing from ACM Portal database; it is either
                 at the end of issue 9 (most likely), or the start of
                 issue 10 (unlikely).",
  xxnumber =     "10",
}

@Article{Hansson:1966:RAG,
  author =       "L. Hansson",
  title =        "Remark on {Algorithm 266 [G5]}: Pseudo-Random
                 Numbers",
  journal =      j-CACM,
  volume =       "9",
  number =       "9",
  pages =        "687--687",
  month =        sep,
  year =         "1966",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/365813.365839",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:09 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Pike:1965:APR}, remark \cite{Pike:1966:RAG},
                 and certification \cite{Sullins:1972:CAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Heyde:1966:SRS,
  author =       "C. C. Heyde",
  title =        "Some results on small-deviation probability
                 convergence rates for sums of independent random
                 variables",
  journal =      j-CAN-J-MATH,
  volume =       "18",
  number =       "??",
  pages =        "656--665",
  month =        "????",
  year =         "1966",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1966-066-x",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:38:35 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v18/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{Hutchinson:1966:NUP,
  author =       "David W. Hutchinson",
  title =        "A new uniform pseudorandom number generator",
  journal =      j-CACM,
  volume =       "9",
  number =       "6",
  pages =        "432--433",
  month =        jun,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65.15",
  MRnumber =     "33\#1954",
  bibdate =      "Tue May 28 07:34:50 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A new multiplicative congruential pseudorandom number
                 generator is discussed, in which the modulus is the
                 largest prime within accumulator capacity and the
                 multiplier is a primitive root of that prime. This
                 generator passes the usual statistical tests and in
                 addition the least significant bits appear to be as
                 random as the most significant bits-a property which
                 generators having modulus $ 2^k $ do not possess.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Book{Jansson:1966:RNG,
  author =       "Birger Jansson",
  title =        "Random number generators",
  publisher =    "Almqvist \& Wiksell",
  address =      "Stockholm, Sweden",
  pages =        "205",
  year =         "1966",
  LCCN =         "QA276.5 .J3 1966",
  MRnumber =     "MR 224253",
  bibdate =      "Wed Dec 21 10:20:08 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@Article{Loveland:1966:NIM,
  author =       "D. Loveland",
  title =        "A New Interpretation of the {von Mises} Concept of
                 Random Sequence",
  journal =      j-Z-MATH-LOGIK-GRUNDL-MATH,
  volume =       "12",
  number =       "??",
  pages =        "279--294",
  month =        "????",
  year =         "1966",
  CODEN =        "ZMLGAQ",
  ISSN =         "0044-3050",
  bibdate =      "Mon Feb 20 15:33:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r mathematische Logik und
                 Grundlagen der Mathematik}",
}

@InProceedings{Marsaglia:1966:GMP,
  author =       "G. Marsaglia",
  booktitle =    "Proceedings of the Fall Joint Computer Conference, San
                 Francisco, November 1966",
  title =        "A general method for producing random variables in a
                 computer",
  publisher =    "Spartan Books",
  address =      "Washington, DC, USA",
  bookpages =    "vii + 819",
  pages =        "169--173",
  year =         "1966",
  LCCN =         "TK7885.A1 J74 1966 Fall",
  bibdate =      "Fri Jan 6 09:58:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7631",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  town =         "San Francisco",
}

@Article{Martin-Lof:1966:CRS,
  author =       "P. Martin-L{\"o}f",
  title =        "On the Concept of a Random Sequence",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "11",
  number =       "??",
  pages =        "177--179",
  month =        "????",
  year =         "1966",
  CODEN =        "TPRBAU",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Mon Feb 20 15:41:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
}

@Article{Martin-Lof:1966:DRS,
  author =       "Per Martin-L{\"o}f",
  title =        "The definition of random sequences",
  journal =      j-INF-CONTROL,
  volume =       "9",
  number =       "6",
  pages =        "602--619",
  month =        dec,
  year =         "1966",
  CODEN =        "IFCNA4",
  DOI =          "https://doi.org/10.1016/S0019-9958(66)80018-9",
  ISSN =         "0019-9958 (print), 1878-2981 (electronic)",
  ISSN-L =       "0019-9958",
  bibdate =      "Mon Jan 16 22:23:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information and Control",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00199958",
}

@Article{Mckinney:1966:CNG,
  author =       "E. H. Mckinney",
  title =        "Classroom Notes: Generalized Birthday Problem",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "73",
  number =       "4",
  pages =        "385--387",
  month =        apr,
  year =         "1966",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Fri Jul 9 10:43:31 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Miller:1966:BRB,
  author =       "Irwin Miller",
  title =        "Book Review: {{\booktitle{Probability, Random
                 Variables, and Stochastic Processes}} by Anthanasios
                 Papoulis}",
  journal =      j-TECHNOMETRICS,
  volume =       "8",
  number =       "2",
  pages =        "378--380",
  month =        may,
  year =         "1966",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.2307/1266379",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 13:17:51 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i254246;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1960.bib",
  URL =          "http://www.jstor.org/stable/1266379",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html",
}

@Article{Murthy:1966:NER,
  author =       "V. N. Murthy and C. S. Pillai",
  title =        "A Note on the Expectation of the Reciprocal and Square
                 Root of a Random Variable",
  journal =      j-AMER-STAT,
  volume =       "20",
  number =       "5",
  pages =        "30--30",
  month =        dec,
  year =         "1966",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:37 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326347;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682640",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Pike:1966:RAG,
  author =       "M. C. Pike and I. D. Hill",
  title =        "Remark on {Algorithm 266 [G5]}: Pseudo-Random
                 Numbers",
  journal =      j-CACM,
  volume =       "9",
  number =       "9",
  pages =        "687--687",
  month =        sep,
  year =         "1966",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/365813.365839",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:09 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Pike:1965:APR}, remark
                 \cite{Hansson:1966:RAG}, and certification
                 \cite{Sullins:1972:CAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Book{RAND:1966:MRD,
  author =       "{RAND Corporation}",
  title =        "A Million Random Digits With 100,000 Normal Deviates",
  publisher =    pub-FREE,
  address =      pub-FREE:adr,
  pages =        "xxviii + 400 + 200",
  year =         "1966",
  LCCN =         "QA276.5 .R3",
  bibdate =      "Sat Aug 23 07:58:03 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reprint of original edition \cite{RAND:1955:MRD}.
                 Reprinted in 2001 \cite{RAND:2001:MRD}. See also
                 \cite{Tippett:1927:RSN,Brown:1949:HRR,Brown:1951:HRR}.",
  URL =          "http://www.rand.org/pubs/monograph_reports/MR1418.html",
  acknowledgement = ack-nhfb,
  HDnumber =     "100",
}

@Book{Shreider:1966:MCM,
  editor =       "I. A. (Ulii Anatol'evich) Shreider and N. P. (Nikolai
                 Panteleimonovich) Buslenko",
  title =        "The {Monte Carlo} method; the method of statistical
                 trials",
  volume =       "87",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "xii + 381",
  year =         "1966",
  LCCN =         "QA273 .S5611",
  bibdate =      "Sat Jan 7 12:03:03 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 library.mit.edu:9909/mit01",
  series =       "International series of monographs in pure and applied
                 mathematics",
  acknowledgement = ack-nhfb,
  remark =       "Translation of Russian original \booktitle{Metod
                 statisticheskikh ispytanii; metod Monte-Karlo}.",
  subject =      "Monte Carlo method",
}

@Article{Spitzer:1966:RPP,
  author =       "Frank Spitzer",
  title =        "Recent Publications and Presentations: {{\em
                 Information and Information Stability of Random
                 Variables and Processes}}, by {M. S. Pinsker}",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "73",
  number =       "8",
  pages =        "912--913",
  month =        oct,
  year =         "1966",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:38:23 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Springer:1966:DPI,
  author =       "M. D. Springer and W. E. Thompson",
  title =        "The Distribution of Products of Independent Random
                 Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "14",
  number =       "3",
  pages =        "511--526",
  month =        may,
  year =         "1966",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Book{Stroud:1966:GQF,
  author =       "A. H. Stroud and Don Secrest",
  title =        "{Gaussian} Quadrature Formulas",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "ix + 374",
  year =         "1966",
  LCCN =         "QA299.4.G3 S7 1966",
  bibdate =      "Sun Jan 17 09:52:34 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "See also \cite{Stroud:1971:ACM}.",
  xxISBN =       "none",
}

@Article{Watson:1962:PPM,
  author =       "E. J. Watson",
  title =        "Primitive polynomials (mod $2$)",
  journal =      j-MATH-COMPUT,
  volume =       "16",
  number =       "79",
  pages =        "368--369",
  month =        jul,
  year =         "1962",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ajournal =     "Math. Comput.",
  annote =       "The following list contains one example of a primitive
                 polynomial (mod 2) for each degree n, 1\leq n\leq
                 100.",
  country =      "USA",
  date =         "00/00/00",
  descriptors =  "Shift register sequences; Tausworthe generator; Galois
                 field",
  enum =         "3243",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  location =     "PKI-OG: Li-Ord.Le; RWTH-AC-DFV: MB",
  references =   "0",
  revision =     "21/04/91",
}

@Article{Zaremba:1966:GLP,
  author =       "S. C. Zaremba",
  title =        "Good lattice points, discrepancy, and numerical
                 integration",
  journal =      j-ANN-MAT-PURA-APPL-4,
  volume =       "73",
  number =       "??",
  pages =        "293--317",
  month =        "????",
  year =         "1966",
  CODEN =        "ANLMAE",
  ISSN =         "0003-4622",
  MRclass =      "65.55",
  MRnumber =     "0218018 (36 \#1107)",
  MRreviewer =   "S. Haber",
  bibdate =      "Thu Jan 19 08:32:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annali di matematica pura ed applicata. Series 4",
}

@Article{Albert:1967:CNN,
  author =       "G. E. Albert and R. L. Tittle",
  title =        "Classroom Notes: Nonnormality of Linear Combinations
                 of Normally Distributed Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "74",
  number =       "5",
  pages =        "583--585",
  month =        may,
  year =         "1967",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:38:39 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Azorin:1967:BRR,
  author =       "F. Azor{\'\i}n",
  title =        "Book Review: {{\booktitle{Random Number Generators}}
                 by B. Jansson}",
  journal =      j-REV-INST-INT-STAT,
  volume =       "35",
  number =       "1",
  pages =        "95--96",
  year =         "1967",
  CODEN =        "ISTRDP",
  DOI =          "https://doi.org/10.2307/1401645",
  ISSN =         "0373-1138 (print), 2212-1846 (electronic)",
  ISSN-L =       "0373-1138",
  bibdate =      "Wed Dec 21 10:21:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/revinstintstat.bib",
  note =         "See \cite{Jansson:1966:RNG}.",
  URL =          "https://www.jstor.org/stable/1401645",
  acknowledgement = ack-nhfb,
  ajournal =     "Rev. Inst. Int. Stat.",
  fjournal =     "Revue de l'Institut international de statistique =
                 Review of the International Statistical Institute",
  journal-URL =  "https://www.jstor.org/journal/revuinstintestat",
}

@Article{Behboodian:1967:EAV,
  author =       "Javad Behboodian",
  title =        "On the Expectation of the Absolute Value of a Random
                 Vector",
  journal =      j-AMER-STAT,
  volume =       "21",
  number =       "4",
  pages =        "25--26",
  month =        oct,
  year =         "1967",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326351;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682101",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@InProceedings{Canavos:1967:CAT,
  author =       "G. C. Canavos",
  editor =       "????",
  booktitle =    "{Proceedings of the 22nd Conference of the ACM}",
  title =        "A comparative analysis of two concepts in the
                 generation of uniform pseudorandom numbers",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "485--501",
  year =         "1967",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 22:16:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Chambers:1967:RNG,
  author =       "R. P. Chambers",
  title =        "Random-number generation on digital computers",
  journal =      j-IEEE-SPECTRUM,
  volume =       "4",
  number =       "2",
  pages =        "48--56",
  month =        feb,
  year =         "1967",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.1967.5216203",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Wed Jan 15 09:12:12 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeespectrum1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
  keywords =     "Application software; Arithmetic; Debugging; Game
                 theory; Inductors; Laboratories; Mesh generation;
                 Military computing; Probability; Sampling methods",
}

@Article{Coveyou:1967:FAU,
  author =       "R. R. Coveyou and R. D. MacPherson",
  title =        "{Fourier} Analysis of Uniform Random Number
                 Generators",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "100--119",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321371.321379",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:22 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method of analysis of uniform random number
                 generators is developed, applicable to almost all
                 practical methods of generation. The method is that of
                 Fourier analysis of the output sequences of such
                 generators. With this tool it is possible to understand
                 and predict relevant statistical properties of such
                 generators and compare and evaluate such methods. Many
                 such analyses and comparisons have been carried out.
                 The performance of these methods as implemented on
                 differing computers is also studied. The main practical
                 conclusions of the study are: (a) Such a priori
                 analysis and prediction of statistical behavior of
                 uniform random number generators is feasible. (b) The
                 commonly used multiplicative congruence method of
                 generation is satisfactory with careful choice of the
                 multiplier for computers with an adequate ($ \geq
                 \tilde $ 35-bit) word length. (c) Further work may be
                 necessary on generators to be used on machines of
                 shorter word length.",
  acknowledgement = ack-nhfb,
  descriptors =  "Shift register sequences; method; spectral analysis;
                 interdependence; multidimensional uniformity; RNG;
                 test",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  remark =       "This article is believed to be the origin of the
                 spectral test for randomness.",
}

@Article{Csorgo:1967:NPS,
  author =       "Mikl{\'o}s Cs{\"o}rg{\"o}",
  title =        "A new proof of some results of {R{\'e}nyi} and the
                 asymptotic distribution of the range of his
                 {Kolmogorov--Smirnov} type random variables",
  journal =      j-CAN-J-MATH,
  volume =       "19",
  number =       "??",
  pages =        "550--558",
  month =        "????",
  year =         "1967",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1967-048-7",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:38:36 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v19/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{deBalbine:1967:NRP,
  author =       "Guy {de Balbine}",
  title =        "Note on Random Permutations (in {Technical Notes and
                 Short Papers})",
  journal =      j-MATH-COMPUT,
  volume =       "21",
  number =       "100",
  pages =        "710--712",
  month =        oct,
  year =         "1967",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Downham:1967:MCP,
  author =       "D. Y. Downham and F. D. K. Roberts",
  title =        "Multiplicative congruential pseudo-random number
                 generators",
  journal =      j-COMP-J,
  volume =       "10",
  number =       "1",
  pages =        "74--77",
  month =        may,
  year =         "1967",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:51:17 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/;
                 https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/100074.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/tiff/74.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/tiff/75.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/tiff/76.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_01/tiff/77.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Gabai:1967:DCS,
  author =       "H. Gabai",
  title =        "On the discrepancy of certain sequences $ \bmod 1 $",
  journal =      j-ILL-J-MATH,
  volume =       "11",
  number =       "??",
  pages =        "1--12",
  month =        "????",
  year =         "1967",
  CODEN =        "IJMTAW",
  ISSN =         "0019-2082 (print), 1945-6581 (electronic)",
  ISSN-L =       "0019-2082",
  bibdate =      "Thu Jan 19 06:48:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Illinois Journal of Mathematics",
}

@Article{Gebhardt:1967:GPR,
  author =       "Friedrich Gebhardt",
  title =        "Generating Pseudo-Random Numbers by Shuffling a
                 {Fibonacci} Sequence (in {Technical Notes and Short
                 Papers})",
  journal =      j-MATH-COMPUT,
  volume =       "21",
  number =       "100",
  pages =        "708--709",
  month =        oct,
  year =         "1967",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/gebhardt-friedrich.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Book{Golomb:1967:SRS,
  author =       "Solomon W. (Solomon Wolf) Golomb",
  title =        "Shift Register Sequences",
  publisher =    pub-HOLDEN-DAY,
  address =      pub-HOLDEN-DAY:adr,
  pages =        "xiv + 224",
  year =         "1967",
  LCCN =         "QA267.5.S4 G6",
  bibdate =      "Sat Sep 17 13:57:12 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Portions co-authored by Lloyd R. Welch, Richard M.
                 Goldstein and Alfred W. Hales.",
  series =       "Holden-Day series in information systems",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Switching theory; Sequential machine
                 theory; Shift registers",
}

@Article{Good:1967:GST,
  author =       "I. J. Good and T. N. Gover",
  title =        "The generalized serial test and the binary expansion
                 of $ \sqrt {2} $",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "130",
  number =       "1",
  pages =        "102--107",
  month =        "????",
  year =         "1967",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Sat Jan 07 11:23:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remark \cite{Good:1968:GST}.",
  URL =          "http://www.jstor.org/stable/2344040",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
  remark =       "The first author reports in \cite[page 43, column
                 2]{Good:1969:HRR}: ``For binary sequences one of the
                 best tests is the generalized serial test. This test,
                 which uses a statistic having the appearance of a
                 `Chi-squared', is also useful when $ t \neq 2 $, but it
                 does not have asymptotically a chi-squared
                 distribution, a fact that has led to error in at least
                 five published papers
                 \cite{Forsythe:1951:GTRa,Kendall:1938:RRS,Pathria:1962:SSR,RAND:1955:MRD,Stoneham:1965:SDT}.
                 It would have led to the rejection of RAND's million
                 random digits if the test had been applied to many
                 blocks incorrectly, instead of to only a few. The
                 simple correct method of use is described in
                 \cite{Good:1967:GST} [this paper].''",
}

@Article{Gorenstein:1967:TRN,
  author =       "Samuel Gorenstein",
  title =        "Testing a random number generator",
  journal =      j-CACM,
  volume =       "10",
  number =       "2",
  pages =        "111--118",
  month =        feb,
  year =         "1967",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:11 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Gurland:1967:ISE,
  author =       "John Gurland",
  title =        "An Inequality Satisfied by the Expectation of the
                 Reciprocal of a Random Variable",
  journal =      j-AMER-STAT,
  volume =       "21",
  number =       "2",
  pages =        "24--25",
  month =        apr,
  year =         "1967",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326349;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682610",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Book{Hemmerle:1967:SCD,
  author =       "William J. Hemmerle",
  title =        "Statistical Computations on a Digital Computer",
  publisher =    "Blaisdell",
  address =      "Waltham, MA, USA",
  pages =        "x + 230",
  year =         "1967",
  LCCN =         "QA276 .H42",
  bibdate =      "Mon Jan 16 22:18:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Itzelsberger:1967:SEP,
  author =       "G. Itzelsberger",
  title =        "Some experiences with the poker test for investigating
                 pseudorandom numbers",
  crossref =     "Hollingdale:1967:DSO",
  pages =        "64--68",
  year =         "1967",
  bibdate =      "Mon Jan 16 22:19:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Marlow:1967:NLT,
  author =       "N. A. Marlow",
  title =        "A normal limit theorem for power sums of independent
                 random variables",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "46",
  number =       "9",
  pages =        "2081--2089",
  month =        nov,
  year =         "1967",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  MRclass =      "60.30",
  MRnumber =     "0224135 (36 \#7181)",
  MRreviewer =   "S. M. Samuels",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1967/BSTJ.1967.4609.html;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/bstj-vol46-issue09.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol46/bstj46-9-2081.pdf;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/articles/bstj46-9-2081.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Mullen:1967:NRT,
  author =       "Kenneth Mullen",
  title =        "A Note on the Ratio of Two Independent Random
                 Variables",
  journal =      j-AMER-STAT,
  volume =       "21",
  number =       "3",
  pages =        "30--31",
  month =        jun,
  year =         "1967",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326350;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682042",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Nasell:1967:SPP,
  author =       "Ingemar Nasell",
  title =        "Some Properties of Power Sums of Truncated Normal
                 Random Variables",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "46",
  number =       "9",
  pages =        "2091--2110",
  month =        nov,
  year =         "1967",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1967/BSTJ.1967.4609.html;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/bstj-vol46-issue09.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol46/bstj46-9-2091.pdf;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/articles/bstj46-9-2091.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@InProceedings{Page:1967:GPR,
  author =       "E. S. Page",
  title =        "The generation of pseudo-random numbers",
  crossref =     "Hollingdale:1967:DSO",
  pages =        "55--63",
  year =         "1967",
  bibdate =      "Thu Dec 22 10:01:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ratz:1967:MPN,
  author =       "Herbert C. Ratz and J. V. Hildebrand",
  title =        "Modified Pseudorandom Number Generators",
  journal =      j-IEEE-TRANS-ELEC-COMPUT,
  volume =       "EC-16",
  number =       "6",
  pages =        "854--856",
  month =        dec,
  year =         "1967",
  CODEN =        "IEECA8",
  DOI =          "https://doi.org/10.1109/PGEC.1967.264749",
  ISSN =         "0367-7508",
  bibdate =      "Wed Jul 13 21:15:06 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4039202",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Electronic Computers",
}

@Article{Sclove:1967:FRE,
  author =       "Stanley L. Sclove and Gordon Simons and J. {Van
                 Ryzin}",
  title =        "Further Remarks on the Expectation of the Reciprocal
                 of a Positive Random Variable",
  journal =      j-AMER-STAT,
  volume =       "21",
  number =       "4",
  pages =        "33--34",
  month =        oct,
  year =         "1967",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326351;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682105",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Serfling:1967:NCR,
  author =       "R. J. Serfling",
  title =        "A Note on the Covariance of a Random Variable and Its
                 Reciprocal",
  journal =      j-AMER-STAT,
  volume =       "21",
  number =       "4",
  pages =        "33--33",
  month =        oct,
  year =         "1967",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326351;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682104",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Sobol:1967:DPC,
  author =       "I. M. Sobol'",
  title =        "On the distribution of points in a cube and the
                 approximate evaluation of integrals",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "7",
  number =       "4",
  pages =        "86--112",
  month =        "????",
  year =         "1967",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(67)90144-9",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Feb 27 17:01:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "English translation of Russian original published in
                 Zh. vychisl. Mat. mat. Fiz. {\bf 7}(4), 784--802,
                 1967.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0041555367901449",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@InProceedings{Solomon:1967:RPD,
  author =       "H. Solomon",
  editor =       "Lucien M. {Le Cam} and Jerzy Neyman",
  booktitle =    "{Proceedings of the Fifth Berkeley Symposium on
                 Mathematical Statistics and Probability. Volume III.
                 Physical Sciences}",
  title =        "Random packing density",
  volume =       "3",
  publisher =    pub-U-CAL,
  address =      pub-U-CAL:adr,
  pages =        "119--134",
  year =         "1967",
  LCCN =         "QA276 .B4 v.3",
  bibdate =      "Wed Feb 29 21:12:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Held at the Statistical Laboratory, University of
                 California, June 21--July 18, 1965 and December 27,
                 1965--January 7, 1966.",
  URL =          "http://projecteuclid.org/euclid.bsmsp/1200513624",
  acknowledgement = ack-nhfb,
  keywords =     "parking-lot test; sphere packing",
}

@Article{Stein:1967:CPA,
  author =       "Josef Stein",
  title =        "Computational problems associated with {Racah}
                 algebra",
  journal =      j-J-COMPUT-PHYS,
  volume =       "1",
  number =       "3",
  pages =        "397--405",
  month =        feb,
  year =         "1967",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(67)90047-2",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 08:27:59 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999167900472",
  abstract =     "In a program written by the author, for performing
                 various calculations in the Racah algebra, some new
                 calculational methods were used; these methods are
                 described in this paper. They include: (1) a
                 representation of numbers alternative to the Rotenberg
                 form; (2) a new algorithm for calculating the greatest
                 common divisor of two odd integers, which was developed
                 for reducing the calculating time in the new
                 representation; (3) methods for shortening the
                 computation time of 3-j and 6-j symbols.",
  acknowledgement = ack-nhfb,
  affiliation =  "The Hebrew University, Jerusalem, Israel",
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
  keywords =     "fast greatest common denominator (gcd)",
  remark =       "This may be the earliest published paper about
                 speeding up computation of the greatest common
                 denominator (gcd). Brent \cite{Brent:2000:TYA} also
                 cites earlier unpublished work of Silver and Terzian
                 (1962), and quotes a translation of a first century AD
                 Chinese text given by Knuth \cite[\S
                 4.5.2]{Knuth:1997:SA} that describes what we now call
                 the ``binary Euclidean algorithm''.",
}

@Article{Strome:1967:AUR,
  author =       "W. Murray Strome",
  title =        "{Algorithm 294}: {Uniform} Random",
  journal =      j-CACM,
  volume =       "10",
  number =       "1",
  pages =        "40--40",
  month =        jan,
  year =         "1967",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:11 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "multiplicative congruential generator; PRNG
                 (pseudo-random number generator)",
  remark =       "User-provided $C$ and $M$ for $ x_{n + 1} = (C x_n)
                 \bmod M $, but user must restrict parameter bit-widths
                 to ensure representability of product done in
                 floating-point arithmetic.",
}

@Article{VanGelder:1967:SNR,
  author =       "A. {Van Gelder}",
  title =        "Some New Results in Pseudo-Random Number Generation",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "785--792",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321420.321437",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:50:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Pseudo-random number generators of the power residue
                 (sometimes called congruential or multiplicative) type
                 are discussed and results of statistical tests
                 performed on specific examples of this type are
                 presented. Tests were patterned after the methods of
                 MacLaren and Marsaglia (M\&M). The main result
                 presented is the discovery of several power residue
                 generators which performed well in these tests. This is
                 important because, of all the generators using standard
                 methods (including power residue) that were tested by
                 M\&M, none gave satisfactory results. The overall
                 results here provide further evidence for their
                 conclusion that the types of tests usually encountered
                 in the literature do not provide an adequate index of
                 the behavior of n-tuples of consecutively generated
                 numbers. In any Monte Carlo or simulation problem where
                 n supposedly independent random numbers are required at
                 each step, this behavior is likely to be important.
                 Finally, since the tests presented here differ in
                 certain details from those of M\&M, some of their
                 generators were retested as a check. A cross-check
                 shows that results are compatible; in particular, if a
                 generator failed one of their tests badly, it also
                 failed the present author's corresponding test badly.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Westlake:1967:URN,
  author =       "W. J. Westlake",
  title =        "A Uniform Random Number Generator Based on the
                 Combination of Two Congruential Generators",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "337--340",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321386.321396",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method of generating pseudo-random uniform numbers
                 based on the combination of two congruential generators
                 is described. It retains two of the desirable features
                 of congruential generators, namely, the long cycle and
                 the case of implementation on a digital computer.
                 Furthermore, unlike the method of combining
                 congruential generators recently proposed by MacLaren
                 and Marsaglia, it does not require the retention in
                 computer memory of a table of generated numbers. The
                 generator gave completely satisfactory results on a
                 fairly stringent series of statistical tests.",
  acknowledgement = ack-nhfb,
  descriptors =  "RNG",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{White:1967:EDC,
  author =       "R. C. White",
  title =        "Experiments with Digital Computer Simulations of
                 Pseudo-Random Noise Generators",
  journal =      j-IEEE-TRANS-ELEC-COMPUT,
  volume =       "EC-16",
  number =       "3",
  pages =        "355--357",
  month =        jun,
  year =         "1967",
  CODEN =        "IEECA8",
  DOI =          "https://doi.org/10.1109/PGEC.1967.264694",
  ISSN =         "0367-7508",
  bibdate =      "Wed Jul 13 21:15:03 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4039076",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Electronic Computers",
}

@Article{Wyner:1967:RPC,
  author =       "A. D. Wyner",
  title =        "Random packings and coverings of the unit
                 {$n$}-sphere",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "46",
  number =       "9",
  pages =        "2111--2118",
  month =        nov,
  year =         "1967",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  MRclass =      "52.45 (60.00)",
  MRnumber =     "0223979 (36 \#7026)",
  MRreviewer =   "R. P. Bambah",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1967/BSTJ.1967.4609.html;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/bstj-vol46-issue09.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol46/bstj46-9-2111.pdf;
                 http://www.alcatel-lucent.com/bstj/vol46-1967/articles/bstj46-9-2111.pdf",
  abstract =     "It is well known that the quantity $ M_p(n, 0) $, the
                 maximum number of nonoverlapping spherical caps of half
                 angle $ \theta $ (a ``packing'') which can be placed on
                 the surface of a unit sphere in Euclidean $n$-space is
                 not less than $ \exp [ - n \log \sin 2 \theta + o(n)]
                 \quad (\theta < \pi / 4) $. In this paper we give a new
                 proof of this fact by a ``random coding'' argument, the
                 central part of which is a theorem which asserts that
                 if a set of roughly $ \exp (n \log \sin 2 \theta) $
                 caps is chosen at random, that on the average only a
                 very small fraction of the caps will overlap (when $n$
                 is large).\par

                 A related problem is the determination of $ M_c(n,
                 \theta) $, the minimum number of caps of half angle $
                 \theta $ required to cover the unit Euclidean
                 $n$-sphere We show that $ M_c(n, \theta) = \exp [ - n
                 \log \sin \theta + o(n)] $. The central part of the
                 proof is also a random coding argument which asserts
                 that if a set roughly $ \exp ( - n \log \sin \theta) $
                 caps is chosen at random, that on the average only a
                 very small fraction of the surface of the $n$-sphere
                 will remain uncovered (when $n$ is large).",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Adhikari:1968:DMS,
  author =       "A. K. Adhikari and B. P. Sarkar",
  title =        "Distribution of most significant digit in certain
                 functions whose arguments are random variables",
  journal =      j-SANKHYA-B,
  volume =       "30",
  number =       "??",
  pages =        "47--58",
  month =        "????",
  year =         "1968",
  CODEN =        "SANBBV",
  ISSN =         "0976-8386 (print), 0976-8394 (electronic)",
  ISSN-L =       "0976-8386",
  bibdate =      "Sat Nov 12 16:09:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Sankhya Ser. B (Indian J. of Statist.)",
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series B.
                 Methodological",
}

@Article{Anonymous:1968:GCM,
  author =       "Anonymous",
  title =        "The generation of correlated multivariate samples for
                 {Monte Carlo} simulation",
  journal =      j-IEEE-SPECTRUM,
  volume =       "5",
  number =       "2",
  pages =        "5--5",
  month =        feb,
  year =         "1968",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.1968.5214753",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Wed Jan 15 09:30:58 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeespectrum1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
  keywords =     "Cellular neural networks; Covariance matrix; Delay
                 lines; Filters; Gaussian processes; Information theory;
                 Phased arrays; Signal generators; Signal processing;
                 Stochastic processes",
}

@Article{Ayoub:1968:EEK,
  author =       "F. Ayoub",
  title =        "Erratum: Encryption with keyed random permutations",
  journal =      j-ELECT-LETTERS,
  volume =       "17",
  number =       "??",
  pages =        "??--??",
  month =        feb,
  year =         "1968",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19810541",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:43 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4246020",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Ayoub:1968:EKR,
  author =       "F. Ayoub",
  title =        "Encryption with keyed random permutations",
  journal =      j-ELECT-LETTERS,
  volume =       "17",
  number =       "??",
  pages =        "583--585",
  month =        feb,
  year =         "1968",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19810411",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4245887",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Bell:1968:ANR,
  author =       "James R. Bell",
  title =        "{Algorithm 334}: {Normal} Random Deviates [{G5}]",
  journal =      j-CACM,
  volume =       "11",
  number =       "7",
  pages =        "498--498",
  month =        jul,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:20 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Tracht:1982:RAN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator); probability
                 functions",
}

@Book{Berlekamp:1968:ACT,
  author =       "Elwyn R. Berlekamp",
  title =        "Algebraic coding theory",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiv + 466",
  year =         "1968",
  LCCN =         "QA268 .B46",
  bibdate =      "Sat Mar 10 10:01:51 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in systems science",
  acknowledgement = ack-nhfb,
  remark =       "This book, and \cite{Massey:1969:SRS}, are the origin
                 of the Berlekamp--Massey algorithm for recovering
                 parameters from bit streams from linear feedback shift
                 register (LSFR) generators.",
  subject =      "Coding theory",
}

@Book{Bradley:1968:RTR,
  author =       "J. V. Bradley",
  title =        "Runs tests of randomness",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "????",
  year =         "1968",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 22:12:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "Check: is this a book, or a book chapter, or a
                 conference paper??",
}

@Book{David:1968:NCM,
  editor =       "F. N. (Florence Nightingale) David",
  title =        "Normal centroids, medians and scores for ordinal
                 data",
  volume =       "29",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "201",
  year =         "1968",
  LCCN =         "QA47 .T7 no. 29",
  bibdate =      "Mon Jun 27 13:35:14 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Tracts for Computers",
  acknowledgement = ack-nhfb,
  editor-dates = "1909--1993",
  subject =      "Mathematical statistics; Tables",
}

@Article{Dieter:1968:AME,
  author =       "Ulrich Dieter",
  title =        "{Autokorrelation multiplikativ erzeugter
                 Pseudo-Zufallszahlen}. ({German}) [{Autocorrelation}
                 generated multiplicative pseudo-random numbers]",
  journal =      j-OPER-RES-VERFAHREN,
  volume =       "6",
  number =       "??",
  pages =        "69--85",
  month =        "????",
  year =         "1968",
  CODEN =        "ORVEAI",
  ISSN =         "0078-5318",
  bibdate =      "Fri Jan 6 10:19:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Operations Research-Verfahren}",
  language =     "German",
}

@Article{Forsythe:1968:RNG,
  author =       "A. B. Forsythe",
  title =        "Random number generators",
  journal =      j-COMPUT-AND-BIOMED-RES,
  volume =       "1",
  number =       "??",
  pages =        "470--474",
  month =        "????",
  year =         "1968",
  CODEN =        "CBMRB7",
  ISSN =         "0010-4809 (print), 1090-2368 (electronic)",
  ISSN-L =       "0010-4809",
  bibdate =      "Mon Jan 16 22:13:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Biomedical Research",
}

@Article{Gardner:1968:MRS,
  author =       "Martin Gardner",
  title =        "On the meaning of randomness and some ways of
                 achieving it",
  journal =      j-SCI-AMER,
  volume =       "??",
  number =       "??",
  pages =        "116--121",
  month =        jul,
  year =         "1968",
  CODEN =        "SCAMAC",
  ISSN =         "0036-8733 (print), 1946-7087 (electronic)",
  ISSN-L =       "0036-8733",
  bibdate =      "Mon Jan 16 22:15:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Scientific American",
  journal-URL =  "http://www.nature.com/scientificamerican",
}

@Article{Good:1968:GST,
  author =       "I. J. Good and T. N. Gover",
  title =        "The generalized serial test and the binary expansion
                 of $ \sqrt {2} $",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "131",
  number =       "??",
  pages =        "434--434",
  month =        "????",
  year =         "1968",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Sat Jan 07 11:23:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Good:1967:GST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@Article{Good:1968:RHP,
  author =       "I. J. Good and R. F. Churchhouse",
  title =        "The {Riemann} Hypothesis and Pseudorandom Features of
                 the {M{\"o}bius} Sequence",
  journal =      j-MATH-COMPUT,
  volume =       "22",
  number =       "104",
  pages =        "857--861",
  month =        oct,
  year =         "1968",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2004584.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Book{Green:1968:TRP,
  author =       "J. W. (John William) Green",
  title =        "Tables of random permutations",
  publisher =    "Department of National Development, Forestry and
                 Timber Bureau",
  address =      "Canberra, ACT, Australia",
  pages =        "161",
  year =         "1968",
  LCCN =         "SD110 .A33 no. 44",
  bibdate =      "Thu Mar 1 08:41:02 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Permutations; Tables",
}

@Article{Gregory:1968:GRP,
  author =       "G. Gregory and K. Sharpe",
  title =        "A Generalization of the Rejection Procedure for the
                 Generation of Random Variables",
  journal =      j-AUSTRALIAN-COMP-J,
  volume =       "1",
  number =       "3",
  pages =        "169--172",
  year =         "1968",
  CODEN =        "ACMJB2",
  ISSN =         "0004-8917",
  bibdate =      "Fri Mar 09 17:54:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "It is shown how the simple rejection procedure may be
                 generalized to cover the situation in which the range
                 of the variable is infinite, subject to some mild
                 restrictions. Methods for making the most efficient use
                 of this generalized procedure are also discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Computer Journal",
}

@Article{Kruskal:1968:NNC,
  author =       "William Kruskal",
  title =        "Note on a Note by {C. S. Pillai}",
  journal =      j-AMER-STAT,
  volume =       "22",
  number =       "5",
  pages =        "24--25",
  month =        dec,
  year =         "1968",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326357;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Pillai:1968:NEI}.",
  URL =          "http://www.jstor.org/stable/2681837",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Lindholm:1968:APR,
  author =       "J. H. Lindholm",
  title =        "An Analysis of the Pseudo-Randomness Properties of
                 Subsequences of Long $m$-Sequences",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-14",
  number =       "4",
  pages =        "569--576",
  year =         "1968",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1968.1054188",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Mon Feb 20 15:43:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@TechReport{Marsaglia:1968:OLRa,
  author =       "George Marsaglia and T. A. Bray",
  title =        "One-line random number generators and their use in
                 combinations",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "12",
  month =        mar,
  year =         "1968",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0667956",
  abstract =     "This is a discussion of some one-line random number
                 generators, requiring a single FORTRAN instruction,
                 together with a description of some short FORTRAN
                 programs which mix several such generators. Evidence
                 suggesting that the simple congruential generators are
                 unsatisfactory continues to grow; one of the most
                 promising alternatives is to mix several simple
                 generators. These composite generators do better in
                 various tests for randomness than do the simple
                 congruential generators used at many computer
                 centers.",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:1968:OLRb,
  author =       "George Marsaglia and T. A. Bray",
  title =        "One-line random number generators and their use in
                 combinations",
  journal =      j-CACM,
  volume =       "11",
  number =       "11",
  pages =        "757--759",
  month =        nov,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65.15",
  MRnumber =     "39\#5040",
  MRreviewer =   "R. R. Coveyou",
  bibdate =      "Fri Nov 25 18:20:22 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0164.18802",
  abstract =     "Some one-line random number generators, i.e.
                 generators requiring a single FORTRAN instruction are
                 discussed, and some short FORTRAN programs which mix
                 several such generators are described. The aim is to
                 provide methods for incorporating random number
                 generators directly in FORTRAN programs, by means of a
                 few in-line instructions. The advantages are speed
                 (avoiding linkage to and from a subroutine),
                 convenience, and versatility. Anyone wishing to
                 experiment with generators, either using congruential
                 generators by themselves or mixing several generators
                 to provide a composite with potentially better
                 statistical properties than the library generators
                 currently available, may wish to consider some of the
                 simple FORTRAN program discussed here.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150E (General utility programs)",
  corpsource =   "Boeing Scientific Research Lab., Seattle, WA, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "FORTRAN; Monte Carlo; numerical analysis; PRNG
                 (pseudo-random number generator); random number
                 generation; simulation; utility programs",
  ZMreviewer =   "R. R. Coveyou",
}

@Article{Marsaglia:1968:QPR,
  author =       "George Marsaglia",
  title =        "Query 27: Pseudo Random Normal Numbers",
  journal =      j-TECHNOMETRICS,
  volume =       "10",
  number =       "2",
  pages =        "401--402",
  month =        may,
  year =         "1968",
  CODEN =        "TCMTA2",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Tue Jun 21 19:29:12 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1267057",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html;
                 http://www.tandfonline.com/loi/utch20",
}

@Article{Marsaglia:1968:RNF,
  author =       "George Marsaglia",
  title =        "Random numbers fall mainly in the planes",
  journal =      j-PROC-NATL-ACAD-SCI-USA,
  volume =       "61",
  number =       "1",
  pages =        "25--28",
  day =          "15",
  month =        sep,
  year =         "1968",
  CODEN =        "PNASA6",
  ISSN =         "0027-8424 (print), 1091-6490 (electronic)",
  ISSN-L =       "0027-8424",
  MRclass =      "65.15",
  MRnumber =     "38 #3998; 235695",
  bibdate =      "Thu Nov 14 11:39:48 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "A popularized account of this work appeared as ``Are
                 random numbers really random?'' [Scientific Research
                 (Philadelphia, PA), 3 (1968), 21--??]. This
                 widely-cited paper describes the hyperplane problem
                 that linear congruential generators suffer from,
                 although careful choice of multipliers can minimize its
                 importance: see
                 \cite{Coveyou:1967:FAU,Dyadkin:1997:SBM,Dyadkin:1997:FEL,Dyadkin:2000:SBM}.",
  ZMnumber =     "0172.21002",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the National Academy of Sciences of the
                 United States of America",
  journal-URL =  "http://www.pnas.org/search",
}

@Article{Matthews:1968:GPN,
  author =       "S. B. Matthews",
  title =        "Generation of Pseudorandom Noise Having a {Gaussian}
                 Spectral Density",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-17",
  number =       "4",
  pages =        "382--385",
  month =        apr,
  year =         "1968",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1968.229387",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 17:40:48 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1687351",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Meijer:1968:DASa,
  author =       "H. G. Meijer",
  title =        "The discrepancy of a {$G$}-adic sequence",
  journal =      "Nederl. Akad. Wetensch, Proc. Ser. A",
  volume =       "71",
  number =       "??",
  pages =        "54--66",
  month =        "????",
  year =         "1968",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 07:11:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0155.37801",
  acknowledgement = ack-nhfb,
  fjournal =     "Nederlandse Akademie van Wetenschappen. Proceedings.
                 Series A. Indagationes Mathematicae",
}

@Article{Meijer:1968:DASb,
  author =       "H. G. Meijer",
  title =        "The discrepancy of a $g$-adic sequence",
  journal =      j-INDAG-MATH,
  volume =       "30",
  number =       "??",
  pages =        "54--66",
  month =        "????",
  year =         "1968",
  CODEN =        "IMTHBJ",
  ISSN =         "0019-3577, 0023-3358",
  ISSN-L =       "0019-3577",
  MRnumber =     "MR 228450",
  bibdate =      "Thu Jan 19 07:11:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Indagationes Mathematic{\ae}",
}

@Article{Millenson:1968:HRN,
  author =       "J. R. Millenson and G. D. Sullivan",
  title =        "A hardware random number generator for use with
                 computer control of probabilistic contingencies",
  journal =      j-BEHAV-RES-METH-INSTR,
  volume =       "1",
  number =       "5",
  pages =        "194--196",
  month =        jan,
  year =         "1968",
  CODEN =        "BRMIAC",
  DOI =          "https://doi.org/10.3758/BF03207980",
  ISSN =         "0005-7878",
  bibdate =      "Fri Mar 09 07:35:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/l6q4517x00r56955/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods and Instrumentation",
  keywords =     "true random numbers from physical sources",
}

@Article{Miller:1968:ACP,
  author =       "J. C. P. Miller and M. J. Prentice",
  title =        "Additive congruential pseudo-random number
                 generators",
  journal =      j-COMP-J,
  volume =       "11",
  number =       "3",
  pages =        "341--346",
  month =        nov,
  year =         "1968",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:51:30 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/;
                 https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/110341.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/341.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/342.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/343.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/344.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/345.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_11/Issue_03/tiff/346.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "numerical methods; random number generation",
}

@InCollection{Muller:1968:RN,
  author =       "M. E. Muller",
  editor =       "????",
  booktitle =    "International Encyclopedia of Social Sciences",
  title =        "Random Numbers",
  publisher =    "????",
  address =      "????",
  pages =        "307--313",
  year =         "1968",
  LCCN =         "????",
  bibdate =      "Sat Jan 07 11:58:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Pillai:1968:NEI,
  author =       "C. S. Pillai",
  title =        "A Note on the Expectation of an Irrational Function of
                 a Random Variable",
  journal =      j-AMER-STAT,
  volume =       "22",
  number =       "3",
  pages =        "31--31",
  month =        jun,
  year =         "1968",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 09:31:38 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326355;
                 https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See note \cite{Kruskal:1968:NNC}.",
  URL =          "http://www.jstor.org/stable/2681808",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Polljak:1968:APN,
  author =       "Ju. G. Polljak",
  title =        "On the analysis of pseudorandom numbers",
  journal =      "Avtomat. i Vy{\v{c}}isl. Tehn.",
  volume =       "5",
  number =       "??",
  pages =        "31--35",
  month =        "????",
  year =         "1968",
  CODEN =        "????",
  ISSN =         "0132-4160",
  MRclass =      "65.15",
  MRnumber =     "MR 286248",
  bibdate =      "Thu Jan 19 08:06:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Avt. i Vy{\v{c}}isl. Tehn.",
  fjournal =     "Akademija Nauk Latvi\u\i sko\u\i\ SSR. Avtomatika i
                 Vy\v cislitel\cprime naja Tehnika",
  language =     "Russian",
}

@Article{Show:1968:AGR,
  author =       "Richard H. Show",
  title =        "{Algorithm 342}: {Generator} of random numbers
                 satisfying the {Poisson} distribution",
  journal =      j-CACM,
  volume =       "11",
  number =       "12",
  pages =        "819--820",
  month =        dec,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:23 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Sibuya:1968:GDE,
  author =       "M. Sibuya",
  title =        "Generating doubly exponential random numbers",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "5",
  number =       "??",
  pages =        "1--7",
  year =         "1968",
  CODEN =        "AISXAD",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  MRclass =      "60.90",
  MRnumber =     "MR0238412 (38 #6688)",
  MRreviewer =   "M. Muller",
  bibdate =      "Thu Mar 08 21:23:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Annals of the Institute of Statistical Mathematics,
                 Supplement 5",
  fjournal =     "Annals of the Institute of Statistical Mathematics
                 (Tokyo)",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Snow:1968:AGR,
  author =       "R. H. Snow",
  title =        "{Algorithm 342}: {Generator} of Random Numbers
                 Satisfying the {Poisson} Distribution [{G5}]",
  journal =      j-CACM,
  volume =       "11",
  number =       "12",
  pages =        "819--820",
  month =        dec,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Mar 24 21:38:51 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "ITT Research Inst., Chicago, IL, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "complete computer programs; Monte Carlo methods;
                 number generation; PRNG (pseudo-random number
                 generator); random; subroutines",
}

@Article{Whittlesey:1968:CCB,
  author =       "John R. B. Whittlesey",
  title =        "A comparison of the correlational behavior of random
                 number generators for the {IBM 360}",
  journal =      j-CACM,
  volume =       "11",
  number =       "9",
  pages =        "641--644",
  month =        sep,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65.15",
  MRnumber =     "MR 255011 (40\#8218)",
  bibdate =      "Fri Nov 25 18:20:21 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See implementation \cite{Fellen:1969:LEI}.",
  abstract =     "Hutchinson states that the ``new'' (prime modulo)
                 multiplicative congruential pseudorandom generator,
                 attributed to D. H. Lehmer, has passed the usual
                 statistical tests for random number generators. It is
                 here empirically shown that generators of this type can
                 produce sequences whose autocorrelation functions up to
                 lag 50 exhibit evidence of nonrandomness for many
                 multiplicative constants. An alternative generator
                 proposed by Tausworthe, which uses irreducible
                 polynomials over the field of characteristic two, is
                 shown to be free from this defect. The applicability of
                 these two generators to the IBM 360 is then discussed.
                 Since computer word size can affect a generator's
                 statistical behavior the older mixed and simple
                 congruential generators, although extensively tested on
                 computers having 36 or more bits per word, may not be
                 optimum generators for the IBM 360.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  descriptors =  "Tausworthe generator; RNG; test; comparison;
                 runtime/storage efficiency; linear congruential
                 generator; shift register sequences",
  enum =         "3287",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "32-bit versus 36-bit word size; autocorrelation
                 function; congruential generators; digital
                 shift-register generators; IBM 360; IBM S/360;
                 irreducible polynomials; linear recurrence modulo two;
                 prime numbers; primitive trinomials modulo two; PRNG
                 (pseudo-random number generator); pseudorandom number
                 generators; random numbers; serial correlation;
                 statistical tests for randomness",
  references =   "21",
  remark =       "Hutchinson states that the ``new'' (prime modulo)
                 multiplicative congruential pseudorandom generator,
                 attributed to D. H. Lehmer, has passed the usual
                 statistical tests for random number generators. It is
                 here empirically shown that generators of this type can
                 produce sequences whose autocorrelation functions up to
                 lag 50 exhibit evidence of non-randomness for many
                 multiplicative constants. an alternative generator
                 proposed by Tausworthe, which us\ldots{}",
  ZMreviewer =   "R. R. Coveyou",
}

@Article{Zaremba:1968:GLP,
  author =       "S. C. Zaremba",
  title =        "Good lattice points in the sense of {Hlawka} and
                 {Monte Carlo} integration",
  journal =      j-MONAT-MATH,
  volume =       "72",
  number =       "3",
  pages =        "264--269",
  month =        jun,
  year =         "1968",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01362552",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "65.15",
  MRnumber =     "0228155 (37 \#3739)",
  MRreviewer =   "J. Spanier",
  bibdate =      "Thu Jan 19 08:34:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/j48m46451580607q/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Zaremba:1968:MBM,
  author =       "S. K. Zaremba",
  title =        "The Mathematical Basis of {Monte Carlo} and
                 Quasi-{Monte Carlo} Methods",
  journal =      j-SIAM-REVIEW,
  volume =       "10",
  number =       "3",
  pages =        "303--314",
  month =        jul,
  year =         "1968",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1010056",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRnumber =     "233489",
  bibdate =      "Thu Mar 27 09:05:58 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/10/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://www.jstor.org/stable/2027655",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "July 1968",
}

@Article{Beasley:1969:DTS,
  author =       "J. D. Beasley and K. Wilson",
  title =        "Design and testing of the {System 4} random number
                 generator",
  journal =      j-COMP-J,
  volume =       "12",
  number =       "4",
  pages =        "368--372",
  month =        nov,
  year =         "1969",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:51:40 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/120368.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/368.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/369.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/370.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/371.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/372.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "random number generation",
}

@Article{Bell:1969:DFT,
  author =       "C. B. Bell and J. F. Donoghue",
  title =        "Distribution-free tests of randomness",
  journal =      j-SANKHYA-A,
  volume =       "31",
  number =       "??",
  pages =        "157--176",
  month =        "????",
  year =         "1969",
  CODEN =        "SANABS",
  ISSN =         "0036-4452",
  ISSN-L =       "0036-4452",
  bibdate =      "Mon Jan 16 22:07:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series A.
                 Methods and Techniques",
  journal-URL =  "https://www.jstor.org/journal/sankhyaseriesa",
}

@Article{Chaitin:1969:LPC,
  author =       "Gregory J. Chaitin",
  title =        "On the Length of Programs for Computing Finite Binary
                 Sequences: {Statistical} Considerations",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "145--159",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321495.321506",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:05:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "An attempt is made to carry out a program (outlined in
                 a previous paper) for defining the concept of a random
                 or patternless, finite binary sequence, and for
                 subsequently defining a random or patternless, infinite
                 binary sequence to be a sequence whose initial segments
                 are all random or patternless finite binary sequences.
                 A definition based on the bounded-transfer Turing
                 machine is given detailed study, but insufficient
                 understanding of this computing machine precludes a
                 complete treatment. A computing machine is introduced
                 which avoids these difficulties.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InProceedings{Coveyou:1969:RNG,
  author =       "R. R. Coveyou",
  title =        "Random number generation is too important to be left
                 to chance",
  crossref =     "Anonymous:1969:CPP",
  pages =        "70--111",
  year =         "1969",
  LCCN =         "QA1 S565 v. 3",
  bibdate =      "Thu Jan 12 17:50:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "The clever title of this paper is widely cited on the
                 Internet, but the contents are heavily mathematical. On
                 page 108, section 12, the author remarks ``There is at
                 present no RNG known to be superior to an SLCRNG
                 [simple linear congruential random number generator]
                 with a carefully chosen multiplier $ \lambda $. The
                 choice of addend $ \mu $ is not of great importance.''
                 The reference is to a generator of the form $ x_{n + 1}
                 = (\lambda x_x + \mu) \bmod P $, and page 93 gives
                 conditions on the parameters $ \lambda $ and $ \mu $
                 for reaching maximal period $P$. However, since this
                 paper was written, many much better generators have
                 been found. In the same section, Coveyou says ``reports
                 of {\em good\/} performance of RNG, not supported by
                 theory, must be deemed irrelevant.'' Pages 108--110
                 contain critical comments on entry
                 \cite{Zaremba:1969:MBM}.",
}

@Article{Cunsolo:1969:CNP,
  author =       "D. Cunsolo",
  title =        "Costruzione di numeri pseudorandom con periodo
                 superiore alla base $m$. ({Italian}) [Generation of
                 pseudorandom numbers with period greater than the base
                 $m$ ]",
  journal =      j-CALCOLO,
  volume =       "6",
  number =       "1",
  pages =        "69--85",
  month =        mar,
  year =         "1969",
  CODEN =        "CALOBK",
  DOI =          "https://doi.org/10.1007/BF02576125",
  ISSN =         "0008-0624 (print), 1126-5434 (electronic)",
  ISSN-L =       "0008-0624",
  bibdate =      "Mon Jan 16 22:08:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/60u464k30851uj27/",
  acknowledgement = ack-nhfb,
  fjournal =     "Calcolo: a quarterly on numerical analysis and theory
                 of computation",
  journal-URL =  "http://link.springer.com/journal/10092",
  language =     "Italian",
  remark =       "From the English abstract: ``In the present study a
                 modified method (of the linear congruential generator,
                 $ x_{n + 1} = (a x_n + b) \bmod m $ ) is proposed in
                 order to increase this period up to values of $ M
                 \approx m^2 $. The modified method consists in a
                 systematic variation of the parameter $b$, with a
                 period conveniently different from $m$''.",
}

@TechReport{Deo:1969:APN,
  author =       "N. Deo and D. Rubin",
  title =        "An additive pseudorandom number generator with
                 semi-infinite sequence length",
  type =         "Report",
  institution =  "NASA",
  address =      "????",
  pages =        "4",
  year =         "1969",
  bibdate =      "Thu Jan 19 17:27:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Document ID 19700050209.",
  acknowledgement = ack-nhfb,
  remark =       "U. of Hawaii, Hawaii International Conference on
                 System Sciences, 2nd, U. of Hawaii; 2nd; Jan. 22--24,
                 1969; Honolulu, HI",
}

@Article{Dieter:1969:AME,
  author =       "Ulrich Dieter",
  title =        "{Autokcorrelation multiplikativ erzeugter
                 Pseudo-Zufallszahlen}. ({German}) [{Autocorrelation} in
                 multiplicatively-generated pseudorandom numbers]",
  journal =      j-OPER-RES-VERFAHREN,
  volume =       "6",
  number =       "??",
  pages =        "69--85",
  month =        "????",
  year =         "1969",
  CODEN =        "ORVEAI",
  ISSN =         "0078-5318",
  bibdate =      "Mon Jan 16 22:09:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Operations Research-Verfahren}",
  language =     "German",
}

@Article{Donnelly:1969:STU,
  author =       "T. Donnelly",
  title =        "Some techniques for using pseudorandom numbers in
                 computer simulation",
  journal =      j-CACM,
  volume =       "12",
  number =       "7",
  pages =        "392--394",
  month =        jul,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:27 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1220 (Simulation, modelling and identification);
                 C4190 (Other numerical methods)",
  corpsource =   "Univ. North Carolina, Chapel Hill, NC, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "numerical methods; PRNG (pseudo-random number
                 generator); simulation",
}

@Article{Downham:1969:RT,
  author =       "D. Y. Downham",
  title =        "The runs up and down test",
  journal =      j-COMP-J,
  volume =       "12",
  number =       "4",
  pages =        "373--376",
  month =        nov,
  year =         "1969",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:51:40 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/120373.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/373.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/374.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/375.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_12/Issue_04/tiff/376.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "random number generation",
}

@Article{Fellen:1969:LEI,
  author =       "Bryna M. Fellen",
  title =        "Letter to the {Editor}: an implementation of the
                 {Tausworthe} generator",
  journal =      j-CACM,
  volume =       "12",
  number =       "7",
  pages =        "413--413",
  month =        jul,
  year =         "1969",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/363156.363194",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:27 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Whittlesey:1968:CCB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Good:1969:HRR,
  author =       "I. J. Good",
  title =        "How random are random numbers?",
  journal =      j-AMER-STAT,
  volume =       "23",
  number =       "4",
  pages =        "42--45",
  month =        oct,
  year =         "1969",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2681742",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
  remark =       "The prolific author I. J. Good (his `shorter
                 publications list' available on the Web lists 2378 of
                 his publications) reports in \cite[page 43, column
                 2]{Good:1969:HRR} ``This method [the multiplicative
                 congruential generator] was proposed by the writer in a
                 classified paper in 1948 and [independently] by Lehmer
                 \cite{Lehmer:1951:MML} [the proceedings of a September
                 1949 conference].'' See also the remark from this paper
                 in entry \cite{Good:1950:PWE}.",
}

@Article{Grosenbaugh:1969:MFR,
  author =       "L. R. Grosenbaugh",
  title =        "More on {Fortran} random number generators",
  journal =      j-CACM,
  volume =       "12",
  number =       "11",
  pages =        "639--639",
  month =        nov,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:28 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Gubenko:1969:FPR,
  author =       "V. S. Gubenko and N. E. Kirillov and K. A.
                 Me{\v{s}}kovski{\u\i} and A. I. {\v{C}}erkunov",
  title =        "Formation of pseudo-random uniformly distributed
                 numbers from noise-like signals",
  journal =      "Izv. Akad. Nauk SSSR Tehn. Kibernet.",
  volume =       "1",
  number =       "??",
  pages =        "57--63",
  month =        "????",
  year =         "1969",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 06:54:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hemmerle:1969:GPN,
  author =       "W. J. Hemmerle",
  title =        "Generating pseudorandom numbers on a two's complement
                 machine such as the {IBM 360}",
  journal =      j-CACM,
  volume =       "12",
  number =       "7",
  pages =        "382--383",
  month =        jul,
  year =         "1969",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/363156.363166",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:27 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The familiar multiplicative congruential generator is
                 examined in the context of the type of two's complement
                 arithmetic used in the IBM 360 series. Different
                 sequences of residues are considered and relationships
                 established among them. It is shown that a sequence of
                 positive and negative residues may be produced more
                 simply and economically than with the conventional
                 approach and yet have twice the period of the latter
                 without loss of desirable statistical properties.
                 Another easily generated sequence involving absolute
                 values is also shown to have twice the period but with
                 the less attractive statistical properties. The
                 statistical properties of these sequences are given and
                 related to previously established criteria.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7890 (Other
                 special applications of computing)",
  corpsource =   "Univ. Rhode Island, Kingston, RI, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "digital arithmetic; IBM S/360; PRNG (pseudo-random
                 number generator); random number generation",
}

@Article{Knop:1969:RAG,
  author =       "R. Knop",
  title =        "Remark on {Algorithm 334} [{G5}]: {Normal} random
                 deviates",
  journal =      j-CACM,
  volume =       "12",
  number =       "5",
  pages =        "281--281",
  month =        may,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:26 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7513",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
  references =   "0",
}

@Article{Kruskal:1969:EPR,
  author =       "J. B. Kruskal",
  title =        "Extremely Portable Random Number Generator",
  journal =      j-CACM,
  volume =       "12",
  number =       "2",
  pages =        "93--94",
  month =        feb,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:24 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Extremely portable subroutines are sometimes needed
                 for which moderate quality and efficiency suffice.
                 Typically, this occurs for library functions (like
                 random number generation and in core sorting) which are
                 not entirely universal or are not used in a
                 standardized way. The literature on random number
                 generators does not seem to contain an algorithm that
                 meets requirements of this sort. An extremely portable
                 8-line FORTRAN program is provided which based on an
                 important paper by Coveyou and MacPherson (1967).Using
                 their methods, Fourier analysis is applied to the
                 probability function for the consecutive n-tuples
                 provided by our generator (with $n$ less than or equal
                 to 4). While the small modulus which must be used to
                 maintain portability prevents the quality of the
                 generator from being high, the generator compares well
                 with the bounds established in the above mentioned
                 paper.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Bell Telephone Lab. Inc., Murray Hill, NJ, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "linear sequential generators; PRNG (pseudo-random
                 number generator); pseudo random numbers; random
                 generators; random number analysis; random number
                 generation; random number generators; random number
                 program; random numbers; subroutines",
}

@Article{Lee:1969:ECF,
  author =       "W. C. Y. Lee",
  title =        "An extended correlation function of two random
                 variables applied to mobile radio transmission",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "48",
  number =       "10",
  pages =        "3423--3440",
  month =        dec,
  year =         "1969",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  MRclass =      "94.10",
  MRnumber =     "0261999 (41 \#6609)",
  MRreviewer =   "P. M. Lee",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1969/BSTJ.1969.4810.html;
                 http://www.alcatel-lucent.com/bstj/vol48-1969/bstj-vol48-issue10.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{Anonymous:1970:EWC}.",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol48/bstj48-10-3423.pdf;
                 http://www.alcatel-lucent.com/bstj/vol48-1969/articles/bstj48-10-3423.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Lehmer:1969:BRR,
  author =       "D. H. Lehmer",
  title =        "Book Review: {{\booktitle{Random number generators}}
                 by Birger Jansson}",
  journal =      j-QUART-APPL-MATH,
  volume =       "27",
  number =       "3",
  pages =        "421--421",
  year =         "1969",
  CODEN =        "QAMAAY",
  DOI =          "https://doi.org/10.2307/43636000",
  ISSN =         "0033-569X (print), 1552-4485 (electronic)",
  ISSN-L =       "0033-569X",
  bibdate =      "Mon Jan 31 10:50:30 2022",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/l/lehmer-derrick-henry.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/43636000",
  acknowledgement = ack-nhfb,
  fjournal =     "Quarterly of Applied Mathematics",
  journal-URL =  "http://dl.acm.org/citation.cfm?id=J641;
                 http://www.ams.org/journals/qam",
  reviewed-author = "Birger Jansson",
}

@Article{Lewis:1969:PNG,
  author =       "P. A. W. Lewis and A. S. Goodman and J. M. Miller",
  title =        "A pseudorandom number generator for the {SYSTEM\slash
                 360}",
  journal =      j-IBM-SYS-J,
  volume =       "8",
  number =       "2",
  pages =        "136--146",
  year =         "1969",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IBM Systems Journal",
}

@TechReport{Marsaglia:1969:OSA,
  author =       "George Marsaglia",
  title =        "One-Sided Approximations by Linear Combinations of
                 Functions",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "18",
  month =        sep,
  year =         "1969",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0695796",
  abstract =     "The paper discusses how to approximate a function $
                 g(x) $ from one side by a linear combination of
                 functions $ f_1 (x), \ldots {}, f_n(x) $ so as to
                 minimize the area between the two. It discusses the
                 problem as one of finding the point where a moving
                 hyperplane last touches a convex set and an approximate
                 procedure based on linear programming methods. It gives
                 details of an algorithm for solving the problem,
                 examples, and applications to Monte Carlo Theory ---
                 generating random variables in a computer.",
  acknowledgement = ack-nhfb,
}

@TechReport{Marsaglia:1969:RCR,
  author =       "George Marsaglia",
  title =        "Regularities in congruential random number
                 generators",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "8",
  month =        may,
  year =         "1969",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0689295",
  abstract =     "The paper suggests that points in $n$-space produced
                 by congruential random number generators are too
                 regular for general Monte Carlo use. Regularity was
                 established previously for multiplicative congruential
                 generators by showing that all the points fall in sets
                 of relatively few parallel hyperplanes. The existence
                 of many containing sets of parallel hyperplanes was
                 easily established, but proof that the number of
                 hyperplanes was small required a result of Minkowski
                 from the geometry of numbers --- a symmetric, convex
                 set of volume 2 to the nth power must contain at least
                 two points with integral coordinates. The present paper
                 takes a different approach to establishing the course
                 lattice structure of congruential generators. It gives
                 a simple, self-contained proof that points in $n$-space
                 produced by the general congruential generator $ r_(i +
                 1)$ is identically equal to $ a(r_i) + b \bmod m$ must
                 fall on a lattice with unit-cell volume at least $m$ to
                 the power $ (n - 1)$. There is no restriction on $a$ or
                 $b$; this means that all congruential random number
                 generators must be considered unsatisfactory in terms
                 of lattices containing the points they produce, for a
                 good generator of random integers should have an
                 $n$-lattice with unit-cell volume 1.",
  acknowledgement = ack-nhfb,
}

@Article{Martin-Lof:1969:AR,
  author =       "P. Martin-L{\"o}f",
  title =        "Algorithms and randomness",
  journal =      j-REV-INST-INT-STAT,
  volume =       "37",
  number =       "??",
  pages =        "265--272",
  month =        "????",
  year =         "1969",
  CODEN =        "????",
  ISSN =         "0373-1138 (print), 2212-1846 (electronic)",
  bibdate =      "Mon Jan 16 22:10:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Rev. Inst. Int. Stat.",
  fjournal =     "Revue de l'Institut international de statistique =
                 Review of the International Statistical Institute",
  journal-URL =  "https://www.jstor.org/journal/revuinstintestat",
}

@Article{Massey:1969:SRS,
  author =       "J. L. Massey",
  title =        "Shift-Register Synthesis and {BCH} Decoding",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-15",
  number =       "1",
  pages =        "122--127",
  month =        jan,
  year =         "1969",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1969.1054260",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Mon Jun 27 21:47:51 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  remark =       "This paper, and \cite{Berlekamp:1968:ACT}, are the
                 origin of the Berlekamp--Massey algorithm for
                 recovering parameters from bit streams from linear
                 feedback shift register (LSFR) generators.",
}

@Article{Meyer:1969:MGR,
  author =       "D. L. Meyer",
  title =        "Methods of generating random normal numbers",
  journal =      j-EDU-PSYCH-MEASUREMENT,
  volume =       "29",
  number =       "1",
  pages =        "193--198",
  month =        "????",
  year =         "1969",
  CODEN =        "EPMEAJ",
  ISSN =         "0013-1644 (print), 1552-3888 (electronic)",
  ISSN-L =       "0013-1644",
  bibdate =      "Thu Mar 08 21:21:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Educational and Psychological Measurement",
}

@Article{Naylor:1969:BSG,
  author =       "T. H. Naylor",
  title =        "Bibliography 19: Simulation and gaming",
  journal =      j-COMP-REV,
  volume =       "10",
  number =       "??",
  pages =        "61--69",
  month =        "????",
  year =         "1969",
  CODEN =        "CPGRA6",
  ISSN =         "0010-4884, 0149-1202",
  ISSN-L =       "0010-4884",
  bibdate =      "Thu Jan 19 07:22:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing Reviews",
}

@Article{Passaquindici:1969:MMC,
  author =       "Maria Passaquindici",
  title =        "{I} metodi di {Monte Carlo} e la generazione dei
                 numeri casuali. ({Italian}) [{Monte Carlo} methods and
                 the generation of random numbers]",
  journal =      j-METRON,
  volume =       "27",
  number =       "3--4",
  pages =        "88--112, i--viii. (2 foldouts)",
  month =        "????",
  year =         "1969",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  MRclass =      "65C10",
  MRnumber =     "324869",
  MRreviewer =   "E. Bareiss",
  bibdate =      "Sun Jul 5 08:55:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0204.51501; 03325334",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  language =     "Italian",
}

@Article{Payne:1969:CLP,
  author =       "W. H. Payne and J. R. Rabung and T. P. Bogyo",
  title =        "Coding the {Lehmer} pseudo-random number generator",
  journal =      j-CACM,
  volume =       "12",
  number =       "2",
  pages =        "85--86",
  month =        feb,
  year =         "1969",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/362848.362860",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:24 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "An algorithm and coding technique is presented for
                 quick evaluation of the Lehmer pseudo-random number
                 generator modulo $ 2^{31} - 1 $, a prime Mersenne
                 number which produces $ 2^{31} - 2 $ numbers, on a
                 $p$-bit (greater than $ 31 $ ) computer. The
                 computation method is extendible to limited problems in
                 modular arithmetic. Prime factorization for $ 2^{61} -
                 2 $ and a primitive root for $ 2^{61} - 1 $, the next
                 largest prime Mersenne number, are given for possible
                 construction of a pseudo-random number generator of
                 increased cycle length.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Washington State Univ., Pullman, WA, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "modular arithmetic; prime factorization; primitive
                 roots; PRNG (pseudo-random number generator);
                 programming; pseudo-random number; random number;
                 random number generation; simulation; uniform frequency
                 function; uniform probability density",
}

@Article{Seraphin:1969:NAF,
  author =       "Dominic S. Seraphin",
  title =        "Numerical Analysis: a fast random number generator for
                 {IBM 360}",
  journal =      j-CACM,
  volume =       "12",
  number =       "12",
  pages =        "695--695",
  month =        dec,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:29 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "State Univ. New York, Stony Brook, NY, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "IBM S/360; PRNG (pseudo-random number generator);
                 random number generation; subroutines",
}

@Article{Verdier:1969:RWS,
  author =       "P. H. Verdier",
  title =        "Relations within sequences of congruential
                 pseudorandom numbers",
  journal =      j-J-RES-NATL-BUR-STAND-B,
  volume =       "73",
  number =       "??",
  pages =        "41--44",
  month =        "????",
  year =         "1969",
  CODEN =        "JNBBAU",
  ISSN =         "0022-4340",
  bibdate =      "Mon Jan 16 22:11:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Research of the National Bureau of
                 Standards. Section B, Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.nist.gov/nvl/jrespastpapers.cfm",
}

@Article{Whittlesey:1969:LEM,
  author =       "John R. B. Whittlesey",
  title =        "Letter to the {Editor}: {On} the Multidimensional
                 Uniformity of Pseudorandom Generators",
  journal =      j-CACM,
  volume =       "12",
  number =       "5",
  pages =        "247--247",
  month =        may,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:26 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Marsaglia:1968:RNF}.",
  acknowledgement = ack-nhfb,
  annote =       "It would appear that George Marsaglia's recent article
                 proving that all the pseudorandom points generated in
                 the unit n-cube ``will be found to lie in a relatively
                 small number of parallel hyperplanes'' has given the
                 coup de grace, to the use of multiplicative
                 congruential generators in all Monte Carlo
                 applications, except those having the most
                 non-stringent requirements for multidimensional
                 uniformity.",
  country =      "USA",
  descriptors =  "Comparison; shift register sequences; Tausworthe
                 generator; RNG; test; multidimensional uniformity; grid
                 structure; linear congruential generator",
  enum =         "3286",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
  references =   "7",
  remark =       "It would appear that George Marsaglia's recent article
                 proving that all the pseudorandom points generated in
                 the unit n-cube ``will be found to lie in a relatively
                 small number of parallel hyperplanes'' has given the
                 coup de grace, to the use of multiplicative
                 congruential generators in all Monte Carlo
                 applications, except those having the most
                 non-stringent requirements for multidimensional
                 uniformity.",
}

@InProceedings{Zaremba:1969:MBM,
  author =       "S. K. Zaremba",
  title =        "The Mathematical Basis of {Monte Carlo} and
                 quasi-{Monte Carlo} Methods",
  crossref =     "Anonymous:1969:CPP",
  pages =        "1--12",
  year =         "1969",
  LCCN =         "QA1 S565 v. 3",
  bibdate =      "Thu Jan 12 17:50:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See critical comments in \cite[pages
                 108--110]{Coveyou:1969:RNG}.",
  acknowledgement = ack-nhfb,
}

@Article{Ahrens:1970:PRN,
  author =       "J. H. Ahrens and Ulrich Dieter and A. Grube",
  title =        "Pseudo-Random Numbers. {A} New Proposal for the Choice
                 of Multiplicators",
  journal =      j-COMPUTING,
  volume =       "6",
  number =       "1--2",
  pages =        "121--138",
  month =        mar,
  year =         "1970",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:51 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-ec # " and " # ack-nhfb,
  affiliation =  "Nova Scotia Tech. Coll., Halifax, NS, Canada",
  classification = "C7890",
  description =  "random number generation; subroutines",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "ALGOL subroutines; autocorrelation of sequence; choice
                 of multiplicators; FORTRAN subroutines; pseudo-random
                 numbers",
}

@Article{Anonymous:1970:EWC,
  author =       "Anonymous",
  title =        "Erratum: {W. C. Y. Lee, {\em An extended correlation
                 function of two random variables applied to mobile
                 radio transmission}, BSTJ {\bf 48}(10) 3423--3440
                 (1969)}",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "49",
  number =       "2",
  pages =        "320--320",
  month =        feb,
  year =         "1970",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1970/BSTJ.1970.4902.html;
                 http://www.alcatel-lucent.com/bstj/vol49-1970/bstj-vol49-issue02.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Lee:1969:ECF}.",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol49/bstj49-2-320.pdf;
                 http://www.alcatel-lucent.com/bstj/vol49-1970/articles/bstj49-2-320.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@TechReport{Anonymous:1970:FVP,
  author =       "Anonymous",
  title =        "A {Fortran V} package for testing and anaylsis of
                 pseudorandom number generators",
  type =         "Technical report",
  number =       "CP-700011",
  institution =  "Computer Science/Operations Research Center, Institute
                 of Technology, Southern Methodist University",
  address =      "Dallas, TX, USA",
  pages =        "32",
  year =         "1970",
  bibdate =      "Fri Feb 09 17:44:49 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Behboodian:1970:ERV,
  author =       "Javad Behboodian",
  title =        "On the Expectation of the Random Variable {$ (X^2 -
                 Y^2)^{1 / 2} $}",
  journal =      j-AMER-STAT,
  volume =       "24",
  number =       "4",
  pages =        "28--29",
  month =        oct,
  year =         "1970",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:19 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326366;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2681312",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Blaisdell:1970:RSP,
  author =       "B. E. Blaisdell and H. Solomon",
  title =        "On random sequential packing in the plane and a
                 conjecture of {Pal{\'a}sti}",
  journal =      j-J-APPL-PROBAB,
  volume =       "7",
  number =       "3",
  pages =        "667--689",
  month =        dec,
  year =         "1970",
  CODEN =        "JPRBAM",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Wed Feb 29 21:17:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/3211946",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html;
                 http://projecteuclid.org/euclid.jap/",
  keywords =     "parking-lot test; sphere packing",
}

@Article{Butler:1970:AAG,
  author =       "E. L. Butler",
  title =        "{ACM Algorithm 370}: General Random Number Generator",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "49--52",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remark \cite{Proll:1972:RAA}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Texas A and M Univ., College Station, TX, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "random number generation; subroutines",
}

@Article{Cenacchi:1970:PRN,
  author =       "G. Cenacchi and A. {De Matteis}",
  title =        "Pseudo-random numbers for comparative {Monte Carlo}
                 calculations",
  journal =      j-NUM-MATH,
  volume =       "16",
  number =       "1",
  pages =        "11--15",
  month =        feb,
  year =         "1970",
  CODEN =        "NUMMA7",
  DOI =          "https://doi.org/10.1007/BF02162402",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "To compare the results of two slightly different
                 situations in a given problem solved by the Monte Carlo
                 method it is convenient to use the same random numbers
                 in both cases. To facilitate the reproducibility of the
                 random numbers used a method based on two pseudo-random
                 number generators may be adopted. In this paper the
                 method is discussed with reference to multiplicative
                 congruential generators, the influence of the initial
                 value on a random sequence obtained by a given
                 multiplier being examined first.",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C7890 (Other special
                 applications of computing)",
  corpsource =   "CNEN, Bologna, Italy",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "Monte Carlo methods; random number generation",
}

@Article{Dixon:1970:NSE,
  author =       "J. Dixon",
  title =        "The number of steps in the {Euclidean} algorithm",
  journal =      j-J-NUMBER-THEORY,
  volume =       "2",
  number =       "??",
  pages =        "414--422",
  month =        "????",
  year =         "1970",
  CODEN =        "JNUTA9",
  ISSN =         "0022-314X (print), 1096-1658 (electronic)",
  ISSN-L =       "0022-314X",
  bibdate =      "Thu Dec 29 07:11:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Number Theory",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0022314X",
}

@Article{Downham:1970:SAA,
  author =       "D. Y. Downham",
  title =        "Statistical Algorithms: {Algorithm AS 29}: The Runs Up
                 and Down Test",
  journal =      j-APPL-STAT,
  volume =       "19",
  number =       "2",
  pages =        "190--192",
  month =        jun,
  year =         "1970",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:19:52 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Wedderburn:1976:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/29",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Fuchs:1970:EDR,
  author =       "E. A. Fuchs and P. E. Jackson",
  title =        "Estimates of Distributions of Random Variables for
                 Certain Computer Communications Traffic Models",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "752--757",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reproduced in Advances in Computer Commun., Chu, W.
                 W., (Ed (1974), 2-7; in Computer Commun., Green, P. E.,
                 and Lucky, R. W. (Eds.), (1975), 577-582).",
  abstract =     "A study of multiaccess computer communications has
                 characterized the distributions underlying an
                 elementary model of the user-computer interactive
                 process. The model used is elementary in the sense that
                 many of the random variables that generally are of
                 interest in computer communications studies can be
                 decomposed into the elements of this model. Data were
                 examined from four operational multiaccess systems, and
                 the model is shown to be robust; that is each of the
                 variables of the model has the same distribution
                 independent of which of the four systems is being
                 examined. It is shown that the gamma distribution can
                 be used to describe the discrete variables.
                 Approximations to the gamma distribution by the
                 exponential distribution are discussed for the systems
                 studied.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Bell Telephone Labs. Inc., Holmdel, NJ, USA",
  descriptors =  "Random Process; Computer Communication; Traffic Model;
                 Distribution; Estimation",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "computation theory; computer communications;
                 distribution of random variables; modelling;
                 multi-access systems; multiaccess systems; operating
                 systems; operating systems (computers); optimisation
                 models; optimization models; time-sharing; time-sharing
                 systems; user computer interactive processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Good:1970:RPM,
  author =       "Irving John Good",
  title =        "Review of {Philip McShane, \booktitle{Randomness,
                 Statistics, and Emergence}, Gill and MacMillan, 1970}",
  journal =      "Times Literary Supplement",
  volume =       "??",
  number =       "??",
  pages =        "1043",
  day =          "18",
  month =        sep,
  year =         "1970",
  bibdate =      "Mon Nov 12 08:43:06 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See book \cite{McShane:1970:RSE}.",
  acknowledgement = ack-nhfb,
}

@Article{Gustavson:1970:FRN,
  author =       "F. G. Gustavson and W. Liniger",
  title =        "A Fast Random Number Generator with Good Statistical
                 Properties",
  journal =      j-COMPUTING,
  volume =       "6",
  number =       "3--4",
  pages =        "221--226",
  year =         "1970",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:51 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-ec # " and " # ack-nhfb,
  affiliation =  "IBM, Yorktown Heights, NY, USA",
  classification = "C7890",
  description =  "random number generation",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "calculation time reduction; division operation;
                 IBM/360; overflow tests removal; random number
                 generator; shift instructions; speed increasing;
                 statistical properties",
}

@Article{Haber:1970:NEM,
  author =       "Seymour Haber",
  title =        "Numerical Evaluation of Multiple Integrals",
  journal =      j-SIAM-REVIEW,
  volume =       "12",
  number =       "4",
  pages =        "481--526",
  month =        oct,
  year =         "1970",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1012102",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:06:22 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/12/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://www.jstor.org/stable/2028488",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "October 1970",
  remark =       "Tutorial on multidimensional Monte Carlo
                 integration.",
}

@Article{Haber:1970:SNA,
  author =       "Seymour Haber",
  title =        "Sequences of Numbers That Are Approximately Completely
                 Equidistributed",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "269--272",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321574.321580",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Halton:1970:RPS,
  author =       "John H. Halton",
  title =        "A Retrospective and Prospective Survey of the {Monte
                 Carlo} Method",
  journal =      j-SIAM-REVIEW,
  volume =       "12",
  number =       "1",
  pages =        "1--63",
  month =        "????",
  year =         "1970",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1012001",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:06:14 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/12/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "January 1970",
}

@Article{Harris:1970:AFG,
  author =       "V. C. Harris",
  title =        "An Algorithm for Finding the Greatest Common Divisor",
  journal =      j-FIB-QUART,
  volume =       "8",
  number =       "1",
  pages =        "102--103",
  month =        feb,
  year =         "1970",
  CODEN =        "FIBQAU",
  ISSN =         "0015-0517",
  ISSN-L =       "0015-0517",
  bibdate =      "Thu Oct 20 18:05:23 MDT 2011",
  bibsource =    "http://www.fq.math.ca/8-1.html;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.fq.math.ca/Scanned/8-1/harris1.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Fib. Quart",
  fjournal =     "The Fibonacci Quarterly. Official Organ of the
                 Fibonacci Association",
  journal-URL =  "http://www.fq.math.ca/",
}

@Article{Hastings:1970:MCS,
  author =       "W. K. Hastings",
  title =        "{Monte Carlo} Sampling Methods Using {Markov} Chains
                 and Their Applications",
  journal =      j-BIOMETRIKA,
  volume =       "57",
  number =       "1",
  pages =        "97--109",
  month =        apr,
  year =         "1970",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2334940",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  bibdate =      "Sat Jun 21 14:33:36 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315464;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This paper introduces what is now known as the
                 Metropolis--Hastings algorithm, a generalization of the
                 work in \cite{Metropolis:1953:ESC}. See \cite[page
                 255]{Hitchcock:2003:HMH}.",
  URL =          "http://www.jstor.org/stable/2334940;
                 http://www.probability.ca/hastings/",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://www.jstor.org/journals/00063444.html",
  keywords =     "Metropolis--Hastings algorithm",
}

@Book{Johnson:1970:CUD,
  author =       "Norman Lloyd Johnson and Samuel Kotz",
  title =        "Continuous univariate distributions",
  publisher =    "Hougton Mifflin",
  address =      "New York, NY, USA",
  pages =        "xiv + 300 (vol. 1), xiii + 306 (vol. 2)",
  year =         "1970",
  LCCN =         "QA273.6 .J6",
  MRclass =      "62Exx, 62-02, 62E10, 62E15",
  bibdate =      "Thu Mar 1 09:37:58 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Distributions in statistics",
  ZMnumber =     "Zbl 0213.21101",
  acknowledgement = ack-nhfb,
  subject =      "distribution (probability theory)",
}

@Article{Juncosa:1970:BRBb,
  author =       "Mario Juncosa",
  title =        "Book Review: {{\booktitle{Random Number Generators}}
                 (Birger Jansson)}",
  journal =      j-SIAM-REVIEW,
  volume =       "12",
  number =       "2",
  publisher =    "SIAM",
  pages =        "310--311",
  month =        "????",
  year =         "1970",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1012068",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:06:17 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/12/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://link.aip.org/link/?SIR/12/310/1",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "April 1970",
}

@Article{Kale:1970:CNN,
  author =       "B. K. Kale",
  title =        "Classroom Notes: Normality of Linear Combinations of
                 Non-Normal Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "77",
  number =       "9",
  pages =        "992--995",
  month =        nov,
  year =         "1970",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:07 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Knop:1970:AAR,
  author =       "R. E. Knop",
  title =        "{ACM Algorithm 381}: Random Vectors Uniform In Solid
                 Angle",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "326--326",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remark \cite{Schrack:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Rutgers Univ., New Brunswick, NJ, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "random number generation; subroutines",
}

@Article{Lempel:1970:HBG,
  author =       "A. Lempel",
  title =        "On a Homomorphism of the {de Bruijn} Graph and its
                 Applications to the Design of Feedback Shift
                 Registers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-19",
  number =       "12",
  pages =        "1204--1209",
  month =        dec,
  year =         "1970",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1970.222859",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 08:01:38 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671452",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InCollection{Linder:1970:TTR,
  author =       "Arthur Linder",
  title =        "Testing a table of random numbers",
  crossref =     "Bose:1970:EPS",
  pages =        "469--478",
  year =         "1970",
  bibdate =      "Mon Jan 16 22:00:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0228.62003",
  acknowledgement = ack-nhfb,
}

@Article{Maritsas:1970:CSV,
  author =       "D. G. Maritsas and M. G. Hartley",
  title =        "A Case Study of a Versatile Generator of Repeatable
                 Non-{Poisson} Sequences of Pseudorandom Pulses",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-19",
  number =       "10",
  pages =        "924--938",
  month =        oct,
  year =         "1970",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1970.222800",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 08:01:37 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671393",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Maritsas:1970:DCG,
  author =       "D. G. Maritsas and M. G. Hartley",
  title =        "Design Criteria for a Generator of Repeatable
                 Non-{Poisson} Sequences of Pseudorandom Pulses",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-19",
  number =       "9",
  pages =        "812--817",
  month =        sep,
  year =         "1970",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1970.223045",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 08:01:36 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671638",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Marsaglia:1970:RCR,
  author =       "George Marsaglia",
  title =        "Regularities in congruential random number
                 generators",
  journal =      j-NUM-MATH,
  volume =       "16",
  number =       "1",
  pages =        "8--10",
  month =        feb,
  year =         "1970",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65.15",
  MRnumber =     "42 \#8651; 273775",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0212.18204",
  acknowledgement = ack-nhfb,
  classification = "C7890 (Other special applications of computing)",
  corpsource =   "Boeing Sci. Res. Labs., Seattle, WA, USA",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "random number generation",
  xxyear =       "1970/1971",
  ZMclass =      "65C10 Random number generation",
}

@TechReport{Marsaglia:1970:RVI,
  author =       "George Marsaglia",
  title =        "Random Variables with Independent Binary Digits",
  type =         "Report",
  number =       "??",
  institution =  inst-BOEING-SRL,
  address =      inst-BOEING-SRL:adr,
  pages =        "15",
  month =        jan,
  year =         "1970",
  bibdate =      "Wed Nov 12 07:42:28 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/docs/citations/AD0705642",
  abstract =     "Let $ X = .b_1 b_2 b_3 \ldots {} $ be a random
                 variable with independent binary digits $ b_n $ taking
                 values $0$ or $1$ with probabilities $ p_n$ and $ q_n$.
                 When does $X$ have a density function? A continuous
                 density function? A singular distribution? This note
                 proves that the distribution $X$ is singular is and
                 only if the tail of the series $ \sum (\log (p_n /
                 q_n))$ squared diverges, and that $X$ has a density
                 that is positive on some interval if and only if $ \log
                 (p_n / q_n)$ is a geometric sequence with ratio $ 1 /
                 2$ for $n$ greater than some $k$, and in that case the
                 fractional part of $ 2^k X$ has an exponential density
                 (increasing or decreasing with the uniform density a
                 special case). It gives a sufficient condition for $X$
                 to have a density, ($ \sum \log (2 \max (p_n, q_n))$
                 converges), but unless the tail of the sequence $ \log
                 (p_n / q_n)$ is geometric, ratio $ 1 / 2$, the density
                 is a weird one that vanishes at least once in every
                 interval.",
  acknowledgement = ack-nhfb,
}

@Book{McShane:1970:RSE,
  author =       "P. McShane",
  title =        "Randomness, Statistics and Emergence",
  publisher =    "University of Notre Dame Press",
  address =      "South Bend, IN, USA",
  pages =        "x + 268",
  year =         "1970",
  LCCN =         "????",
  bibdate =      "Thu Jan 19 07:09:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Also published by Gill and Macmillan, Dublin,
                 Ireland.",
}

@Article{Murry:1970:GAG,
  author =       "Herschell F. Murry",
  title =        "A General Approach for Generating Natural Random
                 Variables",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-19",
  number =       "12",
  pages =        "1210--1213",
  month =        dec,
  year =         "1970",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1970.222860",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 08:01:39 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671453",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "true random numbers from physical sources",
}

@Article{Payne:1970:FTP,
  author =       "W. H. Payne",
  title =        "{Fortran Tausworthe} pseudorandom number generator",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "57--57",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Washington State Univ. Pullman, WA, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "random number generation",
}

@Article{Prasad:1970:PDA,
  author =       "Ram D. Prasad",
  title =        "Probability Distributions of Algebraic Functions of
                 Independent Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "18",
  number =       "3",
  pages =        "614--626",
  month =        may,
  year =         "1970",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Rader:1970:FMG,
  author =       "C. M. Rader and L. R. Rabiner and R. W. Schafer",
  title =        "A Fast Method of Generating Digital Random Numbers",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "49",
  number =       "9",
  pages =        "2303--2310",
  month =        nov,
  year =         "1970",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1970/BSTJ.1970.4909.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol49/bstj49-9-2303.pdf",
  abstract =     "In this article we propose a fast, efficient technique
                 for generating a pseudorandom stream of
                 uniformly-distributed numbers. The arithmetic
                 operations required are an $L$-bit exclusive-{\em or},
                 a rotation, and a shift to update the state of the
                 number generator. With moderately large values of $L$
                 we have been able to generate sequences of numbers
                 whose periods are quite long (on the order of $ 2
                 \times 10^7 $ long). Its simplicity of construction, as
                 well as its ability to generate long streams of
                 independent pseudorandom uniformly-distributed integers
                 makes this noise generator a worthy candidate for use
                 in high-speed digital systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
  remark =       "From the paper: ``the maximum period of any random
                 number generator using only flip-flops and
                 exclusive-{\em or} elements \ldots{} is in general $
                 (2^{2 L} - 1) $. \ldots{} There exist unreasonable
                 starting states, \ldots{}, which have much shorter
                 periods than those described, but these can be avoid in
                 all cases by restricting the starting values to $0$ and
                 $1$. \ldots{} For ($ L = $ ) 25 bits, the longest
                 period results, and is 17,825,775. However, since $
                 2^{25} $ is about $ 3.3 \times 10^7 $, not all the
                 possible 25-bit numbers appear at the output of the
                 generator.''",
}

@Article{Reader:1970:RDM,
  author =       "A. V. Reader",
  title =        "Random digits by a mincing process",
  journal =      j-COMP-J,
  volume =       "13",
  number =       "1",
  pages =        "118--118",
  month =        feb,
  year =         "1970",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/13.1.118",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:44 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/13/1.toc;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_13/Issue_01/;
                 https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/13/1/118.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_13/Issue_01/130118.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_13/Issue_01/tiff/118.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Manchester, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "random number generation",
}

@Article{Schaffer:1970:AAG,
  author =       "H. E. Schaffer",
  title =        "{ACM Algorithm 369}: Generator of Random Numbers
                 Satisfying the {Poisson} Distribution",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "49--49",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "North Carolina State Univ., Raleigh, NC, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "random number generation; subroutines",
}

@Article{Schmidt:1970:QMR,
  author =       "H. Schmidt",
  title =        "Quantum-Mechanical Random-Number Generator",
  journal =      j-J-APPL-PHYS,
  volume =       "41",
  number =       "2",
  pages =        "462--468",
  day =          "1",
  month =        feb,
  year =         "1970",
  CODEN =        "JAPIAU",
  DOI =          "https://doi.org/10.1063/1.1658698",
  ISSN =         "0021-8979 (print), 1089-7550 (electronic), 1520-8850",
  ISSN-L =       "0021-8979",
  bibdate =      "Mon Feb 20 15:46:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Physics",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4915369",
  keywords =     "true random numbers from physical sources",
}

@Article{Schnorr:1970:DEZa,
  author =       "Claus-Peter Schnorr",
  title =        "{{\"U}ber die Definition von effektiven Zufallstests.
                 Teil I}. ({German}) [{On} the definition of effective
                 random tests. {Part I}]",
  journal =      j-Z-WAHRSCHEINLICHKEITSTHEOR-VERW-GEB,
  volume =       "15",
  number =       "4",
  pages =        "297--312",
  month =        "????",
  year =         "1970",
  CODEN =        "ZWVGAA",
  DOI =          "https://doi.org/10.1007/BF00533301",
  ISSN =         "0044-3719",
  ISSN-L =       "0044-3719",
  MRclass =      "60.02",
  MRnumber =     "0288794 (44 \#5990a)",
  bibdate =      "Sat Apr 26 19:23:38 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/z-wahrscheinlichkeits-theor-verw-geb.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00533301",
  acknowledgement = ack-nhfb,
  fjournal =     "Zeitschrift f{\"u}r Wahrscheinlichkeitstheorie und
                 verwandte Gebiete",
  journal-URL =  "http://link.springer.com/journal/440",
  language =     "German",
}

@Article{Schnorr:1970:DEZb,
  author =       "Claus-Peter Schnorr",
  title =        "{{\"U}ber die Definition von effektiven Zufallstests.
                 Teil II}. ({German}) [{On} the definition of effective
                 random tests. {Part II}]",
  journal =      j-Z-WAHRSCHEINLICHKEITSTHEOR-VERW-GEB,
  volume =       "15",
  number =       "4",
  pages =        "313--328",
  month =        "????",
  year =         "1970",
  CODEN =        "ZWVGAA",
  DOI =          "https://doi.org/10.1007/BF00533302",
  ISSN =         "0044-3719",
  ISSN-L =       "0044-3719",
  MRclass =      "60.02",
  MRnumber =     "0288794 (44 \#5990a)",
  bibdate =      "Sat Apr 26 19:23:38 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/z-wahrscheinlichkeits-theor-verw-geb.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00533302",
  acknowledgement = ack-nhfb,
  fjournal =     "Zeitschrift f{\"u}r Wahrscheinlichkeitstheorie und
                 verwandte Gebiete",
  journal-URL =  "http://link.springer.com/journal/440",
  language =     "German",
}

@Manual{Smith:1970:RN,
  author =       "Robert E. (Robert Elijah) Smith",
  title =        "Random numbers",
  organization = "Control Data Corp.",
  address =      "Minneapolis, MN, USA",
  pages =        "82",
  year =         "1970",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Computer explorer series in FORTRAN and BASIC",
  acknowledgement = ack-nhfb,
  keywords =     "Computer science --- Mathematics.; Number concept.;
                 Programming languages (Electronic computers)",
}

@Article{Springer:1970:DPB,
  author =       "M. D. Springer and W. E. Thompson",
  title =        "The Distribution of Products of Beta, Gamma and
                 {Gaussian} Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "18",
  number =       "4",
  pages =        "721--737",
  month =        jun,
  year =         "1970",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Stoneham:1970:NCM,
  author =       "R. G. Stoneham",
  title =        "On a New Class of Multiplicative Pseudo-Random Number
                 Generators",
  journal =      j-BIT,
  volume =       "10",
  number =       "4",
  pages =        "481--500",
  month =        dec,
  year =         "1970",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01935568",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 18:52:11 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=10&issue=4;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=10&issue=4&spage=481",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Subrahmaniam:1970:SAM,
  author =       "K. Subrahmaniam",
  title =        "On Some Applications of {Mellin} Transforms to
                 Statistics: Dependent Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "19",
  number =       "4",
  pages =        "658--662",
  month =        dec,
  year =         "1970",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Vincent:1970:CGT,
  author =       "C. H. Vincent",
  title =        "Corrigendum: {The Generation of Truly Random Binary
                 Numbers}",
  journal =      j-J-PHYS-E,
  volume =       "3",
  number =       "10",
  pages =        "832--832",
  month =        oct,
  year =         "1970",
  CODEN =        "JPSIAE",
  DOI =          "https://doi.org/10.1088/0022-3735/3/10/528",
  ISSN =         "0022-3735",
  bibdate =      "Sat Nov 29 15:15:40 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Vincent:1970:GTR}.",
  URL =          "http://iopscience.iop.org/0022-3735/3/10/528/",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
}

@Article{Vincent:1970:GTR,
  author =       "C. H. Vincent",
  title =        "The Generation of Truly Random Binary Numbers",
  journal =      j-J-PHYS-E,
  volume =       "3",
  number =       "8",
  pages =        "594--598",
  month =        aug,
  year =         "1970",
  CODEN =        "JPSIAE",
  DOI =          "https://doi.org/10.1088/0022-3735/3/8/303",
  ISSN =         "0022-3735",
  bibdate =      "Sat Nov 29 13:56:04 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See corrigendum \cite{Vincent:1970:CGT}.",
  URL =          "http://iopscience.iop.org/0022-3735/3/8/303",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
  keywords =     "true random numbers from physical sources",
}

@Article{White:1970:FDC,
  author =       "R. C. {White, Jr.}",
  title =        "A Fast Digital Computer Method for Recursive
                 Estimation of the Mean",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-19",
  number =       "9",
  pages =        "847--850",
  month =        sep,
  year =         "1970",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1970.223053",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 08:01:36 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments \cite{Majithia:1972:CFD}.",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671646",
  abstract =     "An improvement in a method for recursive estimation of
                 the mean of a random variable is suggested. The
                 proposed algorithm is faster than conventional `ideal'
                 averaging and only slightly less efficient, i.e., the
                 estimate variance is only slightly larger for the same
                 sample size.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Zaremba:1970:DII,
  author =       "S. K. Zaremba",
  title =        "La discr{\'e}pance isotrope et l'int{\'e}gration
                 num{\'e}rique. ({French}) [{Isotropic} discrepancy and
                 numerical integration]",
  journal =      j-ANN-MAT-PURA-APPL-4,
  volume =       "87",
  number =       "??",
  pages =        "125--136",
  month =        "????",
  year =         "1970",
  CODEN =        "ANLMAE",
  ISSN =         "0373-3114 (print), 1618-1891 (electronic)",
  ISSN-L =       "0373-3114",
  bibdate =      "Thu Jan 19 08:40:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annali di matematica pura ed applicata. Series 4",
  language =     "French",
}

@Article{Ashford:1971:BRG,
  author =       "J. R. Ashford",
  title =        "Book Reviews: {{\em The Generation of Random
                 Variates}}, by {T. G. Newman} and {P. L. Odell}",
  journal =      j-APPL-STAT,
  volume =       "20",
  number =       "3",
  pages =        "325--325",
  year =         "1971",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:20:12 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Berman:1971:GGD,
  author =       "M. B. Berman",
  title =        "Generating Gamma Distributed Variates for Computer
                 Simulation Models",
  type =         "Report",
  number =       "??",
  institution =  "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  pages =        "??",
  year =         "1971",
  bibdate =      "Tue Nov 29 06:55:32 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Beyer:1971:LSM,
  author =       "W. A. Beyer and R. B. Roof and Dorothy Williamson",
  title =        "The Lattice Structure of Multiplicative Congruential
                 Pseudo-Random Vectors",
  journal =      j-MATH-COMPUT,
  volume =       "25",
  number =       "114",
  pages =        "345--363",
  month =        apr,
  year =         "1971",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See corrigenda \cite{Beyer:1996:CLS}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2004931.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "This article, and \cite{Marsaglia:1972:SLC}, are
                 believed to be the first reports of the lattice tests
                 for randomness.",
}

@Article{Brown:1971:LRA,
  author =       "J. L. {Brown, Jr.} and R. L. Duncan",
  title =        "The Least Remainder Algorithm",
  journal =      j-FIB-QUART,
  volume =       "9",
  number =       "4",
  pages =        "347--350",
  month =        oct,
  year =         "1971",
  CODEN =        "FIBQAU",
  ISSN =         "0015-0517",
  ISSN-L =       "0015-0517",
  bibdate =      "Thu Oct 20 18:05:39 MDT 2011",
  bibsource =    "http://www.fq.math.ca/9-4.html;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.fq.math.ca/Scanned/9-4/brown-a.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Fib. Quart",
  fjournal =     "Fibonacci Quarterly",
  journal-URL =  "http://www.fq.math.ca/",
}

@Article{Chen:1971:RNN,
  author =       "Edwin H. Chen",
  title =        "A random normal number generator for 32-bit-word
                 computers",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "66",
  number =       "334",
  pages =        "400--403",
  month =        jun,
  year =         "1971",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2283944",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7123",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Cohn:1971:PRB,
  author =       "Charles Erwin Cohn",
  title =        "The performance of random-bit generators",
  journal =      j-SIMULATION,
  volume =       "17",
  number =       "6",
  pages =        "234--236",
  month =        dec,
  year =         "1971",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754977101700604",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:59:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/17/6/234.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
  remark =       "Discusses three physical-device random bit generators
                 and shows that all have significant bias.",
}

@Article{Craddock:1971:TRM,
  author =       "J. M. Craddock and Sheila A. Farmer",
  title =        "Two Robust Methods of Random Number Generation",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "20",
  number =       "3",
  pages =        "55--66",
  month =        sep,
  year =         "1971",
  CODEN =        "????",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Wed Dec 21 09:52:10 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2986798",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
}

@Article{Davies:1971:PWO,
  author =       "A. C. Davies",
  title =        "Properties of Waveforms Obtained by Nonrecursive
                 Digital Filtering of Pseudorandom Binary Sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-20",
  number =       "3",
  pages =        "270--281",
  month =        mar,
  year =         "1971",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1971.223231",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 06:38:13 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671824",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Dieter:1971:EDS,
  author =       "Ulrich Dieter and J. Ahrens",
  title =        "An exact determination of serial correlations of
                 pseudo-random numbers",
  journal =      j-NUM-MATH,
  volume =       "17",
  number =       "2",
  pages =        "101--123",
  month =        apr,
  year =         "1971",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Karlsruhe, West Germany",
  country =      "D",
  date =         "00/00/00",
  descriptors =  "RNG; correlation",
  enum =         "777",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "linear congruential methods; random number generation;
                 serial correlations",
  location =     "PKI-OG: Li-Ord.Le",
  references =   "0",
  revision =     "21/04/91",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dieter:1971:PRN,
  author =       "Ulrich Dieter",
  title =        "Pseudo-Random Numbers: The Exact Distribution of
                 Pairs",
  journal =      j-MATH-COMPUT,
  volume =       "25",
  number =       "116",
  pages =        "855--883",
  month =        oct,
  year =         "1971",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Donn:1971:MDP,
  author =       "E. S. Donn",
  title =        "Manipulating digital patterns with a new binary
                 sequence generator",
  journal =      j-HEWLETT-PACKARD-J,
  volume =       "22",
  number =       "8",
  pages =        "2--8",
  month =        apr,
  year =         "1971",
  CODEN =        "HPJOAX",
  ISSN =         "0018-1153",
  bibdate =      "Tue Mar 25 14:12:15 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B7250E (Signal generators)",
  fjournal =     "Hewlett-Packard Journal: technical information from
                 the laboratories of Hewlett-Packard Company",
  keywords =     "digital instrumentation; digital pattern manipulation;
                 pseudorandom binary sequence generator; sequence
                 generating; shift register",
  treatment =    "N New Development",
}

@InProceedings{Dyadkin:1971:ANA,
  author =       "I. G. Dyadkin",
  booktitle =    "{Monte Carlo} methods and applications ({Metody
                 Monte-Karlo i ikh primeneniya USSR Academy of Sciences,
                 Siberian Branch. Computing Center (VTs SO AN SSSR).
                 Novosibirsk, 30 August--3 September 1971
                 (Vychislitelnyi Tsentr, Sibirskoye Otdelenie. Akademiia
                 Nauk. SSSR)})",
  title =        "An analogue of {von Neumann}'s algorithm for
                 simulating a normal distribution",
  publisher =    "Akademiia Nauk SSSR",
  address =      "Novosibirsk, USSR",
  pages =        "53--54",
  year =         "1971",
  bibdate =      "Mon Feb 27 09:50:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Friedman:1971:REG,
  author =       "Jerome H. Friedman",
  title =        "Random event generation with preferred frequency
                 distributions",
  journal =      j-J-COMPUT-PHYS,
  volume =       "7",
  number =       "2",
  pages =        "201--218",
  month =        apr,
  year =         "1971",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(71)90085-4",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 09:15:03 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999171900854",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Book{Gibbons:1971:NSI,
  author =       "Jean Dickinson Gibbons",
  title =        "Nonparametric Statistical Inference",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiv + 306",
  year =         "1971",
  ISBN =         "0-07-085250-2, 0-07-023166-4",
  ISBN-13 =      "978-0-07-085250-1, 978-0-07-023166-5",
  LCCN =         "QA278.8 .G5",
  bibdate =      "Tue Jan 31 14:57:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "McGraw-Hill series in probability and statistics",
  acknowledgement = ack-nhfb,
}

@InProceedings{Good:1971:SRS,
  author =       "I. J. Good and R. A. Gaskins",
  editor =       "A. O. L. (Arthur O. L.) Atkin and B. J. (Bryan John)
                 Birch",
  booktitle =    "{Computers in number theory: proceedings of the
                 Science Research Council Atlas Symposium no. 2 held at
                 Oxford, from 18--23 August, 1969}",
  title =        "Some relationships satisfied by additive and
                 multiplicative congruential sequences, with
                 implications for pseudorandom number generation",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  bookpages =    "xvii + 433",
  pages =        "125--136",
  year =         "1971",
  ISBN =         "0-12-065750-3",
  ISBN-13 =      "978-0-12-065750-6",
  LCCN =         "QA241 .S35 1969",
  bibdate =      "Sat Jan 07 08:00:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  meetingname =  "Science Research Council Atlas Symposium, 2d, Oxford,
                 1969.",
  subject =      "Number theory; Data processing; Congresses",
}

@Article{Han:1971:DRV,
  author =       "Chien-Pai Han",
  title =        "Dependence of Random Variables",
  journal =      j-AMER-STAT,
  volume =       "25",
  number =       "4",
  pages =        "35--35",
  month =        oct,
  year =         "1971",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:19 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326371;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2682925",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Jackson:1971:PCC,
  author =       "P. A. Jackson",
  title =        "{PRBS} cross-correlation measurements by hybrid
                 computational techniques",
  journal =      j-COMP-J,
  volume =       "14",
  number =       "1",
  pages =        "49--54",
  month =        feb,
  year =         "1971",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:51:51 MDT 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/;
                 https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/140049.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/49.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/50.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/51.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/52.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/53.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_01/tiff/54.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C1220 (Simulation, modelling and identification);
                 C5460 (Analogue and hybrid computing techniques)",
  corpsource =   "Lanchester Coll. Technol., Coventry, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "binary sequences; correlation methods; cross
                 correlation; dynamics identification; hybrid
                 computational techniques; hybrid computer;
                 identification; methods; pseudorandom binary sequence;
                 system",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kendall:1971:BRR,
  author =       "David Kendall",
  title =        "Book Review: {{\booktitle{Random Variables and
                 Probability Distributions}} by H. Cram{\'e}r}",
  journal =      j-REV-INST-INT-STAT,
  volume =       "39",
  number =       "2",
  pages =        "240",
  year =         "1971",
  CODEN =        "ISTRDP",
  DOI =          "https://doi.org/10.2307/1402181",
  ISSN =         "0373-1138 (print), 2212-1846 (electronic)",
  ISSN-L =       "0373-1138",
  bibdate =      "Wed Oct 30 09:11:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/revinstintstat.bib",
  URL =          "https://www.jstor.org/stable/1402181",
  acknowledgement = ack-nhfb,
  ajournal =     "Rev. Inst. Int. Stat.",
  fjournal =     "Revue de l'Institut international de statistique =
                 Review of the International Statistical Institute",
  journal-URL =  "https://www.jstor.org/journal/revuinstintestat",
}

@Article{Kozlov:1971:DRN,
  author =       "G. A. Kozlov",
  title =        "On the Distribution of Random Numbers Produced by
                 Sequential Physical Generators",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "16",
  number =       "2",
  pages =        "369--378",
  month =        "????",
  year =         "1971",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1116037",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:36:25 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/16/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1971",
}

@Article{Marsaglia:1971:RVI,
  author =       "George Marsaglia",
  title =        "Random variables with independent binary digits",
  journal =      j-ANN-MATH-STAT,
  volume =       "42",
  number =       "6",
  pages =        "1922--1929",
  month =        dec,
  year =         "1971",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177693058",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "60A05",
  MRnumber =     "45 \#7764",
  MRreviewer =   "A. Fuchs",
  bibdate =      "Fri Jan 6 09:58:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://projecteuclid.org/euclid.aoms/1177693058;
                 http://www.jstor.org/stable/2240118",
  ZMnumber =     "0239.60015",
  abstract =     "Let $ X = \cdot b_1 b_2 b_3 \cdots $ be a random
                 variable with independent binary digits $ b_n $ taking
                 values 0 or 1 with probability $ p_n $ and $ q_n = 1 -
                 p_n $. When does $X$ have a density? A continuous
                 density? A singular distribution? This note gives
                 necessary and sufficient conditions for the
                 distribution of $X$ to be: discrete: $ \Sigma \min
                 (p_n, q_n) < \infty $; singular: $ \Sigma^\infty_m
                 \lbrack \log (p_n / q_n) \rbrack^2 = \infty $ for every
                 $m$; absolutely continuous: $ \Sigma^\infty_m \lbrack
                 \log (p_n / q_n) \rbrack^2 < \infty $ for some $m$.
                 Furthermore, $X$ has a density that is bounded away
                 from zero on some interval if and only if $ \log (p_n /
                 q_n) $ is a geometric sequence with ratio $ \frac
                 {1}{2} $ for $ n > k $, and in that case the fractional
                 part of $ 2^k X $ has an exponential density
                 (increasing or decreasing with the uniform a special
                 case).",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  ZMclass =      "60E05 General theory of probability distributions
                 60F99 Limit theorems (probability)",
}

@Article{Mitra:1971:PDS,
  author =       "Samarendra Kumar Mitra",
  title =        "On the Probability Distribution of the Sum of
                 Uniformly Distributed Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "20",
  number =       "2",
  pages =        "195--198",
  month =        mar,
  year =         "1971",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Book{Newman:1971:GRVa,
  author =       "Thomas G. Newman and Patrick L. Odell",
  title =        "The generation of random variates",
  volume =       "29",
  publisher =    "Charles Griffin \& Co. Ltd.",
  address =      "London, UK",
  pages =        "viii + 88",
  year =         "1971",
  ISBN =         "0-85264-194-X",
  ISBN-13 =      "978-0-85264-194-1",
  LCCN =         "QA276.5 N55",
  bibdate =      "Thu Jan 19 07:23:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Griffin's Statistical Monographs and Courses",
  acknowledgement = ack-nhfb,
}

@Book{Newman:1971:GRVb,
  author =       "Thomas G. Newman and Patrick L. Odell",
  title =        "The generation of random variates",
  publisher =    "Hafner",
  address =      "New York, NY, USA",
  pages =        "88 (est.)",
  year =         "1971",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "QA276.5 N55",
  bibdate =      "Thu Jan 19 07:23:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Payne:1971:CDS,
  author =       "W. H. Payne and T. G. Lewis",
  title =        "Continuous distribution sampling: accuracy and speed",
  crossref =     "Rice:1971:MS",
  pages =        "??--??",
  year =         "1971",
  bibdate =      "Mon Jan 16 22:01:09 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Philipp:1971:MSR,
  author =       "Walter Philipp",
  title =        "Mixing sequences of random variables and probablistic
                 number theory",
  volume =       "114",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "i + 102",
  year =         "1971",
  LCCN =         "????",
  MRclass =      "10K10 (10KXX 60F05 60F15)",
  MRnumber =     "0437481 (55 \#10411)",
  MRreviewer =   "J. Galambos",
  bibdate =      "Thu Jan 19 08:03:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Memoirs of the American Mathematical Society",
  acknowledgement = ack-nhfb,
}

@InProceedings{Phillips:1971:PGG,
  author =       "Don T. Phillips and Charles Beightler",
  booktitle =    "Proceedings of the 5th Conference on Winter Simulation
                 --- {WSC '71}",
  title =        "Procedures for generating gamma variates with
                 non-integer parameter sets",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "421--427",
  year =         "1971",
  DOI =          "https://doi.org/10.1145/800294.811468",
  bibdate =      "Tue Nov 29 08:26:27 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Rizzi:1971:MGS,
  author =       "Alfredo Rizzi",
  title =        "On a method for generating sequences of binary pseudo
                 random numbers",
  journal =      j-METRON,
  volume =       "29",
  number =       "??",
  pages =        "61--70",
  month =        "????",
  year =         "1971",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  MRclass =      "65C10",
  bibdate =      "Sun Jul 5 08:55:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0233.65004; 03369649",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  xxyear =       "1972",
}

@Article{Schnorr:1971:UAD,
  author =       "Claus-Peter Schnorr",
  title =        "A unified approach to the definition of random
                 sequences",
  journal =      j-THEORY-COMPUT-SYST,
  volume =       "5",
  number =       "3",
  pages =        "246--258",
  month =        sep,
  year =         "1971",
  CODEN =        "TCSYFI",
  DOI =          "https://doi.org/10.1007/BF01694181",
  ISSN =         "1432-4350 (print), 1433-0490 (electronic)",
  ISSN-L =       "1432-4350",
  bibdate =      "Tue Jan 17 10:27:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/u08164t2503054rk/",
  acknowledgement = ack-nhfb,
  fjournal =     "Theory of Computing Systems",
}

@Book{Schnorr:1971:ZWA,
  author =       "Claus Peter Schnorr",
  title =        "{Zuf{\"a}lligkeit} und Wahrscheinlichkeit: Eine
                 algorithmische {Begr{\"u}ndung} der
                 Wahrscheinlichkeitstheorie. ({German}) [{Randomness}
                 and probability. {An} algorithmic foundation of
                 probability theory]",
  volume =       "218",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "iv + 212",
  year =         "1971",
  CODEN =        "LNMAA2",
  DOI =          "https://doi.org/10.1007/BFb0112458",
  ISBN =         "3-540-05566-5 (print), 3-540-36883-3 (e-book)",
  ISBN-13 =      "978-3-540-05566-2 (print), 978-3-540-36883-0
                 (e-book)",
  ISSN =         "0075-8434 (print), 1617-9692 (electronic)",
  ISSN-L =       "0075-8434",
  bibdate =      "Tue May 6 14:51:37 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lnm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LECT-NOTES-MATH,
  URL =          "http://link.springer.com/book/10.1007/BFb0112458;
                 http://www.springerlink.com/content/978-3-540-36883-0",
  acknowledgement = ack-nhfb,
  language =     "German",
  series-URL =   "http://link.springer.com/bookseries/304",
}

@Article{Smith:1971:MPR,
  author =       "C. S. Smith",
  title =        "Multiplicative Pseudo-Random Number Generators with
                 Prime Modulus",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "586--593",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321662.321673",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@TechReport{Strawderman:1971:GTP,
  author =       "W. E. Strawderman",
  title =        "Generation and testing of pseudo-random numbers",
  type =         "Technical Report",
  number =       "171",
  institution =  "Department of Statistics, Stanford University",
  address =      "Stanford, CA, USA",
  month =        "????",
  year =         "1971",
  bibdate =      "Wed Nov 12 09:41:24 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Stroud:1971:ACM,
  author =       "A. H. Stroud",
  title =        "Approximate calculation of multiple integrals",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 431",
  year =         "1971",
  ISBN =         "0-13-043893-6",
  ISBN-13 =      "978-0-13-043893-5",
  LCCN =         "QA311 .S85",
  bibdate =      "Mon Jan 16 11:19:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice-Hall series in automatic computation",
  acknowledgement = ack-nhfb,
  subject =      "multiple integrals; approximation theory; Monte Carlo
                 quadrature",
}

@Article{Tootill:1971:RPT,
  author =       "J. P. R. Tootill and W. D. Robinson and A. G. Adams",
  title =        "The Runs Up-and-Down Performance of {Tausworthe}
                 Pseudo-Random Number Generators",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "381--399",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321650.321657",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Any Tausworthe generator based upon a primitive
                 trinomial over $ g f(2), x^p + x^q + 1 $, can be
                 represented as a simple linear recurrence in $ g f(2^p)
                 $. For a generator producing a sequence of $p$-bit
                 pseudorandom numbers, $ (p, 2^p - 1) = 1 $, which is
                 guaranteed by Tausworthe's theory to be 1-distributed,
                 the recurrence may reveal combinatorial relationships
                 implying a poor runs up-and-down performance. This
                 occurs when $q$ is small, too near $ p / 2 $, or nearly
                 \ldots{}",
  descriptors =  "Tausworthe generator; shift register sequences; rng;
                 test; runtime/storage efficiency",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Vincent:1971:PAG,
  author =       "C. H. Vincent",
  title =        "Precautions for accuracy in the generation of truly
                 random binary numbers",
  journal =      j-J-PHYS-E,
  volume =       "4",
  number =       "11",
  pages =        "825--828",
  month =        "????",
  year =         "1971",
  CODEN =        "JPSIAE",
  DOI =          "https://doi.org/10.1088/0022-3735/4/11/007",
  ISSN =         "0022-3735",
  bibdate =      "Thu Feb 02 17:58:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See corrigendum \cite{Vincent:1972:CPA}.",
  URL =          "http://iopscience.iop.org/0022-3735/4/11/007",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
  keywords =     "true random numbers from physical sources",
}

@Article{Voroncov:1971:UQS,
  author =       "Ju. V. Voroncov and Ju. G. Polljak",
  title =        "On the use of quasirandom sequences in the direct
                 probabilistic simulation of systems",
  journal =      "Avtomat. i Vy\v cisl. Tehn.",
  volume =       "6",
  number =       "??",
  pages =        "23--27",
  month =        "????",
  year =         "1971",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 08:29:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Avt. i Vy{\v{c}}isl. Tehn.",
  fjournal =     "Akademija Nauk Latvi\u\i sko\u\i\ SSR. Avtomatika i
                 Vy\v cislitel\cprime naja Tehnika",
  language =     "Russian",
}

@Article{Zinger:1971:LLC,
  author =       "A. A. Zinger",
  title =        "Limit laws for cumulative sums of independent random
                 variables with a finite number of distribution types",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "16",
  number =       "??",
  pages =        "596--619",
  month =        "????",
  year =         "1971",
  CODEN =        "TPRBAU",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Mon Dec 07 17:39:39 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 16}, (1971), pp. 614--637.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
}

@Article{Ahrens:1972:CMS,
  author =       "Joachim H. Ahrens and Ulrich Dieter",
  title =        "Computer Methods for Sampling from the Exponential and
                 Normal Distributions",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "873--882",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "49 1728",
  MRreviewer =   "V. Dupac",
  bibdate =      "Mon Jan 22 06:20:51 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#AhrensD72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Various methods are known for transforming uniformly
                 distributed random numbers into exponentially and
                 normally distributed quantities. The most efficient
                 ones are compared, in terms of memory requirements and
                 speed, with some new algorithms. A number of procedures
                 convert Taylor series expansions directly into sampling
                 steps, an approach which may be used for sampling from
                 any continuous distribution. For the exponential
                 distribution a definite recommendation can be made,
                 whereas in the case of the normal distribution there
                 remains a choice between slower and shorter algorithms
                 and faster but space consuming methods.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "913; 922",
  corpsource =   "Nova Scotia Tech. Coll., Halifax, NS, Canada",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "6926",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "computer aided sampling; computer methods; distributed
                 random numbers; distributions; exponential; normal
                 distributions; random number generation; sampled data
                 systems; sampling; sampling steps; uniformly",
  oldlabel =     "AhrensD72",
  references =   "0",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AhrensD72",
}

@Article{Alam:1972:AVM,
  author =       "Khursheed Alam",
  title =        "Asymptotic Value of the Mean of a Function of a Normal
                 Random Variable",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "23",
  number =       "4",
  pages =        "495--498",
  month =        dec,
  year =         "1972",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Barr:1972:CMN,
  author =       "Donald R. Barr and Norman L. Sezak",
  title =        "A Comparison of Multivariate Normal Generators",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1048--1049",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:23:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BarrS72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Naval Postgraduate School, Monterey, CA, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "comparison; covariance matrix; Gaussian random number
                 generator; multivariate; multivariate normal
                 generators; normal random vectors; random number
                 generation; simulation; triangular factorization",
  oldlabel =     "BarrS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BarrS72",
}

@Article{Basu:1972:ITF,
  author =       "A. K. Basu",
  title =        "Invariance theorems for first passage time random
                 variables",
  journal =      j-CAN-MATH-BULL,
  volume =       "15",
  number =       "??",
  pages =        "171--176",
  month =        "????",
  year =         "1972",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1972-031-9",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:04:00 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v15/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Behboodian:1972:CNS,
  author =       "Javad Behboodian",
  title =        "Classroom Notes: a Simple Example on Some Properties
                 of Normal Random Variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "79",
  number =       "6",
  pages =        "632--634",
  month =        jun # "\slash " # jul,
  year =         "1972",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:36:47 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@InProceedings{Beyer:1972:LSR,
  author =       "W. A. Beyer",
  title =        "Lattice structure and reduced bases of random vectors
                 generated by linear recurrences",
  crossref =     "Zaremba:1972:ANT",
  pages =        "361--370",
  year =         "1972",
  bibdate =      "Tue Jan 10 15:36:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Broemeling:1972:BPD,
  author =       "L. D. Broemeling",
  title =        "{Bayesian} procedures for detecting a change in a
                 sequence of random variables",
  journal =      j-METRON,
  volume =       "30",
  number =       "??",
  pages =        "214--227",
  month =        "????",
  year =         "1972",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  MRclass =      "62F15 62C10 62F03",
  bibdate =      "Sun Jul 5 08:55:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0303.62029; 03474769",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  xxyear =       "1973",
}

@Article{Cenacchi:1972:QRS,
  author =       "G. Cenacchi and A. {De Matteis}",
  title =        "Quasi-random sequences by power residues",
  journal =      j-NUM-MATH,
  volume =       "20",
  number =       "1",
  pages =        "54--63",
  month =        feb,
  year =         "1972",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon Oct 18 01:28:20 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
}

@Article{Chang:1972:FSD,
  author =       "R. W. Chang and E. Y. Ho",
  title =        "On Fast Start-Up Data Communication Systems Using
                 Pseudo-Random Training Sequences",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "51",
  number =       "9",
  pages =        "2013--2027",
  month =        nov,
  year =         "1972",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1972/BSTJ.1972.5109.html;
                 http://www.alcatel-lucent.com/bstj/vol51-1972/bstj-vol51-issue09.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol51/bstj51-9-2013.pdf;
                 http://www.alcatel-lucent.com/bstj/vol51-1972/articles/bstj51-9-2013.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@InCollection{Dieter:1972:SIP,
  author =       "U. Dieter",
  title =        "Statistical interdependence of pseudo-random numbers
                 generated by the linear congruential method",
  crossref =     "Zaremba:1972:ANT",
  pages =        "287--317",
  year =         "1972",
  MRnumber =     "MR 353622",
  bibdate =      "Thu Jan 19 06:38:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Elias:1972:ECU,
  author =       "P. Elias",
  title =        "The efficient construction of an unbiased random
                 sequence",
  journal =      j-ANN-MATH-STAT,
  volume =       "43",
  number =       "3",
  pages =        "865--870",
  month =        jun,
  year =         "1972",
  CODEN =        "AASTAD",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  bibdate =      "Tue Jan 31 15:45:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2240383",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
}

@Article{Ermakov:1972:NPSa,
  author =       "S. M. Ermakov",
  title =        "Note on pseudorandom sequences",
  journal =      "{\v{Z}}. Vy{\v{c}}isl. Mat. i Mat. Fiz.",
  volume =       "12",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1972",
  ISSN =         "1077-1082",
  bibdate =      "Thu Jan 19 06:40:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0294.65003",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Ermakov:1972:NPSb,
  author =       "S. M. Ermakov",
  title =        "Note on pseudorandom sequences",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "12",
  number =       "4",
  pages =        "307--314",
  month =        "????",
  year =         "1972",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(72)90136-X",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  MRnumber =     "MR 329191",
  bibdate =      "Thu Jan 19 06:42:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/004155537290136X",
  abstract =     "A sequence $ x_{n + 1} = \{ M x_n \} $, $ x_0 (0, 1) $
                 is considered, where $ \{ a \} $ denotes the fractional
                 part of the number $a$ and $ M > 1 $ is a natural
                 number. It is shown that when this sequence is used as
                 a pseudorandom sequence in calculations by the
                 Monte-Carlo method, the central limit theorem holds for
                 a fairly wide class of the functions integrated.",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@TechReport{Everett:1972:MCS,
  author =       "C. J. Everett and E. D. Cashwell",
  title =        "A {Monte Carlo} Sampler",
  type =         "Informal Report",
  number =       "LA-5061-MS",
  institution =  inst-LASL,
  address =      inst-LASL:adr,
  year =         "1972",
  bibdate =      "Mon Jan 16 10:57:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Falk:1972:EDT,
  author =       "H. Falk",
  title =        "Entropy Decomposition and Transfer-Matrix Problems",
  journal =      j-J-MATH-PHYS,
  volume =       "13",
  number =       "5",
  pages =        "608--609",
  month =        may,
  year =         "1972",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.1666023",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Fri Oct 28 16:39:49 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v13/i5/p608_s1",
  acknowledgement = ack-nhfb,
  classification = "A0520 (Statistical mechanics)",
  corpsource =   "City Univ., NY, USA",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "discrete random variables; entropy; entropy
                 decomposition; Markovian decomposition; short range
                 interactions; transfer matrix problems",
  onlinedate =   "31 October 2003",
  pagecount =    "2",
  treatment =    "T Theoretical or Mathematical",
}

@TechReport{Forsythe:1972:NCMa,
  author =       "George E. Forsythe",
  title =        "{Von Neumann}'s comparison method for random sampling
                 from the normal and other distributions",
  type =         "Technical Report",
  number =       "CS-TR-72-254",
  institution =  inst-STAN-CS,
  address =      inst-STAN-CS:adr,
  pages =        "21",
  month =        jan,
  year =         "1972",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/NCSTRL/STAN.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/STAN.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/Stanford.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The author presents a generalization he worked out in
                 1950 of von Neumann's method of generating random
                 samples from the exponential distribution by
                 comparisons of uniform random numbers on (0,1). It is
                 shown how to generate samples from any distribution
                 whose probability density function is piecewise both
                 absolutely continuous and monotonic on $ ( - \infty,
                 \infty) $. A special case delivers normal deviates at
                 an average cost of only 4.036 uniform deviates each.
                 This seems more efficient than the Center-Tail method
                 of Dieter and Ahrens, which uses a related, but
                 different, method of generalizing the von Neumann idea
                 to the normal distribution.",
  acknowledgement = ack-nhfb,
  notes =        "[Adminitrivia V1/Prg/19951016]",
}

@Article{Forsythe:1972:NCMb,
  author =       "George E. Forsythe",
  title =        "{Von Neumann}'s comparison method for random sampling
                 from the normal and other distributions",
  journal =      j-MATH-COMPUT,
  volume =       "26",
  number =       "120",
  pages =        "817--826",
  month =        oct,
  year =         "1972",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "MR0315863 (47 \#4412)",
  MRreviewer =   "R. R. Coveyou",
  bibdate =      "Tue Nov 22 09:08:17 MST 2005",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/mathcomp.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/MATHCOMP/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  ZMnumber =     "0283.65003",
  acknowledgement = ack-nhfb,
  by-date =      "Wi",
  by-rev =       "Le",
  classcodes =   "B0240 (Probability and statistics); C1140 (Probability
                 and statistics)",
  classmath =    "*65C10 Random number generation 62D05 Statistical
                 sampling theory",
  corpsource =   "Stanford Univ., CA, USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7276",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "distribution; normal; random sampling; sampled data
                 systems; statistics; Von Neumann's comparison method",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Frazer:1972:BOM,
  author =       "W. D. Frazer and B. T. Bennett",
  title =        "Bounds on Optimal Merge Performance, and a Strategy
                 for Optimality",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "641--648",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321724.321729",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The length of a sorted sequence produced by the
                 internal sort phase of a large scale general purpose
                 sort routine is a random variable. In a random access
                 environment, any given set of such sequences can be
                 merged in an optimal way, and in practice this often
                 done. the expected work per item required by an optimal
                 merge depends upon the probability distribution for
                 sequence length, and it is this dependence which is
                 studied. Reasonable sharp upper and lower bounds are
                 derived. The distribution which is optimal in the sense
                 of minimizing the lower bound on any bounded interval
                 is determined, and it is shown that this is the
                 strongest result of its kind.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; data storage, digital
                 --- Random Access",
}

@Article{Garside:1972:BRBa,
  author =       "M. J. Garside",
  title =        "Book Review: {{\booktitle{The Generation of Random
                 Variates}}, by T. G. Newman; P. L. Odell}",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "21",
  number =       "2",
  pages =        "143--143",
  month =        jun,
  year =         "1972",
  CODEN =        "????",
  DOI =          "https://doi.org/10.2307/2987327",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Thu Jan 22 18:10:20 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i349925;
                 https://www.math.utah.edu/pub/tex/bib/jrss-d-1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2987327",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
}

@Article{Heathcote:1972:TGF,
  author =       "C. E. Heathcote",
  title =        "A Test of Goodness of Fit for Symmetric Random
                 Variables",
  journal =      j-AUST-J-STAT,
  volume =       "14",
  number =       "2",
  pages =        "172--181",
  month =        aug,
  year =         "1972",
  CODEN =        "AUJSA3",
  DOI =          "https://doi.org/10.1111/j.1467-842X.1972.tb00355.x",
  ISSN =         "0004-9581",
  ISSN-L =       "0004-9581",
  bibdate =      "Fri Jul 15 14:28:03 MDT 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anzjs.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Journal of Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-842X/issues",
}

@Article{Hurst:1972:AAG,
  author =       "Rex L. Hurst and Robert E. Knop",
  title =        "{ACM Algorithm 425}: Generation of Random Correlated
                 Normal Variables [{G5}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "355--357",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:51:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HurstK72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remark \cite{Page:1974:RAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Utah State Univ., Logan, UT, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; FORTRAN subroutine; generation;
                 multivariate normal density; random correlated normal
                 variables; statistics; subroutines; timing",
  oldlabel =     "HurstK72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HurstK72",
}

@Article{Kirschenmann:1972:CR,
  author =       "P. Kirschenmann",
  title =        "Concepts of randomness",
  journal =      j-J-PHILOS-LOGIC,
  volume =       "1",
  number =       "??",
  pages =        "395--414",
  month =        "????",
  year =         "1972",
  CODEN =        "JPLGA7",
  ISSN =         "0022-3611 (print), 1573-0433 (electronic)",
  ISSN-L =       "0022-3611",
  MRnumber =     "MR 426081",
  bibdate =      "Mon Jan 16 21:58:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Philosophical Logic",
}

@Article{Kral:1972:ENA,
  author =       "J. Kr{\'a}l",
  title =        "Erratum: {``A new additive pseudorandom number
                 generator for extremely short word-length''}",
  journal =      j-INFO-PROC-LETT,
  volume =       "1",
  number =       "5",
  pages =        "216--216",
  month =        oct,
  year =         "1972",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Tue Nov 17 10:49:43 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kral:1972:NAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Kral:1972:NAP,
  author =       "J. Kr{\'a}l",
  title =        "A new additive pseudorandom number generator for
                 extremely short word-length",
  journal =      j-INFO-PROC-LETT,
  volume =       "1",
  number =       "4",
  pages =        "164--167",
  month =        jun,
  year =         "1972",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(72)90051-8",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Tue Nov 17 10:49:43 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{Kral:1972:ENA}.",
  abstract =     "We study the suitability of the additive
                 lagged-Fibonacci pseudo-random number generator for
                 parallel computation. This generator has relatively
                 short period with respect to the size of its seed.
                 However, the short period is more than made up for with
                 the huge number of full-period cycles it contains.
                 These different full period cycles are called
                 equivalence classes. We show how to enumerate the
                 equivalence classes and how to compute seeds to select
                 a given equivalence class, In addition, we present some
                 theoretical measures of quality for this generator when
                 used in parallel. Next, we conjecture on the size of
                 these measures of quality for this generator. Extensive
                 empirical evidence supports this conjecture. In
                 addition, a probabilistic interpretation of these
                 measures leads to another conjecture similarly
                 supported by empirical evidence. Finally we give an
                 explicit parallelization suitable for a fully
                 reproducible asynchronous MIMD implementation.",
  acknowledgement = ack-nhfb,
  classification = "C7890 (Other special applications of computing)",
  corpsource =   "RWTH, Aachen, West Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "additive pseudorandom number generator; CDC FORTRAN
                 subroutine; extremely short word lengths; mod 2/sup j/
                 arithmetics; random number generation; shuffling;
                 subroutines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maddocks:1972:CAG,
  author =       "R. S. Maddocks and S. Matthews and E. W. Walker and C.
                 H. Vincent",
  title =        "A compact and accurate generator for truly random
                 binary digits",
  journal =      j-J-PHYS-E,
  volume =       "5",
  number =       "??",
  pages =        "542--544",
  month =        "????",
  year =         "1972",
  CODEN =        "JPSIAE",
  ISSN =         "0022-3735",
  bibdate =      "Thu Feb 02 17:34:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://iopscience.iop.org/0022-3735/5/6/018",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
  keywords =     "true random numbers from physical sources",
}

@Article{Majithia:1972:CFD,
  author =       "J. C. Majithia",
  title =        "Comments on {``A Fast Digital Computer Method for
                 Recursive Estimation of the Mean''}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-21",
  number =       "5",
  pages =        "511--512",
  month =        may,
  year =         "1972",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1972.223554",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 18:58:43 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{White:1970:FDC}.",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672147",
  abstract =     "Several algorithms for the computation of the mean
                 value of a random variable have been analyzed. Results
                 have shown that the two previously published techniques
                 and a modified version of one of these, give unbiased
                 estimates of the mean value. Furthermore, although the
                 confidence intervals have been found to be increased in
                 all cases, the actual increase is insignificant, while
                 the possible speed improvements in computation can be
                 considerable.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Marsaglia:1972:CPS,
  author =       "George Marsaglia",
  title =        "Choosing a point from the surface of a sphere",
  journal =      j-ANN-MATH-STAT,
  volume =       "43",
  number =       "2",
  pages =        "645--646",
  month =        apr,
  year =         "1972",
  CODEN =        "AASTAD",
  DOI =          "https://doi.org/10.1214/aoms/1177692644",
  ISSN =         "0003-4851 (print), 2168-8990 (electronic)",
  ISSN-L =       "0003-4851",
  MRclass =      "65C10",
  bibdate =      "Thu Jan 19 08:45:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aoms/1177692644;
                 http://www.jstor.org/stable/2240001",
  ZMnumber =     "0248.65008",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematical Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoms/",
  ZMclass =      "65C10 Random number generation",
}

@InCollection{Marsaglia:1972:SLC,
  author =       "George Marsaglia",
  title =        "The Structure of Linear Congruential Sequences",
  crossref =     "Zaremba:1972:ANT",
  pages =        "249--285",
  year =         "1972",
  MRclass =      "65C05",
  MRnumber =     "53 \#14854",
  MRreviewer =   "J. H. Halton",
  bibdate =      "Mon Aug 02 10:41:44 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0266.65007",
  acknowledgement = ack-nhfb,
  remark =       "This article, and \cite{Beyer:1971:LSM}, are believed
                 to be the first reports of the lattice tests for
                 randomness.",
  ZMclass =      "65C10 Random number generation",
}

@Article{Mason:1972:LTN,
  author =       "J. David Mason",
  title =        "Local Theorems for Nonidentically Distributed Lattice
                 Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "22",
  number =       "2",
  pages =        "259--265",
  month =        mar,
  year =         "1972",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "A0550 (Lattice theory and statistics; Ising
                 problems)",
  corpsource =   "Univ. Georgia, Athens, GA, USA",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "lattice theory and statistics; local theorems;
                 nondegenerate distribution; nonidentically distributed
                 lattice random variables; random processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Meyer:1972:PCC,
  author =       "C. H. Meyer and W. L. Tuchman",
  title =        "Pseudorandom codes can be cracked",
  journal =      j-ELECTRONIC-DESIGN,
  volume =       "20",
  number =       "23",
  pages =        "74--76",
  day =          "9",
  month =        nov,
  year =         "1972",
  CODEN =        "ELODAW",
  ISSN =         "0013-4872 (print), 1944-9550 (electronic)",
  ISSN-L =       "0013-4872",
  bibdate =      "Sat Jun 10 12:07:32 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Design",
}

@InBook{Mihram:1972:SV,
  author =       "G. Arthur Mihram",
  booktitle =    "Simulation: Statistical Foundations and Methodology",
  title =        "The Stochastic Variate",
  chapter =      "2",
  volume =       "92",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  bookpages =    "xv + 526",
  pages =        "18--146",
  month =        jun,
  year =         "1972",
  DOI =          "https://doi.org/10.1016/S0076-5392(08)61350-8",
  ISBN =         "0-12-495950-4",
  ISBN-13 =      "978-0-12-495950-7",
  LCCN =         "TA343 .M53",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       j-MATH-SCI-ENG,
  URL =          "http://www.sciencedirect.com/science/article/pii/S0076539208613508",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics in Science and Engineering",
}

@Article{Miyatake:1972:GUR,
  author =       "O. Miyatake",
  title =        "Generation of uniform random numbers of good quality",
  journal =      j-MATH-JAPON,
  volume =       "17",
  number =       "??",
  pages =        "79--84",
  month =        "????",
  year =         "1972",
  CODEN =        "MAJAA9",
  ISSN =         "0025-5513",
  MRnumber =     "MR 341796",
  bibdate =      "Thu Jan 19 07:19:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Japonica",
}

@Article{Nance:1972:BRN,
  author =       "R. E. Nance and C. {Overstreet, Jr.}",
  title =        "A Bibliography on Random Number Generation",
  journal =      j-COMP-REV,
  volume =       "13",
  number =       "??",
  pages =        "495--508",
  month =        "????",
  year =         "1972",
  CODEN =        "CPGRA6",
  ISSN =         "0010-4884, 0149-1202",
  ISSN-L =       "0010-4884",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing Reviews",
}

@TechReport{Nance:1972:IFR,
  author =       "Richard E. Nance and Claude Overstreet",
  title =        "Implementation of {Fortran} random number generators
                 on the {SRU} 1108",
  type =         "Technical report",
  number =       "CP-72022",
  institution =  "Computer Science/Operations Research Center, Institute
                 of Technology, Southern Methodist University",
  address =      "Dallas, TX, USA",
  pages =        "14",
  year =         "1972",
  bibdate =      "Fri Feb 09 17:49:08 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Bibliography: p. 14.",
}

@Article{Neave:1972:CLW,
  author =       "Henry R. Neave",
  title =        "A Comparison of Lag Window Generators",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "67",
  number =       "337",
  pages =        "152--158",
  month =        mar,
  year =         "1972",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:45 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314217;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2284714",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Neave:1972:RNP,
  author =       "Henry R. Neave",
  title =        "A random number package",
  journal =      "Computer Applications in the Natural and Social
                 Sciences",
  volume =       "14",
  pages =        "55",
  year =         "1972",
  ISBN =         "0-85358-015-4",
  ISBN-13 =      "978-0-85358-015-7",
  ISSN =         "0069-8105",
  LCCN =         "QA298 .N4",
  bibdate =      "Tue Jan 31 11:24:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Applcns Nat. Soc. Sci.",
  fjournal =     "Computer Applications in the Natural and Social
                 Sciences",
  subject =      "Monte Carlo method; data processing; random number
                 generators",
}

@Article{Niederreiter:1972:DCP,
  author =       "Harald Niederreiter",
  title =        "Discrepancy and convex programming",
  journal =      j-ANN-MAT-PURA-APPL-4,
  volume =       "93",
  number =       "??",
  pages =        "89--97",
  month =        "????",
  year =         "1972",
  CODEN =        "ANLMAE",
  ISSN =         "0373-3114 (print), 1618-1891 (electronic)",
  ISSN-L =       "0373-3114",
  MRnumber =     "MR 389828",
  bibdate =      "Thu Jan 19 07:25:09 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annali di matematica pura ed applicata. Series 4",
}

@Article{Niederreiter:1972:DPR,
  author =       "Harald Niederreiter",
  title =        "On the Distribution of Pseudo-Random Numbers Generated
                 by the Linear Congruential Method",
  journal =      j-MATH-COMPUT,
  volume =       "26",
  number =       "119",
  pages =        "793--795",
  month =        jul,
  year =         "1972",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database; Parallel/Multi.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2005109.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Illinois, Urbana, IL, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "distribution; linear congruential method; number
                 generation; pseudorandom; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{Niederreiter:1972:MED,
  author =       "Harald Niederreiter",
  title =        "Methods for estimating discrepancy",
  crossref =     "Zaremba:1972:ANT",
  pages =        "203--236",
  year =         "1972",
  MRnumber =     "MR 354593",
  bibdate =      "Thu Jan 19 07:29:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Norman:1972:CPG,
  author =       "J. E. Norman and L. E. Cannon",
  title =        "A computer program for the generation of random
                 variables from any discrete distribution",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "1",
  number =       "4",
  pages =        "331--348",
  month =        "????",
  year =         "1972",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657208810026",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:44:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949657208810026",
  abstract =     "This paper provides specific directions for the
                 preparation of a discrete pseudo-random number
                 generator computer program using basic machine
                 instructions. The scheme is a table look-up first
                 suggested by Marsaglia. It is applicable to any
                 discrete probability distribution. The general
                 procedure is described for probabilities expressed as
                 fractions in a number system of arbitrary base $ \beta
                 $. A brief example is given using the decimal system.
                 Flow diagrams accompany the directions which will
                 enable an experienced programmer to write the program
                 for any computer system with only modest storage
                 requirements. Results of chi-square tests performed on
                 samples from specific binomial, Poisson, negative
                 binomial, and hypergeometric distributions generated
                 using this procedure are given",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@TechReport{Overstreet:1972:FVP,
  author =       "Claude Overstreet",
  title =        "A {FORTRAN V} package for testing and anaylsis of
                 pseudorandom number generators",
  type =         "Technical report",
  number =       "CP-72009",
  institution =  "Computer Science/Operations Research Center, Institute
                 of Technology, Southern Methodist University",
  address =      "Dallas, TX, USA",
  pages =        "7 + [24]",
  year =         "1972",
  bibdate =      "Fri Feb 09 17:49:23 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "``A revised and modified version of Technical report
                 CP-700011.'' Bibliography: l. 7.",
}

@Article{Phillips:1972:PGG,
  author =       "Don T. Phillips and Charles S. Beightler",
  title =        "Procedures for generating gamma variates with
                 non-integer parameter sets",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "1",
  number =       "3",
  pages =        "197--208",
  month =        "????",
  year =         "1972",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657208810015",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:50:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949657208810015",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Proll:1972:RAA,
  author =       "L. G. Proll",
  title =        "Remark on ``{ACM Algorithm 370}: {General} random
                 number generator [{G5}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "467--468",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 07:14:04 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Proll72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Butler:1970:AAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Southampton, UK",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7783",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "cumulative distribution function; probability density
                 function; random number generation; random number
                 generator; subroutines; transformation",
  oldlabel =     "Proll72",
  references =   "0",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Proll72",
}

@Article{Ramberg:1972:AMG,
  author =       "John S. Ramberg and Bruce W. Schmeiser",
  title =        "Approximate Method for Generating Symmetric Random
                 Variables",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "987--990",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 07:14:55 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#RambergS72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method for generating values of continuous symmetric
                 random variables that is relatively fast, requires
                 essentially no computer memory, and is easy to use is
                 developed. The method, which uses a uniform zero-one
                 random number source, is based on the inverse function
                 of the lambda distribution of Tukey. Since it
                 approximates many of the continuous theoretical
                 distributions and empirical distributions frequently
                 used in simulations, the method should be useful to
                 simulation practitioners.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "922",
  corpsource =   "Univ. Iowa, Iowa City, IA, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "approximate method; inverse function; lambda
                 distribution of Tukey; mathematical models;
                 mathematical statistics; random number generation;
                 random number source; simulation; symmetric random
                 variable generation; uniform zero one",
  oldlabel =     "RambergS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RambergS72",
}

@Article{Rechtschaffen:1972:QSU,
  author =       "R. N. Rechtschaffen",
  title =        "Queuing simulation using a random number generator",
  journal =      j-IBM-SYS-J,
  volume =       "11",
  number =       "3",
  pages =        "255--271",
  year =         "1972",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IBM Systems Journal",
}

@Article{Relles:1972:SAG,
  author =       "Daniel A. Relles",
  title =        "A simple algorithm for generating binomial random
                 variables when {$N$} is large",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "67",
  number =       "339",
  pages =        "612--613",
  month =        sep,
  year =         "1972",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Fri Jan 6 09:58:59 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2284449",
  acknowledgement = ack-nhfb,
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7809",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Schincke:1972:EPS,
  author =       "E. Schincke and J. H{\"o}pfner",
  title =        "{Erzeugungen von Pseudozufallszahlenfolgen mit
                 st{\"u}ckweise polygonaler Verteilung}. ({German})
                 [{Generation} of pseudo random number sequences with
                 piecemeal polynomial distribution]",
  journal =      j-COMPUTING,
  volume =       "9",
  number =       "1",
  pages =        "63--68",
  month =        mar,
  year =         "1972",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:51 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-nhfb,
  affiliation =  "Martin-Luther Univ., Saale, East Germany",
  classification = "C7890",
  description =  "random number generation",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "algorithm; generation; piecewise continuous
                 probability distributions; pseudorandom numbers;
                 transformation; uniform distribution",
  language =     "German",
}

@Article{Schrack:1972:RAR,
  author =       "G{\"u}nther F. Schrack",
  title =        "Remark on ``{Algorithm 381}: Random vectors uniform in
                 solid angle''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "468--468",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 07:19:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Schrack72a;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Knop:1970:AAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. British Columbia, Vancouver, BC, Canada",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "points uniform on; random number generation; random
                 vector generator; solid angle; sphere; spherically
                 symmetric probability distribution; subroutines",
  oldlabel =     "Schrack72a",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schrack72a",
}

@InCollection{Sobol:1972:DIG,
  author =       "I. M. Sobol'",
  booktitle =    "Operations research and statistical modeling, No. 1
                 ({Russian})",
  title =        "A deterministic interpretation of goodness-of-fit
                 tests, and a test of pseudorandom numbers",
  publisher =    "Izdat. Leningrad. Univ., Leningrad",
  pages =        "162--169",
  year =         "1972",
  MRclass =      "65C05",
  MRnumber =     "0373221 (51 \#9422)",
  MRreviewer =   "V. Pagurova",
  bibdate =      "Thu Jan 19 08:21:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sobol:1972:PEE,
  author =       "I. M. Sobol'",
  title =        "A probabilistic estimate of the error for nonrandom
                 integration nets",
  journal =      "Voprosy Vy{\c{c}}isl. i Prikl. Mat. (Ta{\v{s}}kent)",
  volume =       "14",
  number =       "??",
  pages =        "5--11",
  month =        "????",
  year =         "1972",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 08:22:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sokal:1972:OCN,
  author =       "Nathan O. Sokal",
  title =        "Optimum Choice of Noise Frequency Band and Sampling
                 Rate for Generating Random Binary Digits from Clipped
                 White Noise",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-21",
  number =       "6",
  pages =        "614--615",
  month =        jun,
  year =         "1972",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1972.5009023",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 18:58:44 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009023",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Sowey:1972:CCB,
  author =       "E. R. Sowey",
  title =        "A Chronological and Classified Bibliography on Random
                 Number Generation and Testing",
  journal =      j-INT-STAT-REV,
  volume =       "40",
  number =       "3",
  pages =        "355--371",
  month =        dec,
  year =         "1972",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Fri Jul 01 07:51:56 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1402472",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@Article{Sullins:1972:CAP,
  author =       "Walter L. Sullins",
  title =        "Certification of ``{Algorithm 266}: {Pseudo}-Random
                 Numbers [{G5}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1072--1073",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Aug 02 07:31:49 2004",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sullins72;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Pike:1965:APR} and remarks
                 \cite{Hansson:1966:RAG,Pike:1966:RAG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "PRNG (pseudo-random number generator)",
  oldlabel =     "Sullins72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sullins72",
}

@Article{Vincent:1972:CPA,
  author =       "C. H. Vincent",
  title =        "Corrigendum: {Precautions for accuracy in the
                 generation of truly random binary numbers}",
  journal =      j-J-PHYS-E,
  volume =       "5",
  number =       "6",
  pages =        "546--546",
  year =         "1972",
  CODEN =        "JPSIAE",
  DOI =          "https://doi.org/10.1088/0022-3735/5/6/521",
  ISSN =         "0022-3735",
  ISSN-L =       "0022-3735",
  bibdate =      "Sat Nov 29 15:13:30 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Vincent:1971:PAG}.",
  URL =          "http://stacks.iop.org/0022-3735/5/i=6/a=521",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
}

@Article{Ahrens:1973:EFM,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "Extensions of {Forsythe}'s method for random sampling
                 from the normal distribution",
  journal =      j-MATH-COMPUT,
  volume =       "27",
  number =       "124",
  pages =        "927--937",
  month =        oct,
  year =         "1973",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "6927",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Ahrens:1973:NME,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "{Neuere Methoden zur Erzeugung von
                 nicht-gleichverteilten Zufallsvariablen}. ({German})
                 [{Newer} methods for the generation of nonuniformly
                 distributed random variables]",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "53",
  number =       "12",
  pages =        "T221--T223",
  month =        "????",
  year =         "1973",
  CODEN =        "ZAMMAX",
  DOI =          "https://doi.org/10.1002/zamm.197305312115",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  bibdate =      "Mon Jan 16 12:55:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://onlinelibrary.wiley.com/doi/10.1002/zamm.197305312115/abstract",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik}",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
  language =     "German",
  onlinedate =   "17 November 2010",
}

@Article{Burford:1973:BAC,
  author =       "R. L. Burford",
  title =        "A better additive congruential random number
                 generator",
  journal =      "Decision Sciences",
  volume =       "4",
  number =       "??",
  pages =        "190--193",
  month =        "????",
  year =         "1973",
  CODEN =        "????",
  ISSN =         "0011-7315",
  bibdate =      "Mon Jan 16 21:57:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Diaconis:1973:LMI,
  author =       "Persi Diaconis",
  title =        "Limits of measures of the integers with applications
                 to random number generators and the distribution of
                 leading digits",
  type =         "Memorandum",
  number =       "NS-211",
  institution =  "Department of Statistics, Harvard University",
  address =      "Cambridge, MA, USA",
  day =          "22",
  month =        mar,
  year =         "1973",
  bibdate =      "Sat Nov 12 16:23:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Dieter:1973:CMG,
  author =       "Ulrich Dieter and J. H. Ahrens",
  title =        "A Combinatorial Method for the Generation of Normally
                 Distributed Random Numbers",
  journal =      j-COMPUTING,
  volume =       "11",
  number =       "2",
  pages =        "137--146",
  month =        jun,
  year =         "1973",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:51 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-ec # " and " # ack-nhfb,
  affiliation =  "Tech. Hochschule Graz, Austria",
  classification = "C7890",
  description =  "random number generation",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "combinatorial method; generation; normally
                 distributed; random numbers",
}

@Book{Durbin:1973:DTT,
  author =       "James Durbin",
  title =        "Distribution Theory for Tests Based on the Sample
                 Distribution Function",
  volume =       "9",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "vi + 64",
  year =         "1973",
  LCCN =         "QA276.7 .D87",
  bibdate =      "Sat Mar 03 15:01:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "SIAM CBMS-NSF Regional Conference Series in applied
                 mathematics",
  acknowledgement = ack-nhfb,
}

@Book{Fishman:1973:CMD,
  author =       "George S. Fishman",
  title =        "Concepts and Methods in Discrete Event Digital
                 Simulation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 385",
  year =         "1973",
  ISBN =         "0-471-26155-6",
  ISBN-13 =      "978-0-471-26155-1",
  LCCN =         "T57.62 .F57",
  bibdate =      "Thu Jan 5 14:27:20 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Digital computer simulation; System analysis",
}

@Article{Geffe:1973:HPD,
  author =       "P. Geffe",
  title =        "How to Protect Data With Ciphers That Are Really Hard
                 to Break",
  journal =      "Electronics",
  volume =       "46",
  number =       "1",
  pages =        "99--101",
  month =        jan,
  year =         "1973",
  bibdate =      "Sat Apr 05 12:15:22 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Good:1973:BRB,
  author =       "I. J. Good",
  title =        "Book Review: {{\booktitle{The Generation of Random
                 Variates}} by T. G. Newman; P. L. Odell}",
  journal =      j-INT-STAT-REV,
  volume =       "41",
  number =       "1",
  pages =        "139--140",
  month =        apr,
  year =         "1973",
  CODEN =        "ISTRDP",
  DOI =          "https://doi.org/10.2307/1402798",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Wed Jun 18 06:09:08 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i261080;
                 https://www.math.utah.edu/pub/tex/bib/intstatrev.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1402798",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review = Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@PhdThesis{Grube:1973:MREa,
  author =       "A. Grube",
  title =        "{Mehrfach rekursiv erzeugte Zahienfolgen} ({German})
                 [Multiple sequences of numbers generated recursively]",
  type =         "Dissertation",
  school =       "Fakult{\"a}t f{\"u}r Mathematik, Universit{\"a}t
                 Karlsruhe",
  address =      "Karlsruhe, West Germany",
  year =         "1973",
  bibdate =      "Tue Jan 10 16:09:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Article{Grube:1973:MREb,
  author =       "A. Grube",
  title =        "{Mehrfach rekursiv-erzeugte Pseudo-Zufallszahlen}.
                 ({German}) [{Multiply} recursive generation of
                 pseudorandom numbers]",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "53",
  number =       "12",
  pages =        "T223--T225",
  month =        "????",
  year =         "1973",
  CODEN =        "ZAMMAX",
  DOI =          "https://doi.org/10.1002/zamm.197305312116",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  bibdate =      "Mon Jan 16 21:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik}",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
  language =     "German",
}

@Article{Gupta:1973:OSE,
  author =       "Shanti S. Gupta and Klaus Nagel and S. Panchapakesan",
  title =        "On the Order Statistics from Equally Correlated Normal
                 Random Variables",
  journal =      j-BIOMETRIKA,
  volume =       "60",
  number =       "2",
  pages =        "403--413",
  month =        aug,
  year =         "1973",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2334554",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "62E15",
  MRnumber =     "0388608 (52 \#9444)",
  MRreviewer =   "R. E. Barlow",
  bibdate =      "Sat Jun 21 14:33:52 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315474;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2334554",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Hader:1973:IMR,
  author =       "R. J. Hader",
  title =        "An Improper Method of Randomization in Experimental
                 Design",
  journal =      j-AMER-STAT,
  volume =       "27",
  number =       "2",
  pages =        "82--84",
  month =        apr,
  year =         "1973",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:20 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326378;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683964",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Book{Hamming:1973:NMS,
  author =       "R. W. Hamming",
  title =        "Numerical Methods for Scientists and Engineers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "ix + 721",
  year =         "1973",
  ISBN =         "0-07-025887-2",
  ISBN-13 =      "978-0-07-025887-7",
  LCCN =         "QA297 .H28 1973",
  bibdate =      "Tue Jan 17 11:46:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "random numbers",
}

@Article{Holland:1973:GAO,
  author =       "John H. Holland",
  key =          "genetic-algorithms",
  title =        "Genetic Algorithms and the Optimal Allocation of
                 Trials",
  journal =      j-SIAM-J-COMPUT,
  volume =       "2",
  number =       "2",
  pages =        "88--105",
  month =        apr,
  year =         "1973",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Mon Nov 29 10:57:42 MST 2010",
  bibsource =    "Ai/alife.bib;
                 http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/2/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 Misc/misc.1.bib",
  note =         "See erratum \cite{Holland:1974:EGA}.",
  abstract =     "This study gives a formal setting to the difficult
                 optimisation problems characterised by the conjunction
                 of (1) substantial complexity and initial uncertainty,
                 (2) the necessity of acquiring new information rapidly
                 to reduce the uncertainty and (3) a requirement that
                 the new information be exploited as acquired so that
                 average performance increases at a rate consistent with
                 th rate of acquisition of information. The setting has
                 as its basis a set A of structures to be searched or
                 tried and a performance function u:A->real numbers.
                 Within this setting it is determined how to allocate
                 trials to a set of random variables so as to maximise
                 expected performances. This result is then transformed
                 into a criterion against which to measure the
                 performance of a robust and easily implemented set of
                 algorithms called reproductive plans. It is shown that
                 reproductive plans can in fact surpass the criterion
                 because of a phenomenon called intrinsic parallelism
                 --- a single trial (individual a E A) simultaneously
                 tests and exploits many random variables.",
  acknowledgement = ack-nhfb,
  annote =       "A mathematical analysis of genetic algorithms and
                 their ``implicit parallelism''.",
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Knop:1973:AAR,
  author =       "Robert E. Knop",
  title =        "{ACM Algorithm 441}: Random Deviates from the Dipole
                 Distribution [{G5}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "51--51",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:55:18 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Knop73;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Florida State Univ., Tallahassee, FL, USA",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7514",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "dipole distribution; FORTRAN; probability density;
                 random deviates; random number; statistics;
                 subroutines",
  oldlabel =     "Knop73",
  references =   "0",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knop73",
}

@Article{Kozlov:1973:EEM,
  author =       "G. A. Kozlov",
  title =        "Estimation of the Error of the Method of Statistical
                 Tests ({Monte-Carlo}) Due to Imperfections in the
                 Distribution of Random Numbers",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "17",
  number =       "3",
  pages =        "493--509",
  month =        "????",
  year =         "1973",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1117057",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:36:41 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/17/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "June 1973",
}

@TechReport{Learmonth:1973:NPS,
  author =       "G. P. Learmonth and P. A. W. Lewis",
  title =        "{Naval Postgraduate School} Random Number Generator
                 Package {LLRANDOM}",
  type =         "Report",
  number =       "NP555LW73061A",
  institution =  "Naval Postgraduate School",
  address =      "Monterey, CA, USA",
  year =         "1973",
  bibdate =      "Thu Jan 05 14:33:09 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The shuffling algorithm proposed in this report does
                 {\em not\/} lengthen the period, and only marginally
                 reduces the lattice structure of linear congruential
                 generators, despite the apparently tiny difference with
                 the \cite{Bays:1976:IPR} algorithm: see
                 \cite{Bays:1990:CIR} for a comparison, both
                 mathematical, and graphical.",
  acknowledgement = ack-nhfb,
}

@Article{Levin:1973:NRS,
  author =       "L. A. Levin",
  title =        "On the notion of a random sequence",
  journal =      j-SOVIET-MATH-DOKL,
  volume =       "14",
  number =       "??",
  pages =        "1413--1416",
  month =        "????",
  year =         "1973",
  CODEN =        "????",
  ISSN =         "0197-6788",
  bibdate =      "Thu Dec 29 15:04:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Soviet Mathematics. Doklady",
}

@Article{Lewis:1973:GFS,
  author =       "T. G. Lewis and W. G. Payne",
  title =        "Generalized Feedback Shift Register Pseudorandom
                 Number Algorithm",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "456--468",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321765.321777",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See important errata, and algorithm and code
                 improvements, in \cite{Fushimi:1990:RNG}.",
  acknowledgement = ack-nhfb,
  annote =       "Feedback configurations for SR's of length > 45",
  descriptors =  "Shift register sequences",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@TechReport{Malcolm:1973:UUR,
  author =       "Michael A. Malcolm and Cleve B. Moler",
  title =        "{URAND}: a universal random number generator",
  type =         "Technical Report",
  number =       "STAN-CS-73-334",
  institution =  "Computer Science Department, Stanford University",
  address =      "Stanford, CA, USA",
  pages =        "5",
  year =         "1973",
  bibdate =      "Sat Apr 07 09:25:30 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A subroutine for generating uniformly-distributed
                 floating-point numbers in the interval $ [0, 1) $ is
                 presented in ANSI Standard Fortran. The subroutine,
                 URAND, is designed to be relatively machine
                 independent. URAND has undergone minimal testing on
                 various machines and is thought to work properly on any
                 machine having binary integer number representation,
                 integer multiplication modulo $m$ and integer addition
                 either modulo $m$ or yielding at least $ \log_2 (m) $
                 significant bits, where $m$ is some integral power of
                 $2$. Upon the first call of URAND, the value of $m$ is
                 automatically determined and appropriate constants for
                 a linear congruential generator are computed following
                 the suggestions of D. E. Knuth, volume 2. URAND is
                 guaranteed to have a full-length cycle. Readers are
                 invited to apply their favorite statistical tests to
                 URAND, using any binary machine, and report the results
                 to the authors.",
  acknowledgement = ack-nhfb,
}

@Article{Maritsas:1973:AFT,
  author =       "D. G. Maritsas",
  title =        "The Autocorrelation Function of the Two Feedback
                 Shift-Register Pseudorandom Source",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-22",
  number =       "10",
  pages =        "962--964",
  month =        oct,
  year =         "1973",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1973.223626",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 16:45:35 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672219",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Maritsas:1973:HSA,
  author =       "Dimitris G. Maritsas",
  title =        "A High Speed and Accuracy Digital {Gaussian} Generator
                 of Pseudorandom Numbers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-22",
  number =       "7",
  pages =        "629--634",
  month =        jul,
  year =         "1973",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1973.5009127",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 16:45:27 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009127",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@TechReport{Marsaglia:1973:HUM,
  author =       "George Marsaglia and K. Ananthanarayanan and A.
                 Zaman",
  title =        "How to use the {McGill} random-number package
                 {SUPER-DUPER}",
  type =         "Technical report",
  institution =  "School of Computer Science, McGill University",
  address =      "Montreal, Quebec, Canada",
  year =         "1973",
  bibdate =      "Thu Dec 20 20:19:47 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{McGrath:1973:TEM,
  author =       "E. J. McGrath and D. C. Irving",
  title =        "Techniques for Efficient {Monte Carlo} Simulation.
                 {Vol. II}. {Random} Number Generation for Selected
                 Probability Distributions",
  type =         "Report",
  number =       "????",
  institution =  "National Technical Information Service",
  address =      "Springfield, VA, USA",
  year =         "1973",
  bibdate =      "Wed Nov 12 08:59:16 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Neave:1973:MUB,
  author =       "Henry R. Neave",
  title =        "Miscellanea: On Using the {Box--Muller} Transformation
                 with Multiplicative Congruential Pseudo-Random Number
                 Generators",
  journal =      j-APPL-STAT,
  volume =       "22",
  number =       "1",
  pages =        "92--97",
  year =         "1973",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:20:44 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2346308.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Neuman:1973:CSS,
  author =       "Frank Neuman and Robert Merrick and Clyde F. Martin",
  title =        "The correlation structure of several popular
                 pseudorandom number generators",
  type =         "Report",
  number =       "NASA-TM-X-62275",
  institution =  "NASA Ames Research Center",
  address =      "????",
  year =         "1973",
  bibdate =      "Thu Jan 19 18:03:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Document ID: 19730017891",
  abstract =     "One of the desirable properties of a pseudorandom
                 number generator is that the sequence of numbers it
                 generates should have very low autocorrelation for all
                 shifts except for zero shift and those that are
                 multiples of its cycle length. Due to the simple
                 methods of constructing random numbers, the ideal is
                 often not quite fulfilled. A simple method of examining
                 any random generator for previously unsuspected
                 regularities is discussed. Once they are discovered it
                 is often easy to derive the mathematical relationships,
                 which describe the mathematical relationships, which
                 describe the regular behavior. As examples, it is shown
                 that high correlation exists in mixed and
                 multiplicative congruential random number generators
                 and prime moduli Lehmer generators for shifts a
                 fraction of their cycle lengths.",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1973:BEB,
  author =       "H. Niederreiter and W. Philipp",
  title =        "{Berry--Esseen} bounds and a theorem of {Erd{\H{o}}s}
                 and {Tur{\'a}n} on uniform distribution $ \bmod 1 $",
  journal =      j-DUKE-MATH-J,
  volume =       "40",
  number =       "??",
  pages =        "633--649",
  month =        "????",
  year =         "1973",
  CODEN =        "DUMJAO",
  ISSN =         "0012-7094 (print), 1547-7398 (electronic)",
  ISSN-L =       "0012-7094",
  MRnumber =     "MR 337873",
  bibdate =      "Thu Jan 19 07:45:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Duke Mathematical Journal",
  journal-URL =  "http://projecteuclid.org/info/euclid.dmj",
}

@InProceedings{Niederreiter:1973:MTD,
  author =       "Harald Niederreiter",
  editor =       "????",
  booktitle =    "Analytic number theory (Proceedings of the Symposium
                 on Pure Mathematics, St. Louis University, St. Louis,
                 {MO)}",
  title =        "Metric theorems on the distribution of sequences",
  volume =       "XXIV",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "195--212",
  year =         "1973",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  MRnumber =     "MR0337872 (49 #2641)",
  bibdate =      "Thu Jan 19 07:31:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@PhdThesis{Overstreet:1973:QCM,
  author =       "Claude {Overstreet, Jr.}",
  title =        "The Quadratic Congruential Method of Random Number
                 Generation",
  type =         "{Ph.D.} Dissertation",
  school =       "Southern Methodist University",
  address =      "Dallas, TX",
  month =        may,
  year =         "1973",
  bibdate =      "Tue Jan 17 11:28:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Overstreet:1973:RNG,
  author =       "Claude {Overstreet, Jr.} and Richard E. Nance",
  editor =       "Erwin E. Perlin and Thomas J. {McConnell, Jr.}",
  booktitle =    "{ACM '73: Proceedings of the ACM annual conference}",
  title =        "A random number generator for small word-length
                 computers",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "219--223",
  year =         "1973",
  DOI =          "https://doi.org/10.1145/800192.805707",
  LCCN =         "????",
  bibdate =      "Tue Jan 17 11:23:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kral:1972:NAP,Kral:1972:ENA}",
  URL =          "http://dl.acm.org/citation.cfm?id=805707",
  acknowledgement = ack-nhfb,
}

@Article{Peskun:1973:OMC,
  author =       "P. H. Peskun",
  title =        "Optimum {Monte--Carlo} Sampling Using {Markov}
                 Chains",
  journal =      j-BIOMETRIKA,
  volume =       "60",
  number =       "3",
  pages =        "607--612",
  month =        dec,
  year =         "1973",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2335011",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "65C05 (60J10)",
  MRnumber =     "0362823 (50 \#15261)",
  MRreviewer =   "J. Spanier",
  bibdate =      "Sat Jun 21 14:33:54 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315475;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2335011",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
  remark =       "This paper, based on the author's Ph.D. thesis work,
                 proves the optimality of the Metropolis--Hastings
                 algorithm \cite{Hastings:1970:MCS,Metropolis:1953:ESC},
                 and compares it with the Barker approach
                 \cite{Barker:1965:MCC}. See \cite{Hitchcock:2003:HMH}
                 for a historical view.",
}

@InCollection{Philipp:1973:EDF,
  author =       "W. Philipp",
  editor =       "C. F. Osgood",
  booktitle =    "{Diophantine} Approximation and Its Applications",
  title =        "Empirical distribution functions and uniform
                 distribution $ \bmod 1 $",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  bookpages =    "????",
  pages =        "211--234",
  year =         "1973",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  MRnumber =     "MR 354594",
  bibdate =      "Thu Jan 19 08:04:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Pohl:1973:MVM,
  author =       "P. Pohl",
  title =        "The multicyclic vector method of generating
                 pseudo-random numbers. {I}. {Theoretical} background,
                 Description of the method and algebraic analysis",
  type =         "Report",
  number =       "TRITA-NA-7307",
  institution =  "The Royal Institute of Technology, Department of
                 Information Processing and Computer Science",
  address =      "Stockholm, Sweden",
  pages =        "36",
  year =         "1973",
  bibdate =      "Thu Mar 08 20:50:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Polge:1973:GPR,
  author =       "R. J. Polge and E. M. Holliday and B. K. Bhagavan",
  title =        "Generation of a pseudo-random set with desired
                 correlation and probability distribution",
  journal =      j-SIMULATION,
  volume =       "20",
  number =       "5",
  pages =        "153--158",
  month =        may,
  year =         "1973",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754977302000504",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 12:07:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/20/5/153.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Rice:1973:DRE,
  author =       "S. O. Rice",
  title =        "Distribution of $ \sum a_n / n $, $ a_n $ Randomly
                 Equal to $ \pm 1 $",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "52",
  number =       "7",
  pages =        "1097--1103",
  month =        sep,
  year =         "1973",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1973/BSTJ.1973.5207.html;
                 http://www.alcatel-lucent.com/bstj/vol52-1973/bstj-vol52-issue07.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol52/bstj52-7-1097.pdf;
                 http://www.alcatel-lucent.com/bstj/vol52-1973/articles/bstj52-7-1097.pdf",
  abstract =     "When $ a_1, a2, \ldots {} $ are independent random
                 variables, each equal to $ \pm 1 $ with probability $ 1
                 / 2 $, the sum $ \sum_{n = 1}^\infty a_n / n $ is a
                 random variable whose distribution is difficult to
                 determine theoretically. This sum is of interest in the
                 study of intersymbol interference in digital
                 communication systems. Here the distribution of the sum
                 is computed by numerical integration and the results
                 tabulated. Asymptotic expressions are given for the
                 tails of the distribution.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@Article{Schatte:1973:VMG,
  author =       "Peter Schatte",
  title =        "{Zur Verteilung der Mantisse in der
                 Gleitkommadarstellung einer Zufallsgr{\"o}{\ss}e}.
                 ({German}) [Distribution of the mantissa in the
                 floating-point representation of a random variable]",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "53",
  number =       "??",
  pages =        "553--565",
  month =        "????",
  year =         "1973",
  CODEN =        "ZAMMAX",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  bibdate =      "Mon Nov 14 16:35:28 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "{Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik}",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
  language =     "German",
}

@Article{Tootill:1973:ART,
  author =       "J. P. R. Tootill and W. D. Robinson and D. J. Eagle",
  title =        "An Asymptotically Random {Tausworthe} Sequence",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "469--481",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321765.321778",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The theoretical limitations on the orders of
                 equidistribution attainable by Tausworthe sequences are
                 derived from first principles and are stated in the
                 form of a criterion to be achieved. A second criterion,
                 extending these limitations to multidimensional
                 uniformity, is also defined. A sequence possessing both
                 properties is said to be asymptotically random as no
                 other sequence of the same period could be more random
                 in these respects. An algorithm is presented which, for
                 any Tausworthe sequence based on a primitive trinomial
                 over GF(2), establishes how closely or otherwise the
                 conditions necessary for the criteria are achieved.
                 Given that the necessary conditions are achieved, the
                 conditions sufficient for the first criterion are
                 derived from Galois theory and always apply. For the
                 second criterion, however, the period must be prime. An
                 asymptotically random 23-bit number sequence of
                 astronomic period, $ 2^{607} - 1 $, is presented. An
                 initialization program is required to provide 607
                 starting values, after which the sequence can be
                 generated with a three-term recurrence of the Fibonacci
                 type. In addition to possessing the theoretically
                 demonstrable randomness properties associated with
                 Tausworthe sequences, the sequence possesses
                 equidistribution and multidimensional uniformity
                 properties vastly in excess of anything that has yet
                 been shown for conventional congruentially generated
                 sequences. It is shown that, for samples of a size it
                 is practicable to generate, there can exist no purely
                 empirical test of the sequence as it stands capable of
                 distinguishing between it and an $ \infty $-distributed
                 sequence. Bounds for local nonrandomness in respect of
                 runs above (below) the mean and runs of equal numbers
                 are established theoretically. The claimed randomness
                 properties do not necessarily extend to subsequences,
                 though it is not yet known which particular
                 subsequences are at fault. Accordingly, the sequence is
                 at present suggested only for simulations with no fixed
                 dimensionality requirements.",
  acknowledgement = ack-nhfb,
  annote =       "The theoretical limitations on the orders of
                 equidistribution attainable by Tausworthe sequences are
                 derived from first principles and are stated in the
                 form of a criterion to be achieved. A second criterion,
                 extending these limitations to multidimensional
                 uniformity, is also defined. A sequence possessing both
                 properties is said to be asymptotically random as no
                 other sequence of the same period could be more random
                 in these respects. \ldots{}",
  descriptors =  "Tausworthe generator; shift register sequences; rng;
                 test; runtime/storage efficiency; multidimensional
                 uniformity",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Tsuda:1973:NIF,
  author =       "Takao Tsuda",
  title =        "Numerical integration of functions of very many
                 variables",
  journal =      j-NUM-MATH,
  volume =       "20",
  number =       "5",
  pages =        "377--391",
  month =        oct,
  year =         "1973",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290M (Numerical integration and differentiation);
                 C4160 (Numerical integration and differentiation)",
  corpsource =   "Hokkaido Univ., Sapporo, Japan",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "composite functions; functions of very many variables;
                 integration; Monte Carlo quadrature; multidimensional
                 interpolatory quadrature scheme; numerical integration;
                 samplings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vincent:1973:RGT,
  author =       "C. H. Vincent",
  title =        "Reply to {``The generation of truly random binary
                 digits''}",
  journal =      j-J-PHYS-E,
  volume =       "6",
  number =       "5",
  pages =        "496--496",
  month =        "????",
  year =         "1973",
  CODEN =        "JPSIAE",
  DOI =          "https://doi.org/10.1088/0022-3735/6/5/027",
  ISSN =         "0022-3735",
  bibdate =      "Thu Feb 02 18:19:05 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://iopscience.iop.org/0022-3735/6/5/027",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics. E: Scientific instruments",
  journal-URL =  "http://iopscience.iop.org/0022-3735/",
}

@Article{Adam:1974:CLS,
  author =       "Thomas L. Adam and K. Mani Chandy and J. R. Dickson",
  title =        "A Comparison of List Schedules for Parallel Processing
                 Systems",
  journal =      j-CACM,
  volume =       "17",
  number =       "12",
  pages =        "685--690",
  month =        dec,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:20:31 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/OVR.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#AdamCD74;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The problem of scheduling two or more processors to
                 minimize the execution time of a program which consists
                 of a set of partially ordered tasks is studied. Cases
                 where task execution times are deterministic and others
                 in which execution times are random variables are
                 analyzed. It is shown that different algorithms
                 suggested in the literature vary significantly in
                 execution time and that the B-schedule of Coffman and
                 Graham is near-optimal. A dynamic programming solution
                 for the case in which execution times are random
                 variables is presented.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5400 (Analogue and digital computers and systems);
                 C6150J (Operating systems)",
  classification = "722",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "comparison; computer systems, digital; dynamic
                 programming; list schedules; list scheduling;
                 optimisation; optimization; parallel processing;
                 parallel processing systems; precedence graphs;
                 scheduling",
  oldlabel =     "AdamCD74",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AdamCD74",
}

@Article{Ahrens:1974:CMS,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "Computer Methods for Sampling from Gamma, Beta,
                 {Poisson} and Binomial Distributions",
  journal =      j-COMPUTING,
  volume =       "12",
  number =       "3",
  pages =        "223--246",
  month =        sep,
  year =         "1974",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:52 MST 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  note =         "See note \cite{Apostolopoulos:1979:IAN}.",
  acknowledgement = ack-nhfb # " and " # ack-ec,
  affiliation =  "Nova Scotia Tech. Coll., Halifax, NS, Canada",
  classification = "922; C7890",
  description =  "random number generation; random processes; sampled
                 data systems",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput (Vienna/NY)",
  keywords =     "beta distribution; binomial distribution; computer
                 methods; gamma distribution; intermediate step;
                 mathematical programming; normal distribution;
                 numerical analysis; Poisson distribution; probability;
                 pseudorandom; random numbers; sampling; simulation;
                 uniformly distributed random numbers; variable
                 parameters",
}

@Article{Alam:1974:SNT,
  author =       "Khursheed Alam",
  title =        "Some Nonparametric Tests of Randomness",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "69",
  number =       "347",
  pages =        "738--739",
  month =        sep,
  year =         "1974",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:46 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314229;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2286010",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Beasley:1974:CSR,
  author =       "J. D. Beasley",
  title =        "Correspondence: {System 4} random number",
  journal =      j-COMP-J,
  volume =       "17",
  number =       "4",
  pages =        "381--381",
  month =        nov,
  year =         "1974",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Oct 07 11:02:09 2000",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_04/tiff/381.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Block:1974:CBE,
  author =       "Henry W. Block and A. P. Basu",
  title =        "A continuous bivariate exponential extension",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "69",
  number =       "348",
  pages =        "1031--1037",
  month =        dec,
  year =         "1974",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon May 5 08:32:38 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2286184",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); C1140
                 (Probability and statistics)",
  corpsource =   "Dept. of Math., Univ. of Pittsburgh, Pittsburgh, PA,
                 USA",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  keywords =     "bivariate random variables; continuous bivariate
                 exponential extension; estimation; exponential
                 distribution; loss of memory property; reliability;
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brent:1974:AAG,
  author =       "Richard P. Brent",
  title =        "{ACM Algorithm 488}: a {Gaussian} pseudo-random number
                 generator [{G5}]",
  journal =      j-CACM,
  volume =       "17",
  number =       "12",
  pages =        "704--706",
  month =        dec,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:28:05 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Brent74;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  citedby =      "Fullerton:1980:BEM",
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Australian Nat. Univ., Canberra, Australia",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7061",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "distribution; FORTRAN; Gaussian; generator; GRAND;
                 normal distribution; pseudo random numbers; random
                 number generation; random numbers; subroutines",
  location =     "SEL: Wi",
  oldlabel =     "Brent74",
  references =   "0",
  remark =       "Fullerton: A FORTRAN routine that returns normally
                 distributed numbers with zero mean and unit standard
                 deviation.",
  revision =     "16/01/94",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brent74",
}

@Article{Chen:1974:GRV,
  author =       "Hui-Chuan Chen and Yoshinori Asau",
  title =        "On generating random variates from an empirical
                 distribution",
  journal =      "Transactions of the American Institute of Electrical
                 Engineers",
  volume =       "6",
  number =       "2",
  pages =        "163--166",
  year =         "1974",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/05695557408974949",
  ISSN =         "????",
  bibdate =      "Thu Dec 29 15:19:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This note presents a method for generating a sequence
                 of random variates from an empirical distribution.
                 Computational results show that the proposed method
                 requires less computation time than two standard
                 methods but requires only ten more words of memory. The
                 savings in time becomes more significant as the number
                 of distinct values contained in the distribution, or
                 the sample size increases.",
  acknowledgement = ack-nhfb,
  ajournal =     "AIEE Transactions",
}

@Article{Cohn:1974:CRP,
  author =       "Charles E. Cohn",
  title =        "Correlations in a random-pulse generator",
  journal =      j-SIMULATION,
  volume =       "23",
  number =       "4",
  pages =        "128--128",
  month =        oct,
  year =         "1974",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754977402300407",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:55:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/23/4/128.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
  remark =       "Discusses a physical device, the BNC Model DB-2 Random
                 Pulse Generator, and shows that its output is far from
                 random.",
}

@Article{Coldwell:1974:CDS,
  author =       "Robert Lynn Coldwell",
  title =        "Correlational defects in the standard {IBM 360} random
                 number generator and the classical ideal gas
                 correlation function",
  journal =      j-J-COMPUT-PHYS,
  volume =       "14",
  number =       "2",
  pages =        "223--226",
  month =        feb,
  year =         "1974",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(74)90015-1",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comment \cite{Amadori:1977:CDS}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999174900151",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Collins:1974:CTE,
  author =       "George E. Collins",
  title =        "The Computing Time of the {Euclidean} Algorithm",
  journal =      j-SIAM-J-COMPUT,
  volume =       "3",
  number =       "1",
  pages =        "1--10",
  month =        "????",
  year =         "1974",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Mon Nov 29 10:57:53 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/3/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Book{Dahlquist:1974:NM,
  author =       "Germund Dahlquist and {\AA}ke Bj{\"o}rck and Ned
                 Anderson",
  title =        "Numerical Methods",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 573",
  year =         "1974",
  ISBN =         "0-13-627315-7",
  ISBN-13 =      "978-0-13-627315-8",
  LCCN =         "QA297 .D131 1969",
  bibdate =      "Tue Dec 14 22:44:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Translated by Ned Anderson.",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Some General Principles of Numerical
                 Calculation / 1 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 3: Numerical Uses of Series / 60 \\
                 4: Approximation of Functions / 81 \\
                 5: Numerical Linear Algebra / 137 \\
                 6: Nonlinear Equations / 218 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 8: Differential Equations / 330 \\
                 9: Fourier Methods / 405 \\
                 10: Optimization / 422 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
  tableofcontents = "Preface / xvii \\
                 Conventions / xix \\
                 1: Some General Principles of Numerical Calculation / 1
                 \\
                 1.1. Introduction / 1 \\
                 1.2. Some Common Ideas and Concepts in Numerical
                 Methods / 2 \\
                 1.3. Numerical Problems and Algorithms / 13 \\
                 1.3.1. Definitions / 13 \\
                 1.3.2. Recursive Formulas; Homer's Rule / 14 \\
                 1.3.3. An Example of Numerical Instability / 16 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 2.1. Basic Concepts in Error Estimation / 21 \\
                 2.1.1. Introduction / 21 \\
                 2.1.2. Sources of Error / 22 \\
                 2.1.3. Absolute and Relative Errors / 23 \\
                 2.1.4. Rounding and Chopping / 24 \\
                 2.2 Propagation of Errors / 26 \\
                 2.2.1. Simple Examples of Error Analysis / 26 \\
                 2.2.2. The General Formula for Error Propagation;
                 Maximum Error and Standard Error / 29 \\
                 2.2.3. On the Practical Application of Error Estimation
                 / 34 \\
                 2.2.4. The Use of Experimental Perturbations / 36 \\
                 2.2.5. Automatic Control of Accuracy / 37 \\
                 2.3. Number Systems; Floating and Fixed Representation
                 / 42 \\
                 2.3.1. The Position System / 42 \\
                 2.3.2. Floating and Fixed Representation / 43 \\
                 2.3.3. Floating Decimal Point / 44 \\
                 2.3.4. Fixed Decimal Point / 46 \\
                 2.3.5. Round-off Errors in Computation with Floating
                 Arithmetic Operations / 46 \\
                 2.4. Backward Error Analysis; Condition Numbers / 51
                 \\
                 2.4.1. Backward Error Analysis / 51 \\
                 2.4.2. Condition Numbers for Problems and Algorithms /
                 53 \\
                 2.4.3. Geometrical Illustration of Error Analysis / 56
                 \\
                 3: Numerical Uses of Series / 60 \\
                 3.1. Elementary Uses of Series / 60 \\
                 3.1.1. Simple Examples / 60 \\
                 3.1.2. Estimating the Remainder / 62 \\
                 3.1.3. Power Series / 65 \\
                 3.2. Acceleration of Convergence / 71 \\
                 3.2.1. Slowly Converging Alternating Series / 71 \\
                 3.2.2. Slowly Converging Series with Positive Terms /
                 73 \\
                 3.2.3. Other Simple Ways to Accelerate Convergence / 74
                 \\
                 3.2.4. Ill-Conditioned Series / 75 \\
                 3.2.5. Numerical Use of Divergent Series / 77 \\
                 4: Approximation of Functions / 81 \\
                 4.1. Basic Concepts in Approximation / 81 \\
                 4.1.1. Introduction / 81 \\
                 4.1.2. The Idea of a Function Space / 84 \\
                 4.1.3. Norms and Seminorms / 85 \\
                 4.1.4. Approximation of Functions as a Geometric
                 Problem in Function Space / 87 \\
                 4.2. The Approximation of Functions by the Method of
                 Least Squares / 88 \\
                 4.2.t. Statement of the Problems / 88 \\
                 4.2.2. Orthogonal Systems / 89 \\
                 4.2.3. Solution of the Approximation Problem / 92 \\
                 4.3. Polynomials / 97 \\
                 4.3.1. Basic Terminology; the Weierstrass Approximation
                 Theorem / 97 \\
                 4.3.2. Triangle Families of Polynomials / 98 \\
                 4.3.3. A Triangle Family and Its Application to
                 Interpolation / 99 \\
                 4.3.4. Equidistant Interpolation and the Runge
                 Phenomenon / 101 \\
                 4.4. Orthogonal Polynomials and Applications / 104 \\
                 4.4.1. Tchebycheff Polynomials / 104 \\
                 4.4.2. Tchebycheff Interpolation and Smoothing / 106
                 \\
                 4.4.3. General Theory of Orthogonal Polynomials / 108
                 \\
                 4.4.4. Legendre Polynomials and Gram Polynomials / 113
                 \\
                 4.5. Complementary Observations on Polynomial
                 Approximation / 117 \\
                 4.5.1. Summary of the Use of Polynomials / 117 \\
                 4.5.2. Some Inequalities for $E_n(f)$ with Applications
                 to the Computation of Linear Functionals / 120 \\
                 4.5.3. Approximation in the Maximum Norm / 124 \\
                 4.5.4. Economization of Power Series; Standard
                 Functions / 125 \\
                 4.5.5. Some Statistical Aspects of the Method of Least
                 Squares / 126 \\
                 4.6. Spline Functions / 131 \\
                 5: Numerical Linear Algebra / 137 \\
                 5,1. Introduction / 137 \\
                 5.2. Basic Concepts of Linear Algebra / 138 \\
                 5.2.1. Fundamental Definitions / 138 \\
                 5.2.2. Partitioned Matrices / 140 \\
                 5.2.3. Linear Vector Spaces / 141 \\
                 5.2.4. Eigenvalues and Similarity Transformations / 142
                 \\
                 5.2.5. Singular-Value Decomposition and Pseudo-Inverse
                 / 143 \\
                 5.3. Direct Methods for Solving Systems of Linear
                 Equations / 146 \\
                 5.3.1. Triangular Systems / 146 \\
                 5.3.2. Gaussian Elimination / 147 \\
                 5.3.3. Pivoting Strategies / 150 \\
                 5.3.4. $L U$-Decomposition / 152 \\
                 5.3.5. Compact Schemes for Gaussian Elimination / 157
                 \\
                 5.3.6. Inverse Matrices / 159 \\
                 5.4. Special Matrices / 162 \\
                 5.4.1. Symmetric Positive-Definite Matrices / 162 \\
                 5.4.2. Band Matrices / 165 \\
                 5.4.3. Large-Scale Linear Systems / 168 \\
                 5.4.4. Other Sparse Matrices / 169 \\
                 5.5. Error Analysis for Linear Systems / 174 \\
                 5.5.1. An Ill-Conditioned Example / 174 \\
                 5.5.2. Vector and Matrix Norms / 175 \\
                 5.5.3. Perturbation Analysis / 176 \\
                 5.5.4. Rounding Errors in Gaussian Elimination / 177
                 \\
                 5.5.5. Scaling of Linear Systems / 181 \\
                 5.5.6. Iterative Improvement of a Solution / 183 \\
                 5.6. Iterative Methods / 188 \\
                 5.7. Overdetermined Linear Systems / 196 \\
                 5.7.1. The Normal Equations / 197 \\
                 5.7.2. Orthogonalization Methods / 201 \\
                 5.7.3. Improvement of Least-Squares Solutions / 204 \\
                 5.7.4. Least-Squares Problems with Linear Constraints /
                 205 \\
                 5.8. Computation of Eigenvalues and Eigenvectors / 208
                 \\
                 5.8.1. The Power Method / 209 \\
                 5.8.2. Methods Based on Similarity Transformations /
                 211 \\
                 5.8.3. Eigenvalues by Equation Solving / 215 \\
                 5.8.4. The $Q R$-Algorithm / 216 \\
                 6: Nonlinear Equations / 218 \\
                 6.1. Introduction / 218 \\
                 6.2. Initial Approximations; Starting Methods / 219 \\
                 6.2.1. Introduction / 219 \\
                 6.2.2. The Bisection Method / 220 \\
                 6.3. Newton--Raphson's Method / 222 \\
                 6.4. The Secant Method / 227 \\
                 6.4.1. Description of the Method / 227 \\
                 6.4.2. Error Analysis for the Secant Method / 228 \\
                 6.4.3. Regula Falsi / 230 \\
                 6.4.4. Other Related Methods / 230 \\
                 6.5. General Theory of Iteration Methods / 233 \\
                 6.6. Error Estimation and Attainable Accuracy in
                 Iteration Methods / 238 \\
                 6.6.1. Error Estimation / 238 \\
                 6.6.2. Attainable Accuracy; Termination Criteria / 240
                 \\
                 6.7. Multiple Roots / 242 \\
                 6.8. Algebraic Equations / 243 \\
                 6.8.1. Introduction / 243 \\
                 6.8.2. Deflation / 245 \\
                 6.8.3. Ill-Conditioned Algebraic Equations / 246 \\
                 6.9. Systems of Nonlinear Equations / 248 \\
                 6.9.1. Iteration / 249 \\
                 6.9.2. Newton--Raphson's Method and Some Modifications
                 / 249 \\
                 6.9.3. Other Methods / 251 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 7.1. Difference Operators and Their Simplest Properties
                 / 255 \\
                 7.2. Simple Methods for Deriving Approximation Formulas
                 and Error Estimates / 263 \\
                 7.2.1. Statement of the Problems and Some Typical
                 Examples / 263 \\
                 7.2.2, Repeated Richardson Extrapolation / 269 \\
                 7.3. Interpolation / 275 \\
                 7.3.1. Introduction / 275 \\
                 7.3.2. When is Linear Interpolation Sufficient? / 276
                 \\
                 7.3.3. Newton's General Interpolation Formula / 277 \\
                 7.3.4. Formulas for Equidistant Interpolation / 279 \\
                 7.3.5. Complementary Remarks on Interpolation / 282 \\
                 7.3.6. Lagrange's Interpolation Formula / 284 \\
                 7.3.7. Hermite Interpolation / 285 \\
                 7.3.8. Inverse Interpolation / 286 \\
                 7.4. Numerical Integration / 290 \\
                 7.4.1. The Rectangle Rule, Trapezoidal Rule, and
                 Romberg's Method / 291 \\
                 7.4.2. The Truncation Error of the Trapezoidal Rule /
                 293 \\
                 7.4.3. Some Difficulties and Possibilities in Numerical
                 Integration / 294 \\
                 7.4.4. The Euler--Maclaurin Summation Formula / 297 \\
                 7.4.5. Uses of the Euler--Maclaurin Formula / 300 \\
                 7.4.6. Other Methods for Numerical Integration / 302
                 \\
                 7.5. Numerical Differentiation / 307 \\
                 7.6. The Calculus of Operators / 311 \\
                 7.6.1. Operator Algebra / 311 \\
                 7.6.2. Operator Series with Applications / 312 \\
                 7.7. Functions of Several Variables / 318 \\
                 7.7.1. Working with One Variable at a Time / 319 \\
                 7.7.2. Rectangular Grids / 319 \\
                 7.7.3. Irregular Triangular Grids / 322 \\
                 8: Differential Equations / 330 \\
                 8.1. Theoretical Background / 330 \\
                 8.1.1. Initial-Value Problems for Ordinary Differential
                 Equations / 330 \\
                 8.1.2. Error Propagation / 333 \\
                 8.1.3. Other Differential Equation Problems / 337 \\
                 8.2. Euler's Method, with Repeated Richardson
                 Extrapolation / 338 \\
                 8.3. Other Methods for Initial-Value Problems in
                 Ordinary Differential Equations / 342 \\
                 8.3.1. The Modified Midpoint Method / 342 \\
                 8.3.2. The Power-Series Method / 345 \\
                 8.3.3. Runge--Kutta Methods / 346 \\
                 8.3.4. Implicit Methods / 347 \\
                 8.3.5. Stiff Problems / 349 \\
                 8.3.6. Control of Step Size / 350 \\
                 8.3.7. A Finite-Difference Method for a Second-Order
                 Equation / 352 \\
                 8.4. Orientation on Boundary and Eigenvalue Problems
                 for Ordinary Differential Equations / 359 \\
                 8.4.1. Introduction / 359 \\
                 8.4.2. The Shooting Method / 359 \\
                 8.4.3. The Band Matrix Method / 361 \\
                 8.4.4. Numerical Example of an Eigenvalue Problem / 363
                 \\
                 8.5. Difference Equations / 367 \\
                 8.5.1. Homogeneous Linear Difference Equations with
                 Constant Coefficients / 368 \\
                 8.5.2. General Linear Difference Equations / 370 \\
                 8.5.3. Analysis of a Numerical Method with the Help of
                 a Test Problem / 372 \\
                 8.5.4. Linear Multistep Methods / 375 \\
                 8.6. Partial Differential Equations / 383 \\
                 8.6.1. Introduction / 383 \\
                 8.6.2. An Example of an Initial-Value Problem / 384 \\
                 8.6.3. An Example of a Boundary-Value Problem / 389 \\
                 8.6.4. Methods of Undetermined Coefficients and
                 Variational Methods / 392 \\
                 8.6.5. Finite-Element Methods / 395 \\
                 8.6.6. Integral Equations / 397 \\
                 9: Fourier Methods / 405 \\
                 9.1. Introduction / 405 \\
                 9.2. Basic Formulas and Theorems in Fourier Analysis /
                 406 \\
                 9.2.1. Functions of One Variable / 406 \\
                 9.2.2. Functions of Several Variables / 411 \\
                 9.3. Fast Fourier Analysis / 413 \\
                 9.3.1. An Important Special Case / 413 \\
                 9.3.2. Fast Fourier Analysis, General Case / 414 \\
                 9.4. Periodic Continuation of a Nonperiodic Function /
                 417 \\
                 9.5. The Fourier Integral Theorem / 419 \\
                 10: Optimization / 422 \\
                 10.1. Statement of the Problem, Definitions, and Normal
                 Form / 422 \\
                 10.2. The Simplex Method / 426 \\
                 10.3. Duality / 435 \\
                 10.4. The Transportation Problem and Some Other
                 Optimization Problems / 436 \\
                 10.5. Nonlinear Optimization Problems / 438 \\
                 10.5.1. Basic Concepts and Introductory Examples / 438
                 \\
                 10.5.2. Line Search / 440 \\
                 10.5.3. Algorithms for Unconstrained Optimization / 441
                 \\
                 10.5.4. Overdetermined Nonlinear Systems / 443 \\
                 10.5.5. Constrained Optimization / 444 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 11.1. Introduction / 448 \\
                 11.2. Random Digits and Random Numbers / 449 \\
                 11.3. Applications; Reduction of Variance / 455 \\
                 11.4. Pseudorandom Numbers / 463 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 13.1. Introduction / 536 \\
                 13.2. General Literature in Numerical Analysis / 536
                 \\
                 13.3. Tables, Collections of Formulas, and Problems /
                 539 \\
                 13.4. Error Analysis and Approximation of Functions /
                 540 \\
                 13.5. Linear Algebra and Nonlinear Systems of Equations
                 / 541 \\
                 13.6. Interpolation, Numerical Integration, and
                 Numerical Treatment of Differential Equations / 543 \\
                 13.7. Optimization; Simulation / 545 \\
                 13.8. Reviews, Abstracts and Other Periodicals / 547
                 \\
                 13.9. Survey of Published Algorithms / 548 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
}

@TechReport{Dieter:1974:URN,
  author =       "Ulrich Dieter and Joachim H. Ahrens",
  title =        "Uniform random numbers",
  type =         "Report",
  institution =  "Institut f{\"u}r Mathematische Statistik, Technische
                 Hochschule Graz",
  address =      "Graz, Austria",
  year =         "1974",
  bibdate =      "Tue Jan 10 15:38:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Eggarter:1974:CRL,
  author =       "T. P. Eggarter",
  title =        "On a complex representation of {Lorentzian} random
                 variables",
  journal =      j-J-MATH-PHYS,
  volume =       "15",
  number =       "1",
  pages =        "7--8",
  month =        jan,
  year =         "1974",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.1666507",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Fri Oct 28 16:40:08 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v15/i1/p7_s1",
  acknowledgement = ack-nhfb,
  classification = "A0540 (Fluctuation phenomena, random processes, and
                 Brownian motion); A0550 (Lattice theory and statistics;
                 Ising problems)",
  corpsource =   "Univ. Paris-Sud, Orsay, France",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "complex representation; lattice theory and statistics;
                 Lorentzian random variables; random processes; theory
                 of disordered materials",
  onlinedate =   "4 November 2003",
  pagecount =    "2",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Good:1974:RTA,
  author =       "Irving John Good",
  title =        "Random Thoughts about Randomness",
  crossref =     "Schaffner:1974:PPB",
  chapter =      "9",
  volume =       "20",
  pages =        "117--135",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/978-94-010-2140-1_9",
  ISBN =         "90-277-0408-2, 90-277-0409-0 (paperback)",
  ISBN-13 =      "978-90-277-0408-5, 978-90-277-0409-2 (paperback)",
  LCCN =         "Q175 .B7312",
  bibdate =      "Sat Jan 7 08:12:38 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bsphs.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.gbv.de:20011/gvk",
  note =         "Invited lecture in the symposium on the Concept of
                 Randomness, dedicated to the memory of L. J. Savage, in
                 the Biennial Meeting of the Philosophy of Science
                 Association, Olds Plaza Hotel, Lansing, Michigan,
                 October 27--29, 1972.",
  series =       ser-BOSTON-STUD-PHILOS-SCI,
  URL =          "https://link.springer.com/chapter/10.1007/978-94-010-2140-1_9",
  acknowledgement = ack-nhfb,
}

@InProceedings{Greenwood:1974:FGG,
  author =       "A. J. Greenwood",
  editor =       "G. Bruckman and F. Ferschl and L. Schmetterer",
  booktitle =    "{COMPSTAT}: Proceedings in Computational Statistics",
  title =        "A Fast Generator for {Gamma}-distributed Random
                 Variables",
  publisher =    "Physica-Verlag",
  address =      "Vienna, Austria",
  bookpages =    "????",
  pages =        "17--27",
  year =         "1974",
  bibdate =      "Wed Nov 12 08:56:25 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxpages =      "19--27",
}

@Article{Handelsman:1974:AEL,
  author =       "Richard A. Handelsman and John S. Lew",
  title =        "Asymptotic Expansion of {Laplace} Convolutions for
                 Large Argument and Tail Densities for Certain Sums of
                 Random Variables",
  journal =      j-SIAM-J-MATH-ANA,
  volume =       "5",
  number =       "3",
  pages =        "425--451",
  month =        may,
  year =         "1974",
  CODEN =        "SJMAAH",
  ISSN =         "0036-1410 (print), 1095-7154 (electronic)",
  ISSN-L =       "0036-1410",
  bibdate =      "Sun Nov 28 19:27:44 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SIMA/5/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjmathana.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Mathematical Analysis",
  journal-URL =  "http://epubs.siam.org/sima",
}

@Article{Harada:1974:OMS,
  author =       "N. Harada",
  title =        "Optimal multipliers for the spectral test of uniform
                 random number generators",
  journal =      "Information Processing in Japan",
  volume =       "14",
  number =       "??",
  pages =        "120--126",
  month =        "????",
  year =         "1974",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 06:57:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoffmann-Jorgensen:1974:SIB,
  author =       "J. Hoffmann-J{\o}rgensen",
  title =        "Sums of independent {Banach} space valued random
                 variables",
  journal =      j-STUDIA-MATH,
  volume =       "52",
  pages =        "159--186",
  year =         "1974",
  CODEN =        "SMATAZ",
  ISSN =         "0039-3223 (print), 1730-6337 (electronic)",
  ISSN-L =       "0039-3223",
  bibdate =      "Fri Jan 6 09:59:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Studia Mathematica",
}

@Article{Holland:1974:EGA,
  author =       "John H. Holland",
  title =        "Erratum: Genetic Algorithms and the Optimal Allocation
                 of Trials",
  journal =      j-SIAM-J-COMPUT,
  volume =       "3",
  number =       "4",
  pages =        "326--326",
  month =        "????",
  year =         "1974",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Mon Nov 29 10:58:00 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/3/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "See \cite{Holland:1973:GAO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Kadota:1974:ISS,
  author =       "T. T. Kadota",
  title =        "On the Information Stability of Stationary Ergodic
                 Processes",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "26",
  number =       "1",
  pages =        "176--182",
  month =        jan,
  year =         "1974",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); C1140
                 (Probability and statistics)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "conditional information; continuous parameter
                 stochastic processes; information density; information
                 stability; random variables; stationary ergodic
                 processes; statistical analysis; stochastic processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kedem:1974:TGL,
  author =       "Gershon Kedem and S. K. Zaremba",
  title =        "A table of good lattice points in three dimensions",
  journal =      j-NUM-MATH,
  volume =       "23",
  number =       "2",
  pages =        "175--180",
  month =        apr,
  year =         "1974",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290M (Numerical integration and differentiation);
                 C4160 (Numerical integration and differentiation)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "good lattice points; integration; numerical
                 computation; table; three dimensional lattice points;
                 three dimensions; triple integrals",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Kuipers:1974:UDS,
  author =       "Lauwerens Kuipers and Harald Niederreiter",
  title =        "Uniform distribution of sequences",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 390",
  year =         "1974",
  ISBN =         "0-471-51045-9",
  ISBN-13 =      "978-0-471-51045-1",
  LCCN =         "QA292 .K84",
  bibdate =      "Sat Nov 12 15:42:53 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Pure and applied mathematics",
  acknowledgement = ack-nhfb,
  remark =       "``A Wiley-Interscience publication.''.",
  subject =      "Sequences (Mathematics); Uniform distribution
                 (Probability theory)",
}

@Article{Lunow:1974:GRN,
  author =       "W. L{\"u}now",
  title =        "On the Generation of Random Numbers with at Choice
                 Distribution",
  journal =      j-COMPUTING,
  volume =       "13",
  number =       "1",
  pages =        "21--31",
  month =        mar,
  year =         "1974",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:52 MST 2001",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-nhfb,
  affiliation =  "Fachhochschule Weisbaden, Russelsheim, West Germany",
  classification = "922; C7890",
  description =  "random number generation; random processes",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput (Vienna/NY)",
  keywords =     "computer; cycle free sequences; generation of random
                 numbers; mathematical statistics; programming;
                 radioactive decay of nuclei; random process; specified
                 statistical distribution; theory; truly random
                 numbers",
}

@Article{Marsaglia:1974:APRa,
  author =       "George Marsaglia",
  title =        "Acknowledgement of priority to: {``Random variables
                 with independent binary digits'' (Ann. Math. Statist.
                 {\bf 42} (1971), 1922--1929)}",
  journal =      j-ANN-PROBAB,
  volume =       "2",
  number =       "4",
  pages =        "747--747",
  month =        aug,
  year =         "1974",
  CODEN =        "APBYAE",
  DOI =          "https://doi.org/10.1214/aop/1176996619",
  ISSN =         "0091-1798 (print), 2168-894X (electronic)",
  ISSN-L =       "0091-1798",
  MRclass =      "60A05",
  MRnumber =     "49 \#8070",
  bibdate =      "Sun Apr 20 10:44:17 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/annprobab1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://projecteuclid.org/euclid.aop/1176996619",
  ZMnumber =     "0284.60018",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aop",
  ZMclass =      "60E05 General theory of probability distributions
                 60F99 Limit theorems (probability)",
}

@Article{Marsaglia:1974:APRb,
  author =       "George Marsaglia",
  title =        "Acknowledgement of priority to: {``Random variables
                 with independent binary digits'' (Ann. Math. Statist.
                 {\bf 42} (1971), 1922--1929)}",
  journal =      j-ANN-STAT,
  volume =       "2",
  number =       "4",
  pages =        "848--848",
  year =         "1974",
  CODEN =        "ASTSC7",
  DOI =          "https://doi.org/10.1214/aos/1176342776",
  ISSN =         "0090-5364 (print), 2168-8966 (electronic)",
  ISSN-L =       "0090-5364",
  MRclass =      "60A10",
  MRnumber =     "50 \#1310",
  MRreviewer =   "A. Fuchs",
  bibdate =      "Fri Jan 6 09:59:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://projecteuclid.org/euclid.aos/1176342776",
  ZMnumber =     "0284.60017",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aos/",
  ZMclass =      "60E05 General theory of probability distributions
                 60F99 Limit theorems (probability)",
}

@Article{MendesFrance:1974:SNA,
  author =       "Michel {Mend{\`e}s France}",
  title =        "Suites de nombres au hasard (d'apr{\`e}s {Knuth}).
                 ({French}) [{Sequences} of random numbers (according to
                 {Knuth})]",
  journal =      "S{\'e}min Th{\'e}orie des Nombres",
  volume =       "6",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1974--1975",
  CODEN =        "????",
  ISSN =         "????",
  MRnumber =     "MR 392884",
  bibdate =      "Thu Jan 19 07:16:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0324.10048",
  acknowledgement = ack-nhfb,
  language =     "French",
  pagecount =    "11",
}

@Article{Niederreiter:1974:DPR,
  author =       "Harald Niederreiter",
  title =        "On the distribution of pseudo-random numbers generated
                 by the linear congruential method. {II}",
  journal =      j-MATH-COMPUT,
  volume =       "28",
  number =       "128",
  pages =        "1117--1132",
  month =        oct,
  year =         "1974",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database; Parallel/Multi.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2005370.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); B0290M (Numerical integration and
                 differentiation); C1110 (Algebra); C4160 (Numerical
                 integration and differentiation); C7890 (Other special
                 applications of computing)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "integration; linear congruential method; number
                 theory; pseudorandom numbers; random number
                 generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Odeh:1974:PPN,
  author =       "R. E. Odeh and J. O. Evans",
  title =        "The Percentage Points of the Normal Distribution",
  journal =      j-APPL-STAT,
  volume =       "23",
  number =       "??",
  pages =        "96--97",
  month =        "????",
  year =         "1974",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Page:1974:RAG,
  author =       "R. L. Page",
  title =        "Remark on ``{Algorithm 425}: Generation of Random
                 Correlated Normal Variables''",
  journal =      j-CACM,
  volume =       "17",
  number =       "6",
  pages =        "325--325",
  month =        jun,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 07:11:02 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Page74a;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Hurst:1972:AAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Colorado State Univ., Fort Collins, CO, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithm; array parameters; random correlated normal
                 variables; random number generation; revises; work",
  oldlabel =     "Page74a",
  treatment =    "G General Review; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Page74a",
}

@Article{Pollard:1974:TFP,
  author =       "J. Pollard",
  title =        "Theorems on factorization and primality testing",
  journal =      j-PROC-CAMBRIDGE-PHIL-SOC,
  volume =       "76",
  pages =        "521--528",
  year =         "1974",
  CODEN =        "PCPSA4",
  ISSN =         "0008-1981",
  bibdate =      "Fri Nov 20 15:54:39 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Cambridge Philosophical Society.
                 Mathematical and physical sciences",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=PSP",
  referencedin = "Referenced in \cite[Ref. 18]{Kaliski:1995:SUR}.",
}

@Article{Poole:1974:EDF,
  author =       "W. Kenneth Poole",
  title =        "Estimation of the distribution function of a
                 continuous type random variable through randomized
                 response",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "69",
  number =       "348",
  pages =        "1002--1005",
  month =        dec,
  year =         "1974",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Mon May 5 08:32:38 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2286179",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); C1140
                 (Probability and statistics)",
  corpsource =   "Statistical Methodology Dept., Res. Triangle Inst.,
                 Res. Triangle Park, NC, USA",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  keywords =     "data files; distribution function; estimation theory;
                 income distribution; random processes; random variable;
                 randomized response; sample; statistical analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rabinowitz:1974:CVM,
  author =       "M. Rabinowitz and M. L. Berenson",
  title =        "A Comparison of Various Methods of Obtaining Random
                 Order Statistics for {Monte Carlo} Computations",
  journal =      j-AMER-STAT,
  volume =       "28",
  number =       "1",
  pages =        "27--29",
  month =        feb,
  year =         "1974",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:20 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326381;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683528",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Ramberg:1974:AGG,
  author =       "John S. Ramberg and P. R. Tadikamalla",
  title =        "An algorithm for generating gamma variates based on
                 the {Weibull} distribution",
  journal =      "AIIE Transactions",
  volume =       "6",
  number =       "3",
  pages =        "257--260",
  month =        "????",
  year =         "1974",
  bibdate =      "Tue Nov 29 08:27:29 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ramberg:1974:AMG,
  author =       "John S. Ramberg and Bruce W. Schmeiser",
  title =        "An Approximate Method for Generating Asymmetric Random
                 Variables",
  journal =      j-CACM,
  volume =       "17",
  number =       "2",
  pages =        "78--82",
  month =        feb,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "48 10043",
  MRreviewer =   "J. Spanier",
  bibdate =      "Mon Jan 22 07:14:56 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#RambergS74;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Tukey's lambda distribution is generalized to provide
                 an algorithm for generating values of unimodal
                 asymmetric random variables. This algorithm has the
                 same advantages as the symmetric random variable
                 generator previously given by the authors, except that
                 the addition of another parameter complicates the
                 problem of finding the parameter values to fit a
                 distribution.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "723; 922",
  corpsource =   "Univ. Iowa, IA, USA",
  country =      "USA",
  descriptors =  "RNG; RVG",
  enum =         "2505",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "approximate method; approximations; computer
                 programming --- Subroutines; distribution; generating
                 asymmetric random variables; mathematical statistics;
                 moments; Monte Carlo; Monte Carlo methods; probability;
                 random number generation; random numbers; random
                 variables; simulation; statistics; Tukey's lambda
                 distribution; unimodal asymmetric random; variables",
  oldlabel =     "RambergS74",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RambergS74",
}

@InProceedings{Salfi:1974:LPR,
  author =       "R. Salfi",
  editor =       "Gerhart Bruckmann and Franz Ferschl and Leopold
                 Schmetterer",
  booktitle =    "{Compstat 1974: Proceedings of a Symposium on
                 Computational Statistics, University of Vienna, 1974}",
  title =        "A long-period random number generator with application
                 to permutations",
  publisher =    pub-PHYSICA-VERLAG,
  address =      pub-PHYSICA-VERLAG:adr,
  bookpages =    "539",
  pages =        "28--35",
  year =         "1974",
  MRclass =      "62-06 (65-06)",
  MRnumber =     "0345251 (49 \#9990)",
  bibdate =      "Thu Jan 19 08:15:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Santos:1974:QFS,
  author =       "Emilio Santos",
  title =        "Quantumlike formulation of stochastic problems",
  journal =      j-J-MATH-PHYS,
  volume =       "15",
  number =       "11",
  pages =        "1954--1962",
  month =        nov,
  year =         "1974",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.1666564",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Fri Oct 28 16:40:18 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v15/i11/p1954_s1",
  acknowledgement = ack-nhfb,
  classification = "A0250 (Probability theory, stochastic processes, and
                 statistics); A0365 (Quantum theory; A0540 (Fluctuation
                 phenomena, random processes, and Brownian motion);
                 quantum mechanics)",
  corpsource =   "Univ. Valladolid, Spain",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "Abelian C* algebras; algebra; Brownian motion;
                 electrodynamics; quantum theory; quantumlike
                 formulation; random variables; stochastic
                 electrodynamics; stochastic problems; stochastic
                 processes",
  onlinedate =   "4 November 2003",
  pagecount =    "9",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sato:1974:PCP,
  author =       "Masahiko Sato",
  title =        "On the periods of certain pseudorandom sequences",
  journal =      "Publ. Res. Inst. Math. Sci.",
  volume =       "10",
  number =       "1",
  pages =        "77--89",
  year =         "1974--1975",
  ISSN =         "0034-5318",
  MRclass =      "65C10",
  MRnumber =     "0381232 (52 \#2129)",
  MRreviewer =   "H. Gupta",
  bibdate =      "Thu Jan 19 08:17:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Kyoto University. Research Institute for Mathematical
                 Sciences. Publications",
}

@Article{Saunders:1974:FRV,
  author =       "Sam C. Saunders",
  title =        "A Family of Random Variables Closed Under
                 Reciprocation",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "69",
  number =       "346",
  pages =        "533--539",
  month =        jun,
  year =         "1974",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:46 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314228;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2285692",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Scherpenissea:1974:PRN,
  author =       "J. Scherpenissea",
  title =        "A pseudo random number generator",
  journal =      j-INTERFACE,
  volume =       "3",
  number =       "2",
  pages =        "187--190",
  month =        "????",
  year =         "1974",
  CODEN =        "IFCEBC",
  DOI =          "https://doi.org/10.1080/09298217408570196",
  ISSN =         "0929-8215 (print), 1744-5027 (electronic)",
  ISSN-L =       "0929-8215",
  bibdate =      "Thu Mar 15 17:07:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Interface",
  onlinedate =   "03 Jun 2008",
}

@Article{Schorr:1974:PLV,
  author =       "B. Schorr",
  title =        "Programs for the {Landau} and the {Vavilov}
                 distributions and the corresponding random numbers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "7",
  number =       "4",
  pages =        "215--224",
  month =        apr,
  year =         "1974",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(74)90091-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sun Feb 12 14:24:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465574900915",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Sobol:1974:PNC,
  author =       "I. M. Sobol'",
  title =        "Pseudorandom numbers for the construction of discrete
                 {Markov} chains by a {Monte Carlo} method",
  journal =      "{\v{Z}}. Vy{\v{c}}isl. Mat. i Mat. Fiz.",
  volume =       "14",
  pages =        "36--44, 266",
  year =         "1974",
  ISSN =         "0044-4669",
  MRclass =      "65C05",
  MRnumber =     "0339444 (49 \#4203)",
  MRreviewer =   "V. Dupac",
  bibdate =      "Thu Jan 19 08:25:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Akademija Nauk SSSR. {\v{Z}}urnal
                 Vy{\v{c}}islitel\cprime no{\u\i} Matematiki i
                 Matemati{\v{c}}esko{\u\i} Fiziki",
}

@Article{Walker:1974:FGU,
  author =       "A. J. Walker",
  title =        "Fast generation of uniformly distributed pseudorandom
                 numbers with floating-point representation",
  journal =      j-ELECT-LETTERS,
  volume =       "10",
  number =       "25--26",
  pages =        "533--534",
  day =          "12",
  month =        dec,
  year =         "1974",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19740423",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4245313",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Walker:1974:NFM,
  author =       "A. J. Walker",
  title =        "New fast method for generating discrete random numbers
                 with arbitrary frequency distributions",
  journal =      j-ELECT-LETTERS,
  volume =       "10",
  number =       "8",
  pages =        "127--128",
  day =          "18",
  month =        apr,
  year =         "1974",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19740097",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:35 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4245054",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Wallace:1974:CGG,
  author =       "N. D. Wallace",
  title =        "Computer Generation of Gamma Random Variates with
                 Non-Integral Shape Parameters",
  journal =      j-CACM,
  volume =       "17",
  number =       "12",
  pages =        "691--695",
  month =        dec,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "51 11920",
  MRreviewer =   "R. R. Coveyou",
  bibdate =      "Mon Jan 22 07:27:57 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Wallace74;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "When the shape parameter, alpha, is integral,
                 generating gamma random variables with a digital
                 computer is straightforward. There is no simple method
                 for generating gamma random variates with non-integral
                 shape parameters. A common procedure is to
                 approximately generate such random variables by the use
                 of the so-called probability switch method. Another
                 procedure, which is exact, is due to Joehnk. This paper
                 presents a rejection method for exactly generating
                 gamma random variables when alpha is greater than 1.
                 The efficiency of the rejection method is shown to be
                 better than the efficiency of M. D. Joehnk's method.
                 The paper concludes that when alpha is non-integral,
                 the following mix of procedures yields the best
                 combination of accuracy and efficiency: (1) when alpha
                 is less than 1, use Joehnk's method; (2) when 1 is less
                 than alpha and alpha is less than 5, use the rejection
                 method; (3) when alpha is greater than 5, use the
                 probability switch method.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "922",
  corpsource =   "Southern Illinois Univ., Edwardsville, IL, USA",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "8007",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "computer generation; gamma random variables;
                 probability; probability distribution; random number
                 generation; random numbers; simulation",
  location =     "SEL: Wi",
  oldlabel =     "Wallace74",
  references =   "0",
  revision =     "16/01/94",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wallace74",
}

@Article{Whittaker:1974:MGG,
  author =       "J. Whittaker",
  title =        "Miscellanea: Generating gamma and beta random
                 variables with non-integral shape parameters",
  journal =      j-APPL-STAT,
  volume =       "23",
  number =       "2",
  pages =        "210--214",
  year =         "1974",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:04 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Lancaster, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "beta distribution; gamma distribution; probability;
                 pseudo random numbers; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Akeda:1975:NTP,
  author =       "Y. Akeda and M. Hori",
  title =        "Numerical test of {Pal{\'a}sti}'s conjecture on
                 two-dimensional random packing density",
  journal =      j-NATURE,
  volume =       "254",
  number =       "5498",
  pages =        "318--319",
  day =          "27",
  month =        mar,
  year =         "1975",
  CODEN =        "NATUAS",
  DOI =          "https://doi.org/10.1038/254318a0",
  ISSN =         "0028-0836 (print), 1476-4687 (electronic)",
  ISSN-L =       "0028-0836",
  bibdate =      "Wed Feb 29 21:19:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.nature.com/nature/journal/v254/n5498/pdf/254318a0.pdf",
  abstract =     "Random packing and random space-filling problems have
                 received frequent attention. In one dimension, this
                 topic is usually called the car-parking problem.
                 Pal{\'a}sti generalised the parking problem to two
                 dimensions and conjectured that the random packing
                 density in the two-dimensional case is equal to the
                 square of that in the one-dimensional case. Here we
                 provide a thorough check on her conjecture and confirm
                 its validity.",
  acknowledgement = ack-nhfb,
  fjournal =     "Nature",
  journal-URL =  "http://www.nature.com/nature/archive/",
  keywords =     "parking-lot test; sphere packing",
}

@Article{Beuerman:1975:LDS,
  author =       "D. R. Beuerman",
  title =        "Limit distributions for sums of weighted random
                 variables",
  journal =      j-CAN-MATH-BULL,
  volume =       "18",
  number =       "??",
  pages =        "291--294",
  month =        "????",
  year =         "1975",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1975-055-7",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:04:25 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v18/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Brooker:1975:SAA,
  author =       "P. Brooker and M. J. P. Selby",
  title =        "Statistical Algorithms: {Algorithm AS 92}: The Sample
                 Size for a Distribution-Free Tolerance Interval",
  journal =      j-APPL-STAT,
  volume =       "24",
  number =       "3",
  pages =        "388--390",
  month =        sep,
  year =         "1975",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:24 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://lib.stat.cmu.edu/apstat/92",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240 (Probability and statistics); C1140 (Probability
                 and statistics); C7310 (Mathematics computing)",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "algorithm; distribution free tolerance interval;
                 FORTRAN; identically distributed random variables;
                 probability; sample size",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chaitin:1975:RMP,
  author =       "G. J. Chaitin",
  title =        "Randomness and mathematical proof",
  journal =      j-SCI-AMER,
  volume =       "232",
  number =       "??",
  pages =        "47--52",
  month =        "????",
  year =         "1975",
  CODEN =        "SCAMAC",
  ISSN =         "0036-8733 (print), 1946-7087 (electronic)",
  ISSN-L =       "0036-8733",
  bibdate =      "Fri Jan 6 10:24:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Scientific American",
  journal-URL =  "http://www.nature.com/scientificamerican",
}

@Article{Chay:1975:MUB,
  author =       "S. C. Chay and R. D. Fardo and M. Mazumdar",
  title =        "Miscellanea: On using the {Box--Muller} transformation
                 with multiplicative congruential pseudo-random number
                 generators",
  journal =      j-APPL-STAT,
  volume =       "24",
  number =       "1",
  pages =        "132--135",
  year =         "1975",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:19 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2346711.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240 (Probability and statistics); C1140 (Probability
                 and statistics)",
  corpsource =   "Westinghouse Res. Labs., Pittsburgh, PA, USA",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "analysis; Box--Muller's formula; congruential
                 pseudorandom number generators; multiplicative; random
                 normal deviates; random number generation; random
                 processes; statistical",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dieter:1975:HCS,
  author =       "Ulrich Dieter",
  title =        "How to Calculate Shortest Vectors in a Lattice",
  journal =      j-MATH-COMPUT,
  volume =       "29",
  number =       "131",
  pages =        "827--833",
  month =        jul,
  year =         "1975",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); B0290H (Linear
                 algebra); C1180 (Optimisation techniques); C4140
                 (Linear algebra)",
  corpsource =   "Inst. Math. Statistik, Tech. Hochschule Graz, Graz,
                 Austria",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "Coveyou; dual lattice; MacPherson algorithm;
                 optimisation; shortest vector calculation; vectors",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Dudewicz:1975:RNN,
  author =       "E. J. Dudewicz",
  booktitle =    "Statistical Distributions in Scientific Work",
  title =        "Random Numbers: The Need, the History, the
                 Generators",
  crossref =     "Patil:1975:MCS",
  volume =       "2",
  pages =        "??--??",
  year =         "1975",
  bibdate =      "Thu Jan 05 12:31:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reprinted in \cite{Dudewicz:1985:TMD}.",
  acknowledgement = ack-nhfb,
}

@TechReport{Fellows:1975:CGF,
  author =       "David Michael Fellows",
  title =        "Comments on ``{A general Fortran emulator for IBM
                 360\slash 370 random number generator `RANDU'}''",
  type =         "Technical report",
  number =       "6",
  institution =  "School of Computer Science, University of New
                 Brunswick",
  address =      "Fredericton, NB, Canada",
  pages =        "b + [4]",
  year =         "1975",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Bibliography: leaf 6.",
  keywords =     "Fortran (Computer program language); IBM 360
                 (Computer) --- Programming; IBM 370 (Computer) ---
                 Programming",
}

@Article{Franta:1975:NRV,
  author =       "W. R. Franta",
  title =        "A Note on Random Variate Generators and Antithetic
                 Sampling",
  journal =      j-INFOR,
  volume =       "13",
  number =       "??",
  pages =        "112--117",
  month =        "????",
  year =         "1975",
  CODEN =        "INFRCL",
  ISSN =         "0315-5986",
  bibdate =      "Thu Jan 05 17:35:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFOR",
}

@Article{Fredericsson:1975:PPB,
  author =       "S. A. Fredericsson",
  title =        "Pseudorandomness properties of binary shift register
                 sequences",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-21",
  number =       "1",
  pages =        "115--120",
  month =        jan,
  year =         "1975",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1975.1055310",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Mon Jan 16 21:54:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@Article{Frigerio:1975:RNS,
  author =       "N. A. Frigerio and N. A. Clark",
  title =        "A random number set for {Monte Carlo} computations",
  journal =      j-TRANS-AM-NUCL-SOC,
  volume =       "22",
  number =       "??",
  pages =        "283--284",
  month =        "????",
  year =         "1975",
  CODEN =        "TANSAO",
  ISSN =         "0003-018X",
  bibdate =      "Mon Jan 16 11:01:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.osti.gov/energycitations/product.biblio.jsp?osti_id=4072437",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the American Nuclear Society",
  journal-URL =  "https://www.ans.org/pubs/transactions/",
  keywords =     "true random numbers from physical sources",
}

@Article{Gibbons:1975:VIM,
  author =       "Jean D. Gibbons and John W. Pratt",
  title =        "{$P$}-Values: Interpretation and Methodology",
  journal =      j-AMER-STAT,
  volume =       "29",
  number =       "1",
  pages =        "20--25",
  month =        feb,
  year =         "1975",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:20 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326385;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683674",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Harville:1975:ERW,
  author =       "David A. Harville",
  title =        "Experimental Randomization: Who Needs It?",
  journal =      j-AMER-STAT,
  volume =       "29",
  number =       "1",
  pages =        "27--31",
  month =        feb,
  year =         "1975",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:20 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326385;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683676",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@TechReport{Kedem:1975:SGL,
  author =       "G. Kedem",
  title =        "The search for good lattice points in {$N$}
                 dimensions",
  type =         "Technical Report",
  number =       "1570",
  institution =  "Mathematics Research Center",
  address =      "Madison, WI, USA",
  year =         "1975",
  bibdate =      "Thu Jan 19 07:01:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kemperman:1975:BDM,
  author =       "J. H. B. Kemperman",
  title =        "Bounds on the discrepancy modulo $1$ of a real random
                 variable",
  journal =      j-BULL-INST-MATH-STAT,
  volume =       "4",
  number =       "??",
  pages =        "138--??",
  month =        "????",
  year =         "1975",
  CODEN =        "SMBCVA",
  ISSN =         "0146-3942",
  bibdate =      "Sat Nov 12 16:26:37 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Abstract no. 75t-47.",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin --- Institute of Mathematical Statistics",
}

@Article{Kleijnen:1975:AVC,
  author =       "Jack P. C. Kleijnen",
  title =        "Antithetic Variates, {Common Random Numbers} and
                 Optimal Computer Time Allocation in Simulation",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "21",
  number =       "10",
  pages =        "1176--1185",
  month =        jun,
  year =         "1975",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.21.10.1176",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Levin:1975:UDSa,
  author =       "M. B. Levin",
  title =        "On the uniform distribution of the sequence $ \alpha
                 \lambda $",
  journal =      "Mat. Sb. (N.S.)",
  volume =       "98",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1975",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 19 07:04:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
  xxnote =       "Check title??",
}

@Article{Levin:1975:UDSb,
  author =       "M. B. Levin",
  title =        "On the uniform distribution of the sequence $ \alpha
                 \lambda $",
  journal =      "Math. USSR-Sb.",
  volume =       "27",
  number =       "??",
  pages =        "183--197",
  month =        "????",
  year =         "1975",
  CODEN =        "????",
  ISSN =         "????",
  MRnumber =     "MR 406947",
  bibdate =      "Thu Jan 19 07:04:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0357.10020",
  acknowledgement = ack-nhfb,
  language =     "Russian",
  xxnote =       "Check title??",
}

@Article{Malcolm:1975:LVG,
  author =       "Michael A. Malcolm and R. Bruce Simpson",
  title =        "Local Versus Global Strategies for Adaptive
                 Quadrature",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "129--146",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355637.355640",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65D30",
  MRnumber =     "51 #7248",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  reviewer =     "Thomas A. Atchison",
}

@TechReport{MendesFrance:1975:SNA,
  author =       "Michel {Mend{\`e}s France}",
  title =        "Suites de nombres au hasard, d'apr{\`e}s {Knuth}.
                 ({French}) [{Sequences} of random numbers]",
  institution =  "Lab. Th{\'e}orie des Nombres, Centre Nat. Recherche
                 Sci.",
  address =      "Talence, France",
  pages =        "11",
  year =         "1975",
  MRclass =      "65C05 (10K05)",
  MRnumber =     "53 #6973",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  note =         "S{\'e}minaire de Th{\'e}orie des Nombres, 1974--1975
                 (Univ. Bordeaux I, Talence), Exp. No. 6.",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Miyatake:1975:GPR,
  author =       "O. Miyatake and H. Inoue and Y. Yoshizawa",
  title =        "Generation of physical random numbers",
  journal =      j-MATH-JAPON,
  volume =       "20",
  number =       "??",
  pages =        "207--217",
  month =        "????",
  year =         "1975",
  CODEN =        "MAJAA9",
  ISSN =         "0025-5513",
  MRnumber =     "MR 405788",
  bibdate =      "Thu Jan 19 07:20:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Japonica",
}

@Article{Monroe:1975:CIT,
  author =       "James L. Monroe",
  title =        "Correlation inequalities for two-dimensional vector
                 spin systems",
  journal =      j-J-MATH-PHYS,
  volume =       "16",
  number =       "9",
  pages =        "1809--1812",
  month =        sep,
  year =         "1975",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.522755",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Sat Oct 29 11:27:44 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1975.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v16/i9/p1809_s1",
  acknowledgement = ack-nhfb,
  classification = "A0550 (Lattice theory and statistics; Ising
                 problems)",
  corpsource =   "Dept. of Phys., Northwestern Univ., Evanston, IL,
                 USA",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "correlation inequalities; Gaussian random variables;
                 lattice spin systems; lattice theory and statistics;
                 two dimensional spins; vector spin systems",
  onlinedate =   "3 September 2008",
  pagecount =    "4",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nance:1975:IFR,
  author =       "Richard E. Nance and Claude {Overstreet, Jr.}",
  title =        "Implementation of {Fortran} Random Number Generators
                 on Computers with One's Complement Arithmetic",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "4",
  number =       "3",
  pages =        "235--243",
  month =        "????",
  year =         "1975",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657508810126",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949657508810126",
  abstract =     "Random number generators can be programmed in FORTRAN
                 using several methods on 1's complement machines. We
                 have presented several methods for the SRU 1107--1108
                 and CDC 6000 and CYBER series, the two most popular
                 that utilize 1's complement arithmetic. We believe the
                 logical mask method to be the most efficient technique
                 based on execution time on both machines. This method
                 requires only a little more than one-half the time of
                 the signed residue method on the SRU 1107--1108 and a
                 little more than two thirds the time of the unsigned
                 residue method on the CDC 6000--CYBER. A fast composite
                 generator in FORTRAN uses the logical mask method
                 combined with the FLD function to implement the table
                 approach of MacLaren and Marsaglia (1965). This
                 generator proves to be more than twice as fast as a
                 previous one for the SRU 1108, Marsaglia and Bray
                 (1968)",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Newman:1975:MIF,
  author =       "Charles M. Newman",
  title =        "Moment inequalities for ferromagnetic {Gibbs}
                 distributions",
  journal =      j-J-MATH-PHYS,
  volume =       "16",
  number =       "9",
  pages =        "1956--1959",
  month =        sep,
  year =         "1975",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.522748",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Sat Oct 29 11:27:44 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1975.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v16/i9/p1956_s1",
  acknowledgement = ack-nhfb,
  classification = "A0550 (Lattice theory and statistics; A0570C
                 (Thermodynamic functions and equations of state); Ising
                 problems)",
  corpsource =   "Dept. of Maths., Indiana Univ., Bloomington, IN, USA",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "ferromagnetic Gibbs distributions; ferromagnetic Ising
                 models; free energy; Ising model; lattice theory and
                 statistics; moment inequalities; phi/sup 4/ field
                 models; positive external field; random variable
                 theory",
  onlinedate =   "3 September 2008",
  pagecount =    "4",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niederreiter:1975:DDM,
  author =       "Harald Niederreiter and J. M. Wills",
  title =        "{Diskrepanz und Distanz von Massen bez{\"u}glich
                 konvexer und Jordanscher Mengen}. ({German})
                 [{Discrepancy} with respect to mass and distance of
                 convex and {Jordan} sets]",
  journal =      j-MATH-Z,
  volume =       "144",
  number =       "??",
  pages =        "125--134",
  month =        "????",
  year =         "1975",
  CODEN =        "MAZEAX",
  ISSN =         "0025-5874 (print), 1432-1823 (electronic)",
  ISSN-L =       "0025-5874",
  bibdate =      "Thu Jan 19 07:55:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See correction, volume 148, page 99.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematische Zeitschrift",
  journal-URL =  "http://link.springer.com/journal/209",
  language =     "French",
}

@Article{Niederreiter:1975:QVR,
  author =       "H. Niederreiter",
  title =        "Quantitative versions of a result of {Hecke} in the
                 theory of uniform distribution $ \bmod 1 $",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "28",
  number =       "??",
  pages =        "321--339",
  month =        "????",
  year =         "1975",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  MRnumber =     "MR 389778",
  bibdate =      "Thu Jan 19 07:36:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@TechReport{Pohl:1975:MFP,
  author =       "Peter Pohl",
  title =        "{MCV}: a Fast Pseudo-Random Number Generator with
                 Extremely Good Statistical Properties",
  type =         "Report",
  number =       "??",
  institution =  "The Royal Institute of Technology, Department of
                 Information Processing and Computer Science",
  address =      "Stockholm, Sweden",
  pages =        "34",
  year =         "1975",
  bibdate =      "Thu Mar 08 20:52:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Pollard:1975:MCM,
  author =       "J. M. Pollard",
  title =        "A {Monte Carlo} Method for Factorization",
  journal =      j-BIT,
  volume =       "15",
  number =       "3",
  pages =        "331--334",
  month =        sep,
  year =         "1975",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01933667",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 18:52:14 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=15&issue=3;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=15&issue=3&spage=331",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Rosenblatt:1975:MSS,
  author =       "M. Rosenblatt",
  title =        "Multiply Schemes and Shuffling",
  journal =      j-MATH-COMPUT,
  volume =       "29",
  number =       "131",
  pages =        "929--934",
  month =        jul,
  year =         "1975",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240 (Probability and statistics); C1140 (Probability
                 and statistics)",
  corpsource =   "Dept. of Math., Univ. of California, San Diego, CA,
                 USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "asymptotic frequencies; linear congruential scheme;
                 multiply schemes; pseudorandom number generators;
                 random number generation; random processes; shuffling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schaufele:1975:API,
  author =       "Ronald A. Schaufele",
  title =        "An application of pairwise independence of random
                 variables to regression analysis",
  journal =      j-CAN-MATH-BULL,
  volume =       "18",
  number =       "??",
  pages =        "397--404",
  month =        "????",
  year =         "1975",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1975-073-5",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:04:25 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v18/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Schnurmann:1975:WRT,
  author =       "H. D. Schnurmann and E. Lindbloom and R. G.
                 Carpenter",
  title =        "The Weighted Random Test-Pattern Generator",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-24",
  number =       "7",
  pages =        "695--700",
  month =        jul,
  year =         "1975",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1975.224290",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 07:57:55 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672883",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Shapiro:1975:DAR,
  author =       "Jesse M. Shapiro",
  title =        "Domains of Attraction for Reciprocals of Powers of
                 Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "29",
  number =       "4",
  pages =        "734--739",
  month =        dec,
  year =         "1975",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); C1140
                 (Probability and statistics)",
  corpsource =   "Dept. of Maths., Ben Gurion Univ. of the Negev, Beer
                 Sheva, Israel",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "Cauchy law; domain of attraction; limit distribution;
                 norming constants; positive power; probability; random
                 functions; random variable; reciprocal; sequence;
                 stable law",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stoneham:1975:NRD,
  author =       "R. G. Stoneham",
  title =        "Normal recurring decimals, normal periodic systems, $
                 (j, \epsilon) $ normality and normal numbers",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "28",
  number =       "??",
  pages =        "349--361",
  month =        "????",
  year =         "1975",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Tue Feb 07 11:15:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Tadikamalla:1975:AMG,
  author =       "Pandu R. Tadikamalla and John S. Ramberg",
  title =        "An approximate method for generating gamma and other
                 variates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "3",
  number =       "3",
  pages =        "275--282",
  year =         "1975",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657508810092",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:10:35 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Wheeler:1975:ASG,
  author =       "Donald J. Wheeler",
  title =        "An approximation for simulation of gamma
                 distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "3",
  number =       "3",
  pages =        "225--232",
  year =         "1975",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657508810088",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:10:35 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Witsenhausen:1975:SPD,
  author =       "H. S. Witsenhausen",
  title =        "On Sequences of Pairs of Dependent Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "28",
  number =       "1",
  pages =        "100--113",
  month =        jan,
  year =         "1975",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Yao:1975:ASA,
  author =       "Andrew C. Yao and Donald E. Knuth",
  title =        "Analysis of the subtractive algorithm for greatest
                 common divisors",
  journal =      j-PROC-NATL-ACAD-SCI-USA,
  volume =       "72",
  number =       "12",
  pages =        "4720--4722",
  month =        dec,
  year =         "1975",
  CODEN =        "PNASA6",
  ISSN =         "0027-8424 (print), 1091-6490 (electronic)",
  ISSN-L =       "0027-8424",
  MRclass =      "10A30 (10-04)",
  MRnumber =     "54 #5102",
  MRreviewer =   "P. J. Weinberger",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the National Academy of Sciences of the
                 United States of America",
  journal-URL =  "http://www.pnas.org/search",
}

@Article{Anderson:1976:PRR,
  author =       "G. C. Anderson and G. T. Roberts",
  title =        "Pseudo-random and random test signals",
  journal =      j-HEWLETT-PACKARD-J,
  volume =       "28",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1976",
  CODEN =        "HPJOAX",
  ISSN =         "0018-1153",
  bibdate =      "Sun May 26 08:24:22 1996",
  bibsource =    "Distributed/QLD.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  bydate =       "Le",
  byrev =        "Le",
  country =      "USA",
  date =         "15/01/88",
  descriptors =  "RNG; shift register sequences",
  enum =         "104",
  fjournal =     "Hewlett-Packard Journal: technical information from
                 the laboratories of Hewlett-Packard Company",
  location =     "PKI-OG: Li-Ord.Le",
  references =   "0",
  revision =     "21/04/91",
}

@Article{Atkinson:1976:CGB,
  author =       "A. C. Atkinson and M. C. Pearce",
  title =        "The Computer Generation of Beta, Gamma, and Normal
                 Random Variables",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "139",
  number =       "??",
  pages =        "431--448",
  month =        "????",
  year =         "1976",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Thu Jan 05 10:24:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@Article{Atkinson:1976:SAG,
  author =       "A. C. Atkinson",
  title =        "A Switching Algorithm for the Generation of Beta
                 Random Variables with at Least One Parameter Less Than
                 $1$",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "139",
  number =       "??",
  pages =        "462--467",
  month =        "????",
  year =         "1976",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Thu Jan 05 10:24:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@Article{Bays:1976:IPR,
  author =       "Carter Bays and S. D. Durham",
  title =        "Improving a Poor Random Number Generator",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "59--64",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Learmonth:1973:NPS} for a slightly
                 different, but inferior, shuffling algorithm, and
                 \cite{Bays:1990:CIR} for a comparison, both
                 mathematical, and graphical, of the two algorithms.
                 Reference [3] for IBM Report GC20-8011-0 is incorrectly
                 given year 1969; the correct year is 1959.",
  URL =          "http://doi.acm.org/10.1145/355666.355670",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Blood:1976:CPR,
  author =       "F. A. {Blood, Jr.}",
  title =        "Correlations in power residue generated random
                 numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "20",
  number =       "3",
  pages =        "372--379",
  month =        mar,
  year =         "1976",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(76)90089-9",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 09:15:20 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999176900899",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@InProceedings{Brent:1976:ABE,
  author =       "R. P. Brent",
  title =        "Analysis of the binary {Euclidean} algorithm",
  crossref =     "Traub:1976:ACR",
  pages =        "321--355",
  year =         "1976",
  bibdate =      "Thu Dec 29 06:08:17 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The complexity of the binary Euclidean algorithm for
                 the greatest common denominator is shown to be $
                 O(0.705 \lg N) $ for large $ N = \max (|u|, |v|) $. See
                 \cite{Brent:2000:TYA} for an update, and a repair to an
                 incorrect conjecture in this paper. See also
                 \cite{Brent:1999:FAB}, where the worst case complexity
                 is shown to be $ O(\lg N) $, and the number of right
                 shifts at most $ 2 \lg (N) $.",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.7959",
  acknowledgement = ack-nhfb,
}

@Article{Chamayou:1976:DAG,
  author =       "J. M. F. Chamayou",
  title =        "On a Direct Algorithm for the Generation of Log-Normal
                 Pseudo-Random Numbers",
  journal =      j-COMPUTING,
  volume =       "16",
  number =       "1--2",
  pages =        "69--76",
  month =        mar,
  year =         "1976",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:52 MST 2001",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-nhfb,
  affiliation =  "Data Handling Div., CERN, Geneva, Switzerland",
  classification = "723; 921; 922; C7890",
  description =  "random number generation",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput (Vienna/NY)",
  keywords =     "computer programming; independent uniform variables;
                 log normal variables; mathematical statistics ---
                 Random Number Generation; mathematical techniques;
                 pseudo random number generation; random variable",
}

@Article{Chambers:1976:MSS,
  author =       "J. M. Chambers and C. L. Mallows and B. W. Stuck",
  title =        "A Method for Simulating Stable Random Variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "71",
  number =       "354",
  pages =        "340--344",
  month =        jun,
  year =         "1976",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "65C10 (62E99)",
  MRnumber =     "54 \#4059",
  bibdate =      "Wed Jan 25 08:05:47 MST 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1976.bib;
                 http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314237;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See correction \cite{Chambers:1987:CMS}.",
  URL =          "http://www.jstor.org/stable/2285309",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7107",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Claustriaux:1976:GCN,
  author =       "J. J. Claustriaux",
  title =        "{G}{\'e}n{\'e}ration et contr{\^o}le de nombres
                 pseudo-al{\'e}atoires sur ordinateur {\`a} mots de 16
                 bits. ({French}). [Generation and control of
                 pseudorandom numbers on a 16-bit computer]",
  journal =      "Revue de statistique appliqu{\'e}e",
  volume =       "24",
  number =       "2",
  pages =        "75--88",
  month =        "????",
  year =         "1976",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Tue Jan 17 09:56:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://archive.numdam.org/article/RSA_1976__24_2_75_0.pdf",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@InProceedings{Enison:1976:PTB,
  author =       "R. L. Enison and H. S. Bright",
  title =        "Preliminary testing of a 64-bit
                 {Tausworthe--Lewis--Payne} generator of {Mersenne}
                 exponent degree",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "208--211",
  year =         "1976",
  bibdate =      "Mon Jan 16 21:47:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Fishman:1976:SGD,
  author =       "George S. Fishman",
  title =        "Sampling from the {Gamma}-distribution on a computer",
  journal =      j-CACM,
  volume =       "19",
  number =       "7",
  pages =        "407--409",
  month =        jul,
  year =         "1976",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "54 6449",
  MRreviewer =   "Artenio De Matteis",
  bibdate =      "Mon Jan 22 06:39:47 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Fishman76;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper describes a new technique for sampling from
                 the gamma distribution on a digital computer and
                 compares it with an alternative technique. The method
                 suggested uses the rejection technique.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240 (Probability and statistics); C1140 (Probability
                 and statistics); C7100 (Business and administration);
                 C7310 (Mathematics computing)",
  classification = "912; 922",
  corpsource =   "Univ. of North Carolina, Chapel Hill, NC, USA",
  country =      "USA",
  descriptors =  "RNG; simulation",
  enum =         "951",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "gamma distribution; gamma variates; operations
                 research; probability; probability --- Random
                 Processes; rejection technique; sampling; shape
                 parameter; Wallace's method",
  oldlabel =     "Fishman76",
  references =   "0",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fishman76",
}

@Article{Fishman:1976:SPD,
  author =       "G. S. Fishman",
  title =        "Sampling from the {Poisson} distribution on a
                 computer",
  journal =      j-COMPUTING,
  volume =       "17",
  number =       "2",
  pages =        "147--156",
  month =        jun,
  year =         "1976",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:52 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date)",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of North Carolina, Chapel Hill, NC, USA",
  classification = "C1140; C7310",
  description =  "statistical analysis",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "computer; conventional search; inverse transform;
                 Poisson distribution; sampling",
}

@Article{Fishman:1976:STR,
  author =       "George S. Fishman",
  title =        "Some Test Results on the {Simscript II.5} and
                 {SIMPL/1} Pseudorandom Number Generators",
  journal =      j-SIMULETTER,
  volume =       "8",
  number =       "1",
  pages =        "79--84",
  month =        oct,
  year =         "1976",
  CODEN =        "SIMUD5",
  ISSN =         "0163-6103",
  bibdate =      "Thu Jan 12 12:28:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.or.unc.edu/research/temp/tech70b.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Simuletter",
}

@InProceedings{Friday:1976:SGN,
  author =       "Dennis S. Friday and G. P. Patil and M. T. Boswell",
  title =        "A study of the generation of non-uniform random
                 numbers on a computer",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "191--196",
  year =         "1976",
  bibdate =      "Thu Mar 08 20:54:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Fuller:1976:PPR,
  author =       "A. T. Fuller",
  title =        "The period of pseudo-random numbers generated by
                 {Lehmer}'s congruential method",
  journal =      j-COMP-J,
  volume =       "19",
  number =       "2",
  pages =        "173--177",
  month =        may,
  year =         "1976",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/19.2.173",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Mar 25 13:51:56 MST 1997",
  bibsource =    "Compendex database;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/;
                 https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/tiff/173.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/tiff/174.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/tiff/175.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/tiff/176.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_02/tiff/177.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "922",
  corpsource =   "Dept. of Engng., Univ. of Cambridge, Cambridge, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "Lehmer's congruential method; mathematical statistics;
                 numbers; period; pseudorandom; random number
                 generation; sequence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Glaser:1976:RGM,
  author =       "Ronald E. Glaser",
  title =        "The Ratio of the Geometric Mean to the Arithmetic Mean
                 for a Random Sample from a Gamma Distribution",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "71",
  number =       "354",
  pages =        "480--487",
  month =        jun,
  year =         "1976",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:47 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314237;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2285338",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Golder:1976:BMM,
  author =       "E. R. Golder and J. G. Settle",
  title =        "The {Box--Muller} method for generating pseudo-random
                 normal deviates",
  journal =      j-APPL-STAT,
  volume =       "25",
  number =       "1",
  pages =        "12--20",
  year =         "1976",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:37 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240G (Monte Carlo methods); C1140G (Monte Carlo
                 methods)",
  corpsource =   "Univ. of Liverpool, Liverpool, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "Box Muller transformation; Monte Carlo methods; Monte
                 Carlo simulation; pseudo random normal deviates; random
                 number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Golder:1976:SAA,
  author =       "E. R. Golder",
  title =        "Statistical Algorithms: {Algorithm AS 98}: The
                 Spectral Test for the Evaluation of Congruential
                 Pseudo-Random Generators",
  journal =      j-APPL-STAT,
  volume =       "25",
  number =       "2",
  pages =        "173--180",
  month =        jun,
  year =         "1976",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:40 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See remark \cite{Golder:1976:SAR,Hoaglin:1978:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/98;
                 http://www.jstor.org/stable/pdfplus/2346691.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C7890 (Other special
                 applications of computing)",
  corpsource =   "Dept. of Computational and Statistical Sci., Univ. of
                 Liverpool, Liverpool, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "algorithm; congruential pseudo random; generators;
                 random number generation; spectral test; statistical
                 analysis; subroutines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Golder:1976:SAR,
  author =       "E. R. Golder",
  title =        "Statistical Algorithms: {Remark AS R18}: The Spectral
                 Test for the Evaluation of Congruential Pseudo-Random
                 Generators",
  journal =      j-APPL-STAT,
  volume =       "25",
  number =       "3",
  pages =        "324--324",
  year =         "1976",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:42 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Golder:1976:SAA,Hoaglin:1978:SAR}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2347260.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@InProceedings{Greenwood:1976:DTC,
  author =       "J. A. Greenwood",
  title =        "The demands of trivial combinatorial problems on
                 random number generators",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "222--227",
  year =         "1976",
  bibdate =      "Mon Jan 16 21:48:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Greenwood:1976:FMI,
  author =       "J. A. Greenwood",
  editor =       "J. Gordesch and P. Naeve",
  booktitle =    "{Compstat 1976: Proceedings in Computational
                 Statistics}",
  title =        "A fast machine-independent long-period generator for
                 31-bit pseudorandom integers",
  publisher =    pub-PHYSICA-VERLAG,
  address =      pub-PHYSICA-VERLAG:adr,
  pages =        "30--37",
  year =         "1976",
  bibdate =      "Thu Jan 19 06:52:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Greenwood:1976:MTG,
  author =       "J. Arthur Greenwood",
  title =        "Moments of the time to generate random variables by
                 rejection",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "28",
  number =       "3",
  pages =        "399--401",
  month =        "????",
  year =         "1976",
  CODEN =        "AISXAD",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  MRclass =      "65C10",
  MRnumber =     "0433805 (55 \#6776)",
  MRreviewer =   "Artenio De Matteis",
  bibdate =      "Fri Mar 09 17:35:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Ann. Inst. Statist. Math.",
  fjournal =     "Annals of the Institute of Statistical Mathematics
                 (Tokyo)",
  journal-URL =  "http://link.springer.com/journal/10463",
  keywords =     "random variate generation",
}

@InProceedings{Guerra:1976:RNG,
  author =       "V. O. Guerra and R. A. Tapia and J. R. Thompson",
  title =        "A random number generator for continuous random
                 variables based on an interpolation procedure of
                 {Akima}",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "228--230",
  year =         "1976",
  bibdate =      "Fri Mar 09 17:38:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "random variate generation",
}

@Article{Heikes:1976:UCR,
  author =       "Russell G. Heikes and Douglas C. Montgomery and Ronald
                 L. Rardin",
  title =        "Using {Common Random Numbers} in Simulation
                 Experiments --- an Approach to Statistical Analysis",
  journal =      j-SIMULATION,
  volume =       "25",
  number =       "3",
  pages =        "81--85",
  month =        sep,
  year =         "1976",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754977602700301",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/27/3/81",
  abstract =     "A widely applied method of experimental design in
                 stochastic simulation is to use the same
                 pseudorandom-number stream for each of the systems or
                 alternatives to be compared. If there are only two
                 alternatives, there is a well-known simple method of
                 statistical analysis. This paper presents Graybill's
                 extension of that analysis technique to the case of
                 several systems or alternatives and points out its
                 applicability in the simulation environment. The
                 technique is illustrated using a stochastic simulation
                 model of a small inventory system. An empirical
                 comparison with other methods of design and analysis is
                 included.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
  keywords =     "Common Random Numbers (CRN)",
}

@TechReport{Hoaglin:1976:TPC,
  author =       "D. Hoaglin",
  title =        "Theoretical properties of congruential random-number
                 generators: an empirical view",
  type =         "Memorandum",
  number =       "NS-340",
  institution =  "Department of Statistics, Harvard University",
  address =      "Cambridge, MA, USA",
  year =         "1976",
  bibdate =      "Thu Dec 29 11:17:16 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kinderman:1976:CGN,
  author =       "A. J. Kinderman and J. G. Ramage",
  title =        "Computer Generation of Normal Random Variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "71",
  number =       "356",
  pages =        "893--896",
  month =        dec,
  year =         "1976",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:47 MST 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1976.bib;
                 http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314239;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See corrections
                 \cite{Kinderman:1990:CCG,Tirler:2004:EKR}.",
  URL =          "http://www.jstor.org/stable/2286857",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7501",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@InProceedings{Kinderman:1976:GRV,
  author =       "A. J. Kinderman and J. F. Monahan",
  title =        "Generating random variables from the ratio of two
                 uniform variates",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "197--199",
  year =         "1976",
  bibdate =      "Fri Mar 09 17:44:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Klauder:1976:CGR,
  author =       "John R. Klauder",
  title =        "A characteristic glimpse of the renormalization
                 group",
  journal =      j-J-MATH-PHYS,
  volume =       "17",
  number =       "5",
  pages =        "826--830",
  month =        may,
  year =         "1976",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.522980",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Sat Oct 29 11:27:53 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1975.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v17/i5/p826_s1",
  acknowledgement = ack-nhfb,
  classification = "A0210 (Algebra, set theory, and graph theory); A0220
                 (Group theory)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "characteristic function; Euclidean field theory;
                 generalised real random variable; group theory;
                 probability measure; renormalization group; statistical
                 mechanics",
  onlinedate =   "28 August 2008",
  pagecount =    "5",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{Knuth:1976:CNR,
  author =       "Donald E. Knuth and Andrew C. Yao",
  title =        "The complexity of nonuniform random number
                 generation",
  crossref =     "Traub:1976:ACR",
  pages =        "357--428",
  year =         "1976",
  MRclass =      "65C10 (68A20)",
  MRnumber =     "55 #4598",
  MRreviewer =   "George Marsaglia",
  bibdate =      "Sat Aug 13 10:04:24 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Russian translation by B. B. Pokhodze{\u\i} in {\sl
                 Kiberneticheski{\u\i} Sbornik\/ \bf 19} (1983),
                 97--158.",
  acknowledgement = ack-nhfb,
}

@Article{Kounias:1976:BLB,
  author =       "Stratis Kounias and Jacqueline Marin",
  title =        "Best Linear {Bonferroni} Bounds",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "30",
  number =       "2",
  pages =        "307--323",
  month =        mar,
  year =         "1976",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "B0240 (Probability and statistics); B0260
                 (Optimisation techniques); C1140 (Probability and
                 statistics); C1180 (Optimisation techniques)",
  corpsource =   "Dept. of Math., McGill Univ., Montreal, Que., Canada",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "best linear Bonferroni bounds; indicator random
                 variables; linear programming; probability; probability
                 space; random processes; statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kuo:1976:SRI,
  author =       "C. T. K. Kuo and T. W. Cadman and R. J. Arsenault",
  title =        "Sequential random integer generator",
  journal =      j-COMP-PHYS-COMM,
  volume =       "12",
  number =       "2",
  pages =        "163--171",
  month =        nov,
  year =         "1976",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(76)90065-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 06:01:21 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465576900655",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  remark =       "From the introduction: ``The purpose of the present
                 program is to generate a subset of ordered,
                 non-repeating random integers from a larger set of
                 sequentially increasing, non-repeating integers. The
                 algorithm used minimizes both the computing time and
                 the fast memory space needed to accomplish this task.''
                 The algorithm is machine-dependent, requires an
                 initially-sorted larger list of random numbers, and is
                 inferior to the general solution given in
                 \cite{Bentley:1980:GSL}. However, the article does
                 describe physics applications of such sorted random
                 lists.",
}

@InProceedings{Learmonth:1976:ETM,
  author =       "G. P. Learmonth",
  title =        "Empirical tests of multipliers for the prime-modulus
                 random number generator {$ X(I + 1) = A X(I) \bmod
                 2^{31} 1 $}",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "178--183",
  year =         "1976",
  bibdate =      "Mon Jan 16 21:50:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Levin:1976:UTR,
  author =       "L. A. Levin",
  title =        "Uniform tests of randomness",
  journal =      j-SOV-MATH-PROVIDENCE,
  volume =       "17",
  number =       "??",
  pages =        "337--340",
  month =        "????",
  year =         "1976",
  CODEN =        "SVMDA8",
  ISSN =         "0038-5573",
  bibdate =      "Mon Jan 16 21:51:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Soviet Mathematics",
}

@Article{Lewis:1976:SAN,
  author =       "P. A. W. Lewis and G. S. Shedler",
  title =        "Statistical Analysis of Non-Stationary Series of
                 Events in a Data Base System",
  journal =      j-IBM-JRD,
  volume =       "20",
  number =       "5",
  pages =        "465--482",
  month =        sep,
  year =         "1976",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  MRclass =      "68A50",
  MRnumber =     "56 \#1662",
  bibdate =      "Tue Mar 25 14:26:59 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper describes methods, both old and new, for
                 the statistical analysis of non-stationary univariate
                 stochastic point processes and sequences of positive
                 random variables. Such processes are frequently
                 encountered in computer systems. As an illustration of
                 the methodology an analysis is given of the stochastic
                 point process of transactions initiated in a running
                 data base system. On the basis of the statistical
                 analysis, a non-homogeneous Poisson process model for
                 the transaction initiation process is postulated for
                 periods of high system activity and found to be an
                 adequate characterization of the data.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1140Z (Other topics in statistics); C6120 (File
                 organisation); C6150G (Diagnostic, testing, debugging
                 and evaluating systems)",
  classification = "723; 922",
  corpsource =   "Naval Postgraduate School, Monterey, CA, USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  journalabr =   "IBM J Res Dev",
  keywords =     "analysis; clustering; data base subsystem models; data
                 base systems; database management systems; methodology;
                 nonstationary series; performance evaluation;
                 probability --- Random Processes; process; program
                 testing; statistical; statistical analysis; stochastic
                 processes; transaction initiation; workload",
  reviewer =     "E. C. Posner",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Locks:1976:EAV,
  author =       "M. O. Locks",
  title =        "Error analysis of various methods for generating beta
                 and gamma variates",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "184--188",
  year =         "1976",
  bibdate =      "Fri Mar 09 17:45:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "random number generation",
}

@Article{Lyness:1976:CNA,
  author =       "J. N. Lyness and J. J. Kaganove",
  title =        "Comments on the Nature of Automatic Quadrature
                 Routines",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "65--81",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355666.355671",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65D30",
  MRnumber =     "53 #1921",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  reviewer =     "Henning Esser",
}

@Article{Margolin:1976:TKS,
  author =       "Barry H. Margolin and Willi Maurer",
  title =        "Tests of the {Kolmogorov--Smirnov} Type for
                 Exponential Data with Unknown Scale, and Related
                 Problems",
  journal =      j-BIOMETRIKA,
  volume =       "63",
  number =       "1",
  pages =        "149--160",
  month =        apr,
  year =         "1976",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.2307/2335096",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "62G10",
  MRnumber =     "0403062 (53 \#6875)",
  MRreviewer =   "M. Knott",
  bibdate =      "Sat Jun 21 14:34:05 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315482;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2335096",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Marsaglia:1976:IFM,
  author =       "G. Marsaglia and K. Ananthanarayanan and N. J. Paul",
  title =        "Improvements on Fast Methods for Generating Normal
                 Random Variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "5",
  number =       "2",
  pages =        "27--30",
  month =        jun,
  year =         "1976",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65C10",
  MRnumber =     "55 \#11560",
  MRreviewer =   "I. Vaduva",
  bibdate =      "Tue Nov 17 10:49:43 MST 1998",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/ipl/ipl5.html#MarsagliaAP76;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0332.65003",
  acknowledgement = ack-nhfb,
  classification = "922; B0240G (Monte Carlo methods); C1140G (Monte
                 Carlo methods); C7890 (Other special applications of
                 computing)",
  corpsource =   "School of Computer Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "mathematical programming; mathematical statistics;
                 Monte Carlo; Monte Carlo methods; normal random
                 variables; random number generation; random numbers;
                 rectangle tooth tail method; simulation",
  oldlabel =     "MarsagliaAP76",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ipl/MarsagliaAP76",
  ZMclass =      "65C10 Random number generation 65C05 Monte Carlo
                 methods",
}

@InCollection{Marsaglia:1976:RNG,
  author =       "George Marsaglia",
  title =        "Random number generation",
  crossref =     "Ralston:1976:ECS",
  pages =        "1192--1197",
  year =         "1976",
  bibdate =      "Mon Aug 02 16:34:17 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{McArdle:1976:ETM,
  author =       "J. McArdle",
  title =        "Empirical tests of multivariate generators",
  crossref =     "Hoaglin:1976:PNI",
  pages =        "263--267",
  year =         "1976",
  bibdate =      "Mon Jan 16 21:52:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Michael:1976:GRV,
  author =       "John R. Michael and William R. Schucany and Roy W.
                 Haas",
  title =        "Generating Random Variates Using Transformations with
                 Multiple Roots",
  journal =      j-AMER-STAT,
  volume =       "30",
  number =       "2",
  pages =        "88--90",
  month =        may,
  year =         "1976",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:21 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326390;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683801",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Miklich:1976:HSN,
  author =       "Donald R. Miklich and David J. Austin",
  title =        "A high-speed normal random number generator using
                 table look-up",
  journal =      j-BEHAV-RES-METH-INSTR,
  volume =       "8",
  number =       "4",
  pages =        "405--405",
  month =        jul,
  year =         "1976",
  CODEN =        "BRMIAC",
  DOI =          "https://doi.org/10.3758/BF03201812",
  ISSN =         "0005-7878",
  bibdate =      "Thu Mar 08 20:56:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods and Instrumentation",
  remark =       "The authors use lookup without interpolation in a
                 table of 4096 previously-computed normally-distributed
                 numbers, with the table index chosen by a simple MCG.",
}

@MastersThesis{Mitchell:1976:EAD,
  author =       "James Melvin Mitchell",
  title =        "Encryption algorithm for data security based on a
                 polyalphabetic substitution scheme and a pseudo-random
                 number generator",
  type =         "Thesis ({M.S.})",
  school =       "University of Tennessee, Knoxville",
  address =      "Knoxville, TN, USA",
  pages =        "v + 83",
  year =         "1976",
  bibdate =      "Mon Oct 19 08:47:56 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Neuman:1976:APC,
  author =       "F. Neuman and R. B. Merrick",
  title =        "Autocorrelation Peaks in Congruential Pseudorandom
                 Number Generators",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-25",
  number =       "5",
  pages =        "457--460",
  month =        may,
  year =         "1976",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1976.1674632",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 06:24:51 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674632",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Neuman:1976:AST,
  author =       "F. Neuman and C. F. Martin",
  title =        "The Autocorrelation Structure of {Tausworthe}
                 Pseudorandom Number Generators",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-25",
  number =       "5",
  pages =        "460--464",
  month =        may,
  year =         "1976",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1976.1674633",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 06:24:51 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674633",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Niederreiter:1976:CSL,
  author =       "Harald Niederreiter",
  title =        "On the cycle structure of linear recurring sequences",
  journal =      j-MATH-SCAND,
  volume =       "38",
  number =       "??",
  pages =        "53--77",
  month =        "????",
  year =         "1976",
  CODEN =        "MTSCAN",
  ISSN =         "0025-5521 (print), 1903-1807 (electronic)",
  ISSN-L =       "0025-5521",
  MRnumber =     "MR 406918",
  bibdate =      "Thu Jan 19 07:41:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Scandinavica",
  journal-URL =  "http://www.mscand.dk/issue/archive",
}

@Article{Niederreiter:1976:DPR,
  author =       "Harald Niederreiter",
  title =        "On the distribution of pseudo-random numbers generated
                 by the linear congruential method. {III}",
  journal =      j-MATH-COMPUT,
  volume =       "30",
  number =       "135",
  pages =        "571--597",
  month =        jul,
  year =         "1976",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database; Parallel/Multi.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2005328.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra); C5230 (Digital
                 arithmetic methods)",
  corpsource =   "School of Math., Inst. for Advanced Study, Princeton,
                 NJ, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "congruential generator; discrepancy estimates;
                 distribution; linear; linear congruential method;
                 maximal period sequences; number theory; pseudo random
                 numbers; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niederreiter:1976:SIL,
  author =       "Harald Niederreiter",
  title =        "Statistical independence of linear congruential
                 pseudo-random numbers",
  journal =      j-BULL-AMS,
  volume =       "82",
  number =       "6",
  pages =        "927--929",
  month =        nov,
  year =         "1976",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  MRclass =      "10K05 (65C10)",
  MRnumber =     "0419395 (54 \#7416)",
  MRreviewer =   "Gutti J. Babu",
  bibdate =      "Thu Dec 29 11:25:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.bams/1183538356",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
}

@Article{Niederreiter:1976:SNE,
  author =       "Harald Niederreiter",
  title =        "Some new exponential sums with applications to
                 pseudo-random numbers",
  journal =      j-COLLOQ-MATH-BOLYAI,
  volume =       "13",
  number =       "??",
  pages =        "209--232",
  month =        "????",
  year =         "1976",
  ISSN =         "0139-3383",
  MRnumber =     "MR 447141",
  bibdate =      "Thu Jan 19 07:38:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "",
  acknowledgement = ack-nhfb,
  fjournal =     "Colloquia Mathematica Societatis J{\'a}nos Bolyai",
  remark =       "Conference proceedings: Topics in Number Theory
                 (Debrecen, 1974). Published by North-Holland,
                 Amsterdam, The Netherlands.",
}

@Article{Pohl:1976:DMP,
  author =       "Peter Pohl",
  title =        "Description of {MCV}, a pseudo-random number
                 generator",
  journal =      j-SCAND-ACTUAR-J,
  volume =       "1976",
  number =       "1",
  pages =        "1--14",
  month =        "????",
  year =         "1976",
  CODEN =        "SAJODI",
  DOI =          "https://doi.org/10.1080/03461238.1976.10405931",
  ISSN =         "0346-1238 (print), 1651-2030 (electronic)",
  ISSN-L =       "0346-1238",
  bibdate =      "Thu Mar 15 17:14:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Scandinavian Actuarial Journal",
  onlinedate =   "22 Dec 2011",
}

@Article{Rouault:1976:PAE,
  author =       "Alain Rouault",
  title =        "Propri{\'e}t{\'e}s asymptotiques d'un
                 {$n$}-{\'e}chantillon d'une variable al{\'e}atoire
                 d{\'e}nombrable connues sous le nom de lois de {Zipf}.
                 ({French}) [Asymptotic properties of an $n$-sample of a
                 denumerable random variable known under the name of
                 {Zipf}'s law]",
  journal =      j-C-R-ACAD-SCI-PARIS-SER-AB,
  volume =       "283",
  number =       "6",
  pages =        "Aiv, A379--A380",
  year =         "1976",
  CODEN =        "CHASAP",
  ISSN =         "0151-0509",
  MRclass =      "62E20",
  MRnumber =     "0423644 (54 \#11619)",
  bibdate =      "Sat Nov 12 09:13:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Comptes Rendus Hebdomadaires des S{\'e}ances de
                 l'Acad{\'e}mie des Sciences. S{\'e}ries A et B",
  language =     "French",
}

@Article{Rudolph:1976:RNG,
  author =       "E. Rudolph and D. M. Hawkins",
  title =        "Random Number Generators in Cyclic Queuing
                 Applications",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "5",
  number =       "1",
  pages =        "65--71",
  month =        jan,
  year =         "1976",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657608810139",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Nine multiplicative congruential, shift register and
                 composite random number generators are empirically
                 compared on an IBM 360/65 computer. The basis for the
                 comparison is the simulation of a Markov process which
                 can also be analytically described. Any deviation of
                 the simulation results from the theoretical indicates a
                 non-random behaviour of the generator. The results,
                 including the relative speeds of the generators, are
                 presented and discussed",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Sobol:1976:UDS,
  author =       "I. M. Sobol'",
  title =        "Uniformly distributed sequences with an additional
                 uniform property",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "16",
  number =       "5",
  pages =        "236--242",
  month =        "????",
  year =         "1976",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(76)90154-3",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Feb 20 15:57:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0041555376901543",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@Article{vanDooren:1976:AAN,
  author =       "Paul van Dooren and Luc de Ridder",
  title =        "An adaptive algorithm for numerical integration over
                 an $n$-dimensional cube",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "2",
  number =       "3",
  pages =        "207--217",
  month =        sep,
  year =         "1976",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0771-050X(76)90005-X",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Jan 16 11:26:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0771050X7690005X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "Monte Carlo quadrature",
}

@Article{Wallace:1976:TRG,
  author =       "C. S. Wallace",
  title =        "Transformed Rejection Generators for Gamma and Normal
                 Pseudo-Random Variables",
  journal =      j-AUSTRALIAN-COMP-J,
  volume =       "8",
  number =       "3",
  pages =        "103--105",
  month =        "????",
  year =         "1976",
  CODEN =        "ACMJB2",
  ISSN =         "0004-8917",
  bibdate =      "Fri Mar 09 17:54:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A combination of the transformation and rejection
                 techniques for the generation of pseudo-random variates
                 from specified distributions is presented. The method
                 extends the rejection technique to cover distributions
                 of infinite range and/or infinite density at some point
                 in the range. Algorithms using the method are devised
                 for the Normal distribution and for the Gamma
                 distribution with shape parameter less than one. The
                 first algorithm is competitive with others published,
                 and the second superior to previous algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Computer Journal",
  keywords =     "Gamma distribution; Gaussian distribution; Normal
                 distribution; random number generators; simulation",
  xxtitle =      "Transformed Rejection Generators for the Gamma and
                 Normal Pseudo-Random Variables",
}

@Article{Wedderburn:1976:SAR,
  author =       "R. W. M. Wedderburn",
  title =        "Statistical Algorithms: {Remark AS R16}: a Remark on
                 {Algorithm AS 29}: {``The Runs Up and Down Test''}",
  journal =      j-APPL-STAT,
  volume =       "25",
  number =       "2",
  pages =        "193--193",
  year =         "1976",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:40 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Downham:1970:SAA}.",
  URL =          "http://lib.stat.cmu.edu/apstat/29",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Williams:1976:PRS,
  author =       "F. J. Williams and N. J. A. Sloane",
  title =        "Pseudo-random sequences and arrays",
  journal =      j-PROC-IEEE,
  volume =       "64",
  number =       "12",
  pages =        "1715--1727",
  year =         "1976",
  CODEN =        "IEEPAD",
  DOI =          "https://doi.org/10.1109/PROC.1976.10411",
  ISSN =         "0018-9219 (print), 1558-2256 (electronic)",
  ISSN-L =       "0018-9219",
  bibdate =      "Fri Mar 09 17:47:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the IEEE",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
}

@Article{Witsenhausen:1976:VBC,
  author =       "H. S. Witsenhausen",
  title =        "Values and Bounds for the Common Information of Two
                 Discrete Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "31",
  number =       "2",
  pages =        "313--333",
  month =        sep,
  year =         "1976",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "B6110 (Information theory); C1260 (Information
                 theory)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "common information; discrete random variables;
                 information theory; joint distributions; L shaped
                 distributions; lower bound; reduced bounds; zero
                 trace",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zakharov:1976:ECS,
  author =       "V. V. Zakharov and V. I. Smirnova",
  title =        "Experimental comparison of some pseudorandom
                 sequences",
  journal =      "Problems of Random Search, Zinatne, Riga",
  volume =       "5",
  number =       "??",
  pages =        "185--190",
  month =        "????",
  year =         "1976",
  bibdate =      "Mon Feb 27 17:17:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Zucker:1976:TMT,
  author =       "Steven W. Zucker",
  title =        "Toward a Model of Texture",
  journal =      j-CGIP,
  volume =       "5",
  number =       "2",
  pages =        "190--202",
  month =        jun,
  year =         "1976",
  CODEN =        "CGIPBG",
  ISSN =         "0146-664x (print), 1557-9697 (electronic)",
  ISSN-L =       "0146-664X",
  bibdate =      "Fri Feb 7 08:07:49 MST 1997",
  bibsource =    "Compendex database; Graphics/imager/imager.76.bib;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 Misc/misc.1.bib",
  note =         "ZUCKER76a",
  abstract =     "This paper develops aspects of a model of texture. The
                 notion of a primitive is defined, from which
                 unobservable, highly regular ideal textures are
                 generated. By examining this construction process,
                 various consequences of adopting a local approach to
                 texture are realised. Transformations are defined from
                 the graph representation of ideal textures onto the
                 representation of observable textures. Through this
                 transformational stage, the statistical approach to
                 texture is shown to be a generalisation of the
                 structural approach in the same way that random
                 variables are a generalisation of deterministic
                 variables.",
  acknowledgement = ack-nhfb,
  classification = "723; 921",
  fjournal =     "Computer Graphics and Image Processing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0146664X",
  journalabr =   "Comput Graphics Image Process",
  keywords =     "image processing --- Mathematical Models; pattern
                 recognition systems; realism, texture, surface
                 texture",
}

@TechReport{Ahrens:1977:URN,
  author =       "J. H. Ahrens and U. Dieter",
  title =        "Uniform Random Numbers",
  type =         "Technical Report",
  number =       "??",
  institution =  "University of Graz",
  address =      "Graz, Austria",
  month =        "????",
  year =         "1977",
  bibdate =      "Wed Nov 12 15:39:21 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Akchurin:1977:RNG,
  author =       "R. M. Akchurin",
  title =        "A random number generator",
  journal =      j-PROG-COMP-SOFT,
  volume =       "3",
  number =       "??",
  pages =        "392--395",
  month =        "????",
  year =         "1977",
  CODEN =        "PCSODA",
  ISSN =         "0361-7688 (print), 1608-3261 (electronic)",
  ISSN-L =       "0361-7688",
  bibdate =      "Mon Jan 16 21:36:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Programming and Computer Software; translation of
                 Programmirovaniye (Moscow, USSR) Plenum",
  journal-URL =  "http://link.springer.com/journal/11086",
}

@Article{Amadori:1977:CDS,
  author =       "R{\"u}diger Amadori",
  title =        "Correlational defects in the standard {IBM 360} random
                 number generator and the classical ideal gas
                 correlation function",
  journal =      j-J-COMPUT-PHYS,
  volume =       "24",
  number =       "4",
  pages =        "450--454",
  month =        aug,
  year =         "1977",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(77)90033-X",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Coldwell:1974:CDS}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/002199917790033X",
  abstract =     "In a previous note [1] with the above title, Coldwell
                 demonstrated the manifestation of a defect in a special
                 random number generator and discussed methods [2] to
                 circumvent this defect. The purpose of this note is to
                 draw attention to other devices which may serve for the
                 same intent.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Atkinson:1977:EPA,
  author =       "A. C. Atkinson",
  title =        "An Easily Programmed Algorithm for Generating Gamma
                 Random Variables",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "140",
  number =       "2",
  pages =        "232--234",
  month =        "????",
  year =         "1977",
  CODEN =        "JSSAEF",
  DOI =          "https://doi.org/10.2307/2344879",
  ISSN =         "0035-9238",
  ISSN-L =       "0035-9238",
  bibdate =      "Sat Jan 24 11:18:14 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i315979;
                 https://www.math.utah.edu/pub/tex/bib/jrss-a-1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2344879",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@Article{Beasley:1977:SAA,
  author =       "J. D. Beasley and S. G. Springer",
  title =        "Statistical Algorithms: {Algorithm AS 111}: The
                 Percentage Points of the Normal Distribution",
  journal =      j-APPL-STAT,
  volume =       "26",
  number =       "1",
  pages =        "118--121",
  month =        mar,
  year =         "1977",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:55 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://lib.stat.cmu.edu/apstat/111",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Book{Bendat:1977:PAR,
  author =       "Julius S. Bendat",
  title =        "Principles and Applications of Random Noise Theory",
  publisher =    pub-R-E-KRIEGER,
  address =      pub-R-E-KRIEGER:adr,
  pages =        "xxi + 433",
  year =         "1977",
  ISBN =         "0-88275-556-0",
  ISBN-13 =      "978-0-88275-556-4",
  LCCN =         "TK5101 .B37 1978",
  bibdate =      "Sun Nov 30 07:48:47 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Reprint of \cite{Bendat:1958:PAR} with corrections and
                 new material.",
  subject =      "Random noise theory",
}

@Article{Bohrer:1977:SSR,
  author =       "R. Bohrer and P. B. Imrey",
  title =        "Statistics, stationarity and random number
                 generation",
  journal =      j-SIMULETTER,
  volume =       "9",
  number =       "??",
  pages =        "64--71",
  month =        "????",
  year =         "1977",
  CODEN =        "SIMUD5",
  ISSN =         "0163-6103",
  bibdate =      "Mon Jan 16 21:37:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Simuletter",
}

@Article{Camp:1977:IPN,
  author =       "W. V. Camp and T. G. Lewis",
  title =        "Implementing a Pseudorandom Number Generator on a
                 Minicomputer",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-3",
  number =       "3",
  pages =        "259--262",
  month =        may # "\slash " # jun,
  year =         "1977",
  CODEN =        "IESEDJ",
  DOI =          "https://doi.org/10.1109/TSE.1977.231135",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Thu Feb 1 08:07:37 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702434",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Cheng:1977:MGG,
  author =       "R. C. H. Cheng",
  title =        "Miscellanea: The Generation of Gamma Variables with
                 Non-Integral Shape Parameter",
  journal =      j-APPL-STAT,
  volume =       "26",
  number =       "1",
  pages =        "71--75",
  year =         "1977",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:55 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Fishman:1977:ETM,
  author =       "George S. Fishman and Louis R. Moore",
  title =        "Empirical Testing of Multiplicative Congruential
                 Generators with Modulus $ 2^{31} - 1 $",
  type =         "Technical Report",
  number =       "77-12",
  institution =  "University of North Carolina at Chapel Hill",
  address =      "Chapel Hill, NC 27514, USA",
  pages =        "iv + 15 + ii",
  month =        oct,
  year =         "1977",
  bibdate =      "Wed Nov 12 08:31:51 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a046149.pdf",
  abstract =     "This paper presents the results of empirically testing
                 8 alternative multipliers for a multiplicative
                 congruential generator with modulus $ 2^{31} - 1 $. The
                 LLRANDOM random number package [11] uses one of the
                 multipliers, the simulation programming language
                 SINSCRIPT II uses a second and the remaining six are
                 the best of $ 50 $ candidate multipliers studied by
                 Hoaglin (1976) using the theoretical spectra1 and
                 lattice tests. The battery of tests fall to detect any
                 departures from randomness for $3$ of the multipliers,
                 even at a $ 0.20$ significance level. This group
                 includes the multiplier that SIMSCRIPT II employs.
                 However, another of the $3$ superior performers, $
                 397204094$, requires only $ 78$ percent of the
                 computing time that the SIMSCRIPT II multiplier does
                 and is the second most efficient computationally of all
                 $8$ multipliers.",
  acknowledgement = ack-nhfb,
}

@Article{Gait:1977:NNP,
  author =       "J. Gait",
  title =        "A New Nonlinear Pseudorandom Number Generator",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-3",
  number =       "5",
  pages =        "359--363",
  month =        sep # "\slash " # oct,
  year =         "1977",
  CODEN =        "IESEDJ",
  DOI =          "https://doi.org/10.1109/TSE.1977.231161",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Thu Feb 1 08:07:37 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702460",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Unpublished{Garling:1977:SBS,
  author =       "D. J. H. Garling",
  title =        "Sums of {Banach} space valued random variables",
  address =      "Department of Mathematics, The Ohio State University,
                 Columbus, OH, USA",
  pages =        "107",
  year =         "1977",
  bibdate =      "Fri Jan 6 09:59:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Mimeographed lecture notes",
  acknowledgement = ack-nhfb,
}

@Article{Gideon:1977:SAE,
  author =       "Rudy A. Gideon and John Gurland",
  title =        "Some Alternative Expansions for the Distribution
                 Function of a Noncentral Chi-Square Random Variable",
  journal =      j-SIAM-J-MATH-ANA,
  volume =       "8",
  number =       "1",
  pages =        "100--110",
  month =        feb,
  year =         "1977",
  CODEN =        "SJMAAH",
  ISSN =         "0036-1410 (print), 1095-7154 (electronic)",
  ISSN-L =       "0036-1410",
  bibdate =      "Sun Nov 28 19:28:21 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SIMA/8/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjmathana.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Mathematical Analysis",
  journal-URL =  "http://epubs.siam.org/sima",
}

@Article{Jackson:1977:SGP,
  author =       "D. Jackson",
  title =        "Software generation of pseudorandom sequences",
  journal =      j-ELECTRON-ENG,
  volume =       "49",
  number =       "??",
  pages =        "55--58",
  month =        dec,
  year =         "1977",
  CODEN =        "ELEGAP",
  ISSN =         "0013-4902",
  bibdate =      "Mon Jan 16 21:40:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Engineering",
}

@Article{Kinderman:1977:CGR,
  author =       "A. J. Kinderman and J. F. Monahan",
  title =        "Computer Generation of Random Variables Using the
                 Ratio of Uniform Deviates",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "257--260",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355744.355750",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 27 22:58:34 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7496",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@InProceedings{Kurita:1977:CPC,
  author =       "Y. Kurita",
  title =        "Choosing parameters for congruential random number
                 generators",
  crossref =     "Barra:1977:RDS",
  pages =        "697--704",
  year =         "1977",
  bibdate =      "Mon Jan 16 21:41:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Landauer:1977:CCM,
  author =       "Edwin G. Landauer",
  title =        "Computer Corner: Methods of Random Number Generation",
  journal =      j-TWO-YEAR-COLL-MATH-J,
  volume =       "8",
  number =       "5",
  pages =        "296--303",
  month =        nov,
  year =         "1977",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/00494925.1977.11974532",
  ISSN =         "0049-4925 (print), 2325-9116 (electronic)",
  ISSN-L =       "0049-4925",
  bibdate =      "Thu Feb 14 09:48:41 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/collegemathj.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/3026786;
                 http://www.tandfonline.com/doi/abs/10.1080/00494925.1977.11974532",
  acknowledgement = ack-nhfb,
  fjournal =     "Two-Year College Mathematics Journal",
  journal-URL =  "https://maa.tandfonline.com/loi/ucmj20;
                 http://www.jstor.org/journals/00494925.html",
  onlinedate =   "30 Jan 2018",
}

@Article{Marsaglia:1977:SMG,
  author =       "George Marsaglia",
  title =        "The squeeze method for generating gamma variates",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "3",
  number =       "4",
  pages =        "321--325",
  year =         "1977",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(77)90089-X",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  MRclass =      "65C10",
  MRnumber =     "58 \#13613",
  bibdate =      "Mon Oct 24 11:37:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0384.65005",
  abstract =     "This paper describes an exact method for computer
                 generation of random variables with a gamma
                 distribution. The method is based on the
                 Wilson--Hilferty transformation and an improvement on
                 the rejection technique. The idea is to ``squeeze'' a
                 target density between two functions, the top one easy
                 to sample from, the bottom one easy to evaluate.",
  acknowledgement = ack-nhfb,
  citedby =      "Fullerton:1980:BEM",
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  ZMclass =      "65C10 Random number generation 60E05 General theory of
                 probability distributions",
}

@Article{Miller:1977:STD,
  author =       "A. J. Miller and A. W. Brown and P. Mars",
  title =        "A Simple Technique for the Determination of Delayed
                 Maximal Length Linear Binary Sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-26",
  number =       "8",
  pages =        "808--811",
  month =        aug,
  year =         "1977",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1977.1674919",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 11 21:56:56 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674919",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Miller:1977:TDD,
  author =       "A. J. Miller and P. Mars",
  title =        "Theory and design of a digital stochastic computer
                 random number generator",
  journal =      j-MATH-COMP-SIM,
  volume =       "19",
  number =       "??",
  pages =        "198--216",
  month =        "????",
  year =         "1977",
  CODEN =        "MCSIDR",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Mon Jan 16 21:42:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{Mitchell:1977:TLM,
  author =       "R. L. Mitchell and C. R. Stone",
  title =        "Table-Lookup Methods for Generating Arbitrary Random
                 Numbers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-26",
  number =       "10",
  pages =        "1006--1008",
  month =        oct,
  year =         "1977",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1977.1674735",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 13 10:13:04 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674735",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Mueller:1977:RNG,
  author =       "R. A. Mueller and D. D. Georg and G. R. Johnson",
  title =        "A random number generator for microprocessors",
  journal =      j-SIMULATION,
  volume =       "28",
  number =       "4",
  pages =        "123--127",
  month =        apr,
  year =         "1977",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754977702800407",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 10:40:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/28/4/123.abstract",
  abstract =     "An algorithm is presented for generating uniformly
                 distributed random deviates on microprocessors or
                 minicomputers utilizing memories with a small
                 word-length. Other alternative solutions are discussed,
                 and the statistical quality of sample streams of
                 generated numbers is evaluated and compared with the
                 quality of other widely used generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@TechReport{Musyck:1977:SPG,
  author =       "E. Musyck",
  title =        "Search for a perfect generator of random numbers",
  type =         "Working Paper",
  number =       "BLG 516",
  institution =  "Centre d'{\'E}tude de l'{\'E}nergie Nucl{\'e}aire",
  address =      "Belgium",
  year =         "1977",
  bibdate =      "Mon Jan 16 21:43:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1977:PRN,
  author =       "Harald Niederreiter",
  title =        "Pseudo-random numbers and optimal coefficients",
  journal =      j-ADV-MATH,
  volume =       "26",
  number =       "2",
  pages =        "99--181",
  month =        "????",
  year =         "1977",
  CODEN =        "ADMTA4",
  ISSN =         "0001-8708 (print), 1090-2082 (electronic)",
  ISSN-L =       "0001-8708",
  MRclass =      "10K05 (65C10)",
  MRnumber =     "0476679 (57 \#16238)",
  MRreviewer =   "M. Mendes France",
  bibdate =      "Wed Nov 12 08:26:59 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0366.65004",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances in Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00018708",
  remark =       "Cited in \cite[page 33]{Reiser:1977:AAR}",
}

@Article{Payne:1977:NRN,
  author =       "W. H. Payne",
  title =        "Normal Random Numbers: Using Machine Analysis to
                 Choose the Best Algorithm",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "346--358",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10",
  MRnumber =     "57 #1827",
  bibdate =      "Sat Aug 27 23:09:02 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/355759.355763",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7752",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  location =     "SEL: Wi",
  references =   "0",
  reviewer =     "Artenio De Matteis",
  revision =     "16/01/94",
}

@InProceedings{Peskun:1977:IAR,
  author =       "P. Peskun",
  editor =       "D. Hogben and D. Fife",
  booktitle =    "Proceedings of the 10th Annual Symposium on the
                 Interface of Computer Science and Statistics",
  title =        "Improving the apparent randomness of pseudorandom
                 numbers generated by the mixed congruential method",
  publisher =    "????",
  address =      "????",
  pages =        "323--328",
  year =         "1977",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 21:45:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Pettitt:1977:KSG,
  author =       "A. N. Pettitt and M. A. Stephens",
  title =        "The {Kolmogorov--Smirnov} Goodness-of-Fit Statistic
                 with Discrete and Grouped Data",
  journal =      j-TECHNOMETRICS,
  volume =       "19",
  number =       "??",
  pages =        "205--210",
  month =        "????",
  year =         "1977",
  CODEN =        "TCMTA2",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html;
                 http://www.tandfonline.com/loi/utch20",
}

@Article{Reeds:1977:CRN,
  author =       "James A. Reeds",
  title =        "``{Cracking}'' a Random Number Generator",
  journal =      j-CRYPTOLOGIA,
  volume =       "1",
  number =       "1",
  pages =        "20--26",
  month =        jan,
  year =         "1977",
  CODEN =        "CRYPE6",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Sat Nov 21 12:35:16 MST 1998",
  bibsource =    "http://www.dean.usma.edu/math/pubs/cryptologia/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 Theory/crypto.security.bib",
  note =         "Reprinted in \cite[pp. 509--515]{Deavours:1987:CYT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  romanvolume =  "I",
}

@TechReport{Reiser:1977:AAR,
  author =       "John Fredrick Reiser",
  title =        "Analysis of additive random number generators",
  type =         "U.S. Government Report",
  number =       "STAN-CS-77-601 (AD-A045652/5)",
  institution =  "Computer Science Department, School of Humanities and
                 Sciences, Stanford University",
  address =      "Stanford, CA, USA",
  pages =        "34",
  month =        mar,
  year =         "1977",
  bibdate =      "Mon Jan 16 21:46:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Roefs:1977:CPR,
  author =       "H. F. A. Roefs and M. B. Pursley",
  title =        "Correlation parameters of random binary sequences",
  journal =      j-ELECT-LETTERS,
  volume =       "13",
  number =       "16",
  pages =        "488--489",
  day =          "4",
  month =        aug,
  year =         "1977",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19770353",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4240473",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@TechReport{Schmeiser:1977:RMB,
  author =       "Bruce W. Schmeiser and M. A. Shalaby",
  title =        "Rejection Methods for Beta Variate Generation",
  type =         "Technical Report",
  number =       "77014",
  institution =  "Department of Operations Research and Engineering
                 Management, Southern Methodist University",
  address =      "Dallas, TX 75275, USA",
  year =         "1977",
  bibdate =      "Wed Nov 12 09:01:02 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sheil:1977:SAA,
  author =       "J. Sheil and I. O'Muircheartaigh",
  title =        "Statistical Algorithms: {Algorithm AS 106}: The
                 Distribution of Non-Negative Quadratic Forms in Normal
                 Variables",
  journal =      j-APPL-STAT,
  volume =       "26",
  number =       "1",
  pages =        "92--98",
  month =        mar,
  year =         "1977",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:21:55 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See remark \cite{Farebrother:1984:SARb}.",
  URL =          "http://lib.stat.cmu.edu/apstat/106",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@InProceedings{Shepherd:1977:TLI,
  author =       "W. L. Shepherd and J. N. Hynes",
  booktitle =    "{Proceedings of the Twenty-Second Conference on the
                 Design of Experiments in Army Research, Development,
                 and Testing: sponsored by Army Mathematics Steering
                 Committee, Host, Harry Diamond Laboratories, Adelphi,
                 Maryland, 20--22 October 1976}",
  title =        "Table look-up and interpolation for a normal random
                 number generator",
  number =       "77-2",
  publisher =    "US Army Research Office",
  address =      "Research Triangle Park, NC, USA",
  bookpages =    "xiv + 344",
  pages =        "153--164",
  year =         "1977",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Mar 08 20:57:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "ARO Report",
  acknowledgement = ack-nhfb,
}

@Article{Swick:1977:HRA,
  author =       "D. A. Swick",
  title =        "Harmonic Relationships Among Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "33",
  number =       "3",
  pages =        "490--498",
  month =        nov,
  year =         "1977",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Tashiro:1977:MGU,
  author =       "Yoshihiro Tashiro",
  title =        "On methods for generating uniform random points on the
                 surface of a sphere",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "29",
  number =       "1",
  pages =        "295--300",
  month =        "????",
  year =         "1977",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02532791",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 18:19:56 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02532791",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Vaduva:1977:CGG,
  author =       "I. V{\"a}duva",
  title =        "On computer generation of gamma random variables by
                 rejection and composition procedures",
  journal =      j-STATISTICS-BERLIN,
  volume =       "8",
  number =       "4",
  pages =        "545--576",
  year =         "1977",
  CODEN =        "MOSSD5",
  DOI =          "https://doi.org/10.1080/02331887708801401",
  ISSN =         "0323-3944",
  ISSN-L =       "0323-3944",
  bibdate =      "Wed Oct 8 11:23:12 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statistics.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics (Berlin, DDR)",
  journal-URL =  "http://www.tandfonline.com/loi/gsta19",
}

@Article{Walker:1977:EMG,
  author =       "Alastair J. Walker",
  title =        "An Efficient Method for Generating Discrete Random
                 Variables with General Distributions",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "253--256",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355744.355749",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Yuen:1977:TRN,
  author =       "Chung-Kwong Yuen",
  title =        "Testing Random Number Generators by {Walsh}
                 Transform",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-26",
  number =       "4",
  pages =        "329--333",
  month =        apr,
  year =         "1977",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1977.1674842",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 11 21:56:54 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674842",
  abstract =     "A truly random sequence of numbers has an
                 asymptotically flat Walsh power spectrum. This fact is
                 used to devise a new test for the randomness of the
                 output of random number generators. Because it takes
                 little computing time to obtain the Walsh power
                 spectrum of even very long sequences, generators with
                 large periods can be tested. Some computed examples are
                 shown.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Arvillias:1978:PPC,
  author =       "A. C. Arvillias and D. G. Maritsas",
  title =        "Partitioning the Period of a Class of $m$-Sequences
                 and Application to Pseudorandom Number Generation",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "675--686",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322092.322106",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A criterion is derived for the ``q-equipartition'' of
                 the period of m-sequences based on primitive trinomials
                 (PT's), 1 plus D**q plus D**p. It is shown that the
                 class of PT's with q equals 2**t, where t is an
                 integer, can be implemented efficiently so as to
                 produce in parallel q phase-shifted versions of the
                 same m-sequence with relative delays analytically
                 evaluated. These implementations lead to the
                 construction of efficient algorithms for the generation
                 of q-bit pseudorandom number sequences equivalent in
                 correlation performance to the Tausworthe-type
                 generators. The algorithms are of the GFSR type. The
                 advantage of utilizing the specific class of PT's is
                 that the initialization procedures is not required. The
                 corresponding linear recurrences directly yield coding
                 for the generators which deliver q-bit number sequences
                 uncorrelated over a length approximately equal to (2**p
                 minus 1)/q. It is important that three members of this
                 class, of degrees p equals 127, 175, 521, respectively,
                 are Mersenne prime.",
  acknowledgement = ack-nhfb,
  classification = "922",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical statistics",
}

@InProceedings{Best:1978:SAC,
  author =       "D. J. Best",
  editor =       "L. C. A. (Leo Caspar Antoon) Corsten and J. Hermans",
  booktitle =    "{COMPSTAT 1978: Proceedings in Computational
                 statistics: 3rd symposium held in Leiden 1978}",
  title =        "A simple algorithm for the computer generation of
                 random samples from a {Student}'s $t$ or symmetric beta
                 distribution",
  publisher =    pub-PHYSICA-VERLAG,
  address =      pub-PHYSICA-VERLAG:adr,
  bookpages =    "540",
  pages =        "341--347",
  year =         "1978",
  ISBN =         "3-7908-0196-8 (paperback)",
  ISBN-13 =      "978-3-7908-0196-5 (paperback)",
  LCCN =         "QA276.4 .C192",
  bibdate =      "Wed Feb 22 09:57:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Castanie:1978:GRB,
  author =       "F. Castanie",
  title =        "Generation of Random Bits with Accurate and
                 Reproducible Statistical Properties",
  journal =      j-PROC-IEEE,
  volume =       "66",
  number =       "7",
  pages =        "865--870",
  month =        jul,
  year =         "1978",
  CODEN =        "IEEPAD",
  ISSN =         "0018-9219 (print), 1558-2256 (electronic)",
  ISSN-L =       "0018-9219",
  bibdate =      "Thu Feb 02 17:27:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the IEEE",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
}

@Article{Cheng:1978:GBV,
  author =       "R. C. H. Cheng",
  title =        "Generating beta variates with nonintegral shape
                 parameters",
  journal =      j-CACM,
  volume =       "21",
  number =       "4",
  pages =        "317--322",
  month =        apr,
  year =         "1978",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "58 13609",
  MRreviewer =   "George Marsaglia",
  bibdate =      "Mon Jan 22 06:30:47 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Cheng78;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. of Wales Inst. of Sci. and Technol., Cardiff,
                 UK",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7128",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "beta variates; computer timings; generating; method;
                 nonintegral shape parameters; random number generation;
                 random numbers; rejection; simplicity; speed;
                 statistics",
  location =     "SEL: Wi",
  oldlabel =     "Cheng78",
  references =   "0",
  revision =     "16/01/94",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Cheng78",
}

@Article{Dagpunar:1978:SVT,
  author =       "J. S. Dagpunar",
  title =        "Sampling of variates from a truncated gamma
                 distribution",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "8",
  number =       "1",
  pages =        "59--64",
  year =         "1978",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657808810248",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:10:43 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@TechReport{DiDonato:1978:CBN,
  author =       "A. R. DiDonato and M. P. {Jarnagin, Jr.} and R. K.
                 Hageman",
  title =        "Computation of the Bivariate Normal Distribution over
                 Convex Polygons",
  type =         "Report",
  number =       "NSWC/DL-TR-3886",
  institution =  "Naval Surface Weapons Center",
  address =      "Dahlgren, VA 22448, USA",
  pages =        "v + 46 + 7",
  month =        sep,
  year =         "1978",
  bibdate =      "Wed Nov 12 09:05:32 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a069406.pdf",
  abstract =     "A procedure is given for computing the bivariate
                 normal probability over an angular region or a convex
                 polygon. The procedure is implemented into a Fortran IV
                 computer program which is designed to yield $3$, $6$,
                 or $9$ decimal digits of accuracy. Comparisons with two
                 other published methods, for the same achievable
                 accuracy, show our program to be much faster.",
  acknowledgement = ack-nhfb,
}

@Book{Fishman:1978:PDE,
  author =       "George S. Fishman",
  title =        "Principles of Discrete Event Simulation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 514",
  year =         "1978",
  ISBN =         "0-471-04395-8",
  ISBN-13 =      "978-0-471-04395-9",
  LCCN =         "T57.62 .F59",
  bibdate =      "Thu Jan 5 14:22:25 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Wiley series on systems engineering and analysis",
  acknowledgement = ack-nhfb,
  subject =      "Digital computer simulation",
}

@TechReport{Fishman:1978:SEM,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "A statistical evaluation of multiplicative
                 congruential generators with modulus $ 2^{-31} - 1 $",
  type =         "Technical report",
  number =       "78-11",
  institution =  "University of North Carolina at Chapel Hill",
  address =      "Chapel Hill, NC, USA",
  pages =        "v + 19 + 2",
  month =        dec,
  year =         "1978",
  bibdate =      "Thu Jan 12 12:21:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a063858.pdf;
                 http://www.or.unc.edu/research/temp/tech70b.html",
  abstract =     "This paper presents the results of empirically testing
                 eight alternative multipliers for a multiplicative
                 congruential generator with modulus $ 2^{31} - 1 $. The
                 LLRANDOM number package (Learmonth and Lewis,1973) uses
                 one of the multipliers, the simulation programming
                 language SIMSCRIPT II uses a second and the remaining
                 six are the best of $ 50 $ candidate multipliers
                 studied by Hoaglin (1976) using the theoretical
                 spectral and lattice tests. The battery of tests raises
                 serious doubts about three of the multipliers,
                 including the one in LLRANDOM. The power of the tests
                 is demonstrated by their rejection of RANDU, a notably
                 poor random number generator. A comparison of the
                 results for the eight multipliers with the eight worst
                 multipliers (with regard to $2$-tuples) in Hoaglin
                 (1976) failed to show any apparent gross differences.
                 Since examination of performance on the lattice test
                 revealed that the $ 16$ multipliers clustered in
                 performance when compared to RANDU, one may conjecture
                 that the poorer lattice test performance for the worst
                 eight is too subtle for detection by our empirical
                 tests. Since this failure may not be as serious as the
                 lattice test implies, one may want to revise upward the
                 criteria for acceptable performance on the lattice
                 tests and similarly on the spectral test. In section 9
                 an analysis of algorithms for generating random numbers
                 reveals that the choice of coding can significantly
                 affect execution time for different multipliers.",
  acknowledgement = ack-nhfb,
}

@TechReport{Frigerio:1978:TTR,
  author =       "N. A. Frigerio and N. Clark and S. Tyler",
  title =        "Toward Truly Random Numbers",
  type =         "Report",
  number =       "ANL/ES-26 Part 4",
  institution =  inst-ARGONNE,
  address =      inst-ARGONNE:adr,
  year =         "1978",
  bibdate =      "Mon Jan 16 11:04:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Galperin:1978:LPC,
  author =       "E. A. Galperin",
  title =        "Loop Properties and Controllability of Linear
                 Congruential Sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-27",
  number =       "1",
  pages =        "68--76",
  month =        jan,
  year =         "1978",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1978.1674954",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 11 08:13:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674954",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Garpman:1978:STP,
  author =       "S. Garpman and J. Randrup",
  title =        "Statistical tests for pseudorandom number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "15",
  number =       "1--2",
  pages =        "5--13",
  month =        sep,
  year =         "1978",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(78)90080-2",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Jan 16 21:31:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465578900802",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Gaver:1978:PNA,
  author =       "Donald P. Gaver",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments: Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "522",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Schruben:1978:PNAa}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286593.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Geller:1978:SEW,
  author =       "Nancy L. Geller",
  title =        "Some Examples of the Weak and Strong Laws of Large
                 Numbers for Averages of Mutually Independent Random
                 Variables",
  journal =      j-AMER-STAT,
  volume =       "32",
  number =       "1",
  pages =        "34--36",
  month =        feb,
  year =         "1978",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 10:52:21 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326397;
                 https://www.math.utah.edu/pub/tex/bib/amstat1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683474",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Hoaglin:1978:SAR,
  author =       "David C. Hoaglin and Max L. King",
  title =        "Statistical Algorithms: {Remark AS R24}: a Remark on
                 {Algorithm AS 98}: The Spectral Test for the Evaluation
                 of Congruential Pseudo-Random Generators",
  journal =      j-APPL-STAT,
  volume =       "27",
  number =       "3",
  pages =        "375--377",
  year =         "1978",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:17 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Golder:1976:SAA,Golder:1976:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/98;
                 http://www.jstor.org/stable/pdfplus/2347183.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Hollander:1978:TDU,
  author =       "Myles Hollander and Frank Proschan",
  title =        "Testing to Determine the Underlying Distribution Using
                 Randomly Censored Data",
  type =         "{FSU} Statistics Report",
  number =       "M458",
  institution =  "Department of Statistics, The Florida State
                 University",
  address =      "Tallahassee, FL 32306, USA",
  pages =        "18",
  month =        apr,
  year =         "1978",
  bibdate =      "Wed Nov 12 08:40:48 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Also issued as AFOSR Technical Report No. 6 and AFOSR
                 Technical Report No. 79.",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a054978.pdf",
  abstract =     "For right-censored data, we develop a goodness-of-fit
                 procedure for testing whether the underlying
                 distribution is a specified function $G$. Our test
                 statistic $C$ is the one-sample limit of Efron's (1967)
                 two-sample statistic $W$. The test based on $C$ is
                 compared with recently proposed competitors due to
                 Koziol and Green (1976) and Hyde (1977). The
                 comparisons are on the basis of (i) applicability, (ii)
                 the extent to which the censoring distribution can
                 affect the inference, and (iii) power. It is shown that
                 in certain situations the $C$ test compares favourably
                 with the tests of Koziol--Green and Hyde.",
  acknowledgement = ack-nhfb,
}

@Article{Holmlid:1978:UCP,
  author =       "Leif Holmlid and Kjell Rynefors",
  title =        "Uniformity of congruential pseudorandom number
                 generators. {Dependence} on length of number sequence
                 and resolution",
  journal =      j-J-COMPUT-PHYS,
  volume =       "26",
  number =       "3",
  pages =        "297--306",
  month =        mar,
  year =         "1978",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(78)90072-4",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999178900724",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Kemp:1978:CGB,
  author =       "C. D. Kemp and S. Loukas",
  title =        "The Computer Generation of Bivariate Discrete Random
                 Variables",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "141",
  number =       "4",
  pages =        "513--519",
  month =        "????",
  year =         "1978",
  CODEN =        "JSSAEF",
  DOI =          "https://doi.org/10.2307/2344486",
  ISSN =         "0035-9238",
  ISSN-L =       "0035-9238",
  bibdate =      "Sat Jan 24 11:18:14 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i315985;
                 https://www.math.utah.edu/pub/tex/bib/jrss-a-1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2344486",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@Article{Kiefer:1978:PNA,
  author =       "J. Kiefer",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments: Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "523--524",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Schruben:1978:PNAa}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286594.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@TechReport{Kinderman:1978:RDC,
  author =       "A. J. Kinderman and J. F. Monahen",
  title =        "Recent Developments in the Computer Generation of
                 {Student} s $t$ and Gamma Random Variables",
  type =         "Technical Report",
  number =       "AMD-799, BNL-24679",
  institution =  "Brookhaven National Laboratory",
  address =      "Long Island, NY, USA",
  pages =        "??",
  year =         "1978",
  bibdate =      "Tue Nov 29 07:08:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Li:1978:EMN,
  author =       "T-Y. Li and J. A. Yorke",
  title =        "Ergodic maps on $ [0, 1] $ and non-linear pseudorandom
                 number generators",
  journal =      j-NONLINEAR-ANAL,
  volume =       "2",
  number =       "??",
  pages =        "473--481",
  month =        "????",
  year =         "1978",
  CODEN =        "NOANDD",
  ISSN =         "0362-546X (print), 1873-5215 (electronic)",
  ISSN-L =       "0362-546X",
  bibdate =      "Mon Jan 16 21:32:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Nonlinear Analysis, Theory, Methods and Applications",
  journal-URL =  "http://www.sciencedirect.com/journal/nonlinear-analysis",
}

@Article{Mallows:1978:PNA,
  author =       "Colin L. Mallows",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments: Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "520",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Schruben:1978:PNAa}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286591.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Maritsas:1978:PSA,
  author =       "D. G. Maritsas and A. C. Arvillias and A. C. Bounas",
  title =        "Phase-Shift Analysis of Linear Feedback Shift Register
                 Structures Generating Pseudorandom Sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-27",
  number =       "7",
  pages =        "660--669",
  month =        jul,
  year =         "1978",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1978.1675166",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 11 08:13:30 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1675166",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Nance:1978:SEO,
  author =       "Richard E. Nance and Claude {Overstreet, Jr.}",
  title =        "Some Experimental Observations on the Behavior of
                 Composite Random Number Generators",
  journal =      j-OPER-RES,
  volume =       "26",
  number =       "5",
  pages =        "915--935",
  month =        sep # "\slash " # oct,
  year =         "1978",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.26.5.915",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Wed Dec 21 10:17:36 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/170084",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{Niederreiter:1978:EGL,
  author =       "Harald Niederreiter",
  title =        "Existence of good lattice points in the sense of
                 {Hlawka}",
  journal =      j-MONAT-MATH,
  volume =       "86",
  number =       "3",
  pages =        "203--219",
  month =        sep,
  year =         "1978--1979",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01659720",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "10K05 (65D99)",
  MRnumber =     "517026 (80e:10039)",
  MRreviewer =   "L. Kuipers",
  bibdate =      "Thu Jan 19 08:45:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:1978:QMC,
  author =       "Harald Niederreiter",
  title =        "Quasi-{Monte Carlo} Methods and Pseudo-Random
                 Numbers",
  journal =      j-BULL-AMS,
  volume =       "84",
  number =       "6",
  pages =        "957--1041",
  month =        nov,
  year =         "1978",
  CODEN =        "BAMOAD",
  DOI =          "https://doi.org/10.1090/S0002-9904-1978-14532-7",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  MRclass =      "65C05 (10K15 65C10 68J05)",
  MRnumber =     "508447 (80d:65016)",
  MRreviewer =   "George Marsaglia",
  bibdate =      "Sat Mar 08 10:53:58 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/bull/1978-84-06/S0002-9904-1978-14532-7/S0002-9904-1978-14532-7.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
  tableofcontents = "1. Introduction \\
                 Part I. Quasi-Monte Carlo Methods \\
                 2. Quasi-Monte Carlo integration \\
                 3. Quasi-random points \\
                 4. Good lattice points \\
                 5. Application of diophantine approximations \\
                 Part II. Pseudo-Random Numbers \\
                 6. Random numbers vs. pseudo-random numbers \\
                 7. Linear congruential pseudo-random numbers \\
                 8. Exponential sums \\
                 9. Equidistribution test \\
                 10. Interdependence of successive",
}

@Article{Niederreiter:1978:STLa,
  author =       "Harald Niederreiter",
  title =        "The Serial Test for Linear Congruential Pseudo-random
                 Numbers",
  journal =      j-BULL-AMS,
  volume =       "84",
  number =       "2",
  pages =        "273--274",
  month =        "????",
  year =         "1978",
  CODEN =        "BAMOAD",
  ISSN =         "0002-9904 (print), 1936-881X (electronic)",
  ISSN-L =       "0002-9904",
  MRclass =      "65C10 (10K05)",
  MRnumber =     "MR0458791 (56 #16991)",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/bull/all_issues.html",
}

@InProceedings{Niederreiter:1978:STLb,
  author =       "H. Niederreiter",
  editor =       "L. Corsten and J. Hermans",
  booktitle =    "{Proceedings of COMPSTAT 1978}",
  title =        "Statistical tests for linear congruential pseudorandom
                 numbers",
  publisher =    "Physica Verlag",
  address =      "????",
  pages =        "398--404",
  year =         "1978",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Mon Jan 16 21:34:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Padgett:1978:CCI,
  author =       "W. J. Padgett",
  title =        "{C21}. {Comment} on inverse {Gaussian} random number
                 generation",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "8",
  number =       "1",
  pages =        "78--79",
  year =         "1978",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657808810251",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:10:43 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Rivest:1978:MOD,
  author =       "Ronald L. Rivest and Adi Shamir and Leonard M.
                 Adleman",
  title =        "A Method for Obtaining Digital Signatures and Public
                 Key Cryptosystems",
  journal =      j-CACM,
  volume =       "21",
  number =       "2",
  pages =        "120--126",
  month =        feb,
  year =         "1978",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "94A05",
  MRnumber =     "83m:94003",
  MRreviewer =   "J. L. Selfridge",
  bibdate =      "Fri Nov 20 15:54:39 MST 1998",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The basics of trap-door functions and the famous RSA
                 public key cryptosystem are presented in this paper.",
  abstract =     "An encryption method is presented with the novel
                 property that publicly revealing an encryption key does
                 not thereby reveal the corresponding decryption key.
                 This has two important consequences: (1) Couriers or
                 other secure means are not needed to transmit keys,
                 since a message can be enciphered using an encryption
                 key publicly revealed by the intended recipient. (2) A
                 message can be ``signed'' using a privately held
                 decryption key. Anyone can verify this signature using
                 the corresponding publicly revealed encryption key.
                 Signatures cannot be forged, and a signer cannot later
                 deny the validity of his signature.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "Dept. of Math., MIT, Cambridge, MA, USA",
  fjournal =     "Communications of the Association for Computing
                 Machinery",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; cryptography; cryptosystems;
                 data handling; data processing --- Security of Data;
                 decryption key; digital signatures; encryption key;
                 number theory; operating protection; RSA; security;
                 security of data",
  referencedin = "Referenced in \cite[Ref. 12]{Handschuh:1998:SCC},
                 \cite[Ref. 21]{Kaliski:1995:SUR}, \cite[Ref.
                 5]{Haber:1995:HDD}, \cite[Ref. 8]{Wiener:1998:PCP},
                 \cite[Ref. 27]{Goldreich:1997:FMCb}.",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Romankevich:1978:MCN,
  author =       "A. M. Romankevich",
  title =        "A method of construction of nonlinear generators of
                 pseudorandom sequences",
  journal =      j-CYBER,
  volume =       "14",
  number =       "1",
  pages =        "141--142",
  month =        jan,
  year =         "1978",
  CODEN =        "CYBNAW",
  DOI =          "https://doi.org/10.1007/BF01207141",
  ISSN =         "0011-4235 (print), 2375-0189 (electronic)",
  ISSN-L =       "0011-4235",
  bibdate =      "Mon Jan 16 21:35:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01207141",
  acknowledgement = ack-nhfb,
  fjournal =     "Cybernetics",
  journal-URL =  "http://link.springer.com/journal/10559",
}

@Article{Sakasegawa:1978:GNP,
  author =       "Hirotaka Sakasegawa",
  title =        "On a generation of normal pseudo-random numbers",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "30",
  number =       "1",
  pages =        "271--279",
  month =        "????",
  year =         "1978",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02480218",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 18:19:56 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02480218",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@TechReport{Schmeiser:1978:GVD,
  author =       "Bruce W. Schmeiser",
  title =        "Generation of Variates from Distribution Tails",
  type =         "Technical Report",
  number =       "78008",
  institution =  "Department of Operations Research and Engineering
                 Management, Southern Methodist University",
  address =      "Dallas, TX 75275, USA",
  pages =        "??",
  year =         "1978",
  bibdate =      "Wed Nov 12 09:02:59 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Schmeiser:1978:SMG,
  author =       "Bruce W. Schmeiser",
  title =        "Squeeze methods for generating gamma variates",
  type =         "Technical Report",
  number =       "OREM-78009",
  institution =  "Department of Operations Research and Engineering
                 Management, Southern Methodist University",
  address =      "Dallas, TX 75275, USA",
  pages =        "21",
  month =        jul,
  year =         "1978",
  bibdate =      "Wed Nov 12 08:48:10 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a060388.pdf",
  abstract =     "Two algorithms are given for generating gamma
                 distributed random variables. The algorithms, which are
                 valid when the shape parameter is greater than one, use
                 a uniform majorizing function for the body of the
                 distribution and exponential majorizing functions for
                 the tails. The algorithms are self-contained, requiring
                 only $ U(0, 1) $ variates. Comparisons are made to
                 three competitive algorithms in terms of marginal
                 generation times, initialization time, and memory
                 requirements. Both algorithms are faster than existing
                 methods, for all values of the shape parameter.",
  acknowledgement = ack-nhfb,
}

@Article{Schruben:1978:PNAa,
  author =       "Lee W. Schruben and Barry H. Margolin",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "504--520",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See discussion
                 \cite{Gaver:1978:PNA,Kiefer:1978:PNA,Mallows:1978:PNA,Schruben:1978:PNAb,Simon:1978:PNA}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286590.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  remark =       "According to \cite[page 68]{Eddy:1990:RNG}, this paper
                 may be the first to suggest generating streams of
                 random numbers for parallel computers by starting with
                 different seeds. Eddy states ``the expected length of
                 the shortest disjoint stream under this method is the
                 period length of the generator divided by the square of
                 the number of processors''.",
}

@Article{Schruben:1978:PNAb,
  author =       "Lee W. Schruben and Barry H. Margolin",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments: Rejoinder",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "524--525",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Schruben:1978:PNAa}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286595.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Simon:1978:PNA,
  author =       "Gary A. Simon",
  title =        "Pseudorandom Number Assignment in Statistically
                 Designed Simulation and Distribution Sampling
                 Experiments: Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "73",
  number =       "363",
  pages =        "520--521",
  month =        sep,
  year =         "1978",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Schruben:1978:PNAa}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2286592.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Singh:1978:CPP,
  author =       "Jagbir Singh",
  title =        "A Characterization of Positive {Poisson} Distribution
                 and its Statistical Application",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "34",
  number =       "3",
  pages =        "545--548",
  month =        may,
  year =         "1978",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  classification = "A0250 (Probability theory, stochastic processes, and
                 statistics)",
  corpsource =   "Dept. of Statistics, Temple Univ., Philadelphia, PA,
                 USA",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "characterisation; independent nonnegative random
                 variables; joint conditional distribution; numerical
                 example; positive Poisson distribution; statistical
                 analysis; statistical application",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Sowey:1978:SCB,
  author =       "E. R. Sowey",
  title =        "A Second Classified Bibliography on Random Number
                 Generation and Testing",
  journal =      j-INT-STAT-REV,
  volume =       "46",
  number =       "1",
  pages =        "89--102",
  month =        apr,
  year =         "1978",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Fri Jul 01 07:54:55 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/i261095",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@Article{Starner:1978:EID,
  author =       "J. W. Starner and W. L. Shepherd",
  title =        "Efficient Inverse Distribution Type Normal Random
                 Number Generator",
  journal =      j-SIAM-REVIEW,
  volume =       "20",
  number =       "3",
  pages =        "635--635",
  month =        "????",
  year =         "1978",
  CODEN =        "SIREAD",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Fri Jun 21 11:25:02 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
}

@Article{Tadikamalla:1978:CGGa,
  author =       "Pandu R. Tadikamalla",
  title =        "Computer Generation of Gamma Random Variables",
  journal =      j-CACM,
  volume =       "21",
  number =       "5",
  pages =        "419--422",
  month =        may,
  year =         "1978",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "58 13614",
  MRreviewer =   "George Marsaglia",
  bibdate =      "Mon Jan 22 07:25:17 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Tadikamalla78;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A new method for generating random variables from the
                 gamma distribution with nonintegral shape parameter
                 alpha is proposed. This method is similar to two other
                 methods recently given by N. D. Wallace and G. S.
                 Fishman. It is compared with Fishman's and J. H. Ahrens
                 and Ulrich Dieter's methods. The core storage
                 requirements and programming effort for this method are
                 similar to those of Fishman's method. The proposed
                 method is the same as Fishman's method for 1 less than
                 equivalent to alpha less than 2 and is faster than
                 Fishman's method for 3 less than equivalent to alpha
                 less than equivalent to 19. Also, the proposed method
                 is much simpler than Ahrens and Dieter's method and is
                 faster for alpha less than equivalent to 8.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1140 (Probability and statistics); C7310 (Mathematics
                 computing)",
  classification = "723; 922",
  corpsource =   "Eastern Kentucky Univ., Richmond, KY, USA",
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7943",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; core; gamma distribution; gamma
                 random variables; generating; mathematical statistics
                 --- Random Number Generation; programming effort;
                 statistics; storage requirements",
  oldlabel =     "Tadikamalla78",
  references =   "0",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Tadikamalla78",
}

@Article{Tadikamalla:1978:CGGb,
  author =       "Pandu R. Tadikamalla",
  title =        "Computer Generation of Gamma Random Variables ---
                 {II}",
  journal =      j-CACM,
  volume =       "21",
  number =       "11",
  pages =        "925--928",
  month =        nov,
  year =         "1978",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 07:25:18 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Tadikamalla78a;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1140Z (Other topics in statistics); C7310
                 (Mathematics computing)",
  corpsource =   "Univ. of Pittsburgh, Pittsburgh, PA, USA",
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7944",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "computational; computer generation; core; gamma random
                 variables; nonintegral shape parameter; programming
                 effort; random processes; statistics; storage
                 requirements; times",
  oldlabel =     "Tadikamalla78a",
  references =   "0",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Tadikamalla78a",
}

@Article{Whitmore:1978:NLT,
  author =       "G. A. Whitmore and M. Yalovsky",
  title =        "A Normalizing Logarithmic Transformation for Inverse
                 {Gaussian} Random Variables",
  journal =      j-TECHNOMETRICS,
  volume =       "20",
  number =       "2",
  pages =        "207--208",
  month =        may,
  year =         "1978",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.2307/1268715",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 13:18:43 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i254294;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1970.bib",
  URL =          "http://www.jstor.org/stable/1268715",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html",
}

@Book{Zielinski:1978:EZP,
  author =       "Ryszard Zieli{\'n}ski",
  title =        "{Erzeugung von Zufallszahlen: Programmierung und Test
                 Digitalrechnern}. ({German}) [{Generation} of random
                 numbers: Programming and test digital computation]",
  publisher =    "Ham Deutsch",
  address =      "Frankfurt, West Germany; Thun, Switzerland",
  pages =        "xiii + 160",
  year =         "1978",
  ISBN =         "3-87144-404-9",
  ISBN-13 =      "978-3-87144-404-3",
  LCCN =         "????",
  bibdate =      "Tue Jan 10 16:12:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "French",
  remark =       "German translation by Peter Neumann of the Polish
                 original \booktitle{Generatory liczb losowych}.",
}

@Article{Anonymous:1979:BRT,
  author =       "Anonymous",
  title =        "Book Reviews: {Tables of Random Times}, by {I. D.
                 Hill} and {P. A. Hill}",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "1",
  pages =        "72--72",
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:29 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Apostolopoulos:1979:IAN,
  author =       "N. Apostolopoulos and G. Schuff",
  title =        "Initializing algorithms: a note to the article:
                 {``Computer methods for sampling from gamma, beta,
                 Poisson and binomial distributions'' [Computing {\bf
                 12} (1974), no. 3, 223--246; {MR {\bf 52}} \#15949] by
                 J. H. Ahrens and Ulrich Dieter}",
  journal =      j-COMPUTING,
  volume =       "22",
  number =       "2",
  pages =        "185--189",
  month =        jun,
  year =         "1979",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "83c:65010",
  bibdate =      "Thu Oct 14 11:56:25 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  note =         "See \cite{Ahrens:1974:CMS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Atkinson:1979:CGP,
  author =       "A. C. Atkinson",
  title =        "The Computer Generation of {Poisson} Random
                 Variables",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "??",
  pages =        "29--35",
  month =        "????",
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Thu Jan 05 10:24:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Atkinson:1979:FSA,
  author =       "A. C. Atkinson",
  title =        "A Family of Switching Algorithms for the Computer
                 Generation of Beta Random Variables",
  journal =      j-BIOMETRIKA,
  volume =       "66",
  number =       "1",
  pages =        "141--145",
  month =        apr,
  year =         "1979",
  CODEN =        "BIOKAX",
  DOI =          "https://doi.org/10.1093/biomet/66.1.141;
                 https://doi.org/10.2307/2335253",
  ISSN =         "0006-3444 (print), 1464-3510 (electronic)",
  ISSN-L =       "0006-3444",
  MRclass =      "65C10",
  MRnumber =     "529158 (80c:65019)",
  bibdate =      "Sat Jun 21 14:34:18 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00063444.html;
                 http://www.jstor.org/stable/i315490;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2335253",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrika",
  journal-URL =  "http://biomet.oxfordjournals.org/content/by/year;
                 http://www.jstor.org/journals/00063444.html",
}

@Article{Atkinson:1979:RDC,
  author =       "A. C. Atkinson",
  title =        "Recent Developments in the Computer Generation of
                 {Poisson} Random Variables",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "??",
  pages =        "260--263",
  month =        "????",
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Thu Jan 05 10:24:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Atkinson:1979:SAA,
  author =       "A. C. Atkinson and J. Whittaker",
  title =        "Statistical Algorithms: {Algorithm AS 134}: The
                 Generation of Beta Random Variables with one Parameter
                 Greater than and One Parameter Less than $1$",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "1",
  pages =        "90--93",
  month =        mar,
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:29 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://lib.stat.cmu.edu/apstat/134",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Imperial Coll., London, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "beta random variables; generation; random number
                 generation; subroutines",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Atkinson:1979:SGI,
  author =       "A. C. (Anthony Curtis) Atkinson",
  title =        "The simulation of generalised inverse {Gaussian},
                 generalised hyperbolic, gamma, and related random
                 variables",
  publisher =    "Department of Theoretical Statistics, Institute of
                 Mathematics, University of Aarhus",
  address =      "{\AA}rhus, Denmark",
  pages =        "48 (various)",
  year =         "1979",
  LCCN =         "QA273.6 .A84",
  bibdate =      "Tue Apr 29 20:39:05 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat1970.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Research reports --- Department of Theoretical
                 Statistics, University of Aarhus; no. 52",
  acknowledgement = ack-nhfb,
  subject =      "Distribution (Probability theory); Data processing",
}

@Article{Bache:1979:APP,
  author =       "Niels Bache",
  title =        "Approximate percentage points for the distribution of
                 a product of independent positive random variables",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "2",
  pages =        "158--162",
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:32 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C1140Z (Other topics in statistics)",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "distribution; independent positive random; percentage
                 points; statistical analysis; variables",
  treatment =    "T Theoretical or Mathematical",
}

@TechReport{Bentley:1979:AGS,
  author =       "J. L. Bentley and J. B. Saxe",
  title =        "Algorithm: Generating sorted lists of randoms",
  type =         "Report",
  number =       "CMU-CS-79-113",
  institution =  "Department of Computer Science, Carnegie-Mellon
                 University",
  address =      "Pittsburgh, PA, USA",
  month =        mar,
  year =         "1979",
  bibdate =      "Thu Mar 01 09:42:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Published in \cite{Bentley:1980:GSL}.",
  acknowledgement = ack-nhfb,
}

@Article{Best:1979:SEP,
  author =       "D. J. Best",
  title =        "Some Easily Programmed Pseudo-Random Normal
                 Generators",
  journal =      j-AUSTRALIAN-COMP-J,
  volume =       "11",
  number =       "2",
  pages =        "60--62",
  year =         "1979",
  CODEN =        "ACMJB2",
  ISSN =         "0004-8917",
  bibdate =      "Fri Mar 09 17:54:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The virtues of easily programmed algorithms are
                 explained and then, after brief description, a
                 comparison is made of six such algorithms for
                 generating normal deviates. The six algorithms are
                 compared with respect to speed on a CDC 7600 and in
                 terms of the average numbers of random numbers and
                 mathematical functions needed to generate one normal
                 deviate.",
  acknowledgement = ack-nhfb,
  fjournal =     "Australian Computer Journal",
  keywords =     "Gaussian distribution; Normal distribution; random
                 number generators; simulation",
}

@Article{Braaten:1979:ILD,
  author =       "Eric Braaten and George Weller",
  title =        "An improved low-discrepancy sequence for
                 multidimensional quasi-{Monte Carlo} integration",
  journal =      j-J-COMPUT-PHYS,
  volume =       "33",
  number =       "2",
  pages =        "249--258",
  month =        nov,
  year =         "1979",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(79)90019-6",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 09:15:35 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See improvements in \cite{Okten:2009:GNK}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999179900196",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Bright:1979:QRN,
  author =       "Herbert S. Bright and Richard L. Enison",
  title =        "Quasi-Random Number Sequences from a Long-Period {TLP}
                 Generator with Remarks on Application to Cryptography",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "357--370",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356795",
  ISSN =         "0010-4892",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@InProceedings{Brown:1979:CPNa,
  author =       "Mark Brown and Herbert Solomon",
  editor =       "Anonymous",
  booktitle =    "{Proceedings of the Twenty-Fourth Conference on the
                 Design of Experiments, Mathematics Research Center,
                 University of Wisconsin, Madison, Wisconsin, 4--6
                 October 1978}",
  title =        "On Combining Pseudorandom Number Generators",
  volume =       "79-2",
  publisher =    "U.S. Army Research Office",
  address =      "P.0. Box 12211, Research Triangle Park, NC, USA",
  bookpages =    "xv + 416",
  pages =        "133--142",
  month =        jun,
  year =         "1979",
  bibdate =      "Wed Nov 12 09:34:39 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a070840.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Brown:1979:CPNb,
  author =       "Mark Brown and Herbert Solomon",
  title =        "On Combining Pseudorandom Number Generators",
  journal =      j-ANN-STAT,
  volume =       "7",
  number =       "3",
  pages =        "691--695",
  month =        may,
  year =         "1979",
  CODEN =        "ASTSC7",
  ISSN =         "0090-5364 (print), 2168-8966 (electronic)",
  ISSN-L =       "0090-5364",
  bibdate =      "Sat Sep 17 10:13:48 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2958754",
  abstract =     "A technique used in pseudorandom number generation is
                 to combine two or more different generators with the
                 goal of producing a new generator with improved
                 randomness properties. We study such a class of
                 generators and show that in a strong sense the combined
                 generator does offer improvement. Our approach applies
                 results from majorization theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aos/",
}

@Article{Burford:1979:AVM,
  author =       "R. L. Burford",
  title =        "Additive vs multiplicative uniform pseudo-random
                 number generators in the generation of {Erlang}
                 variates",
  journal =      j-SIMULETTER,
  volume =       "10",
  number =       "3",
  pages =        "75--82",
  year =         "1979",
  CODEN =        "SIMUD5",
  ISSN =         "0163-6103",
  bibdate =      "Tue Mar 6 06:56:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Simuletter",
  keywords =     "comparison; Erlang distribution; linear congruential
                 generator",
  remark =       "This paper presents the comparative results of several
                 random numbers generators with an inverse transform to
                 generate {Erlang} random variates with $ \lambda = 1 $
                 and $ k = 3 $, $4$, $5$ and $6$. the results show that
                 two commonly used generators (a multiplicative and a
                 mixed one) produce unacceptable results. two others (an
                 additive one and a multiplicative one) produce
                 acceptable results.",
}

@Article{Cheng:1979:SSG,
  author =       "R. C. H. Cheng and G. M. Feast",
  title =        "Some Simple Gamma Variate Generators",
  journal =      j-APPL-STAT,
  volume =       "28",
  number =       "3",
  pages =        "290--295",
  year =         "1979",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:34 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{delJunco:1979:HLV,
  author =       "A. del Junco and J. Michael Steele",
  title =        "{Hammersley's Law} for the {Van Der Corput} Sequence:
                 An Instance of Probability Theory for Pseudorandom
                 Numbers",
  journal =      j-ANN-PROBAB,
  volume =       "7",
  number =       "2",
  pages =        "267--275",
  month =        apr,
  year =         "1979",
  CODEN =        "APBYAE",
  ISSN =         "0091-1798 (print), 2168-894X (electronic)",
  ISSN-L =       "0091-1798",
  bibdate =      "Sun Apr 20 10:44:17 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annprobab1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://projecteuclid.org/euclid.aop/1176995087;
                 http://www.jstor.org/stable/pdfplus/2242879.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aop",
}

@Article{Edgell:1979:SCD,
  author =       "Stephen E. Edgell",
  title =        "A statistical check of the {DECsystem-10 FORTRAN}
                 pseudorandom number generator",
  journal =      j-BEHAV-RES-METH-INSTR,
  volume =       "11",
  number =       "5",
  pages =        "529--530",
  month =        sep,
  year =         "1979",
  CODEN =        "BRMIAC",
  DOI =          "https://doi.org/10.3758/BF03201371",
  ISSN =         "0005-7878",
  bibdate =      "Fri Mar 09 08:17:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/ah71321478333g10/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods and Instrumentation",
  remark =       "The author reports successful passing of five
                 statistical tests by the {\tt ran()} generator:
                 frequency test, serial test, lagged product test, runs
                 up-and-down test, and runs above-and-below one-half,
                 but gives no information about the generator
                 algorithm.",
}

@Article{Good:1979:CCR,
  author =       "I. J. Good",
  title =        "{C52}: The clustering of random variables",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "9",
  number =       "3",
  pages =        "241--243",
  month =        "????",
  year =         "1979",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657908810323",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:18:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Book{Hammersley:1979:MCM,
  author =       "J. M. (John Michael) Hammersley and D. C. (David
                 Christopher) Handscomb",
  title =        "{Monte Carlo} methods",
  publisher =    pub-CHAPMAN-HALL,
  address =      pub-CHAPMAN-HALL:adr,
  pages =        "vii + 178",
  year =         "1979",
  ISBN =         "0-412-15870-1",
  ISBN-13 =      "978-0-412-15870-4",
  LCCN =         "QA298 .H354 1964",
  bibdate =      "Fri Jan 6 10:33:31 MST 2012",
  bibsource =    "clas.caltech.edu:210/INNOPAC;
                 fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Reprint of \cite{Hammersley:1964:MCM}.",
  series =       "Monographs on statistics and applied probability",
  acknowledgement = ack-nhfb,
}

@Article{Heidelberger:1979:CSS,
  author =       "Philip Heidelberger and Donald L. Iglehart",
  title =        "Comparing Stochastic Systems Using Regenerative
                 Simulation with {Common Random Numbers}",
  journal =      j-ADV-APPL-PROB,
  volume =       "11",
  number =       "4",
  pages =        "804--819",
  month =        dec,
  year =         "1979",
  CODEN =        "AAPBBD",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1426860",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00018678.html;
                 http://projecteuclid.org/euclid.aap/",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Hellman:1979:MPK,
  author =       "Martin E. Hellman",
  title =        "The Mathematics of Public-Key Cryptography",
  journal =      j-SCI-AMER,
  volume =       "241",
  number =       "2",
  pages =        "146--?? (Intl. ed. 130--139)",
  month =        aug,
  year =         "1979",
  CODEN =        "SCAMAC",
  ISSN =         "0036-8733 (print), 1946-7087 (electronic)",
  ISSN-L =       "0036-8733",
  bibdate =      "Tue May 19 18:01:43 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "B6120B (Codes); C6130 (Data handling techniques);
                 C6160 (Database management systems (DBMS))",
  fjournal =     "Scientific American",
  journal-URL =  "http://www.nature.com/scientificamerican",
  keywords =     "computer privacy; cryptography; electronic
                 communications; encoding; encryption; knapsack problem;
                 mathematics; P-NP problem; public key cryptography;
                 public-key cryptosystem; random numbers; security of
                 data; trap-door one-way functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hill:1979:CPP,
  author =       "G. W. Hill",
  title =        "Cyclic properties of pseudo-random sequences of
                 {Mersenne} prime residues",
  journal =      j-COMP-J,
  volume =       "22",
  number =       "1",
  pages =        "80--85",
  month =        feb,
  year =         "1979",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "65C10 (10A99 68J05)",
  MRnumber =     "81a:65014",
  bibdate =      "Tue Mar 25 13:51:56 MST 1997",
  bibsource =    "Compendex database;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/;
                 https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/80.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/81.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/82.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/83.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/84.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/85.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310 (Mathematics
                 computing); C7890 (Other special applications of
                 computing)",
  classification = "723",
  corpsource =   "Div. of Mineral Chem., CSIRO, Port Melbourne, Vic.,
                 Australia",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "computer simulation; cyclic properties; Mersenne
                 prime; Mersenne prime residues; number theory; random
                 number generation; random numbers",
  reviewer =     "Paul Gray",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Iglehart:1979:RSI,
  author =       "Donald L. Iglehart and Peter A. W. Lewis",
  title =        "Regenerative Simulation with Internal Controls",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "271--282",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322123.322132",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A new variance reduction technique called internal
                 control variables is introduced. This technique is to
                 be used in regenerative simulations. The idea is to
                 identify a sequence of control random variables, each
                 one defined within a regenerative cycle, whose mean can
                 be calculated analytically. These controls should be
                 highly correlated with the usual quantities observed in
                 a regenerative simulation. This correlation reduces the
                 variance of the estimate for the parameter of interest.
                 Numerical examples are included for the waiting time
                 process of an M/M/1 queue and for several Markov
                 chains.",
  acknowledgement = ack-nhfb,
  classification = "723; 922",
  descriptors =  "Simulation; control variable; independent cycles;
                 M/M/1; Markov process",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer simulation; probability --- Queueing Theory",
}

@Article{Kahaner:1979:EAD,
  author =       "David K. Kahaner and Mark B. Wells",
  title =        "An Experimental Algorithm for $ {N} $-Dimensional
                 Adaptive Quadrature",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "86--96",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355815.355821",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Aug 30 00:41:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "Monte Carlo quadrature",
}

@TechReport{Kirby:1979:MFC,
  author =       "William H. Kirby",
  title =        "Machine-independent {FORTRAN} coding of {Lehmer}
                 random number generators",
  type =         "Open-file series",
  number =       "80- 004",
  institution =  "U.S. Geological Survey",
  address =      "Reston, VA, USA",
  pages =        "[i] + 11",
  year =         "1979",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Bibliography: leaf 9.",
  keywords =     "Random number generators --- Data processing.",
}

@Article{Kleijnen:1979:ASC,
  author =       "J. P. C. Kleijnen",
  title =        "Analysis of Simulation with {Common Random Numbers}: a
                 Note on {Heikes et al.}",
  journal =      "Simulette",
  volume =       "11",
  number =       "??",
  pages =        "7--13",
  month =        "????",
  year =         "1979",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Kronmal:1979:AMG,
  author =       "Richard A. Kronmal and Arthur V. {Peterson, Jr.}",
  title =        "On the alias method for generating random variables
                 from a discrete distribution",
  journal =      j-AMER-STAT,
  volume =       "33",
  number =       "4",
  pages =        "214--218",
  month =        "????",
  year =         "1979",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "65C10 (68J05)",
  MRnumber =     "81c:65010",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Lee:1979:DRC,
  author =       "Ru Ying Lee and Burt S. Holland and John A. Flueck",
  title =        "Distribution of a Ratio of Correlated Gamma Random
                 Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "36",
  number =       "2",
  pages =        "304--320",
  month =        apr,
  year =         "1979",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "62E15",
  MRnumber =     "80f:62020",
  MRreviewer =   "Donald R. Jensen",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Monahan:1979:ENM,
  author =       "John F. Monahan",
  title =        "Extensions of {von Neumann}'s method for generating
                 random variables",
  journal =      j-MATH-COMPUT,
  volume =       "33",
  number =       "147",
  pages =        "1065--1069",
  month =        jul,
  year =         "1979",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "80c:65022",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/mathcomp.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/MATHCOMP/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Statistics, North Carolina State Univ.,
                 Rayleigh, Rayleigh, NC, USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7686",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "algorithms; approximation theory; exponential
                 distribution; power series; random; variables
                 generation; von Neumann method",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Moore:1979:RNG,
  author =       "J. L. Moore and F. H. Thomas",
  title =        "A random number generator for {BASIC} programs",
  journal =      "Computer Education",
  volume =       "33",
  number =       "??",
  pages =        "13--16",
  month =        "????",
  year =         "1979",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Jan 16 21:27:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Nadas:1979:PP,
  author =       "Arthur Nadas",
  title =        "Probabilistic {PERT}",
  journal =      j-IBM-JRD,
  volume =       "23",
  number =       "3",
  pages =        "339--347",
  month =        may,
  year =         "1979",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Tue Mar 25 14:26:59 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A solution is offered to the problem of determining a
                 probability distribution for the length of the longest
                 path from source (start) to sink (finish) in an
                 arbitrary PERT network (directed acyclic graph), as
                 well as determining associated probabilities that the
                 various paths are critical (``bottleneck
                 probabilities''). It is assumed that the durations of
                 delays encountered at a node are random variables
                 having known but arbitrary probability distributions
                 with finite expected values. The solution offered is,
                 in a certain sense, a worst-case bound over all
                 possible joint distributions of delays for given
                 marginal distributions for delays. This research was
                 motivated by the engineering problem of the timing
                 analysis of computer hardware logic block graphs where
                 randomness in circuit delay is associated with
                 manufacturing variations. The probability distribution
                 of the critical pathlength turns out to be a solution
                 of an unconstrained minimization problem, which can be
                 recast as a convex programming problem with linear
                 constraints. The probability that a given path is
                 critical turns out to be the Lagrange multiplier
                 associated with the constraint determined by the path.
                 The discrete version of the problem can be solved
                 numerically by means of various parametric linear
                 programming formulations, in particular by one which is
                 efficiently solved by Fulkerson's network flow
                 algorithm for project cost curves.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1140Z (Other topics in statistics); C1180
                 (Optimisation techniques); C1290F (Systems theory
                 applications in industry)C4190 (Other numerical
                 methods)",
  classification = "723; 922",
  corpsource =   "IBM Data Systems Div. Lab., Hopewell Junction, NY,
                 USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  journalabr =   "IBM J Res Dev",
  keywords =     "circuit delay; convex programming; cost curves;
                 critical path method; data processing; directed acyclic
                 graph; Fulkerson's network flow algorithm; linear;
                 linear programming; minimisation; PERT; probability;
                 probability distribution; programming; project;
                 unconstrained minimisation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niki:1979:CMF,
  author =       "Naoto Niki",
  title =        "Corrections to {``Multi-folding the normal
                 distribution and mutual transformation between uniform
                 and normal random variables''}",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "31",
  number =       "1",
  pages =        "349--349",
  month =        "????",
  year =         "1979",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02480292",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 18:19:56 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Niki:1979:MFN}.",
  URL =          "http://link.springer.com/accesspage/article/10.1007/BF02480292",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Niki:1979:MFN,
  author =       "Naoto Niki",
  title =        "Multi-folding the normal distribution and mutual
                 transformation between uniform and normal random
                 variables",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "31",
  number =       "1",
  pages =        "125--140",
  month =        "????",
  year =         "1979",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF02480270",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 16:59:49 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See corrections \cite{Niki:1979:CMF}.",
  URL =          "http://link.springer.com/article/10.1007/BF02480270",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Pangratz:1979:PRN,
  author =       "H. Pangratz and H. Weinrichter",
  title =        "Pseudo-Random Number Generator Based on Binary and
                 Quinary Maximal-Length Sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-28",
  number =       "9",
  pages =        "637--642",
  month =        sep,
  year =         "1979",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1979.1675431",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 11 06:49:40 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1675431",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Pavlov:1979:PNG,
  author =       "A. I. Pavlov and B. B. Pokhodzei",
  title =        "Pseudorandom numbers generated by linear recurrence
                 relations over a finite field",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "19",
  number =       "4",
  pages =        "38--44",
  month =        "????",
  year =         "1979",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(79)90154-X",
  ISSN =         "0041-5553 (print), 1878-2930 (electronic)",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Jan 16 21:28:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/004155537990154X",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@InCollection{Reeds:1979:CMC,
  author =       "James A. Reeds",
  title =        "Cracking a multiplicative congruential encryption
                 algorithm",
  crossref =     "Wang:1979:ILB",
  pages =        "467--472",
  year =         "1979",
  MRclass =      "94B99 (65C10)",
  MRnumber =     "80h:94040",
  bibdate =      "Fri Oct 25 18:39:09 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
}

@Article{Ripley:1979:TRS,
  author =       "B. D. Ripley",
  title =        "Tests of randomness for spatial point patterns",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "41",
  number =       "??",
  pages =        "368--374",
  month =        "????",
  year =         "1979",
  CODEN =        "JSTBAJ",
  ISSN =         "0035-9246",
  bibdate =      "Tue Feb 07 09:35:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@TechReport{Roberts:1979:ITN,
  author =       "C. S. Roberts",
  title =        "Implementing and Testing New Versions of a Good 48-bit
                 Pseudo-random Number Generator",
  type =         "Report",
  number =       "1453 (TM 79-1353-5)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "4",
  month =        sep,
  year =         "1979",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes the design, implementation,
                 testing, and use of drand48 --- a good pseudorandom
                 number generator based on the linear congruential
                 algorithm and 48-bit integer arithmetic.",
  acknowledgement = ack-nhfb,
}

@Article{Rubin:1979:SCB,
  author =       "Frank Rubin",
  title =        "Solving a Cipher Based on Multiple Random Number
                 Streams",
  journal =      j-CRYPTOLOGIA,
  volume =       "3",
  number =       "3",
  pages =        "155--157",
  month =        jul,
  year =         "1979",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-117991853972",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:28 MDT 2008",
  bibsource =    "http://www.dean.usma.edu/math/pubs/cryptologia/;
                 https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902796~db=all~order=page",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  romanvolume =  "III",
}

@Article{Sahai:1979:SSB,
  author =       "Hardeo Sahai",
  title =        "A supplement to {Sowey}'s bibliography on random
                 number generation and related topics",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "10",
  number =       "1",
  pages =        "31--52",
  month =        dec,
  year =         "1979",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949657908810345",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:03:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949657908810345",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Schrage:1979:MPF,
  author =       "Linus Schrage",
  title =        "A More Portable {Fortran} Random Number Generator",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "132--138",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/355826.355828",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Sobol:1979:ESS,
  author =       "I. M. Sobol'",
  title =        "Erratum: {``On the Systematic Search in a Hypercube''
                 [SIAM J. Numer. Anal. {\bf 16} (1979), no. 5, 790--793,
                 MR 80f:65072]}",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "16",
  number =       "6",
  pages =        "1080--1080",
  month =        dec,
  year =         "1979",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  MRclass =      "65K10",
  MRnumber =     "81e:65029",
  MRreviewer =   "Derek W. Arthur",
  bibdate =      "Fri Oct 16 06:57:22 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjnumeranal.bib;
                 JSTOR database",
  note =         "See \cite{Sobol:1979:SSH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
}

@Article{Sobol:1979:SSH,
  author =       "I. M. Sobol'",
  title =        "On the Systematic Search in a Hypercube",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "16",
  number =       "5",
  pages =        "790--793",
  month =        oct,
  year =         "1979",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  MRclass =      "65K05 (65C10)",
  MRnumber =     "80f:65072",
  bibdate =      "Fri Oct 16 06:57:22 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjnumeranal.bib;
                 JSTOR database",
  note =         "See erratum \cite{Sobol:1979:ESS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
}

@Article{Tanemura:1979:RCP,
  author =       "M. Tanemura",
  title =        "On random complete packing by discs",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "31",
  number =       "Part B",
  pages =        "351--365",
  month =        "????",
  year =         "1979",
  CODEN =        "AISXAD",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Wed Feb 29 21:24:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics
                 (Tokyo)",
  journal-URL =  "http://link.springer.com/journal/10463",
  keywords =     "parking-lot test; sphere packing",
}

@Article{Tripathi:1979:RFI,
  author =       "V. S. Tripathi",
  title =        "{RANTEST} --- a {Fortran IV} program for testing
                 randomness of uniform pseudorandom numbers",
  journal =      j-COMP-GEOSCI,
  volume =       "5",
  number =       "??",
  pages =        "251--268",
  month =        "????",
  year =         "1979",
  CODEN =        "CGEODT, CGOSDN",
  ISSN =         "0098-3004 (print), 1873-7803 (electronic)",
  ISSN-L =       "0098-3004",
  bibdate =      "Mon Jan 16 21:30:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Geosciences",
}

@Article{vanLint:1979:PRA,
  author =       "J. H. {van Lint} and F. J. MacWilliams and N. J. A.
                 Sloane",
  title =        "On Pseudo-Random Arrays",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "36",
  number =       "1",
  pages =        "62--72",
  month =        feb,
  year =         "1979",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "05B15",
  MRnumber =     "80b:05011",
  MRreviewer =   "J.-M. Goethals",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  URL =          "http://www.jstor.org/stable/2100768",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
}

@Article{Wang:1979:MND,
  author =       "Y. H. Wang",
  title =        "Mathematical Notes: Dependent Random Variables with
                 Independent Subsets",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "86",
  number =       "4",
  pages =        "290--292",
  month =        apr,
  year =         "1979",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Mon Jun 28 12:39:24 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Williams:1979:SPF,
  author =       "H. C. Williams and E. Seah",
  title =        "Some Primes of the Form $ (a^n - 1) / (a - 1) $",
  journal =      j-MATH-COMPUT,
  volume =       "33",
  number =       "148",
  pages =        "1337--1342",
  month =        oct,
  year =         "1979",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "10A25",
  MRnumber =     "80g:10014",
  MRreviewer =   "H. J. Godwin",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "The primes in the title are of interest for
                 simplifying computations in the determination of
                 optimal parameters for linear and multiplicative
                 congruential generators.",
}

@Article{Wright:1979:ECR,
  author =       "R. D. Wright and T. E. {Ramsay, Jr.}",
  title =        "On the Effectiveness of {Common Random Numbers}",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "25",
  number =       "7",
  pages =        "649--656",
  month =        jul,
  year =         "1979",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.25.7.649",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{Ahrens:1980:SBP,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "Sampling from binomial and {Poisson} distributions: a
                 method with bounded computation times",
  journal =      j-COMPUTING,
  volume =       "25",
  number =       "3",
  pages =        "193--208",
  month =        sep,
  year =         "1980",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65U05",
  MRnumber =     "82e:65139",
  bibdate =      "Tue Jan 2 17:40:54 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date); MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Math. Seminar, Univ. Kiel, Kiel, West Germany",
  classification = "C1140; C4240",
  description =  "computational complexity; statistical analysis",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "binomial distribution; Poisson distribution; random
                 numbers; sampling",
}

@Article{Atkinson:1980:TPR,
  author =       "A. C. Atkinson",
  title =        "Tests of Pseudo-Random Numbers",
  journal =      j-APPL-STAT,
  volume =       "29",
  number =       "2",
  pages =        "164--171",
  year =         "1980",
  CODEN =        "APSTAG",
  DOI =          "https://doi.org/10.2307/2986302",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:50 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Imperial Coll., London, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "multiplicative generators; pseudo random numbers;
                 random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Basu:1980:RAEa,
  author =       "D. Basu",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "575--582",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287648",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Basu:1980:RAEb,
  author =       "D. Basu",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Rejoinder",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "593--595",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287654",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Bentley:1980:GSL,
  author =       "Jon Louis Bentley and James B. Saxe",
  title =        "Generating Sorted Lists of Random Numbers",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "359--364",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (68-01)",
  MRnumber =     "81k:65010",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/355900.355907",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "linear-time algorithm; probabilistic methods in
                 algorithm design; random number generation; sorting",
  remark =       "See \cite{Fan:1962:DSP,Rouzankin:1999:CAR} for other
                 algorithms for selecting $n$ of $N$ values. The
                 Bentley--Saxe algorithm appears to be superior, because
                 it is short and simple, and runs in worst case time $
                 O(n) $ with storage $ O(1) $ (with immediate output) or
                 $ O(n) $ with array output, and the selected values are
                 sorted.",
  remark-2 =     "The final paragraph of the paper concludes: ``Although
                 we have described our method for generating sorted
                 lists of uniform random numbers, the same method can be
                 extended to generate sorted numbers from other
                 distributions. To generate numbers from distribution
                 $F$ for which the inverse $F^{-1}$ is known, it is only
                 necessary to apply the monotone function $F^{-1}$ to
                 each of the outputs of Program 3 or 4, and the
                 resulting sorted list will satisfy all the desired
                 properties.''",
  reviewer =     "George Marsaglia",
}

@Article{Brown:1980:GFG,
  author =       "T. Brown",
  title =        "General fast generation of random variables for
                 discrete distribution",
  journal =      j-SIMULETTER,
  volume =       "11, 4",
  pages =        "73--75",
  year =         "1980",
  CODEN =        "SIMUD5",
  ISSN =         "0163-6103",
  bibdate =      "Fri Jan 6 09:59:00 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Recently a new method, the ALAIS method has been
                 introduced for generating a discrete, finite valued
                 distribution (1,2). The method is exceptionally fast
                 and can be broadly applied. It should have wide appeal.
                 The purpose of this note is to introduce the method,
                 place it in prospective with other fast, generally
                 applied methods and to provide a Fortran program to
                 generate constants needed by the method for any given
                 distribution.",
  country =      "USA",
  date =         "26/02/81",
  descriptors =  "RNG; RVG; method; table-look-up method",
  enum =         "422",
  fjournal =     "ACM Simuletter",
  location =     "RWTH-AC-DFV: Bibl.",
  references =   "5",
  revision =     "08/02/92",
}

@Article{Davies:1980:SAA,
  author =       "Robert B. Davies",
  title =        "Statistical Algorithms: {Algorithm AS 155}: The
                 Distribution of a Linear Combination of $ \chi^2 $
                 Random Variables",
  journal =      j-APPL-STAT,
  volume =       "29",
  number =       "3",
  pages =        "323--333",
  month =        sep,
  year =         "1980",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:52 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See remark \cite{Farebrother:1984:SARb}.",
  URL =          "http://lib.stat.cmu.edu/apstat/155",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@InProceedings{Dempster:1980:CEA,
  author =       "M. A. H. Dempster and A. Papagaki-Papoulias",
  title =        "Computational experience with an approximate method
                 for the distribution problem",
  crossref =     "Dempster:1980:SPP",
  year =         "1980",
  bibdate =      "Fri Jan 6 09:59:00 2012",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/stoprog.bib.gz;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classmath =    "*90C15 Stochastic programming 65K05 Mathematical
                 programming (numerical methods) 65G10 Interval
                 arithmetic",
  keywords =     "approximate method; automatic error arithmetic;
                 computational experience; distribution problem;
                 interval arithmetic; linear equation solution; linear
                 program; quantile arithmetic; quantile version of
                 Hansen's method; random variables",
}

@Book{Edgington:1980:RT,
  author =       "Eugene S. Edgington",
  title =        "Randomization tests",
  volume =       "31",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  pages =        "xii + 287",
  year =         "1980",
  ISBN =         "0-8247-6878-7",
  ISBN-13 =      "978-0-8247-6878-2",
  LCCN =         "QA277 .E32",
  bibdate =      "Thu Jan 26 12:03:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  acknowledgement = ack-nhfb,
  subject =      "Statistical hypothesis testing",
}

@Article{Farebrother:1980:SAA,
  author =       "R. W. Farebrother",
  title =        "Statistical Algorithms: {Algorithm AS 153}: {Pan}'s
                 Procedure for the Tail Probabilities of the
                 {Durbin--Watson} Statistic",
  journal =      j-APPL-STAT,
  volume =       "29",
  number =       "2",
  pages =        "224--227",
  month =        jun,
  year =         "1980",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:22:50 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See remark
                 \cite{Farebrother:1984:SARa,Farebrother:1984:SARb}.",
  URL =          "http://lib.stat.cmu.edu/apstat/153",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Fishman:1980:NLR,
  author =       "G. S. Fishman",
  title =        "Notes on linear recurrence generators modulo $2$",
  institution =  "University of North Carolina",
  address =      "Chapel Hill, NC, USA",
  year =         "1980",
  bibdate =      "Mon Mar 5 22:00:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "RNG; runs up and down test; runtime/storage
                 efficiency; shift register sequences; Tausworthe
                 generator",
}

@TechReport{Fishman:1980:SCM,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "In search of correlation in multiplicative
                 congruential generators with modulus $ 2^{-31} - 1 $",
  type =         "Technical report",
  number =       "80-05",
  institution =  "University of North Carolina at Chapel Hill",
  address =      "Chapel Hill, NC, USA",
  month =        sep,
  year =         "1980",
  bibdate =      "Thu Jan 12 12:21:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.or.unc.edu/research/temp/tech80a.html#1980",
  acknowledgement = ack-nhfb,
}

@Article{Gardenes:1980:FSI,
  author =       "E. Gardenes and A. Trepat",
  title =        "Fundamentals of {Sigla}, an Interval Computing System
                 over the Completed Set of Intervals",
  journal =      j-COMPUTING,
  volume =       "24",
  number =       "2--3",
  pages =        "161--179",
  month =        jun,
  year =         "1980",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65G10",
  MRnumber =     "82h:65035",
  bibdate =      "Tue Jan 2 17:40:54 MST 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date); MathSciNet database",
  acknowledgement = ack-jr # " and " # ack-nhfb,
  affiliation =  "Univ. de Barcelona, Barcelona, Spain",
  classification = "723; B0250",
  description =  "set theory",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "autonomous random variable; bounded fuzzy
                 distribution; bounding theorems; computer programming
                 languages; Interval Computing System; intervals
                 complete set; lattice completion; semantics rounding",
}

@Article{Good:1980:CFD,
  author =       "I. J. Good",
  title =        "{C77}. {Functions} of distinct random variables having
                 identical distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "12",
  number =       "1",
  pages =        "68--70",
  month =        "????",
  year =         "1980",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658008810429",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:19:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Hassner:1980:UMR,
  author =       "Martin Hassner and Jack Sklansky",
  title =        "The use of {Markov} random fields as models of
                 texture",
  journal =      j-CGIP,
  volume =       "12",
  number =       "4",
  pages =        "357--370",
  month =        apr,
  year =         "1980",
  CODEN =        "CGIPBG",
  ISSN =         "0146-664x (print), 1557-9697 (electronic)",
  ISSN-L =       "0146-664X",
  bibdate =      "Fri Feb 7 08:36:21 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 Misc/misc.1.bib",
  note =         "HASSNER80",
  abstract =     "We propose Markov random fields (MRFs) as
                 probabilistic models of digital image texture where a
                 textured region is viewed as a finite sample of a 2D
                 random process describable by its statistical
                 parameters. MRFs are multidimensional generalisations
                 of Markov chains defined in terms of conditional
                 probabilities associated with spatial neighbourhoods.
                 We present an algorithm that generates an MRF on a
                 finite toroidal square lattice from an independent
                 identically distributed (iid) array of random variables
                 and a given set of independent real-valued statistical
                 parameters. The parametric specification of a
                 consistent collection of MRF conditional probabilities
                 is a general result known as the MRF-Gibbs Random Field
                 (GRF) equivalence. The MRF statistical parameters
                 control the size and directionality of the clusters of
                 adjacent similar pixels which are basic to texture
                 discrimination and thus seem to constitute an efficient
                 model of texture. In the last part of this paper we
                 outline an MRF parameter estimation method and goodness
                 of fit statistical tests applicable to MRF models for a
                 given unknown digital image texture on a finite
                 toroidal square lattice. The estimated parameters may
                 be used as basic features in texture classification.
                 Alternatively these parameters may be used in
                 conjunction with the MRF generation algorithm as a
                 powerful data compression scheme.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "Computer Graphics and Image Processing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0146664X",
  journalabr =   "Comput Graphics Image Process",
  keywords =     "image processing",
}

@Article{Hinkley:1980:RAE,
  author =       "David V. Hinkley",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "582--584",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287649",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{James:1980:MCT,
  author =       "F. James",
  title =        "{Monte Carlo} theory and practice",
  journal =      j-REP-PROG-PHYS,
  volume =       "43",
  number =       "9",
  pages =        "1145--1189",
  month =        sep,
  year =         "1980",
  CODEN =        "RPPHAG",
  DOI =          "https://doi.org/10.1088/0034-4885/43/9/002",
  ISSN =         "0034-4885 (print), 1361-6633 (electronic)",
  ISSN-L =       "0034-4885",
  bibdate =      "Wed Jan 11 07:13:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://iopscience.iop.org/0034-4885/43/9/002",
  acknowledgement = ack-nhfb,
  fjournal =     "Reports on Progress in Physics",
  journal-URL =  "http://iopscience.iop.org/0034-4885",
  keywords =     "Monte Carlo; quasi-Monte Carlo",
}

@Article{Johnson:1980:RPS,
  author =       "Dudley Paul Johnson",
  title =        "The ruin problem for sums of dependent random
                 variables",
  journal =      j-CAN-MATH-BULL,
  volume =       "23",
  number =       "??",
  pages =        "333--338",
  month =        "????",
  year =         "1980",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1980-047-2",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:04:58 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v23/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Kempthorne:1980:RAE,
  author =       "Oscar Kempthorne",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "584--587",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287650",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Book{Kennedy:1980:SC,
  author =       "William J. {Kennedy, Jr.} and James E. Gentle",
  title =        "Statistical Computing",
  volume =       "33",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  pages =        "xi + 591",
  year =         "1980",
  ISBN =         "0-8247-6898-1",
  ISBN-13 =      "978-0-8247-6898-0",
  LCCN =         "QA276.4 .K46",
  bibdate =      "Thu Jan 5 14:39:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Statistics, textbooks and monographs",
  URL =          "http://lccn.loc.gov/80010976",
  acknowledgement = ack-nhfb,
}

@Article{Kinderman:1980:NMG,
  author =       "A. J. Kinderman and J. F. Monahan",
  title =        "New methods for generating {Student}'s $t$ and gamma
                 variables",
  journal =      j-COMPUTING,
  volume =       "25",
  number =       "4",
  pages =        "369--377",
  month =        dec,
  year =         "1980",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "82e:65008",
  bibdate =      "Tue Jan 2 17:40:54 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; INSPEC
                 Axiom database (1968--date); MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Management Sci., California State Univ.,
                 Northridge, CA, USA",
  classification = "C1140",
  description =  "statistical analysis",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "gamma variables; ratio of uniform method; shape
                 parameter; student distribution",
}

@TechReport{Knuth:1980:DLC,
  author =       "Donald E. Knuth",
  title =        "Deciphering a linear congruential encryption",
  type =         "Report",
  number =       "024800",
  institution =  "Department of Computer Science, Stanford University",
  address =      "Stanford, CA, USA",
  year =         "1980",
  bibdate =      "Wed Feb 22 13:51:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Published in \cite{Knuth:1985:DLC}.",
}

@Article{Lam:1980:RTD,
  author =       "Simon S. Lam and A. Udaya Shankar",
  title =        "Response time distributions for a multi-class queue
                 with feedback",
  journal =      j-SIGMETRICS,
  volume =       "9",
  number =       "2",
  pages =        "225--234",
  month =        "Summer",
  year =         "1980",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/800199.806167",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 10:54:53 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "A single server queue with feedback and multiple
                 customer classes is analyzed. Arrival processes are
                 independent Poisson processes. Each round of service is
                 exponentially distributed. After receiving a round of
                 service, a customer may depart or rejoin the end of the
                 queue for more service. The number of rounds of service
                 required by a customer is a random variable with a
                 general distribution. Our main contribution is
                 characterization of response time distributions for the
                 customer classes. Our results generalize in some
                 respects previous analyses of processor-sharing models.
                 They also represent initial efforts to understand
                 response time behavior along paths with loops in local
                 balanced queueing networks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Lane:1980:RAE,
  author =       "David A. Lane",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "587--589",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287651",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Lindley:1980:RAE,
  author =       "D. V. Lindley",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "589--590",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287652",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Marsaglia:1980:GRV,
  author =       "George Marsaglia",
  title =        "Generating Random Variables With a $t$-Distribution",
  journal =      j-MATH-COMPUT,
  volume =       "34",
  number =       "149",
  pages =        "235--236",
  month =        jan,
  year =         "1980",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "81a:65015",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database; MathSciNet database",
  ZMnumber =     "0423.65005",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "algorithm; t-distribution",
  ZMclass =      "65C10 Random number generation 65C05 Monte Carlo
                 methods",
}

@Article{OBrien:1980:PIR,
  author =       "G. L. O'Brien",
  title =        "Pairwise Independent Random Variables",
  journal =      j-ANN-PROBAB,
  volume =       "8",
  number =       "1",
  pages =        "170--175",
  month =        feb,
  year =         "1980",
  CODEN =        "APBYAE",
  ISSN =         "0091-1798 (print), 2168-894X (electronic)",
  ISSN-L =       "0091-1798",
  bibdate =      "Sun Apr 20 10:44:17 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annprobab1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aop/1176994834",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aop",
}

@Article{Peskun:1980:TTC,
  author =       "Peter H. Peskun",
  title =        "Theoretical tests for choosing the parameters of the
                 general mixed linear congruential pseudorandom number
                 generator",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "11",
  number =       "3--4",
  pages =        "281--305",
  month =        "????",
  year =         "1980",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658008810415",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:57:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949658008810415",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@TechReport{Petkovic:1980:RRV,
  author =       "M. S. Petkovic",
  title =        "A Representation of Random Variables by the Probable
                 Intervals",
  type =         "Freiburger Intervall-Ber.",
  number =       "80/10",
  institution =  "Universit{\"a}t Freiburg",
  address =      "Freiburg, Germany",
  pages =        "12--20",
  year =         "1980",
  bibdate =      "Fri Jan 12 11:37:56 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-jr,
}

@Article{Ribeiro:1980:MOS,
  author =       "C. A. Ribeiro",
  title =        "Method for obtaining small sets of pseudo random
                 numbers with uniform distribution",
  journal =      j-COMP-PHYS-COMM,
  volume =       "19",
  number =       "3",
  pages =        "305--307",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(80)90085-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 06:01:27 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465580900855",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  xxauthor =     "C. A. Rebeiro",
}

@Article{Rice:1980:DQF,
  author =       "S. O. Rice",
  title =        "Distribution of quadratic forms in normal random
                 variables---evaluation by numerical integration",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "1",
  number =       "4",
  pages =        "438--448",
  month =        dec,
  year =         "1980",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "62E30 (65U05)",
  MRnumber =     "82g:62037",
  MRreviewer =   "James E. Gentle",
  bibdate =      "Tue Apr 29 18:46:42 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  note =         "See comment \cite{Helstrom:1983:CDQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
}

@Article{Rubin:1980:RAE,
  author =       "Donald B. Rubin",
  title =        "Randomization Analysis of Experimental Data: The
                 {Fisher} Randomization Test Comment",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "591--593",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287653",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Sahai:1980:SSB,
  author =       "Hardeo Sahai",
  title =        "A supplement to {Sowey}'s bibliography on random
                 number generation and related topics",
  journal =      j-BIOMETRICAL-J,
  volume =       "22",
  number =       "5",
  pages =        "447--461",
  month =        "????",
  year =         "1980",
  CODEN =        "BIJODN",
  DOI =          "https://doi.org/10.1002/bimj.4710220509",
  ISSN =         "0323-3847",
  bibdate =      "Thu Dec 29 10:52:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://onlinelibrary.wiley.com/doi/10.1002/bimj.4710220509",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4036",
}

@Article{Sampson:1980:NCD,
  author =       "Allan R. Sampson",
  title =        "Nonnegative {Cholesky} decomposition and its
                 application to association of random variables",
  journal =      j-SIAM-J-ALG-DISC-METH,
  volume =       "1",
  number =       "3",
  pages =        "284--291",
  year =         "1980",
  CODEN =        "SJAMDU",
  ISSN =         "0196-5212 (print), 2168-345X (electronic)",
  ISSN-L =       "0196-5212",
  MRclass =      "15A57 (60E15 62H20 65U05)",
  MRnumber =     "81j:15024",
  MRreviewer =   "I. Olkin",
  bibdate =      "Sat Apr 11 10:02:33 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjalgdiscmeth.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Algebraic and Discrete Methods",
  journal-URL =  "http://epubs.siam.org/loi/sjamdu",
}

@Article{Schmeiser:1980:ARM,
  author =       "Bruce W. Schmeiser and Mohamed A. Shalaby",
  title =        "Acceptance\slash rejection methods for beta variate
                 generation",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "673--678",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Thu Jan 5 15:45:14 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287667",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7857",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Schmeiser:1980:BVG,
  author =       "B. W. Schmeiser and A. J. G. Babu",
  title =        "Beta Variate Generation via Exponential Majorizing
                 Functions",
  journal =      j-OPER-RES,
  volume =       "28",
  number =       "??",
  pages =        "917--926",
  month =        "????",
  year =         "1980",
  CODEN =        "OPREAI",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{Schmeiser:1980:GVD,
  author =       "B. W. Schmeiser",
  title =        "Generation of Variates from Distribution Tails",
  journal =      j-OPER-RES,
  volume =       "28",
  number =       "??",
  pages =        "1012--1017",
  month =        "????",
  year =         "1980",
  CODEN =        "OPREAI",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@TechReport{Schmeiser:1980:RVGa,
  author =       "B. W. Schmeiser",
  title =        "Random Variate Generation: a Survey",
  institution =  "School of Industrial Engineering, Purdue University",
  address =      "West Lafayette, IN, USA",
  pages =        "ii + 26 + 1",
  month =        jun,
  year =         "1980",
  bibdate =      "Wed Nov 12 09:47:44 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a091343.pdf",
  acknowledgement = ack-nhfb,
  xxnote =       "Check the extensive bibliography against the coverage
                 in this file!",
}

@InProceedings{Schmeiser:1980:RVGb,
  author =       "B. W. Schmeiser",
  title =        "Random Variate Generation: a Survey",
  crossref =     "Oren:1980:SDM",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "79--104",
  year =         "1980",
  bibdate =      "Thu Jan 05 11:36:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Schmeiser:1980:SMG,
  author =       "Bruce W. Schmeiser and Ram Lal",
  title =        "Squeeze methods for generating gamma variates",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "679--682",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Fri Jan 6 09:49:56 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287668",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7855",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Shedler:1980:RTS,
  author =       "G. S. Shedler",
  title =        "Response-time simulation of multivariate point process
                 models for multiprogrammed jobstreams",
  journal =      j-INT-J-COMPUT-INF-SCI,
  volume =       "9",
  number =       "2",
  pages =        "73--91",
  month =        apr,
  year =         "1980",
  CODEN =        "IJCIAH",
  ISSN =         "0091-7036",
  bibdate =      "Sat Apr 26 12:20:22 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "IBM Res. Lab., San Jose, CA, USA",
  fjournal =     "International Journal of Computer and Information
                 Sciences",
  journal-URL =  "http://link.springer.com/journal/10766",
  keywords =     "autoregressive dependency structure; discrete random
                 variables; interval estimates; job response times;
                 multiprogrammed jobstreams; multiprogramming;
                 multivariable systems; multivariate point process
                 models; response time simulation",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Misc{Simmons:1980:RNG,
  author =       "R. E. Simmons",
  title =        "Random Number Generator",
  howpublished = "U.S. Patent No. 4,183,088.",
  day =          "8",
  month =        jan,
  year =         "1980",
  bibdate =      "Thu Feb 02 17:54:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@PhdThesis{Soulis:1980:RDL,
  author =       "A. Soulis",
  title =        "Recent developments in linear congruential and other
                 methods for pseudorandom number generation",
  type =         "{Ph.D.} thesis",
  school =       "Chelsea College, University of London",
  address =      "London, UK",
  year =         "1980",
  bibdate =      "Mon Jan 16 21:25:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tadikamalla:1980:RSE,
  author =       "Pandu R. Tadikamalla",
  title =        "Random sampling from the exponential power
                 distribution",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "75",
  number =       "371",
  pages =        "683--686",
  month =        sep,
  year =         "1980",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:55 MST 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1980.bib;
                 http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314255;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287669",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7947",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@PhdThesis{Tsay:1980:SST,
  author =       "H. Tsay",
  title =        "Stringent statistical tests for randomness and random
                 number generators",
  type =         "{Ph.D.} thesis",
  school =       "Washington State University",
  address =      "Pullman, WA, USA",
  year =         "1980",
  bibdate =      "Mon Jan 16 21:26:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ahrens:1981:CME,
  author =       "J. H. Ahrens and K. D. Kohrt",
  title =        "Computer methods for efficient sampling from largely
                 arbitrary statistical distributions",
  journal =      j-COMPUTING,
  volume =       "26",
  number =       "1",
  pages =        "19--31",
  month =        mar,
  year =         "1981",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "83c:65009",
  MRreviewer =   "J. Tiago de Oliveira",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Battaglia:1981:RDA,
  author =       "F. Battaglia",
  title =        "Riproduzione delle Autocorrelazioni nei Metodi di
                 Generazione di Numeri Pseudo-Casuali Normali.
                 ({Italian}) [{Reproduction} of autocorrelations in the
                 generation of pseudorandom normal numbers]",
  journal =      j-METRON,
  volume =       "39",
  number =       "3",
  pages =        "187--208",
  month =        "????",
  year =         "1981",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695x (electronic)",
  bibdate =      "Mon Jan 16 21:19:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  language =     "Italian",
}

@Manual{Becker:1981:LSD,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "{S}: a Language and System for Data Analysis",
  type =         "Report",
  organization = inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "405",
  month =        jan,
  year =         "1981",
  LCCN =         "QA76.7 .B43 1981",
  bibdate =      "Wed Aug 10 10:41:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://drive.google.com/drive/folders/14ijVPw1DihydXFqTzj-wgl3C5LYEJdKX",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction to the S User's Guide. / 1-1 \\
                 1.1. Outline; Suggested Approach. / 1-1 \\
                 1.2. Concepts in S: Expressions and Data. / 1-1 \\
                 1.3. Invoking S. / 1-2 \\
                 \\
                 2. Basic Use of S. / 2-1 \\
                 2.1. The Language. / 2-1 \\
                 2.1.1. Expressions; Operators; Functions. / 2-1 \\
                 2.1.2. Interacting with S: Errors; Interrupts; Help. /
                 2-3 \\
                 2.2. Data. / 2-5 \\
                 2.2.1. Data Values. / 2-5 \\
                 2.2.2. Vectors. / 2-5 \\
                 2.2.3. Data Input. / 2-6 \\
                 2.2.4. Databases. / 2-7 \\
                 2.2.5. Data Structures: Matrices and Time-Series. / 2-8
                 \\
                 2.3. Data Analysis. / 2-11 \\
                 2.3.1. Statistical Functions. / 2-11 \\
                 2.3.2. Data Manipulation. / 2-13 \\
                 2.3.3. Numerical Calculations. / 2-15 \\
                 2.4. Graphics. / 2-16 \\
                 2.3. Example. / 2-19 \\
                 \\
                 3. Advanced Use of S. / 3-1 \\
                 3.1. Language. / 3-1 \\
                 3.1.1. Extending the Language: Source and Sink; Macros.
                 / 3-1 \\
                 3.1.2. Applying Functions; Iteration. / 3-3 \\
                 3.1.3. Conditional expressions; compound expressions. /
                 3-6 \\
                 3.1.4. More on Arithmetic and Operators. / 3-7 \\
                 3.1.5. Numbered Components of a Structure. / 3-8 \\
                 3.1.6. Executing Commands on Invoking S. / 3-8 \\
                 3.1.7. Batch Execution of S. / 3-9 \\
                 3.1.8. Keeping Track of an Analysis: Diary. / 3-9 \\
                 3.1.9. Functional Form of Operations / 3-10 \\
                 3.2. Data. / 3-11 \\
                 3.2.1. Structures: Arrays; Vector Structures. / 3-11
                 \\
                 3.2.2. Prefixes. / 3-12 \\
                 3.2.3. Attaching Databases; Search Lists. / 3-13 \\
                 3.2.4. Moving Data between Computers; Nonstandard
                 Input. / 3-14 \\
                 3.2.5. NULL Data Type. / 3-16 \\
                 3.2.6. Categorical Variables. / 3-16 \\
                 3.2.7. Documenting Datasets and Macros. / 3-17 \\
                 3.3. Data Analysis. / 3-18 \\
                 3.3.1. Statistical Functions./ 3-18 \\
                 3.3.1.1. More on Regression and Models. / 3-18 \\
                 3.3.1.2. Probability and Quantile Functions. / 3-20 \\
                 3.3.1.3. Multivariate Analysis. / 3-20 \\
                 3.3.1.4. Matrix Methods; Linear Algebra. / 3-22 \\
                 3.3.2. Data Manipulation. / 3-22 \\
                 3.4. Graphics. / 3-23 \\
                 3.4.1. More High-Level Functions. / 3-23 \\
                 3.4.2. Contour and Perspective Plots of Surfaces. /
                 3-26 \\
                 3.4.3. Multivariate Plotting Functions. / 3-27 \\
                 3.4.4. Graphical Data Structures; Missing Values. /
                 3-29 \\
                 3.4.5. Graphical Input; Identify, Rdpen. / 3-30 \\
                 3.4.6. Graphical Parameters. / 3-30 \\
                 3.4.7. The Layout of Plots and Figures. / 3-33 \\
                 3.4.8. Building-up Plots. / 3-35 \\
                 3.4.9. Deferred Graphics. / 3-38 \\
                 \\
                 4. The S Macro Processor. / 4-1 \\
                 4.1. Macros in S. / 4-1 \\
                 4.2. Defining Macros. / 4-2 \\
                 4.3. Literals; Conditional Expansion. / 4-5 \\
                 4.4. Macros with Many Arguments. / 4-7 \\
                 4.5. User-Oriented Macros. / 4-9 \\
                 4.6. Temporary Definitions; Recursive Calls. / 4-11 \\
                 4.7. Built-In Macros and Special Constructions. / 4-12
                 \\
                 4.8. Examples of S Macros. / 4-13 \\
                 \\
                 5. Reference. / 5-1 \\
                 5.1. The Language: Syntax. / 5-1 \\
                 5.1.1. Function Calls and Commands. / 5-3 \\
                 5.1.2. Compound Expressions. / 5-4 \\
                 5.1.3. Continuation. / 5-4 \\
                 5.1.4. Reserved words. / 5-4 \\
                 5.2. Semantics. / 5-5 \\
                 5.2.1. Functions and Operators. / 5-5 \\
                 5.2.2. Side Effects: Database Changes and Parameters. /
                 5-7 \\
                 5.2.3. Compound Expressions. / 5-8 \\
                 5.2.4. Conditional Expressions; Iterative Expressions.
                 / 5-8 \\
                 5.3. Data Structures. / 5-9 \\
                 \\
                 6. Writing New Functions for S. / 6-1 \\
                 6.1. Design and Implementation of Simple S Functions. /
                 6-2 \\
                 6.1.1. Design of S Functions. / 6-2 \\
                 6.1.2. Arguments; the FUNCTION Statement. / 6-2 \\
                 6.1.3. Error Checking. / 6-3 \\
                 6.1.4. Dynamic and Static Data Structures. / 6-4 \\
                 6.1.5. Computations. / 6-5 \\
                 6.1.6. Creating New Functions. / 6-6 \\
                 6.1.7. Hints; Debugging. / 6-8 \\
                 6.2. Data Structures. / 6-10 \\
                 6.2.1. Data Values and Attributes. / 6-10 \\
                 6.2.2. Character Data and Character Attributes. / 6-10
                 \\
                 6.2.3. Missing Values. / 6-12 \\
                 6.2.4. Structures and Components. / 6-13 \\
                 6.2.5. Modes Computed at Execution. / 6-13 \\
                 6.3. Function Arguments. / 6-17 \\
                 6.3.1. Arguments in the FUNCTION Statement. / 6-17 \\
                 6.3.2. Interrupting and Resuming Argument Processing. /
                 6-18 \\
                 6.3.3. Arbitrarily Many Arguments. / 6-19 \\
                 6.3.4. Treating Structures Like Argument Lists. / 6-20
                 \\
                 6.4. Function Results and Related Statements. / 6-21
                 \\
                 6.4.1. The RETURN Statement. / 6-22 \\
                 6.4.2. CHAIN: Invoking Another Function. / 6-23 \\
                 6.4.3. INSERT: Building Structures. / 6-23 \\
                 6.5. Graphics Functions. / 6-24 \\
                 6.5.1. Declaring a Graphics Function. / 6-24 \\
                 6.5.2. Graphical Parameters. / 6-24 \\
                 6.5.3. Plotting Data Structure. / 6-25 \\
                 6.5.4. High Level Graphics Functions: SETUP and
                 LOGPLOT. / 6-25 \\
                 \\
                 7. Writing and Using Algorithms / 7-1 \\
                 2.1. The Algorithm Language: Basics. / 7-1 \\
                 7.1.1. Languages. / 7-1 \\
                 7.1.2. MAKE: Generating S Functions and Stand-Alone
                 Programs. / 7-1 \\
                 7.1.3. Error Handling. / 7-2 \\
                 7.1.4. Symbolic Constants; Declarations. / 7-3 \\
                 7.1.5. Debugging. / 7-3 \\
                 7.1.6. C Language Facilities. / 7-4 \\
                 7.2. Special Facilities. / 7-4 \\
                 7.2.1. Printing and Encoding. / 7-4 \\
                 7.2.1.1. Basic Message Printing. / 7-4 \\
                 7.2.1.2. Encoding. / 7-6 \\
                 7.2.1.3. Detailed Format Control. / 7-7 \\
                 7.2.1.4. Problems with Encoding. / 7-8 \\
                 7.2.2. Reading and Decoding. / 7-8 \\
                 7.2.2.1. Basic Reading of Data Items. / 7-9 \\
                 7.2.2.2. Line Input; End-of-File. / 7-10 \\
                 7.2.3. File Access; Standard Files. / 7-10 \\
                 7.2.4. Dynamic Storage. / 7-11 \\
                 7.2.5. Data Structures for S. / 7-12 \\
                 7.3. Available Algorithms. / 7-14 \\
                 7.3.1. Data Handling; Character Data. / 7-14 \\
                 7.3.2. Sort and Order. / 7-15 \\
                 7.3.3. Range of Data. / 7-16 \\
                 7.3.4. Probabilities; Quantiles; Pseudorandom Numbers.
                 / 7-17 \\
                 7.3.4.1. Available Algorithms. / 7-17 \\
                 7.3.4.2. New Pseudorandom Generators for S. / 7-17 \\
                 7.3.5. Matrices and Arrays. / 7-18 \\
                 \\
                 8. Graphical Algorithms. / 8-1 \\
                 8.1. Basic Concepts of Graphical Algorithms. / 8-1 \\
                 8.1.1. Figures and Plots. / 8-2 \\
                 8.1.2. User and Margin Coordinate Systems. / 8-2 \\
                 8.1.3. Graphical Parameters. / 8-3 \\
                 8.2. Creating Graphical Algorithms. / 8-4 \\
                 8.2.1. Initialization of Graphical Algorithms. / 8-4
                 \\
                 8.2.2. Setting-up Coordinate Systems and Axes. / 8-5
                 \\
                 8.2.3. Drawing the Picture./ 8-5 \\
                 8.2.4. Titles and Axis Labels./ 8-6 \\
                 8.2.5. Specifying and Querying Graphical Parameters. /
                 8-6 \\
                 8.2.6. Wrapping Up. / 8-8 \\
                 8.3. The Structure of a Graphical Algorithm. / 8-10 \\
                 8.3.1. High-Level Graphical Algorithms; S Functions. /
                 8-11 \\
                 8.3.2. Algorithms that Augment a Plot. / 8-14 \\
                 8.4. Advanced Graphical Algorithms. / 8-16 \\
                 8.4.1. Control of Figures, Plots, Margins. / 8-16 \\
                 8.4.2. Margins and Outer Margins. / 8-89 \\
                 8.4.3. Parameters of Physical Size. / 8-19 \\
                 8.4.4. Setting-up Coordinate Systems and Axes. / 8-20
                 \\
                 8.4.5. Summary of Graphical Parameters. / 8-22 \\
                 8.4.6. Graphical Input. / 8-24 \\
                 8.4.7. Debugging. / 8-24 \\
                 8.5. Available Graphical Subroutines. / 8-24 \\
                 8.6. Stand-Alone Graphical Algorithms. / 8-25 \\
                 8.7. Device Drivers. / 8-26 \\
                 8.7.1. Organization of Device Driver Routines. / 8-26
                 \\
                 8.7.2. Portability Considerations. / 8-29 \\
                 8.7.3. Control of Graphic Input. / 8-29 \\
                 8.7.4. Writing a Device Driver for S. / 8-29 \\
                 \\
                 9. S Detailed Documentation. \\
                 9.1. Function Documentation. \\
                 9.2. Topic --- Documentation Index. \\
                 2.3. System Macros Detailed Documentation. \\
                 9.4. System Datasets Detailed Documentation. \\
                 9.5. Algorithm Documentation. \\
                 9.6. Graphical Algorithm Documentation. \\
                 10. Index",
}

@Article{Calo:1981:DAT,
  author =       "S. B. Calo",
  title =        "Delay Analysis of a Two-Queue, Nonuniform Message
                 Channel",
  journal =      j-IBM-JRD,
  volume =       "25",
  number =       "6",
  pages =        "915--929",
  month =        nov,
  year =         "1981",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  MRclass =      "60K25 (68A05 94A99)",
  MRnumber =     "84f:60122",
  bibdate =      "Mon Feb 12 09:58:53 MST 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "465.68016",
  abstract =     "A Message Channel is defined as a tandem connection of
                 single server queues in which the successive service
                 times experienced by an particular customer are scaled
                 versions of the same random variable, and thus it
                 serves as a model for sparsely connected
                 store-and-forward data communications networks (or
                 network segments) where messages typically preserve
                 their lengths as they traverse the system. A particular
                 instance of such a nonstandard queueing model is
                 analyzed in this paper. The system consists of two
                 single server queues in tandem subject to a Poisson
                 arrival process (at the first queue) and providing
                 service according to scaled versions of a sequence of
                 two-level, discrete random variables. A set of
                 recursive equations that can be used to solve the model
                 for any given scaling factor at the second queue
                 (normalized with respect to the first queue service) is
                 explicitly derived.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240C (Queueing theory); B6150 (Communication system
                 theory)C1140C (Queueing theory); C5600 (Data
                 communication equipment and techniques)",
  classification = "723",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  journalabr =   "IBM J Res Dev",
  keywords =     "computer networks; computers; data communication
                 systems; equations; equilibrium mean cumulative
                 waiting; message switching; networks; Poisson arrival
                 process; queueing; queueing model; recursive; service
                 times; store-and-forward data communications; tandem
                 connection; theory; two-queue, nonuniform message
                 channel",
  treatment =    "A Application; T Theoretical or Mathematical",
  xxpages =      "915--930",
}

@Article{Deak:1981:EMR,
  author =       "I. De{\'a}k",
  title =        "An economical method for random number generation and
                 a normal generator",
  journal =      j-COMPUTING,
  volume =       "27",
  number =       "2",
  pages =        "113--121",
  month =        jun,
  year =         "1981",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (68J05)",
  MRnumber =     "82m:65006",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Hung Acad of Sci, Comput \& Auto Inst, Budapest",
  classification = "922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "mathematical statistics",
}

@Article{Devroye:1981:CGP,
  author =       "Luc Devroye",
  title =        "The computer generation of {Poisson} random
                 variables",
  journal =      j-COMPUTING,
  volume =       "26",
  number =       "3",
  pages =        "197--207",
  month =        sep,
  year =         "1981",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "60-04 (60E05 65C10 68J05)",
  MRnumber =     "82g:60003",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "McGill Univ, Montreal, Que, Can",
  classification = "922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "mathematical statistics",
}

@Article{Devroye:1981:CGR,
  author =       "Luc Devroye",
  title =        "On the computer generation of random variables with a
                 given characteristic function",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "7",
  number =       "6",
  pages =        "547--552",
  month =        "????",
  year =         "1981",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 18:51:21 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122181900389",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221/",
}

@Article{Diaconis:1981:GRP,
  author =       "Persi Diaconis and Mehrdad Shahshahani",
  title =        "Generating a random permutation with random
                 transpositions",
  journal =      j-Z-WAHRSCHEINLICHKEITSTHEOR-VERW-GEB,
  volume =       "57",
  number =       "2",
  pages =        "159--179",
  month =        "????",
  year =         "1981",
  CODEN =        "ZWVGAA",
  DOI =          "https://doi.org/10.1007/BF00535487",
  ISSN =         "0044-3719",
  ISSN-L =       "0044-3719",
  MRclass =      "60C05 (60J15)",
  MRnumber =     "626813 (82h:60024)",
  MRreviewer =   "Lars Holst",
  bibdate =      "Sat Apr 26 19:27:30 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/z-wahrscheinlichkeits-theor-verw-geb.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00535487",
  acknowledgement = ack-nhfb,
  fjournal =     "Zeitschrift f{\"u}r Wahrscheinlichkeitstheorie und
                 verwandte Gebiete",
  journal-URL =  "http://link.springer.com/journal/440",
}

@Article{Dudewicz:1981:EBT,
  author =       "Edward J. Dudewicz and Edward C. van der Meulen",
  title =        "Entropy-Based Tests of Uniformity",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "76",
  number =       "376",
  pages =        "967--974",
  month =        dec,
  year =         "1981",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62G10",
  MRnumber =     "83e:62058",
  bibdate =      "Wed Jan 25 08:05:56 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314260;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287597",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Book{Dudewicz:1981:HRN,
  author =       "Edward J. Dudewicz and Thomas G. Ralley",
  title =        "The handbook of random number generation and testing
                 with {TESTRAND} computer code",
  volume =       "4",
  publisher =    "American Sciences Press",
  address =      "Columbus, OH, USA",
  pages =        "xi + 634",
  year =         "1981",
  ISBN =         "0-935950-01-X (paperback)",
  ISBN-13 =      "978-0-935950-01-4 (paperback)",
  LCCN =         "QA298 .D8",
  bibdate =      "Sun Apr 26 12:51:01 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "American series in mathematical and management
                 sciences",
  acknowledgement = ack-nhfb,
  subject =      "Testrand; TESTRAND; Monte Carlo method; computer
                 programs; random number generators",
}

@InProceedings{Fishman:1981:SCM,
  author =       "George S. Fishman and Louis R. {Moore III}",
  editor =       "W. F. Eddy",
  booktitle =    "Computer Science and Statistics: Proc. of the 13th
                 Symposium on the Interface",
  title =        "In Search of Correlation in Multiplicative
                 Congruential Generators with Modulus $ 2^{31} - 1 $",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "??--??",
  year =         "1981",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Jan 05 14:29:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Friedman:1981:NPP,
  author =       "Jerome H. Friedman and Margaret H. Wright",
  title =        "A Nested Partitioning Procedure for Numerical Multiple
                 Integration",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "76--92",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355934.355939",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65D30",
  MRnumber =     "83d:65058",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "bounds-constrained optimization; Monte Carlo
                 quadrature; numerical integration; recursive
                 partitioning",
  reviewer =     "C. Dagnino",
}

@InProceedings{Gentle:1981:PCR,
  author =       "James E. Gentle",
  title =        "Portability considerations for random number
                 generators",
  crossref =     "Eddy:1981:CSS",
  pages =        "158--164",
  year =         "1981",
  bibdate =      "Mon Dec 08 13:48:15 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Grafton:1981:SAA,
  author =       "R. G. T. Grafton",
  title =        "Statistical Algorithms: {Algorithm AS 157}: The
                 Runs-Up and Runs-Down Tests",
  journal =      j-APPL-STAT,
  volume =       "30",
  number =       "1",
  pages =        "81--85",
  month =        mar,
  year =         "1981",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:06 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/as1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://lib.stat.cmu.edu/apstat/157",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "testing of random-number generators",
}

@Article{Green:1981:BRBa,
  author =       "Bert F. Green",
  title =        "Book Review: {{\booktitle{Randomization Tests}}, by
                 Eugene S. Edgington}",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "76",
  number =       "374",
  pages =        "495--495",
  month =        jun,
  year =         "1981",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:56 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314258;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287866",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Greenwood:1981:PFA,
  author =       "J. Arthur Greenwood",
  title =        "A portable formulation of the alias method for random
                 numbers with discrete distributions",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "10",
  number =       "6",
  pages =        "649--655",
  year =         "1981",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610918108812241",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:16 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@TechReport{Ide:1981:EZM,
  author =       "H. D. Ide and J. S{\"a}gebarth",
  title =        "{Zur Erzeugung von Zufallszahlen mittels linearer
                 Rekursion}. ({German}) [{Generation} of random numbers
                 using linear recursion]",
  institution =  "Lehrstuhl f{\"u}r Elektronische Systeme und
                 Vermittlungstechnik, Universit{\"a}t Dortmund",
  address =      "Dortmund, West Germany",
  pages =        "21",
  year =         "1981",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "evaluation; grid structure; linear congruential
                 generator; reliability; two-sample problem",
  language =     "German",
}

@Article{Kaplan:1981:ERS,
  author =       "Howard L. Kaplan",
  title =        "Effective random seeding of random number generators",
  journal =      j-BEHAV-RES-METH-INSTR,
  volume =       "13",
  number =       "2",
  pages =        "283--289",
  month =        jan,
  year =         "1981",
  CODEN =        "BRMIAC",
  DOI =          "https://doi.org/10.3758/BF03207952",
  ISSN =         "0005-7878",
  bibdate =      "Mon Jan 16 21:21:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/0146m73q44251315/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods and Instrumentation",
  remark =       "The author discusses the difficulty in generating
                 three or more independent streams from a single
                 random-number generator.",
}

@Article{Kemp:1981:EGL,
  author =       "A. W. Kemp",
  title =        "Efficient generation of logarithmically distributed
                 pseudo-random variables",
  journal =      j-APPL-STAT,
  volume =       "30",
  number =       "3",
  pages =        "249--253",
  year =         "1981",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:11 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240Z (Other topics in statistics); C1140Z (Other
                 topics in statistics)",
  corpsource =   "Univ. of Bradford, Bradford, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "contexts; ecological; logarithmically distributed;
                 one-line algorithm LB; pseudo-random variables;
                 sampling; search; statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kirkpatrick:1981:VFS,
  author =       "S. Kirkpatrick and E. Stoll",
  title =        "A very fast shift-register sequence random number
                 generator",
  journal =      j-J-COMPUT-PHYS,
  volume =       "40",
  number =       "2",
  pages =        "517--526",
  month =        apr,
  year =         "1981",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(81)90227-8",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Sep 17 13:59:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999181902278",
  abstract =     "This article describes some very simple, as well as
                 some quite sophisticated, tests that shed light on the
                 suitability of certain random number generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Kozlov:1981:ECI,
  author =       "G. A. Kozlov",
  title =        "The Error in Calculating an Integral by the
                 {Monte--Carlo} Method Using a Random Code Generator
                 with Independent Digits",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "25",
  number =       "2",
  pages =        "401--408",
  month =        "????",
  year =         "1981",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1125052",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:38:23 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/25/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1981",
}

@Article{Kronmal:1981:VAR,
  author =       "Richard A. Kronmal and Arthur V. {Peterson, Jr.}",
  title =        "A variant of the acceptance-rejection method for
                 computer generation of random variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "76",
  number =       "374",
  pages =        "446--451",
  month =        jun,
  year =         "1981",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62E30 (65C10 68J05)",
  MRnumber =     "82h:62037",
  bibdate =      "Fri Jan 6 09:50:07 2012",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1981.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See corrigendum \cite{Kronmal:1982:CVA}.",
  URL =          "http://www.jstor.org/stable/2287848",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7547",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  location =     "SEL: Wi",
  revision =     "16/01/94",
}

@Article{Lakhan:1981:GAP,
  author =       "V. Chris Lakhan",
  title =        "Generating autocorrelated pseudo-random numbers with
                 specific distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "12",
  number =       "3--4",
  pages =        "303--309",
  month =        "????",
  year =         "1981",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658108810463",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:28:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949658108810463",
  abstract =     "An easily implemented and computationally efficient
                 procedure is presented for the generation of
                 autocorrelated pseudo-random numbers with specific
                 probability distributions. A plot illustrates the
                 relationship among the autocorrelations of the uniform,
                 Rayleigh, and exponential distributions corresponding
                 to a given autocorrelation in the normal generating
                 distribution.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Landauer:1981:RNF,
  author =       "Edwin G. Landauer",
  title =        "Random numbers: finding a good, low cost generator",
  journal =      j-INT-J-MATH-EDU-SCI-TECH,
  volume =       "12",
  number =       "1",
  pages =        "1--8",
  month =        "????",
  year =         "1981",
  CODEN =        "IJMEBM",
  DOI =          "https://doi.org/10.1080/0020739810120102",
  ISSN =         "0020-739X (print), 1464-5211 (electronic)",
  ISSN-L =       "0020-739X",
  bibdate =      "Tue Feb 07 08:08:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/0020739810120102",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Mathematical Education in
                 Science and Technology",
  journal-URL =  "http://www.tandfonline.com/loi/tmes20",
  onlinedate =   "09 Jul 2006",
}

@Article{Menzefricke:1981:BAC,
  author =       "Ulrich Menzefricke",
  title =        "A {Bayesian} analysis of a change in the precision of
                 a sequence of independent normal random variables at an
                 unknown time point",
  journal =      j-APPL-STAT,
  volume =       "30",
  number =       "2",
  pages =        "141--146",
  year =         "1981",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  MRclass =      "62F15",
  MRnumber =     "82j:62021",
  bibdate =      "Sat Apr 21 10:23:08 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0240 (Probability and statistics); C1140Z (Other
                 topics in statistics)",
  corpsource =   "Univ. of Toronto, Toronto, Ont., Canada",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  keywords =     "Bayes methods; Bayesian analysis; change point
                 problems; independent normal random variables; unknown
                 time point; variance inverse",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Nekrutkin:1981:JSM,
  author =       "V. V. Nekrutkin",
  title =        "Justification of the selection method for a
                 multiplicative pseudorandom number generator",
  journal =      "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  volume =       "21",
  number =       "5",
  pages =        "25--33",
  month =        "????",
  year =         "1981",
  CODEN =        "????",
  ISSN =         "0041-5553 (print), 1878-2930 (electronic)",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Jan 16 21:22:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Preece:1981:DFD,
  author =       "D. A. Preece",
  title =        "Distributions of Final Digits in Data",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "30",
  number =       "1",
  pages =        "31--60",
  month =        mar,
  year =         "1981",
  CODEN =        "????",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Wed Nov 23 12:19:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2987702",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
  remark =       "This paper extends previous work \cite{Yule:1927:RS}
                 on human bias in the recording of last digits in
                 measurements, or from roundings, or from later scale
                 conversions, and how such bias can be detected.",
}

@InCollection{Rubinstein:1981:RNG,
  author =       "Reuven Y. Rubinstein",
  title =        "Random Number Generation",
  crossref =     "Rubinstein:1981:SMC",
  pages =        "??--??",
  year =         "1981",
  DOI =          "https://doi.org/10.1002/9780470316511.ch2",
  bibdate =      "Mon Jan 16 11:46:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://onlinelibrary.wiley.com/doi/10.1002/9780470316511.ch2/summary",
  acknowledgement = ack-nhfb,
}

@Article{Schatte:1981:RVL,
  author =       "P. Schatte",
  title =        "On random variables with logarithmic mantissa
                 distribution relative to several bases",
  journal =      j-ELEK-INFO-KYBER,
  volume =       "17",
  number =       "??",
  pages =        "293--295",
  month =        "????",
  year =         "1981",
  CODEN =        "EIVKAX",
  ISSN =         "0013-5712",
  bibdate =      "Sat Nov 12 15:53:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Elektron. Inform. verarb. Kybernet. EIK",
}

@TechReport{Schmeiser:1981:PRV,
  author =       "B. W. Schmeiser and V. Kachitvichyanukul",
  title =        "{Poisson} Random Variate Generation",
  type =         "Research Memorandum",
  number =       "81-4",
  institution =  "School of Industrial Engineering, Purdue University",
  address =      "West Lafayette, IN, USA",
  year =         "1981",
  bibdate =      "Thu Jan 05 11:48:09 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tadikamalla:1981:CGG,
  author =       "P. R. Tadikamalla and M. E. Johnson",
  title =        "A Complete Guide to Gamma Variate Generation",
  journal =      j-AM-J-MATH-MANAGE-SCI,
  volume =       "1",
  number =       "??",
  pages =        "78--95",
  month =        "????",
  year =         "1981",
  CODEN =        "AMMSDX",
  ISSN =         "0196-6324",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Journal of Mathematical and Management
                 Sciences",
}

@Article{Tadikamalla:1981:FDO,
  author =       "Pandu R. Tadikamalla",
  title =        "On a family of distributions obtained by the
                 transformation of the gamma distribution",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "13",
  number =       "3--4",
  pages =        "209--214",
  year =         "1981",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658108810497",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:10:51 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Ahrens:1982:CGP,
  author =       "J. H. Ahrens and U. Dieter",
  title =        "Computer Generation of {Poisson} Deviates from
                 Modified Normal Distributions",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "163--179",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/355993.355997",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (60-04 62E99)",
  MRnumber =     "84c:65016",
  bibdate =      "Mon Aug 29 23:31:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "6930",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "acceptance-rejection method; algorithms; Poisson
                 distribution; theory",
  location =     "SEL: Wi",
  references =   "0",
  reviewer =     "James E. Gentle",
  revision =     "16/01/94",
}

@Article{Ahrens:1982:GGV,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "Generating {Gamma} variates by a modified rejection
                 technique",
  journal =      j-CACM,
  volume =       "25",
  number =       "1",
  pages =        "47--54",
  month =        jan,
  year =         "1982",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/360000/358390",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65U05 (65C10)",
  MRnumber =     "83f:65223",
  bibdate =      "Tue Dec 26 13:35:07 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "A suitable square root transformation of a gamma
                 random variable with mean $ a \ge 1 $ yields a
                 probability density close to the standard normal
                 density. A modification of the rejection technique then
                 begins by sampling from the normal distribution, being
                 able to accept and transform the initial normal
                 observation quickly at least 85 percent of the time (95
                 percent if $ a \ge 4 $ ). When used with efficient
                 subroutines for sampling from the normal and
                 exponential distributions, the resulting accurate
                 method is significantly faster than competing
                 algorithms.",
  country =      "USA",
  descriptors =  "RNG; probability; statistics; distribution; gamma
                 distribution; Poisson distribution; variance; normal
                 distribution",
  enum =         "49",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  references =   "24",
}

@Article{Atkinson:1982:SGI,
  author =       "A. C. Atkinson",
  title =        "The simulation of generalized inverse {Gaussian} and
                 hyperbolic random variables",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "3",
  number =       "4",
  pages =        "502--515",
  month =        dec,
  year =         "1982",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "84b:65011",
  MRreviewer =   "James E. Gentle",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C7310
                 (Mathematics computing)",
  corpsource =   "Imperial Coll., London, UK",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "algorithms; digital simulation; generalised inverse
                 Gaussian distribution; multivariate generalized
                 hyperbolic distributions; probability; simulation;
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baccelli:1982:DBR,
  author =       "F. Baccelli and E. G. Coffman",
  title =        "A data base replication analysis using an {M\slash
                 M\slash m} queue with service interruptions",
  journal =      j-SIGMETRICS,
  volume =       "11",
  number =       "4",
  pages =        "102--107",
  month =        dec,
  year =         "1982",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/1035332.1035309",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 10:59:37 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "A study of file replication policies for distributed
                 data bases will be approached through the analysis of
                 an M/M/m queue subjected to state-independent,
                 preemptive interruptions of service. The durations of
                 periods of interruption constitute a sequence of
                 independent, identically distributed random variables.
                 Independently, the times measured from the termination
                 of one period of interruption to the beginning of the
                 next form a sequence of independent, exponentially
                 distributed random variables. Preempted customers
                 resume service at the terminations of interrupt
                 periods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Bartels:1982:RVN,
  author =       "Robert Bartels",
  title =        "The Rank Version of {von Neumann}'s Ratio Test for
                 Randomness",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "77",
  number =       "377",
  pages =        "40--46",
  month =        mar,
  year =         "1982",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Thu Jan 05 10:41:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287767",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@InProceedings{Blum:1982:HGC,
  author =       "Manuel Blum and Silvio Micali",
  title =        "How to Generate Cryptographically Strong Sequences of
                 Pseudo-Random Bits",
  crossref =     "IEEE:1982:ASF",
  pages =        "112--117",
  year =         "1982",
  DOI =          "https://doi.org/10.1109/SFCS.1982.72",
  bibdate =      "Wed Dec 21 06:47:00 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/focs1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxpages =      "464--479",
}

@TechReport{Crigler:1982:RCP,
  author =       "J. R. Crigler",
  title =        "{RANDOM}: a computer program for evaluating
                 pseudo-uniform random number generators",
  type =         "U.S. Government Report",
  number =       "AD-A 118412/6",
  institution =  "Naval Surface Weapons Center (K 106)",
  address =      "Dahlgren, VA 22448, USA",
  pages =        "v + 41 + 3",
  month =        aug,
  year =         "1982",
  bibdate =      "Mon Jan 16 21:13:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a118412.pdf",
  abstract =     "The RANDOM computer program evaluates the usefulness
                 of pseudo-uniform random number generators. RANDOM was
                 written in FORTRAN IV for the CDC 6700 computer system
                 at the Naval Surface Weapons Center, Dahlgren. This
                 program can also be used to evaluate candidate
                 pseudo-uniform random number generators designed for
                 use on any other computer system. RANDOM subjects the
                 candidate generator to 11 different statistical tests
                 designed to detect departures from randomness. These
                 tests serve as useful tools for determining the
                 adequacy of a candidate generator.",
  acknowledgement = ack-nhfb,
}

@Article{Devroye:1982:NAR,
  author =       "Luc Devroye",
  title =        "A note on approximations in random variate
                 generation",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "14",
  number =       "2",
  pages =        "149--158",
  month =        "????",
  year =         "1982",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658208810536",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Mon Jan 16 21:14:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@TechReport{DiDonato:1982:FSP,
  author =       "A. R. DiDonato",
  title =        "Five Statistical Programs in {Basic} for Desktop
                 Computers",
  type =         "Report",
  number =       "NSWC TR 83-13",
  institution =  "Naval Surface Weapons Center (Code K104)",
  address =      "Dahlgren, VA 22448, USA",
  pages =        "vi + 96 + 4",
  month =        nov,
  year =         "1982",
  bibdate =      "Wed Nov 12 15:50:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a158111.pdf",
  abstract =     "Five computer programs especially useful in statistics
                 are described and listings in BASIC are given. The
                 listings are generated using the Hewlett-Packard 85 and
                 9845 desktop computers. The programs supply the values
                 of: (1) the integral of the bivariate circular normal
                 distribution (ND) over an offset circle; (2) the
                 integral of the bivariate elliptical ND over a circle
                 centered at the origin; (3) the integral of the
                 bivariate elliptical ND over an offset circle; (4) the
                 integral of the bivariate correlated elliptical ND over
                 an arbitrary polygon; (5) the maximum likelihood.
                 estimates, obtained from quantal response experiments,
                 for the mean and variance of a ND.",
  acknowledgement = ack-nhfb,
}

@Article{Dykstra:1982:MLE,
  author =       "Richard L. Dykstra",
  title =        "Maximum likelihood estimation of the survival
                 functions of stochastically ordered random variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "77",
  number =       "379",
  pages =        "621--628",
  month =        sep,
  year =         "1982",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62F10 (62G05)",
  MRnumber =     "84h:62039",
  MRreviewer =   "A. C. Cohen",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2287725",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Faure:1982:DSA,
  author =       "H. Faure",
  title =        "Discr{\'e}pance des suites associ{\'e}es {\`a} un
                 syst{\`e}me de num{\'e}ration en dimension {$S$}.
                 ({French}) [{Discrepancy} of sequences associated with
                 a numeration system in dimension {$S$}]",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "61",
  number =       "??",
  pages =        "337--351",
  month =        "????",
  year =         "1982",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Wed Feb 22 10:17:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0442.10035",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
  language =     "German",
}

@Article{Fishman:1982:SEM,
  author =       "George S. Fishman and Louis R. Moore",
  title =        "A Statistical Evaluation of Multiplicative
                 Congruential Random Number Generators with Modulus $
                 2^{31} - 1 $",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "77",
  number =       "377",
  pages =        "129--136",
  month =        mar,
  year =         "1982",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:56 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314261;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://links.jstor.org/sici?sici=0162-1459%28198203%2977%3A377%3C129%3AASEOMC%3E2.0.CO%3B2-Q;
                 http://www.jstor.org/stable/2287778",
  abstract =     "This article presents the results of empirically
                 testing 16 alternative multipliers for a multiplicative
                 congruential random number generator with modulus $
                 2^{31} - 1 $. Two of the multipliers are in common use,
                 six are the best of 50 candidate multipliers according
                 to the theoretical spectral and lattice tests, and
                 eight are the worst, with regard to $2$-tuples, among
                 the 50. The test results raise serious doubts about
                 several of the multipliers, including one in common
                 use. The tests were also applied to a well-known
                 theoretically poor generator, RANDU, and gave strong
                 empirical evidence of its inadequacy. Since comparison
                 of the results of the first eight multipliers with
                 those for the eight worst multipliers failed to show
                 any apparent gross differences, one may want to relax
                 the currently employed stringent criteria for
                 acceptable performance on the lattice and spectral
                 tests.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  keywords =     "congruential generator; lattice test; random number
                 generation; runs test; spectral test",
}

@Article{Fredricksen:1982:SFL,
  author =       "Harold Fredricksen",
  title =        "A Survey of Full Length Nonlinear Shift Register Cycle
                 Algorithms",
  journal =      j-SIAM-REVIEW,
  volume =       "24",
  number =       "2",
  pages =        "195--221",
  month =        apr,
  year =         "1982",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1024041",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "68C05 (05A05 10L99 94B60)",
  bibdate =      "Sat Mar 29 09:53:27 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/24/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://www.jstor.org/stable/2029360",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "April 1982",
}

@Article{Gabriel:1982:VPI,
  author =       "Richard Gabriel",
  title =        "{Verschl{\"u}sselungsabbildungen mit Pseudo-Inversen,
                 Zufallsgeneratoren und T{\"a}felungen}. ({German})
                 [{Encryption} mapping with pseudoinverses, random
                 generators and tilings]",
  journal =      "Kybernetika (Prague)",
  volume =       "18",
  number =       "6",
  pages =        "485--504",
  year =         "1982",
  CODEN =        "KYBNAI",
  ISSN =         "0023-5954",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "85a:94023",
  bibdate =      "Fri Oct 25 18:39:09 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Kybernetika",
  language =     "German",
}

@Book{Golomb:1982:SRS,
  author =       "Solomon W. (Solomon Wolf) Golomb",
  title =        "Shift register sequences",
  publisher =    pub-AEGEAN-PARK,
  address =      pub-AEGEAN-PARK:adr,
  edition =      "Revised",
  pages =        "xvi + 247",
  year =         "1982",
  ISBN =         "0-89412-048-4 (paperback)",
  ISBN-13 =      "978-0-89412-048-0 (paperback)",
  LCCN =         "QA267.5.S4 G6 1982",
  bibdate =      "Sat Sep 17 13:57:12 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Portions co-authored by Lloyd R. Welch, Richard M.
                 Goldstein and Alfred W. Hales.",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Switching theory; Sequential machine
                 theory; Shift registers",
}

@Article{Houle:1982:CGD,
  author =       "P. A. Houle",
  title =        "Comment on gamma deviate generation",
  journal =      j-CACM,
  volume =       "25",
  number =       "10",
  pages =        "747--748",
  month =        oct,
  year =         "1982",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Dec 26 16:39:57 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  descriptors =  "RVG",
  enum =         "7409",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  references =   "0",
}

@Article{Kashiwagi:1982:SPT,
  author =       "H. Kashiwagi",
  title =        "On some properties of {TLP} random numbers generated
                 by $m$-sequence",
  journal =      j-TRANS-SOC-INST-CONTROL-ENG,
  volume =       "18",
  number =       "??",
  pages =        "828--832",
  month =        "????",
  year =         "1982",
  CODEN =        "TSICA9",
  ISSN =         "0453-4654",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the Society of Instrument and Control
                 Engineers",
  language =     "Japanese",
}

@Article{Kronmal:1982:CVA,
  author =       "Richard A. Kronmal and Arthur V. {Peterson, Jr.}",
  title =        "Corrigendum: {``A variant of the acceptance-rejection
                 method for computer generation of random variables''
                 [J. Amer. Statist. Assoc. {\bf 76} (1981), no. 374,
                 446--451, MR 82h:62037]}",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "77",
  number =       "380",
  pages =        "954--954",
  month =        dec,
  year =         "1982",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62E25 (65C10 68J05)",
  MRnumber =     "84d:62047",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kronmal:1981:VAR}.",
  URL =          "http://www.jstor.org/stable/2287364",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Book{Law:1982:SMA,
  author =       "Averill M. Law and W. David Kelton",
  title =        "Simulation modeling and analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiv + 400",
  year =         "1982",
  ISBN =         "0-07-036696-9",
  ISBN-13 =      "978-0-07-036696-1",
  LCCN =         "QA76.9.C65 L38",
  bibdate =      "Mon Jan 2 15:04:33 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in industrial engineering and
                 management science",
  acknowledgement = ack-nhfb,
  remark =       "See \cite{Law:1991:SMA,Law:2000:SMA,Law:2006:SMA} for
                 other editions.",
  subject =      "Digital computer simulation",
}

@Article{Lenstra:1982:FPR,
  author =       "Arjen K. Lenstra and H. W. {Lenstra, Jr.} and L.
                 Lov{\'a}sz",
  title =        "Factoring polynomials with rational coefficients",
  journal =      j-MATH-ANN,
  volume =       "261",
  number =       "4",
  pages =        "515--534",
  month =        dec,
  year =         "1982",
  CODEN =        "MAANA3",
  DOI =          "https://doi.org/10.1007/BF01457454",
  ISSN =         "0025-5831 (print), 1432-1807 (electronic)",
  ISSN-L =       "0025-5831",
  bibdate =      "Sat Mar 17 06:59:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/lh1m24436431g068/",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematische Annalen",
  journal-URL =  "http://link.springer.com/journal/208",
}

@TechReport{Marsaglia:1982:CSA,
  author =       "J. C. Marsaglia",
  title =        "Computer Studies of the {Anderson--Darling}
                 statistic",
  type =         "Technical Report",
  number =       "CS-82-096",
  institution =  "Computer Science Department, Washington State
                 University",
  address =      "Pullman, WA, USA",
  month =        "????",
  year =         "1982",
  bibdate =      "Tue Apr 17 07:47:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Meyers:1982:CDR,
  author =       "M. H. Meyers",
  title =        "Computing the Distribution of a Random Variable via
                 {Gaussian} Quadrature Rules",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "61",
  number =       "9",
  pages =        "2245--2261",
  month =        nov,
  year =         "1982",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:56 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1982/BSTJ.1982.6109.html;
                 http://www.alcatel-lucent.com/bstj/vol61-1982/bstj-vol61-issue09.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol61/bstj61-9-2245.pdf;
                 http://www.alcatel-lucent.com/bstj/vol61-1982/articles/bstj61-9-2245.pdf",
  abstract =     "Using the technique of Gaussian quadrature rules, a
                 new estimator is proposed for approximating the
                 distribution of a random variable given only a finite
                 number of its moments. The estimator is shown by
                 numerous examples to be accurate on the tails of both
                 continuous and discrete distributions. Efficient
                 algorithms exist for computing the estimator from the
                 first $ 2 N $ moments of the random variable. A robust
                 implementation of the estimator is presented, along
                 with rules that provide additional protection against
                 computer roundoff errors.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}

@InProceedings{Niederreiter:1982:STT,
  author =       "H. Niederreiter",
  title =        "Statistical tests for {Tausworthe} pseudorandom
                 numbers",
  crossref =     "Grossmann:1982:PSI",
  pages =        "265--274",
  year =         "1982",
  bibdate =      "Mon Jan 16 21:17:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Peterson:1982:MMC,
  author =       "Arthur V. {Peterson, Jr.} and Richard A. Kronmal",
  title =        "On mixture methods for the computer generation of
                 random variables",
  journal =      j-AMER-STAT,
  volume =       "36",
  number =       "3",
  pages =        "184--191",
  month =        aug,
  year =         "1982",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "65C10",
  MRnumber =     "83i:65009",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C7310
                 (Mathematics computing)",
  corpsource =   "Dept. of Biostatistics, Univ. of Washington, Seattle,
                 WA, USA",
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
  keywords =     "acceptance-rejection method; computer generation;
                 general mixture method; natural sciences computing;
                 random number generation; random variables;
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Plumstead:1982:ISG,
  author =       "Joan Boyar Plumstead",
  title =        "Inferring a sequence generated by a linear
                 congruence",
  crossref =     "IEEE:1982:ASF",
  pages =        "153--159",
  year =         "1982",
  bibdate =      "Wed Jun 22 18:26:09 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Suppose it is known that $ \{ X_0, X_1, \ldots {}, X_n
                 \} $ is produced by a pseudo-random number generator of
                 the form $ X_{i + 1} = a X_i + b \bmod m $, but $a$,
                 $b$, and $m$ are unknown. Can one efficiently predict
                 the remainder of the sequence with knowledge of only a
                 few elements from that sequence? This question is
                 answered in the affirmative and an algorithm is
                 given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithm design and analysis; computer science;
                 cryptography; data analysis; error correction;
                 inference algorithms; power generation; random number
                 generation; sections; tiles",
}

@Article{Rizzi:1982:GPB,
  author =       "Alfredo Rizzi",
  title =        "The generation of pseudorandom binary digits by
                 primitive polynomes",
  journal =      j-STATISTICA-BOLOGNA,
  volume =       "42",
  number =       "??",
  pages =        "193--207",
  month =        "????",
  year =         "1982",
  CODEN =        "????",
  ISSN =         "0390-590X (print), 1973-2201 (electronic)",
  ISSN-L =       "0390-590X",
  bibdate =      "Mon Jan 16 21:17:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistica (Bologna)",
  language =     "Italian",
  xxnote =       "Find original title??",
}

@Article{Roberts:1982:ITN,
  author =       "C. S. Roberts",
  title =        "Implementing and Testing New Versions of a Good,
                 48-Bit, Pseudo-Random Number Generator",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "61",
  number =       "8",
  pages =        "2053--2063",
  month =        oct,
  year =         "1982",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580",
  bibdate =      "Tue Nov 9 11:15:56 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1982/BSTJ.1982.6108.html;
                 http://www.alcatel-lucent.com/bstj/vol61-1982/bstj-vol61-issue08.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol61/bstj61-8-2053.pdf;
                 http://www.alcatel-lucent.com/bstj/vol61-1982/articles/bstj61-8-2053.pdf",
  abstract =     "In this paper we describe the design, testing, and use
                 of {\tt drand48} --- a good, pseudo-random number
                 generator based upon the linear congruential algorithm
                 and 48-bit integer arithmetic. The {\tt drand48}
                 subroutine is callable from C-language programs and is
                 available in the subroutine library of the UNIX
                 operating system. Versions coded in assembly language
                 now exist for both the PDP-11 and VAX-11 computers; a
                 version coded in a ``portable'' dialect of C language
                 has been produced by Rosler for the Western Electric
                 3B20 and other machines. Given the same initialization
                 value, all these versions produce the identical
                 sequence of pseudo-random numbers. Versions of {\tt
                 drand48} in the assembly language of other computers or
                 for other programming languages clearly could be
                 implemented, and some output results have been
                 tabulated to aid in testing and debugging such newly
                 coded subroutines. Timing results for {\tt drand48} on
                 the PDP-11/ 45, the PDP-11/70, the VAX-11/750, and the
                 VAX-11/78O are also presented and compared.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
  remark =       "This paper describes the {\tt drand48()} generator
                 family, which is widely implemented on Unix systems,
                 and is standardized in IEEE Std 1003.1-2001, {\em
                 Portable Operating System Interface (POSIX)}.
                 Curiously, this paper is not mentioned in that
                 Standard, or in 1997-vintage FreeBSD source code for
                 this family, or in current Unix manual pages for {\tt
                 drand48()}.\par

                 The {\tt drand48()} code uses a standard linear
                 congruential generator, defined by $ X_{n + 1} = (a X_n
                 + c) \bmod m $, with $ n \geq 0 $, $ a = 0 x5 \, d e e
                 c \, e66 d = 0 o273 \, 673 \, 163 \, 155 = 25 \, 214 \,
                 903 \, 917 $, $ c = 0 x b = 0 o13 = 11 $, and $ m =
                 2^{48} $, giving a period of $ 2^{48} = 281 \, 474 \,
                 976 \, 710 \, 656 $. Timing tests using a C {\tt
                 main()} program given in the paper, with hand-coded
                 assembly-language library implementations of the
                 generator on five PDP-11 and VAX models showed times
                 from 440 sec (PDP-11/45) to 96 sec (VAX-11/780) for $
                 10^6 $ output pseudorandom numbers.

                 Timing tests using the program in this paper on
                 2010-vintage AMD and Intel x86\_64 CPUs show a speedup
                 of about 2400 times over the best 1977-vintage
                 VAX-11/780 times, suggesting that the period of the
                 {\tt drand48()} generator could be reached in about
                 three months. There are well-understood, and
                 unavoidable, $n$-step correlations (for some, possibly
                 large, and possibly as-yet-unknown, $n$ ) in linear
                 congruential generators, as discovered by George
                 Marsaglia and described in his famous paper ``Random
                 numbers fall mainly in the planes'' (Proceedings of the
                 National Academy of Science of the USA, {\bf 61}(1)
                 25--28, 15 September 1968). The availability of other
                 generator families developed since about 1990 that have
                 much larger periods (up to $ 10^{100} $ to $ 10^{20000}
                 $ ), and no known $n$-step correlations, suggest that
                 {\tt drand48()} should not be used for serious
                 long-running simulations, even though it is likely to
                 still be satisfactory for casual use.",
}

@Article{Schmeiser:1982:BGR,
  author =       "B. W. Schmeiser and R. Lal",
  title =        "Bivariate Gamma Random Vectors",
  journal =      j-OPER-RES,
  volume =       "30",
  number =       "2",
  pages =        "355--374",
  month =        mar # "\slash " # apr,
  year =         "1982",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.30.2.355",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{Shen:1982:FAD,
  author =       "A. Shen",
  title =        "Frequency approach to the definition of the notion of
                 random sequence",
  journal =      "Semiotika i Informatika",
  volume =       "18",
  number =       "??",
  pages =        "14--42",
  month =        "????",
  year =         "1982",
  CODEN =        "????",
  ISSN =         "0259-4269",
  bibdate =      "Wed Jan 18 11:06:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Tracht:1982:RAN,
  author =       "Allen E. Tracht",
  title =        "Remark on {``Algorithm 334: Normal Random
                 Deviates''}",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "89--89",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Jul 05 16:49:20 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Bell:1968:ANR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "PRNG (pseudo-random number generator)",
}

@Article{Vahle:1982:BPR,
  author =       "M. O. Vahle and L. F. Tolendino",
  title =        "Breaking a Pseudo Random Number Based Cryptographic
                 Algorithm",
  journal =      j-CRYPTOLOGIA,
  volume =       "6",
  number =       "4",
  pages =        "319--328",
  month =        oct,
  year =         "1982",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-118291857145",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:37 MDT 2008",
  bibsource =    "http://www.dean.usma.edu/math/pubs/cryptologia/;
                 https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.informaworld.com/smpp/content~content=a741903089~db=all~order=page",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  romanvolume =  "VI",
}

@Article{Wichmann:1982:SAA,
  author =       "B. A. Wichmann and I. D. Hill",
  title =        "Statistical Algorithms: {Algorithm AS 183}: An
                 Efficient and Portable Pseudo-Random Number Generator",
  journal =      j-APPL-STAT,
  volume =       "31",
  number =       "2",
  pages =        "188--190",
  month =        jun,
  year =         "1982",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:27 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See correction \cite{Wichmann:1984:SAC} and remarks
                 \cite{McLeod:1985:SAR,Zeisel:1986:SAR,Deng:1997:SJC,Sobol:1999:PRN}.
                 Reprinted in \cite[pages 238--242]{Griffiths:1985:ASA}.
                 See also the extended 32-bit generator in
                 \cite{Wichmann:2006:GGP}.",
  URL =          "http://lib.stat.cmu.edu/apstat/183",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  remark =       "Zeisel \cite{Zeisel:1986:SAR} shows that the 1982
                 Wichmann--Hill \cite{Wichmann:1982:SAA} combined
                 generator is, according to the Chinese Remainder
                 Theorem, equivalent to a single multiplicative
                 congruential generator with $ A = 16 \, 555 \, 425 \,
                 264 \, 690 = 0 x f0 e \_ 9 c3 d \_ f432 $ and $ M = 27
                 \, 817 \, 185 \, 604 \, 309 = + 0 x194 c \_ b177 \_ 72
                 d5 $. Those constants need 44 and 45 bits,
                 respectively, and the period is about $ 2^{43} \approx
                 10^{12} $ (precisely, $ M / 4 = 6 \, 954 \, 296 \, 401
                 \, 077 = 0 x653 \_ 2 c5 d \_ d c b5 $ ). However, the
                 Wichmann--Hill procedure allows its computation with
                 only 16-bit integer arithmetic.",
}

@InProceedings{Yao:1982:TAT,
  author =       "A. Yao",
  title =        "Theory and applications of trapdoor functions",
  crossref =     "IEEE:1982:ASF",
  pages =        "80--91",
  year =         "1982",
  bibdate =      "Fri Jan 06 06:37:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Contains a `perfect' pseudorandom sequence
                 generator.",
}

@PhdThesis{Afflerbach:1983:LKG,
  author =       "Lothar Afflerbach",
  title =        "{Lineare Kongruenz-Generatoren zur Erzeugung von
                 Pseudo-Zufallszafflen und ibre Gitterstruktur}.
                 ({German}) [{Linear} congruential generators for
                 generating pseudorandom numbers and their lattice
                 structure]",
  type =         "Dissertation",
  school =       "Fachbereich Mathematik, Technische Hochschule
                 Darmstadt",
  address =      "Darmstadt, West Germany",
  year =         "1983",
  bibdate =      "Tue Jan 10 15:26:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@InProceedings{Barel:1983:FHR,
  author =       "M. Barel",
  booktitle =    "{Proceedings of the 16th Annual Simulation Symposium,
                 Florida}",
  title =        "Fast hardware random number generator for the
                 {Tausworthe} sequence",
  publisher =    "????",
  address =      "????",
  pages =        "121--135",
  year =         "1983",
  bibdate =      "Mon Jan 16 21:04:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Barel:1983:UGG,
  author =       "Mair Barel and Bernd Jobes",
  title =        "{Untersuchungen an Generatoren f{\"u}r gleichverteilte
                 Zufallszahlen}. ({German}) [{Testing} of uniform random
                 number generators]",
  journal =      j-ANG-INFO-ELEK-DATEN,
  volume =       "25",
  number =       "9",
  pages =        "404--409",
  month =        "????",
  year =         "1983",
  CODEN =        "AWIFA7",
  ISSN =         "0013-5704",
  bibdate =      "Mon Jan 16 21:05:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Angewandte Informatik (Elektron. Datenverarbeitung)",
  language =     "German",
}

@Article{Best:1983:NGV,
  author =       "D. J. Best",
  title =        "A note on gamma variate generators with shape
                 parameter less than unity",
  journal =      j-COMPUTING,
  volume =       "30",
  number =       "2",
  pages =        "185--188",
  month =        jun,
  year =         "1983",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (62E25)",
  MRnumber =     "84d:65004",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@InProceedings{Blum:1983:CTP,
  author =       "Lenore Blum and Manuel Blum and Michael Shub",
  title =        "Comparison of two pseudorandom number generators",
  crossref =     "Chaum:1983:ACP",
  pages =        "61--78",
  year =         "1983",
  bibdate =      "Thu Dec 29 14:56:12 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also final version of paper with proofs in
                 \cite{Blum:1986:SUP}.",
  acknowledgement = ack-nhfb,
}

@Article{Borosh:1983:OMP,
  author =       "Itshak Borosh and Harald Niederreiter",
  title =        "Optimal multipliers for pseudorandom number generation
                 by the linear congruential method",
  journal =      j-BIT,
  volume =       "23",
  number =       "1",
  pages =        "65--74",
  month =        mar,
  year =         "1983",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01937326",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65C10 (10K30 65A05)",
  MRnumber =     "84e:65012",
  bibdate =      "Wed Jan 4 18:52:18 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=23&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=23&issue=1&spage=65",
  abstract =     "A systematic search method is employed to find
                 multipliers for linear congruential pseudo-random
                 number generation which are optimal with respect to
                 statistical independence of pairs of successive
                 pseudo-random numbers. Tables of such optimal
                 multipliers corresponding to moduli $ 2^n $, $ n \leq
                 35 $, are included.",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Book{Bratley:1983:GS,
  author =       "Paul Bratley and Bennett L. Fox and Linus E. Schrage",
  title =        "A Guide to Simulation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 383",
  year =         "1983",
  ISBN =         "0-387-90820-X",
  ISBN-13 =      "978-0-387-90820-5",
  LCCN =         "QA76.9.C65 B73 1983",
  bibdate =      "Thu Jan 5 15:12:24 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Includes indexes.",
  subject =      "Digital computer simulation",
}

@Book{Brillhart:1983:FHP,
  author =       "John Brillhart and D. H. Lehmer and J. L. Selfridge
                 and Bryant Tuckerman and S. S. {Wagstaff, Jr.}",
  title =        "Factorizations of $ b^n \pm 1 $, $ b = 2, 3, 5, 6, 7,
                 10, 11, 12 $ up to high powers",
  volume =       "22",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "lxvii + 178",
  year =         "1983",
  ISBN =         "0-8218-5021-0 (paperback)",
  ISBN-13 =      "978-0-8218-5021-3 (paperback)",
  ISSN =         "0271-4132 (print), 1098-3627 (electronic)",
  ISSN-L =       "0271-4132",
  LCCN =         "QA161.F3 F33 1983",
  bibdate =      "Sat Mar 10 10:17:57 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Contemporary mathematics",
  ZMnumber =     "Zbl 0527.10001",
  acknowledgement = ack-nhfb,
  remark =       "Factorizations of the form in the title are of
                 interest for simplifying computations in the
                 determination of optimal parameters for linear and
                 multiplicative congruential generators.",
  subject =      "Factors (Algebra); Tables",
}

@Article{Chen:1983:SSR,
  author =       "Robert Chen and Larry A. Shepp",
  title =        "On the sum of symmetric random variables",
  journal =      j-AMER-STAT,
  volume =       "37",
  number =       "3",
  pages =        "237--237",
  month =        "????",
  year =         "1983",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "60E05 (62E10)",
  MRnumber =     "84k:60022",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Devroye:1983:MIR,
  author =       "Luc Devroye",
  title =        "Moment inequalities for random variables in
                 computational geometry",
  journal =      j-COMPUTING,
  volume =       "30",
  number =       "2",
  pages =        "111--119",
  month =        jun,
  year =         "1983",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "60E15 (52A22 60D05 68U05)",
  MRnumber =     "86k:60028",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Dudewicz:1983:TRN,
  author =       "Edward J. Dudewicz and Thomas G. Ralley",
  title =        "{TESTRAND}: a Random Number Generation and Testing
                 Library",
  journal =      j-AMER-STAT,
  volume =       "37",
  number =       "2",
  pages =        "169--170",
  month =        may,
  year =         "1983",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 12:40:28 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326497;
                 https://www.math.utah.edu/pub/tex/bib/amstat1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2685882",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Erber:1983:SRP,
  author =       "T. Erber and T. M. Rynne and W. F. Darsow and M. J.
                 Frank",
  title =        "The simulation of random processes on digital
                 computers: Unavoidable order",
  journal =      j-J-COMPUT-PHYS,
  volume =       "49",
  number =       "3",
  pages =        "394--419",
  month =        mar,
  year =         "1983",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(83)90137-7",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 15:59:14 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999183901377",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Fushimi:1983:DGF,
  author =       "Masanori Fushimi and Shu Tezuka",
  title =        "The $k$-distribution of {Generalized Feedback Shift
                 Register} Pseudorandom Numbers",
  journal =      j-CACM,
  volume =       "26",
  number =       "7",
  pages =        "516--523",
  month =        jul,
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Oct 21 23:58:25 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  descriptors =  "Shift register sequences; RNG",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Fushimi:1983:IOE,
  author =       "Masanori Fushimi",
  title =        "Increasing the orders of equidistribution of the
                 leading bits of the {Tausworthe} sequence",
  journal =      j-INFO-PROC-LETT,
  volume =       "16",
  number =       "4",
  pages =        "189--192",
  day =          "13",
  month =        may,
  year =         "1983",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "65C10",
  MRnumber =     "85a:65011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C7890 (Other special applications of computing)",
  corpsource =   "Faculty of Engng., Univ. of Tokyo, Tokyo, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "algebraic method; equidistribution; Lehmer's
                 congruential generator; maximal-length linearly
                 recurring sequence; orders of equidistribution; pseudo
                 random number generation; random number generation;
                 Tausworthe sequence",
  treatment =    "P Practical",
}

@Article{Fushimi:1983:RTR,
  author =       "Masanori Fushimi",
  title =        "A reciprocity theorem on the random number generation
                 based on $m$-sequences and its applications",
  journal =      j-TRANS-INFO-PROCESSING-SOC-JAPAN,
  volume =       "24",
  number =       "??",
  pages =        "576--579",
  month =        "????",
  year =         "1983",
  CODEN =        "JSGRD5",
  ISSN =         "0387-5806",
  ISSN-L =       "0387-5806",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the Information Processing Society of
                 Japan",
  language =     "Japanese",
}

@Article{Gokhale:1983:EBG,
  author =       "D. V. Gokhale",
  title =        "On entropy-based goodness-of-fit tests",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "1",
  number =       "1",
  pages =        "157--165",
  month =        mar,
  year =         "1983",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(83)90087-7",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Sat Mar 03 15:07:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Helstrom:1983:CDQ,
  author =       "Carl W. Helstrom",
  title =        "Comment: {``Distribution of quadratic forms in normal
                 random variables---evaluation by numerical
                 integration'' [SIAM J. Sci. Statist. Comput. {\bf 1}
                 (1980), no. 4, 438--448, MR 82g:62037] by S. O. Rice}",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "4",
  number =       "2",
  pages =        "353--356",
  month =        jun,
  year =         "1983",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "62E30 (65D30 65U05)",
  MRnumber =     "84m:62035",
  MRreviewer =   "James E. Gentle",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  note =         "See \cite{Rice:1980:DQF}.",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); B0290M
                 (Numerical integration and differentiation); C1140Z
                 (Other topics in statistics); C4160 (Numerical
                 integration and differentiation)",
  corpsource =   "Dept. of Electrical Engng. and Computer Sci., Univ. of
                 California, San Diego, La Jolla, CA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "cumulative distribution; integration; inversion
                 integral; numerically integrating; probability; random
                 variable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hopkins:1983:SAAb,
  author =       "T. R. Hopkins",
  title =        "Statistical Algorithms: {Algorithm AS 193}: a Revised
                 Algorithm for the Spectral Test",
  journal =      j-APPL-STAT,
  volume =       "32",
  number =       "3",
  pages =        "328--335",
  month =        sep,
  year =         "1983",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:48 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See remark \cite{Hill:1985:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/193",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Hora:1983:EIF,
  author =       "Stephen C. Hora",
  title =        "Estimation of the inverse function for random variate
                 generation",
  journal =      j-CACM,
  volume =       "26",
  number =       "5",
  pages =        "590--594",
  month =        may,
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 27 13:13:06 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "A regression method for estimating the inverse of a
                 continuous cumulative probability function F(X) is
                 presented. It is assumed that an ordered sample, $ x_1,
                 \ldots, x_n $, of identically and independently
                 distributed random variables is available. A reference
                 distribution $ f_0 (x) $ with known inverse $
                 f_0^{-1}(p) $ is used to calculate the quantities $ w_i
                 = i(f_0 (x_i) / f_0 (x_{i + 1})) $. These quantities
                 are used to estimate the function $ \gamma (p) = p d
                 \ln = > f_0 (f^{-1}(p)) < / d p $ from \ldots{}",
  country =      "USA",
  descriptors =  "RNG; RVG; Transform; approximation; method;
                 INVERSION",
  enum =         "1406",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  references =   "0",
}

@Article{Inoue:1983:RNG,
  author =       "H. Inoue and H. Kumahora and Y. Yoshizawa and M.
                 Ichimura and O. Miyatake",
  title =        "Random Numbers Generated by a Physical Device",
  journal =      j-APPL-STAT,
  volume =       "32",
  number =       "2",
  pages =        "115--120",
  year =         "1983",
  CODEN =        "APSTAG",
  DOI =          "https://doi.org/10.2307/2347290",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:46 MDT 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2347290",
  acknowledgement = ack-nhfb,
  classification = "922",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  journalabr =   "Appl Stat",
  keywords =     "mathematical statistics",
}

@Article{Jennergren:1983:AMR,
  author =       "L. Peter Jennergren",
  title =        "Another method for random number generation on
                 microcomputers",
  journal =      j-SIMULATION,
  volume =       "41",
  number =       "2",
  pages =        "79--79",
  month =        "????",
  year =         "1983",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978304100210",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:40:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/41/2/79.abstract",
  abstract =     "The random number generator $ u(t + 1) = u(t) 5^{13}
                 \bmod 2^{35} $ is suitable for simulation work on
                 microcomputers. Results of statistical tests of this
                 generator show that it has reasonable properties. It
                 can easily be implemented either in PASCAL or in
                 assembly language.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Kac:1983:WR,
  author =       "M. Kac",
  title =        "What is randomness?",
  journal =      j-AM-SCI,
  volume =       "71",
  number =       "??",
  pages =        "405--406",
  month =        aug,
  year =         "1983",
  CODEN =        "AMSCAC",
  ISSN =         "0003-0996 (print), 1545-2786 (electronic)",
  ISSN-L =       "0003-0996",
  bibdate =      "Fri Jan 06 06:34:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.americanscientist.org/issues/past.aspx",
  acknowledgement = ack-nhfb,
  fjournal =     "American Scientist",
  journal-URL =  "http://www.americanscientist.org/issues/past.aspx",
  remark =       "Publisher archives have only year 1998--date.",
}

@InProceedings{Kachitvichyanukul:1983:DUR,
  author =       "V. Kachitvichyanukul",
  title =        "Discrete Univariate Random Variate Generation",
  crossref =     "Roberts:1983:WSC",
  pages =        "179--187",
  year =         "1983",
  bibdate =      "Thu Jan 05 17:46:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Keefer:1983:TPA,
  author =       "D. L. Keefer and S. E. Bodily",
  title =        "Three-Point Approximations for Continuous Random
                 Variables",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "29",
  number =       "??",
  pages =        "595--609",
  month =        "????",
  year =         "1983",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{Lawrance:1983:SDP,
  author =       "A. J. Lawrance and P. A. W. Lewis",
  title =        "Simple Dependent Pairs of Exponential and Uniform
                 Random Variables",
  journal =      j-OPER-RES,
  volume =       "31",
  number =       "6",
  pages =        "1179--1197",
  month =        nov # "\slash " # dec,
  year =         "1983",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.31.6.1179",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@InCollection{Marsaglia:1983:RNG,
  author =       "George Marsaglia",
  title =        "Random number generation",
  crossref =     "Ralston:1983:ECS",
  pages =        "1260--1264",
  year =         "1983",
  bibdate =      "Mon Aug 02 10:57:24 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "Text virtually identical with first edition
                 \cite{Marsaglia:1976:RNG}. See also third edition
                 \cite{Marsaglia:1993:RNG}.",
}

@Article{Marsaglia:1983:RVI,
  author =       "George Marsaglia",
  title =        "Random variables with independent binary digits",
  journal =      "Kibern. Sb., Nov. Ser.",
  volume =       "20",
  pages =        "216--224",
  year =         "1983",
  CODEN =        "????",
  ISSN =         "0453-8382",
  bibdate =      "Fri Jan 6 09:50:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0535.60013",
  abstract =     "Translation from Ann. Math. Stat. 42, 1922--1929
                 (1971; Zbl 0239.60015).",
  acknowledgement = ack-nhfb,
  fjournal =     "Kiberneti{\v{c}}eskij sbornik. Novaya Seriya",
  fjournal-2 =   "Kiberneti{\c{c}}eskij sbornik (KS): sbornik statej",
  keywords =     "independent binary digits",
  language =     "Russian",
  ZMclass =      "60E05 General theory of probability distributions
                 60F99 Limit theorems (probability)",
}

@Article{Marse:1983:IPF,
  author =       "Ken Marse and Stephen D. Roberts",
  title =        "Implementing a Portable {FORTRAN} Uniform $ (0, 1) $
                 Generator",
  journal =      j-SIMULATION,
  volume =       "41",
  number =       "4",
  pages =        "135--139",
  month =        oct,
  year =         "1983",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978304100401",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Thu Jan 05 14:23:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The implementation and testing of a portable FORTRAN
                 routine is described which utilizes a well-known random
                 number generator to produce Uniform (0,1) values. The
                 implementation techniques illustrate the advantages of
                 a well-tested portable algorithm and expose some
                 problems which commonly occur in the generation of
                 Uniform (0, 1) numbers for application areas such as
                 simulation. These problems include the pitfalls of
                 using machine-dependent random number generators with
                 unknown characteristics typically supplied with
                 computer system software. The excellent global
                 statistical properties of the generator used in this
                 routine are documented and local testing of the Uniform
                 (0,1) values produced is provided. An additional
                 routine is described which enables the user to obtain
                 independent streams of values. Fifteen streams are
                 rated for their performance on uniformity and
                 independence tests. The provided seed values enable the
                 user to select streams with the desired properties for
                 a particular application.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
  keywords =     "{\tt ranmar()} generator",
}

@Article{Miyatake:1983:MAR,
  author =       "Osamu Miyatake and Minoru Ichimura and Yasukazu
                 Yoshizawa and Hikaru Inoue",
  title =        "Mathematical analysis of random number generator using
                 gamma-rays. {I}",
  journal =      j-MATH-JAPON,
  volume =       "28",
  number =       "4",
  pages =        "399--414",
  month =        "????",
  year =         "1983",
  CODEN =        "MAJAA9",
  ISSN =         "0025-5513",
  MRclass =      "65C10",
  MRnumber =     "717511 (86c:65008)",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also part II \cite{Inoue:1986:MAR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "Math. Jap.",
  fjournal =     "Mathematica Japonica",
}

@Article{Muller:1983:BRB,
  author =       "Mervin E. Muller",
  title =        "Book Review: {{\booktitle{The Handbook of Random
                 Number Generation and Testing with TESTRAND Computer
                 Code}} by Edward J. Dudewicz; Thomas G. Ralley}",
  journal =      j-TECHNOMETRICS,
  volume =       "25",
  number =       "2",
  pages =        "207--208",
  month =        may,
  year =         "1983",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.2307/1268561",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 13:19:07 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i254315;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1980.bib",
  URL =          "http://www.jstor.org/stable/1268561",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html",
}

@Article{Pearson:1983:APR,
  author =       "Robert B. Pearson",
  title =        "An algorithm for pseudo random number generation
                 suitable for large scale integrations",
  journal =      j-J-COMPUT-PHYS,
  volume =       "49",
  number =       "3",
  pages =        "478--489",
  month =        mar,
  year =         "1983",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(83)90142-0",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999183901420",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Peterson:1983:ACT,
  author =       "Arthur V. {Peterson, Jr.} and Richard A. Kronmal",
  title =        "Analytic Comparison of Three General-Purpose Methods
                 for the Computer Generation of Discrete Random
                 Variables",
  journal =      j-APPL-STAT,
  volume =       "32",
  number =       "3",
  pages =        "276--286",
  year =         "1983",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:23:48 MDT 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classification = "921",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  journalabr =   "Appl Stat",
  keywords =     "alias method; indexed-search method; mathematical
                 statistics; table method",
}

@PhdThesis{Plumstead:1983:ISPa,
  author =       "Joan Boyar Plumstead",
  title =        "Inferring Sequences Produced by Pseudo-Random Number
                 Generators",
  type =         "{Ph.D.} Dissertation",
  school =       "Department of Computer Science, University of
                 California, Berkeley",
  address =      "Berkeley, CA, USA",
  pages =        "ii + 56",
  month =        jun,
  year =         "1983",
  bibdate =      "Wed Jun 22 18:14:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "To solve the problem of inferring sequences produced
                 by pseudo-random number generators of a particular
                 form, one must present an efficient inference method
                 which, from knowledge of some of the numbers in a
                 sequence, predicts the remainder of the sequence.
                 Pseudo-random number generators of the following forms
                 are considered: (1) Linear congruential method, $ X(, i
                 + 1) = a X(, i) + b \bmod m $. (2) Linear congruences
                 with $n$ terms in the recurrence, for fixed $n$, $ X(,
                 i) = a(, 1) X(, i - 1) + a(, 2) X(, i - 2) + (.)(.)(.)
                 + a(, n) X(, i - n) + a(, n + 1) \bmod m $. (3)
                 Quadratic congruences, $ X(, i + 1) = a X(, i)('2) + b
                 X(, i) + c \bmod m $. In each case, it is assumed that
                 the coefficients and the modulus are unknown. It is
                 also assumed that whenever an incorrect prediction
                 occurs, the correct value is revealed before the next
                 prediction is made. Sequences of the first type can be
                 predicted with no more than $ 2 + \log (, 2) m $
                 errors, sequences of the second type with no more than
                 $ 2 + n('2) \log (, 2) n m $ errors, and sequences of
                 the third type with no more than $ 4 + 3 \log (, 2)m $
                 errors. All of the inference methods presented are
                 efficient. This shows that pseudo-random number
                 generators in any of these forms are cryptographically
                 insecure.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Plumstead:1983:ISPb,
  author =       "Joan B. Plumstead",
  editor =       "R. L. Rivest and A. Sherman and D. Chaum",
  booktitle =    "{CRYPTO82}",
  title =        "Inferring a Sequence Produced by a Linear Congruence",
  publisher =    pub-PLENUM,
  address =      pub-PLENUM:adr,
  pages =        "317--319",
  year =         "1983",
  bibdate =      "Tue Mar 06 20:45:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  comment =      "Abstract of the FOCS '82 paper",
}

@Article{Pokhodzei:1983:OMM,
  author =       "B. B. Pokhodze{\u\i}",
  title =        "Optimality of the {Marsaglia} method for simulating
                 discrete distributions",
  journal =      "Vestnik Leningrad. Univ. Mat. Mekh. Astronom.",
  volume =       "4",
  pages =        "105--107",
  year =         "1983",
  CODEN =        "VMMAA3",
  ISSN =         "0024-0850",
  MRclass =      "65C10",
  MRnumber =     "85a:65015",
  bibdate =      "Fri Jan 6 09:50:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0551.60020",
  abstract =     "It is shown that after a small modification the famous
                 {\it G. Marsaglia's} method [Commun. ACM 6, 37-38
                 (1963; Zbl 0112.084)] for generation of discrete
                 distributions reduces to an optimal algorithm for
                 transformation of random bits to random variables with
                 given distribution.",
  acknowledgement = ack-nhfb,
  classmath =    "*60E99 Distribution theory in probability theory 65C10
                 Random number generation",
  fjournal =     "Vestnik Leningradskogo Universiteta, Seriya 1:
                 Matematika, Mekhanika, Astronomiya",
  keywords =     "Marsaglia's method; transformation of random bits to
                 random variables with given distribution",
  language =     "Russian. English summary",
  xxtitle =      "On optimal {Marsaglia}'s method for simulating
                 discrete distributions",
}

@Article{Purdy:1983:CFA,
  author =       "George B. Purdy",
  title =        "A carry-free algorithm for finding the greatest common
                 divisor of two integers",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "9",
  number =       "2",
  pages =        "311--316",
  year =         "1983",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(83)90133-5",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Thu Dec 29 06:28:02 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Purdy's extended binary algorithm for the gcd runs in
                 $ O(n^2) $ time, where $n$ is the number of bits in the
                 inputs; see \cite{Bojanczyk:1987:SAE} for an $ O(n) $
                 algorithm.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122183901335",
  abstract =     "We investigate a variant of the so-called ``binary''
                 algorithm for finding the GCD (greatest common divisor)
                 of two numbers which requires no comparisons. We show
                 that when implemented with carry-save hardware, it can
                 be used to find the modulo $B$ inverse of an $n$-bit
                 binary integer in a time proportional to $n$, using
                 only registers of length proportional to $n$.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Ripley:1983:CGR,
  author =       "B. D. Ripley",
  title =        "Computer generation of random variables: a tutorial",
  journal =      j-INT-STAT-REV,
  volume =       "51",
  number =       "??",
  pages =        "301--319",
  month =        "????",
  year =         "1983",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Tue Dec 27 15:38:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@Article{Ripley:1983:LSP,
  author =       "B. D. Ripley",
  title =        "The lattice structure of pseudorandom number
                 generators",
  journal =      j-PROC-R-SOC-LOND-SER-A-MATH-PHYS-SCI,
  volume =       "389",
  number =       "1796",
  pages =        "197--204",
  month =        sep,
  year =         "1983",
  CODEN =        "PRLAAZ",
  ISSN =         "0080-4630 (print), 2053-9169 (electronic)",
  MRclass =      "65C10",
  MRnumber =     "MR0719645 (85i:65010)",
  bibdate =      "Wed Dec 21 07:22:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2397327",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the Royal Society of London. Series A,
                 Mathematical and physical sciences",
  journal-URL =  "http://rspa.royalsocietypublishing.org/content/current",
}

@Article{Rosenbaum:1983:RNG,
  author =       "W. Rosenbaum and J. Syrotuik and R. Gordon",
  title =        "Random number generators for microcomputers",
  journal =      j-COMPUT-PROGRAMS-BIOMED,
  volume =       "16",
  number =       "??",
  pages =        "235--240",
  month =        "????",
  year =         "1983",
  CODEN =        "COPMBU",
  ISSN =         "0010-468X (print), 1878-3139 (electronic)",
  ISSN-L =       "0010-468X",
  bibdate =      "Mon Jan 16 21:10:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Programs in Biomedicine",
}

@Article{Sakasegawa:1983:SRS,
  author =       "H. Sakasegawa",
  title =        "Stratified rejection and squeeze method for generating
                 beta random numbers",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "35B",
  number =       "??",
  pages =        "291--302",
  year =         "1983",
  CODEN =        "AISXAD",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Wed Feb 22 10:25:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0526.65003",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics
                 (Tokyo)",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Savir:1983:NET,
  author =       "J. Savir",
  title =        "A New Empirical Test for the Quality of Random Integer
                 Generators",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-32",
  number =       "10",
  pages =        "960--961",
  month =        oct,
  year =         "1983",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1983.1676142",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sun Jul 10 10:01:12 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676142",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InProceedings{Schmeiser:1983:RAG,
  author =       "B. W. Schmeiser",
  title =        "Recent Advances in Generating Observations from
                 Discrete Random Variables",
  crossref =     "Gentle:1983:CSS",
  pages =        "154--160",
  year =         "1983",
  bibdate =      "Thu Jan 05 11:43:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shamir:1983:GCS,
  author =       "Adi Shamir",
  title =        "On the Generation of Cryptographically Strong
                 Pseudorandom Sequences",
  journal =      j-TOCS,
  volume =       "1",
  number =       "1",
  pages =        "38--44",
  month =        feb,
  year =         "1983",
  CODEN =        "ACSYEC",
  ISSN =         "0734-2071 (print), 1557-7333 (electronic)",
  ISSN-L =       "0734-2071",
  bibdate =      "Thu Jan 14 11:57:59 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tocs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Computer Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J774",
  keywords =     "TOCS",
}

@Article{VanEs:1983:RNG,
  author =       "A. J. {Van Es} and R. D. Gill and C. {Van Putten}",
  title =        "Random number generators for a pocket calculator",
  journal =      j-STAT-NEERLANDICA,
  volume =       "37",
  number =       "??",
  pages =        "95--102",
  month =        "????",
  year =         "1983",
  CODEN =        "????",
  ISSN =         "0039-0402 (print), 1467-9574 (electronic)",
  ISSN-L =       "0039-0402",
  bibdate =      "Mon Jan 16 21:11:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistica Neerlandica. Journal of the Netherlands
                 Society for Statistics and Operations Research",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9574",
}

@InProceedings{Vazirani:1983:TPR,
  author =       "Umesh V. Vazirani and Vijay V. Vazirani",
  title =        "Trapdoor pseudo-random number generators, with
                 applications to protocol design",
  crossref =     "IEEE:1983:ASF",
  pages =        "23--30",
  year =         "1983",
  DOI =          "https://doi.org/10.1109/SFCS.1983.78",
  bibdate =      "Fri Jan 06 07:03:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Banks:1984:DES,
  author =       "Jerry Banks and John S. {Carson II}",
  title =        "Discrete-Event System Simulation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 514",
  year =         "1984",
  ISBN =         "0-13-215582-6",
  ISBN-13 =      "978-0-13-215582-3",
  LCCN =         "T57.62 .B35 1984",
  bibdate =      "Thu Jan 5 14:55:01 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Prentice-Hall international series in industrial and
                 systems engineering",
  acknowledgement = ack-nhfb,
  subject =      "Simulation methods",
}

@Article{Blum:1984:HGC,
  author =       "Manuel Blum and Silvio Micali",
  title =        "How to Generate Cryptographically Strong Sequences of
                 Pseudo-Random Bits",
  journal =      j-SIAM-J-COMPUT,
  volume =       "13",
  number =       "4",
  pages =        "850--864",
  month =        "????",
  year =         "1984",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68P25 (65C10 68Q20)",
  MRnumber =     "86a:68021",
  bibdate =      "Mon Nov 29 11:00:12 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/13/4;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Also published in \cite{Blum:1982:HGC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  referencedin = "Referenced in \cite[Ref. 7]{Goldreich:1997:FMCb}.",
  remark =       "From the abstract: ``Two closely-related pseudo-random
                 sequence generators are presented: The $ 1 / P $
                 generator with input $P$ a prime, outputs the quotient
                 digits obtained on dividing $1$ by $P$. The $ x^2 \bmod
                 N $ generator with inputs $N$, $ x_0 $ (where $ N = P
                 \cdot Q $ is a product of distinct primes, each
                 congruent to 3 mod 4, and $ x_0 $ is a quadratic
                 residue $ \bmod N $ ), outputs $ b_0 b_1 b_2 \ldots {}
                 $ where $ b_i = {\rm parity}(x_i) $ and $ x_{i + 1} =
                 x_i^2 \bmod N $.''\par

                 The authors show that the $ 1 / P $ generator produces
                 a sequence from which only a few element are needed to
                 recover P, making it useless for cryptographically. For
                 the second generator, if only $ x_0 $ and $N$ are
                 known, but {\em not} $P$ and $Q$, the generator can be
                 run forwards, but not backwards. However, if the two
                 prime factors can be determined, then the generator can
                 be run in both directions, and jumped about in. That
                 makes it of interest for cryptography where the two
                 primes are large (e.g., hundreds of decimal digits),
                 but not for fast generation of pseudorandom numbers.",
}

@InProceedings{Blum:1984:IUC,
  author =       "Manuel Blum",
  title =        "Independent Unbiased Coin Flips from a Correlated
                 Biased Source: a Finite State {Markov} Chain",
  crossref =     "IEEE:1984:ASF",
  pages =        "425--433",
  year =         "1984",
  bibdate =      "Thu Feb 02 17:24:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Brody:1984:RNG,
  author =       "T. A. Brody",
  title =        "A random-number generator",
  journal =      j-COMP-PHYS-COMM,
  volume =       "34",
  number =       "1--2",
  pages =        "39--46",
  month =        nov # "\slash " # dec,
  year =         "1984",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(84)90157-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465584901577",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Brown:1984:ETS,
  author =       "Morton B. Brown and Judith Bromberg",
  title =        "An Efficient Two-Stage Procedure for Generating Random
                 Variates from the Multinomial Distribution",
  journal =      j-AMER-STAT,
  volume =       "38",
  number =       "3",
  pages =        "216--219",
  month =        aug,
  year =         "1984",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 12:40:28 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326424;
                 https://www.math.utah.edu/pub/tex/bib/amstat1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683660",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Cheng:1984:GIG,
  author =       "Russell C. H. Cheng",
  title =        "Generation of Inverse {Gaussian} Variates with Given
                 Sample Mean and Dispersion",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "3",
  pages =        "309--316",
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  MRclass =      "62-04 (62E25 65C20)",
  MRnumber =     "86d:62002",
  bibdate =      "Sat Apr 21 10:24:05 MDT 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wales Inst of Science \& Technology, Cardiff,
                 Wales",
  affiliationaddress = "Univ of Wales Inst of Science \& Technology,
                 Cardiff, Wales",
  classification = "723; 922",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  journalabr =   "Appl Stat",
  keywords =     "computer simulation; inverse Gaussian distribution;
                 mathematical statistics; Monte Carlo simulation; Random
                 Number Generation",
}

@Article{Devroye:1984:MGR,
  author =       "Luc Devroye",
  title =        "Methods for generating random variates with {Polya}
                 characteristic functions",
  journal =      j-STAT-PROB-LETT,
  volume =       "2",
  number =       "5",
  pages =        "257--261",
  month =        oct,
  year =         "1984",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(84)90061-0",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  bibdate =      "Wed Jan 18 22:17:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
}

@Article{Devroye:1984:RVG,
  author =       "Luc Devroye",
  title =        "Random Variate Generation for Unimodal and Monotone
                 Densities",
  journal =      j-COMPUTING,
  volume =       "32",
  number =       "1",
  pages =        "43--68",
  month =        mar,
  year =         "1984",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "85h:65016",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "McGill Univ, Sch of Computer Science, Montreal, Que,
                 Can",
  classification = "922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "mathematical statistics",
}

@Article{Devroye:1984:SAG,
  author =       "Luc Devroye",
  title =        "A simple algorithm for generating random variates with
                 a log-concave density",
  journal =      j-COMPUTING,
  volume =       "33",
  number =       "3--4",
  pages =        "247--257",
  month =        sep,
  year =         "1984",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "86d:65019",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "McGill Univ, Sch of Computer Science, Montreal, Que,
                 Can",
  classification = "723; 922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "computer programming; log concavity; mathematical
                 statistics --- Random Number Generation; random variate
                 generation",
}

@Article{Devroye:1984:UPI,
  author =       "Luc Devroye",
  title =        "The use of probability inequalities in random variate
                 generation",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "20",
  number =       "2",
  pages =        "91--100",
  month =        "????",
  year =         "1984",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658408810759",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Mon Jan 16 20:54:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949658408810759",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Downing:1984:PDP,
  author =       "C. P. Downing",
  title =        "Proposal for a digital pseudorandom number generator",
  journal =      j-ELECT-LETTERS,
  volume =       "20",
  number =       "11",
  pages =        "435--436",
  day =          "24",
  month =        may,
  year =         "1984",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19840302",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4248756",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Etzion:1984:AGF,
  author =       "T. Etzion and A. Lempel",
  title =        "Algorithms for the Generation of Full-Length
                 Shift-Register Sequences",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-30",
  number =       "3",
  pages =        "480--484",
  month =        "????",
  year =         "1984",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1984.1056919",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Wed Feb 22 10:33:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@Article{Farebrother:1984:SAA,
  author =       "R. W. Farebrother",
  title =        "Statistical Algorithms: {Algorithm AS 204}: The
                 Distribution of a Positive Linear Combination of $
                 \chi^2 $ Random Variables",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "3",
  pages =        "332--339",
  month =        sep,
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:05 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://lib.stat.cmu.edu/apstat/204",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Farebrother:1984:SARa,
  author =       "R. W. Farebrother",
  title =        "Statistical Algorithms: {Remark AS R52}: The
                 Distribution of a Linear Combination of Central $
                 \chi^2 $ Random Variables: a Remark on {AS 153}:
                 {Pan}'s Procedure for the Tail Probabilities of the
                 {Durbin-Watson} Statistic",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "3",
  pages =        "363--366",
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:05 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See
                 \cite{Farebrother:1980:SAA,Farebrother:1984:SARb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Farebrother:1984:SARb,
  author =       "R. W. Farebrother",
  title =        "Statistical Algorithms: {Remark AS R53}: a Remark on
                 Algorithms {AS 106}, {AS 153} and {AS 155}: The
                 Distribution of a Linear Combination of $ \chi^2 $
                 Random Variables",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "3",
  pages =        "366--369",
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:05 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See
                 \cite{Sheil:1977:SAA,Farebrother:1980:SAA,Davies:1980:SAA,Farebrother:1984:SARa}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@TechReport{Fishman:1984:EAM,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "An Exhaustive Analysis of Multiplicative Congruential
                 Random Number Generators with Modulus $ 2^{32} - 1 $",
  type =         "Technical report",
  number =       "84-05",
  institution =  "University of North Carolina at Chapel Hill",
  address =      "Chapel Hill, NC, USA",
  pages =        "ii + 44",
  month =        jun,
  year =         "1984",
  bibdate =      "Thu Jan 12 12:21:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a143085.pdf;
                 http://www.or.unc.edu/research/temp/tech80a.html#1984",
  abstract =     "This paper presents the results of an exhaustive
                 search to find optimal full period multipliers for the
                 multiplicative congruential random number generator
                 with prime modulus $ 2^{31} - 1 $. Here a multiplier is
                 said to be optimal if the distance between adjacent
                 parallel hyperplanes on which $k$-tuples lie does not
                 exceed the minimal achievable distance by more than 25
                 percent for $ k = 2, \ldots {}, 6$. This criterion is
                 considerably more stringent than prevailing standards
                 of acceptability and leads to a total of only $ 414$
                 multipliers among the more than $ 534$ million
                 candidate multipliers.\par

                 Section 1 reviews the basic properties of linear
                 congruential generators and Section 2 describes worst
                 case performance measures. These include the maximal
                 distance between adjacent parallel hyperplanes, the
                 minimal number of parallel hyperplanes, the minimal
                 distance between $k$ tuples, the lattice ratio and the
                 discrepancy. Section 3 presents the five best
                 multipliers and compares their performances with those
                 of three commonly employed multipliers for all measures
                 but the lattice test. Comparisons using packing
                 measures in the space of $k$-tuples and in the dual
                 space are also made. Section 4 presents the results of
                 applying a battery of statistical tests to the best
                 five to detect local departures from randomness. None
                 were found. The Appendix contains a list of all optimal
                 multipliers.",
  acknowledgement = ack-nhfb,
  keywords =     "Congruential generator; discrepancy; lattice test;
                 random number generation; spectral test",
}

@Article{Fishman:1984:SDD,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "Sampling from a Discrete Distribution while Preserving
                 Monotonicity",
  journal =      j-AMER-STAT,
  volume =       "38",
  number =       "??",
  pages =        "219--223",
  month =        "????",
  year =         "1984",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Jan 05 17:33:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Frederickson:1984:PRT,
  author =       "P. Frederickson and R. Hiromoto and T. L. Jordan and
                 B. Smith and T. Warnock",
  title =        "Pseudo-random trees in {Monte Carlo}",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "1",
  number =       "2",
  pages =        "175--180",
  month =        dec,
  year =         "1984",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Mon Apr 14 11:08:33 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C7300 (Natural
                 sciences computing); C7400 (Engineering computing)",
  corpsource =   "Los Alamos Nat. Lab., Los Alamos, NM, USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "digital simulation; Lehmer pseudorandom number
                 generator; MIMD architecture; Monte Carlo methods;
                 Monte Carlo simulations; parallel; parallel computers;
                 processing; pseudorandom trees; random number
                 generation; reproducibility; SIMD architecture;
                 supercomputer; trees (mathematics)",
  treatment =    "P Practical",
}

@InProceedings{Frieze:1984:LCG,
  author =       "A. M. Frieze and R. Kannan and J. C. Lagarias",
  title =        "Linear Congruential Generators Do Not Produce Random
                 Sequences",
  crossref =     "IEEE:1984:ASF",
  pages =        "480--484",
  year =         "1984",
  DOI =          "https://doi.org/10.1109/SFCS.1984.715950",
  bibdate =      "Wed Feb 22 10:34:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "One of the most popular and fast methods of generating
                 ``random'' sequence[s] are linear congruential
                 generators. This paper discusses the predictability of
                 the sequence given only a constant proportion $ \alpha
                 $ of the leading bits of the first few numbers
                 generated. We show that the rest of the sequence is
                 predictable in polynomial time, almost always, provided
                 $ \alpha > 2 / 5 $.",
  acknowledgement = ack-nhfb,
}

@Article{Gal:1984:OEC,
  author =       "S. Gal and R. Y. Rubinstein and A. Ziv",
  title =        "On the Optimality and Efficiency of {Common Random
                 Numbers}",
  journal =      j-MATH-COMP-SIM,
  volume =       "26",
  number =       "??",
  pages =        "502--512",
  month =        "????",
  year =         "1984",
  CODEN =        "MCSIDR",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Thu Jan 05 17:37:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{Guinier:1984:RNS,
  author =       "Daniel Guinier",
  title =        "Random numbers for stochastic simulation",
  journal =      j-SIGBIO-NEWSLETTER,
  volume =       "6",
  number =       "4",
  pages =        "5--6",
  month =        mar,
  year =         "1984",
  CODEN =        "SINWDG",
  DOI =          "https://doi.org/10.1145/992237.992242",
  ISSN =         "0163-5697 (print), 1557-9506 (electronic)",
  ISSN-L =       "0163-5697",
  bibdate =      "Thu Feb 23 21:56:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method, that generates 36-bit machine-independent
                 sets of pseudo-random numbers uniformly distributed in
                 the interval (0.0 to 1.0), is proposed. The method has
                 been tested on several computers, including the PDP
                 11/10 (16 bit), VAX 11/780 (32 bit), CII 10070 (32
                 bit), and UNIVAC 1110 (36 bit). The pseudo-random
                 sequences. Normal, Log-normal, Binomial, Poisson, and
                 Chi-squared, are calculated from the Uniform
                 distribution. These pseudo-random numbers give perfect
                 reproducibility regardless of the operating system
                 and/or kind of computer used. This is of the first
                 importance in simulation methods, like the Monte Carlo
                 method. The cycle of the pseudo-random sequence has
                 been tested up to 10**7.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGBIO Newsletter",
}

@Article{Hamedani:1984:NLC,
  author =       "G. G. Hamedani",
  title =        "Nonnormality of linear combinations of normal random
                 variables",
  journal =      j-AMER-STAT,
  volume =       "38",
  number =       "4",
  pages =        "295--296",
  month =        "????",
  year =         "1984",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "62H05",
  MRnumber =     "86b:62081",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Heth:1984:PVP,
  author =       "C. D. Heth",
  title =        "A {Pascal} Version of a Pseudorandom Number
                 Generator",
  journal =      j-BEHAV-RES-METH-INSTR-COMP,
  volume =       "16",
  number =       "6",
  pages =        "548--550",
  month =        "????",
  year =         "1984",
  CODEN =        "BRMCEW",
  DOI =          "https://doi.org/10.3758/BF03200841",
  ISSN =         "0743-3808 (print), 1532-5970 (electronic)",
  ISSN-L =       "0743-3808",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods, Instruments, and
                 Computers",
  journal-URL =  "http://link.springer.com/journal/13428",
}

@Article{Kalle:1984:PRN,
  author =       "Claus Kalle and Stephan Wansleben",
  title =        "Problems with the random number generator {RANF}
                 implemented on the {CDC Cyber 205}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "33",
  number =       "4",
  pages =        "343--346",
  month =        oct,
  year =         "1984",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(84)90139-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Fri Feb 24 13:39:14 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465584901395",
  abstract =     "We show that using RANF may lead to wrong results when
                 lattice models are simulated by Monte Carlo methods. We
                 present a shift-register sequence random number
                 generator which generates two random numbers per cycle
                 on a two pipe CDC Cyber 205.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@InProceedings{Kannan:1984:SPA,
  author =       "R. Kannan and G. Miller and L. Rudolph",
  title =        "Sublinear parallel algorithm for computing the
                 greatest common divisor of two integers",
  crossref =     "IEEE:1984:ASF",
  pages =        "7--11",
  year =         "1984",
  DOI =          "https://doi.org/10.1109/SFCS.1984.715895",
  bibdate =      "Thu Apr 5 06:13:39 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The advent of practical parallel processors has caused
                 a reexamination of many existing algorithms with the
                 hope of discovering a parallel implementation. One of
                 the oldest and best known algorithms is Euclid's
                 algorithm for computing the greatest common divisor
                 (GCD). In this paper we present a parallel algorithm to
                 compute the GCD of two integers. The two salient
                 features of the algorithm are: the observation based on
                 the pigeon hole principle that we can easily find an
                 integer combination of the two integers $A$ and $B$
                 which has fewer bits than $n$ and the idea of working
                 in phases so as to perform arithmetics on $n$-bit
                 integers only once every phase, the more frequent
                 operations being performed on $ O(l o g^2 n) $-bit
                 integers. It appears that yet another approach is
                 needed if the GCD is to be computed in poly-log
                 parallel time.",
  acknowledgement = ack-nhfb,
  keywords =     "greatest common divisor (GCD)",
}

@Article{Kronmal:1984:ACA,
  author =       "Richard A. Kronmal and Arthur V. {Peterson, Jr.}",
  title =        "An Acceptance-Complement Analogue of the
                 Mixture-plus-Acceptance-Rejection Method for Generating
                 Random Variables",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "271--281",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/1271.1272",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "86f:65027",
  bibdate =      "Wed Aug 24 22:43:47 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7548",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Kuo:1984:SRI,
  author =       "C. T. K. Kuo and T. W. Cadman and R. J. Arsenault",
  title =        "Sequential random integer generator",
  journal =      j-COMP-PHYS-COMM,
  volume =       "35",
  number =       "1--3",
  pages =        "C-394",
  month =        "????",
  year =         "1984",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(84)82605-3",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Feb 25 10:56:24 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465584826053",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Landauer:1984:ERN,
  author =       "Edwin G. Landauer",
  title =        "The effect of random number generators on an
                 application",
  journal =      j-COMPUT-IND-ENG,
  volume =       "8",
  number =       "1",
  pages =        "65--72",
  year =         "1984",
  CODEN =        "CINDDL",
  DOI =          "https://doi.org/10.1016/0360-8352(84)90022-6",
  ISSN =         "0360-8352 (print), 1879-0550 (electronic)",
  ISSN-L =       "0360-8352",
  bibdate =      "Thu May 20 19:15:26 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0360835284900226",
  abstract =     "Several pseudorandom number generators are described
                 and compared on the basis of their use in an
                 application. Four pseudorandom number generators are
                 used to generate interarrival and service times for an
                 M/M/1 queuing system that is programmed in GPSS. The
                 results of each of the trials are compared to the
                 theoretical results which can be obtained from queuing
                 theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& industrial engineering",
  remark =       "This paper has been presented earlier at the Fifth
                 Annual Meeting of the Southeast Atlantic Section of
                 SIAM held in Marietta, Georgia, 3--4 April
                 1981.\par

                 This paper was used as partial fulfillment of the
                 requirements for the degree of Master of Science from
                 the Industrial Engineering Department at the University
                 of Central Florida.",
}

@Article{Lugannani:1984:DRQ,
  author =       "R. Lugannani and S. O. Rice",
  title =        "Distribution of the ratio of quadratic forms in normal
                 variables---numerical methods",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "5",
  number =       "2",
  pages =        "476--488",
  month =        jun,
  year =         "1984",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65U05 (62-04)",
  MRnumber =     "85h:65282",
  MRreviewer =   "Kenneth N. Berk",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290Z (Other numerical methods); C4190 (Other
                 numerical methods)",
  corpsource =   "Dept. of Electrical Engng. and Computer Sci., Univ. of
                 California, San Diego, La Jolla, CA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "closed-form expressions; composite random variables;
                 normal variables; numerical integration; numerical
                 methods; probability; probability density; quadratic
                 forms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Marsaglia:1984:EAM,
  author =       "George Marsaglia",
  title =        "The exact-approximation method for generating random
                 variables in a computer",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "79",
  number =       "385",
  pages =        "218--221",
  month =        mar,
  year =         "1984",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "65C10",
  MRnumber =     "85d:65010",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1984.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://www.jstor.org/stable/2288360",
  ZMnumber =     "0552.65005",
  abstract =     "A suitably chosen approximation to the inverse of a
                 probability distribution can lead to exact and very
                 fast methods for generating random variables, if the
                 approximation is made exact by adjusting the argument
                 of the approximating function. This article describes
                 the basic method and extensions of it. It gives four
                 examples, of which two are methods for generating
                 gamma-and t-variates that, while meant to illustrate
                 the basic method, show promise of being faster than the
                 best current methods.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7634",
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
  keywords =     "gamma-and t-variates; inverse of a probability
                 distribution",
  location =     "SEL: Wi",
  revision =     "16/01/94",
  ZMclass =      "65C10 Random number generation 65C05 Monte Carlo
                 methods",
}

@Article{Marsaglia:1984:FEI,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "A fast, easily implemented method for sampling from
                 decreasing or symmetric unimodal density functions",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "5",
  number =       "2",
  pages =        "349--359",
  month =        jun,
  year =         "1984",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65U05 (65C10)",
  MRnumber =     "86a:65137",
  MRreviewer =   "M. Muller",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "An updated version of this algorithm (see
                 \cite{Marsaglia:2000:ZMG}) is used in Matlab's randn()
                 function for generating normally-distributed
                 pseudo-random numbers; see \cite{Moler:2001:CCN}.",
  classification = "B0240G (Monte Carlo methods); C1140G (Monte Carlo
                 methods); C7310 (Mathematics computing)",
  corpsource =   "Computer Sci. Dept., Washington State Univ., Pullman,
                 WA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "FORTRAN subroutine; Fortran subroutines; Monte Carlo
                 methods; numerical analysis; REXP; RNOR; sampling;
                 subroutines; symmetric unimodal density functions;
                 ziggurat method",
  treatment =    "N New Development; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Marsaglia:1984:GCM,
  author =       "George Marsaglia and Ingram Olkin",
  title =        "Generating correlation matrices",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "5",
  number =       "2",
  pages =        "470--475",
  month =        jun,
  year =         "1984",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65C10 (62H99)",
  MRnumber =     "85h:65018",
  MRreviewer =   "G. P. Bhattacharjee",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bibbibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib;
                 MathSciNet database",
  ZMnumber =     "0552.65006",
  abstract =     "This paper describes a variety of methods for
                 generating random correlation matrices, with emphasis
                 on choice of random variables and distributions so as
                 to provide matrices with given structure, expected
                 values of eigenvalues.",
  acknowledgement = ack-nhfb,
  classification = "B0240G (Monte Carlo methods); C1140G (Monte Carlo
                 methods)",
  corpsource =   "Computer Sci. Dept., Washington State Univ., Pullmann,
                 WA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "correlation matrices generation; eigenvalues;
                 eigenvalues and eigenfunctions; matrix algebra; Monte
                 Carlo methods; random correlation matrices; random
                 variables",
  treatment =    "T Theoretical or Mathematical",
  ZMclass =      "65C10 Random number generation 65F30 Other matrix
                 algorithms 62J05 Linear regression",
}

@Article{Modianos:1984:RNG,
  author =       "D. T. Modianos and R. C. Scott and L. W. Cornwell",
  title =        "Random number generation on microcomputers",
  journal =      j-INTERFACES,
  volume =       "14",
  number =       "2",
  pages =        "81--87",
  month =        mar # "\slash " # apr,
  year =         "1984",
  CODEN =        "INFAC4",
  DOI =          "https://doi.org/10.1287/inte.14.4.81",
  ISSN =         "0092-2102 (print), 1526-551X (electronic)",
  ISSN-L =       "0092-2102",
  bibdate =      "Wed Jan 11 10:03:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Interfaces",
}

@Article{Niederreiter:1984:PSP,
  author =       "Harald Niederreiter",
  title =        "The performance of $k$-step pseudorandom number
                 generators under the uniformity test",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "5",
  number =       "4",
  pages =        "798--810",
  month =        dec,
  year =         "1984",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65C10 (11K06)",
  MRnumber =     "86f:65029",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Math. Inst., Austrian Acad. of Sci., Vienna, Austria",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "integers; k-step; linear recursions; pseudorandom
                 number generators; random number generation; recursive
                 functions; sequences; uniformity test",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Papoulis:1984:PRV,
  author =       "Athanasios Papoulis",
  title =        "Probability, random variables, and stochastic
                 processes",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xv + 576",
  year =         "1984",
  ISBN =         "0-07-048468-6",
  ISBN-13 =      "978-0-07-048468-9",
  LCCN =         "QA273 .P2 1984",
  bibdate =      "Tue Jan 17 09:42:57 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in electrical engineering.
                 Communications and information theory",
  acknowledgement = ack-nhfb,
  remark =       "See other editions
                 \cite{Papoulis:1965:PRV,Papoulis:1991:PRV,Papoulis:2002:PRV}.",
  subject =      "Probabilities; Random variables; Stochastic
                 processes",
}

@Article{Paulsen:1984:IRN,
  author =       "Jostein Paulsen",
  title =        "Impact of random number generators in time series
                 {Monte Carlo} simulation",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "19",
  number =       "1",
  pages =        "23--33",
  month =        "????",
  year =         "1984",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658408810711",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:36:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949658408810711",
  abstract =     "In this paper the impact of random number generators
                 in Monte Carlo time series simulation is discussed.
                 Using six different random number generators a large
                 number of autoregressive time series of order one are
                 generated and some important statistics are compared.
                 From this it seems that unless a very poor generator is
                 used, the choice of generator has little or no impact
                 on the conclusions drawn on the basis of a simulation
                 study.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Porter:1984:CNS,
  author =       "Sig Porter",
  title =        "Cryptology and number sequences: Pseudorandom, random,
                 and perfectly random",
  journal =      j-COMPUT-SECUR,
  volume =       "3",
  number =       "1",
  pages =        "43--44",
  month =        feb,
  year =         "1984",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Mon Sep 23 09:44:23 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.sciencedirect.com/science/article/pii/0167404884900257",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Rasmussen:1984:FPS,
  author =       "Jeffrey Lee Rasmussen",
  title =        "A {Fortran} program for statistical evaluation of
                 pseudorandom number generators",
  journal =      j-BEHAV-RES-METH-INSTR-COMP,
  volume =       "16",
  number =       "1",
  pages =        "63--64",
  month =        jan,
  year =         "1984",
  CODEN =        "BRMCEW",
  DOI =          "https://doi.org/10.3758/BF03201053",
  ISSN =         "0743-3808 (print), 1532-5970 (electronic)",
  ISSN-L =       "0743-3808",
  bibdate =      "Mon Jan 16 20:57:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/a25j12g243u6566n/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods, Instruments, and
                 Computers",
  journal-URL =  "http://link.springer.com/journal/13428",
}

@Book{Ronse:1984:FSR,
  author =       "Christian Ronse",
  title =        "{Feedback shift registers}",
  volume =       "169",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "145",
  year =         "1984",
  CODEN =        "LNCSD9",
  DOI =          "????",
  ISBN =         "0-387-13330-5 (paperback)",
  ISBN-13 =      "978-0-387-13330-0 (paperback)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "TK7895.S54 R66 1984",
  bibdate =      "Wed Feb 14 06:00:56 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t0169.htm;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=169",
  acknowledgement = ack-nhfb,
  keywords =     "feedback (electronics); shift registers",
}

@Article{Scholtz:1984:GS,
  author =       "Robert A. Scholtz and Lloyd R. Welch",
  title =        "{GMW} sequences",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-30",
  number =       "3",
  pages =        "548--553",
  month =        may,
  year =         "1984",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1984.1056910",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Mon Jan 16 21:01:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Gordon:1962:SND}.",
  abstract =     "The difference set design of Gordon, Mills, and Welch
                 (GMW) is adapted for use as a pseudorandom number
                 generator. Statistical properties of the generated
                 binary sequences, including periodic correlation,
                 linear span, and $k$-tuple statistics, are derived. One
                 mechanization of a GMW sequence generator is suggested,
                 and the number of sequences that can be generated with
                 a fixed number of shift-register stages and read-only
                 memory (ROM) size is evaluated.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  xxpages =      "548--552",
}

@Article{Schorr:1984:PLV,
  author =       "B. Schorr",
  title =        "Programs for the {Landau} and the {Vavilov}
                 distributions and the corresponding random numbers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "35",
  number =       "1--3",
  pages =        "C-239--C-240",
  month =        "????",
  year =         "1984",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(84)82478-9",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Feb 25 10:56:15 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465584824789",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Smith:1984:EMC,
  author =       "Robert L. Smith",
  title =        "Efficient {Monte Carlo} Procedures for Generating
                 Points Uniformly Distributed over Bounded Regions",
  journal =      j-OPER-RES,
  volume =       "32",
  number =       "6",
  pages =        "1296--1308",
  year =         "1984",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.32.6.1296",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Wed Nov 12 14:33:24 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@InProceedings{Thesen:1984:SER,
  author =       "A. Thesen and Z. Sun and T. J. Wang",
  title =        "Some Efficient Random Number Generators for
                 Micro-Computers",
  crossref =     "Sheppard:1984:WSC",
  pages =        "187--196",
  year =         "1984",
  bibdate =      "Wed Jan 11 10:15:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tolleth:1984:SSM,
  author =       "David W. Tolleth",
  title =        "System sparing for minicomputer-based operations
                 systems",
  journal =      j-ATT-BELL-LAB-TECH-J,
  volume =       "63",
  number =       "6 part 2",
  pages =        "1029--1047",
  year =         "1984",
  CODEN =        "ABLJER",
  ISSN =         "0748-612X (print), 2376-7162 (electronic)",
  ISSN-L =       "0748-612X",
  bibdate =      "Fri Nov 12 09:17:39 2010",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A queueing model was developed to derive guidelines
                 for deploying system spares --- complete minicomputer
                 systems used as backup for failed minicomputer-based
                 Operations Systems (OSs). The model is a
                 three-dimensional set of queueing equations
                 incorporating a time-dependent number of repairers, and
                 exponential random variables for the time between
                 failures for each minicomputer system, the time to
                 repair each system, and the time to switch between
                 failed systems and spares. Guidelines derived from
                 numerical solution of the model are being used by the
                 Bell Operating Companies and AT\&T Communications to
                 aid planning studies for (1) proving-in system spares,
                 (2) meeting specific OS availability objectives, and
                 (3) improving minicomputer maintenance staff
                 utilization.",
  acknowledgement = ack-nhfb,
  fjournal =     "AT\&T Bell Laboratories Technical Journal",
  keywords =     "probability --- queueing theory",
  subject =      "Minicomputer Maintenance and Operations Center (MMOC);
                 minicomputer-based operations systems; system sparing",
  topic =        "computers, microprocessor",
}

@Article{Ulrich:1984:CGD,
  author =       "Gary Ulrich",
  title =        "Computer generation of distributions on the
                 $m$-sphere",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "2",
  pages =        "158--163",
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  MRclass =      "62-04 (65C10 92-04)",
  MRnumber =     "86j:62001",
  MRreviewer =   "B. Dimitrov",
  bibdate =      "Sat Apr 21 10:24:03 MDT 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/as1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  affiliation =  "Virginia Polytechnic Inst \& State Univ, Blacksburg,
                 VA, USA",
  affiliationaddress = "Virginia Polytechnic Inst \& State Univ,
                 Blacksburg, VA, USA",
  classification = "723; 922",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  journalabr =   "Appl Stat",
  keywords =     "Algorithms; computer programming; distribution on the
                 m-sphere; Fisher-von Mises distribution; mathematical
                 statistics --- Monte Carlo Methods; probability ---
                 Random Processes",
}

@InProceedings{Vazirani:1984:ESP,
  author =       "U. V. Vazirani and V. V. Vazirani",
  title =        "Efficient and Secure Pseudo-Random Number Generation",
  crossref =     "IEEE:1984:ASF",
  pages =        "458--463",
  year =         "1984",
  DOI =          "https://doi.org/10.1109/SFCS.1984.715945",
  bibdate =      "Thu Apr 5 06:13:39 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Whitney:1984:GTP,
  author =       "C. A. Whitney",
  title =        "Generating and Testing Pseudorandom Numbers",
  journal =      j-BYTE,
  volume =       "9",
  number =       "11",
  pages =        "128--129",
  month =        nov,
  year =         "1984",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  bibdate =      "Sat Dec 30 11:50:13 1995",
  bibsource =    "/usr/local/src/bib/bibliography/Distributed/QLD/1984.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "(VBI-001721)",
  date =         "01/07/93",
  descriptors =  "random number",
  enum =         "11465",
  fjournal =     "BYTE Magazine",
  references =   "0",
}

@Article{Wichmann:1984:SAC,
  author =       "B. A. Wichmann and I. D. Hill",
  title =        "Statistical Algorithms: Correction: {Algorithm AS
                 183}: An Efficient and Portable Pseudo-Random Number
                 Generator",
  journal =      j-APPL-STAT,
  volume =       "33",
  number =       "1",
  pages =        "123--123",
  year =         "1984",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:00 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Afflerbach:1985:CMR,
  author =       "L. Afflerbach and H. Grothe",
  title =        "Calculation of {Minkowski}-reduced lattice bases",
  journal =      j-COMPUTING,
  volume =       "35",
  number =       "3--4",
  pages =        "269--276",
  month =        sep,
  year =         "1985",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "11H55 (11Y99 65C10)",
  MRnumber =     "87g:11078",
  MRreviewer =   "C. G. Lekkerkerker",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Hochschule Darmstadt, Fachbereich
                 Mathematik, Darmstadt, West Germany",
  affiliationaddress = "West Germany",
  classification = "723; 921",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "computer programming --- Algorithms; lattice
                 structure; mathematical techniques; Minkowski-reduced
                 lattice bases; shortest lattice vectors",
}

@Article{Afflerbach:1985:PRN,
  author =       "L. Afflerbach",
  title =        "The pseudo-random number generators in {Commodore} and
                 {Apple} microcomputers",
  journal =      j-STATIST-PAPERS,
  volume =       "26",
  number =       "1",
  pages =        "321--333",
  month =        dec,
  year =         "1985",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02932542",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  bibdate =      "Tue Jan 10 15:29:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers = Statistische Hefte",
  journal-URL =  "http://link.springer.com/journal/362",
}

@Article{Ahrens:1985:SRS,
  author =       "J. H. Ahrens and Ulrich Dieter",
  title =        "Sequential Random Sampling",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "157--169",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/214392.214402;
                 http://www.acm.org/pubs/citations/journals/toms/1985-11-2/p157-ahrens/",
  abstract =     "Fast algorithms for selecting a random set of exactly
                 $k$ records from a file of $n$ records are constructed.
                 Selection is sequential: the sample records are chosen
                 in the same order in which they occur in the file. All
                 procedures run in $ O(k) $ time. The ``geometric''
                 method has two versions: with or without $ O(k) $
                 auxiliary space. A further procedure uses hashing
                 techniques and requires $ O(k) $ space.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@InProceedings{Akl:1985:FPR,
  author =       "Selim G. Akl and Henk Meijer",
  title =        "A Fast Pseudo Random Permutation Generator With
                 Applications to Cryptology",
  crossref =     "Blakley:1985:ACP",
  pages =        "269--275",
  year =         "1985",
  bibdate =      "Thu Feb 23 08:43:57 MST 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=????&volume=0&issue=0;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=????&volume=0&issue=0&spage=269",
  acknowledgement = ack-nhfb,
}

@Article{Berry:1985:RPD,
  author =       "Keith Berry and Cliff J. Huang",
  title =        "Random pseudo-disturbance generators in a stochastic
                 simulation of an econometric model",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "22",
  number =       "3--4",
  pages =        "285--302",
  month =        "????",
  year =         "1985",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658508810851",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:20:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949658508810851",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Blom:1985:SPE,
  author =       "Gunnar Blom",
  title =        "A simple property of exchangeable random variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "92",
  number =       "7",
  pages =        "491--492",
  month =        "????",
  year =         "1985",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  MRclass =      "60G09",
  MRnumber =     "87i:60044",
  bibdate =      "Wed Dec 3 17:17:33 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Bounas:1985:DDS,
  author =       "Adam C. Bounas",
  title =        "Direct determination of a ``seed'' binary matrix",
  journal =      j-INFO-PROC-LETT,
  volume =       "20",
  number =       "1",
  pages =        "47--50",
  day =          "2",
  month =        jan,
  year =         "1985",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A60 (94A15)",
  MRnumber =     "86g:94038",
  MRreviewer =   "S. Guia{\c{s}}u",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Greek Atomic Energy Commission, Computer Science
                 Dep, Attiki, Greece",
  classification = "723; 922; B6120B (Codes); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., Min. of Res. and Technol.,
                 Greek Atomic Energy Comm., Attiki, Greece",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "binary matrix; cryptography; data transformation;
                 generalized feedback shift register pseudorandom number
                 generator; keys; mathematical statistics --- Random
                 Number Generation; pseudorandom number generators;
                 random number generation; seed matrices; seed matrix;
                 stream enciphering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burks:1985:CEM,
  author =       "Arthur W. Burks and Alston S. Householder and N.
                 Metropolis and S. M. Ulam",
  title =        "Comments on Early {Monte Carlo} Computations and
                 Scientific Meetings",
  journal =      j-ANN-HIST-COMPUT,
  volume =       "7",
  number =       "2",
  pages =        "147--148",
  month =        apr # "\slash " # jun,
  year =         "1985",
  CODEN =        "AHCOE5",
  ISSN =         "0164-1239",
  bibdate =      "Fri Nov 1 15:29:22 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dlib.computer.org/an/books/an1985/pdf/a2141.pdf;
                 http://www.computer.org/annals/an1985/a2141abs.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the History of Computing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5488650",
}

@Article{Clark:1985:PNG,
  author =       "R. N. Clark",
  title =        "A Pseudorandom Number Generator",
  journal =      j-SIMULATION,
  volume =       "45",
  number =       "5",
  pages =        "252--255",
  month =        nov,
  year =         "1985",
  CODEN =        "SIMUA2",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 09:56:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See criticism and response
                 \cite{Hultquist:1986:LST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Dowdy:1985:AUM,
  author =       "Lawrence W. Dowdy and Manvinder S. Chopra",
  title =        "On the applicability of using multiprogramming level
                 distributions",
  journal =      j-SIGMETRICS,
  volume =       "13",
  number =       "2",
  pages =        "116--127",
  month =        aug,
  year =         "1985",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/317786.317817",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:01:51 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "A computer system's workload is represented by its
                 multiprogramming level, which is defined as the number
                 of tasks (jobs, customers) which actively compete for
                 resources within the system. In a product-form queuing
                 network model of the system, the workload is modeled by
                 assuming that the multiprogramming level is either
                 fixed (i.e., closed model) or that the multiprogramming
                 level depends upon an outside arrival process (i.e.,
                 open model). However, in many actual systems, closed
                 and open models are both inappropriate since the
                 multiprogramming level is neither fixed nor governed by
                 an outside arrival process. In an actual system., the
                 multiprogramming level varies due to features such as
                 task spawning, killing, blocking, parallel processing,
                 and/or simultaneous resource possession. The
                 multiprogramming level is a random variable with an
                 associated distribution. This paper demonstrates that
                 improved models can result from using this
                 multiprogramming level distribution information.
                 Several examples relative to open versus closed models,
                 subsystem models, actual system models, and blocking
                 models are given which demonstrate the applicability of
                 using multiprogramming level distributions. This
                 applicability, shown via the examples, is the main
                 contribution of the paper. The examples also motivate
                 interesting theoretical results relating to open
                 models, closed models, and subsystem models.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
  keywords =     "blocking; multiprogramming level distributions; open
                 and closed queuing networks; subsystem modeling",
}

@InProceedings{Dudewicz:1985:RNG,
  author =       "E. J. Dudewicz and Z. A. Karian and R. J. {Marshall,
                 III}",
  editor =       "????",
  booktitle =    "Modeling and Simulation on Microcomputers: 1985",
  title =        "Random number generation on microcomputers",
  publisher =    pub-SOC-COMPUT-SIM,
  address =      pub-SOC-COMPUT-SIM:adr,
  pages =        "9--14",
  year =         "1985",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Wed Jan 11 09:58:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Dudewicz:1985:TMD,
  author =       "Edward J. Dudewicz and Zaven A. Karian",
  title =        "Tutorial: Modern Design and Analysis of Discrete-Event
                 Computer Simulations",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "ix + 475",
  year =         "1985",
  ISBN =         "0-8186-0597-9 (paperback), 0-8186-4597-0",
  ISBN-13 =      "978-0-8186-0597-0 (paperback), 978-0-8186-4597-6",
  LCCN =         "QA76.9.C65 D83 1985",
  bibdate =      "Thu Jan 5 17:30:55 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "IEEE catalog number EH0227-9.",
  subject =      "Digital computer simulation",
}

@Article{Dyadkin:1985:AMN,
  author =       "I. G. Dyad'kin",
  title =        "An algorithm for modelling a normal distribution",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "25",
  number =       "4",
  pages =        "91--93",
  month =        "????",
  year =         "1985",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(85)90148-X",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Feb 27 09:55:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "English translation of Russian original published in
                 Zh. vychisl. Mat. mat. Fiz., {\bf 25}(7), 1102--1104,
                 1985.",
  URL =          "http://www.sciencedirect.com/science/article/pii/004155538590148X",
  abstract =     "An algorithm for modelling a normal law which does not
                 include transcendental or irrational functions, or
                 division operations, is described. The efficiency of
                 this and other well-known algorithms is illustrated by
                 comparing modelling times by direct computation on a
                 BESM-6 computer.",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@InProceedings{Fairfield:1985:LRN,
  author =       "R. C. Fairfield and R. L. Mortenson and K. B.
                 Coulthart",
  title =        "An {LSI} Random Number Generator ({RNG})",
  crossref =     "Blakley:1985:ACP",
  pages =        "203--230",
  year =         "1985",
  DOI =          "https://doi.org/10.1007/3-540-39568-7_18",
  bibdate =      "Wed Feb 22 10:40:40 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=????&volume=0&issue=0;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=????&volume=0&issue=0&spage=203",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Feltz:1985:MLE,
  author =       "Carol J. Feltz and Richard L. Dykstra",
  title =        "Maximum likelihood estimation of the survival
                 functions of $ {N} $ stochastically ordered random
                 variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "80",
  number =       "392",
  pages =        "1012--1019",
  month =        dec,
  year =         "1985",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62G05 (62N05)",
  MRnumber =     "87d:62070",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2288568",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Figiel:1985:NLP,
  author =       "K. D. Figiel and D. R. Sule",
  title =        "New lagged product test for random number generators",
  journal =      j-COMPUT-IND-ENG,
  volume =       "9",
  number =       "3",
  pages =        "287--296",
  month =        mar,
  year =         "1985",
  CODEN =        "CINDDL",
  ISSN =         "0360-8352 (print), 1879-0550 (electronic)",
  ISSN-L =       "0360-8352",
  bibdate =      "Wed Jan 11 10:00:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& industrial engineering",
}

@Article{Fincke:1985:IMC,
  author =       "U. Fincke and M. Pohst",
  title =        "Improved methods for calculating vectors of short
                 length in a lattice, including a complexity analysis",
  journal =      j-MATH-COMPUT,
  volume =       "44",
  number =       "170",
  pages =        "463--471",
  month =        apr,
  year =         "1985",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11H50 (11H55)",
  MRnumber =     "86e:11050",
  MRreviewer =   "A. K. Lenstra",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dusseldorf Univ., West Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "complexity analysis; computational complexity;
                 ellipsoid; lattice; reduction procedure;
                 short-length-vector calculation; vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Gibbons:1985:NSI,
  author =       "Jean Dickinson Gibbons",
  title =        "Nonparametric Statistical Inference",
  volume =       "65",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Second",
  pages =        "xv + 408",
  year =         "1985",
  ISBN =         "0-8247-7327-6",
  ISBN-13 =      "978-0-8247-7327-4",
  LCCN =         "QA278.8 .G5 1985",
  bibdate =      "Tue Jan 31 14:50:08 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  acknowledgement = ack-nhfb,
  subject =      "Nonparametric statistics",
}

@Article{Gleser:1985:EPG,
  author =       "Leon Jay Gleser",
  title =        "Exact power of goodness-of-fit tests of {Kolmogorov}
                 type for discontinuous distributions",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "80",
  number =       "392",
  pages =        "954--958",
  month =        dec,
  year =         "1985",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62G10 (62E15)",
  MRnumber =     "87g:62065",
  MRreviewer =   "F. T. Wright",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2288560",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@InProceedings{Goldreich:1985:CAR,
  author =       "Oded Goldreich and Shafi Goldwasser and Silvio
                 Micali",
  title =        "On the Cryptographic Applications of Random Functions
                 (Extended Abstract)",
  crossref =     "Blakley:1985:ACP",
  pages =        "276--288",
  year =         "1985",
  bibdate =      "Thu Feb 23 08:43:57 MST 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=????&volume=0&issue=0;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=????&volume=0&issue=0&spage=276",
  acknowledgement = ack-nhfb,
}

@Article{Gordon:1985:SSB,
  author =       "T. F. Gordon",
  title =        "Statistical simulations on the {BBC} microcomputer:
                 significance tests of the pseudo-random number
                 generator",
  journal =      j-J-APPL-STAT,
  volume =       "12",
  number =       "2",
  pages =        "147--155",
  year =         "1985",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/02664768500000020",
  ISSN =         "0266-4763 (print), 1360-0532 (electronic)",
  ISSN-L =       "0266-4763",
  bibdate =      "Tue Sep 6 11:15:53 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/routledge/02664763.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/02664768500000020",
  abstract =     "Statistical tests of significance are carried out on
                 the feedback shift register pseudo-random number
                 generator employed on the BBC microcomputer. The tests
                 are based on the practicalities of using a
                 microcomputer in simulations for statistical education.
                 The results indicate that the generator is not
                 universally acceptable in this role.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/cjas20",
  onlinedate =   "28 Jul 2006",
}

@Book{Griffiths:1985:ASA,
  editor =       "Paul Griffiths and Ian David Hill",
  title =        "Applied statistics algorithms",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "307",
  year =         "1985",
  ISBN =         "0-85312-772-7 (UK), 0-470-20184-3 (US)",
  ISBN-13 =      "978-0-85312-772-7 (UK), 978-0-470-20184-8 (US)",
  LCCN =         "QA276.4 .A57 1985",
  bibdate =      "Tue Feb 7 06:56:01 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Published for the Royal Statistical Society.",
  series =       "Ellis Horwood series in mathematics and its
                 applications",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical statistics; Data processing; Statistics;
                 Computer algorithms",
}

@InProceedings{Haastad:1985:CST,
  author =       "J. H{\aa}stad and A. Shamir",
  title =        "The cryptographic security of truncated linearly
                 related variables",
  crossref =     "ACM:1985:PSA",
  pages =        "356--362",
  year =         "1985",
  bibdate =      "Wed Feb 20 18:33:46 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/stoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/22145/p356-hastad/p356-hastad.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/22145/p356-hastad/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Helfrich:1985:ACMa,
  author =       "B. Helfrich",
  title =        "An algorithm to construct {Minkowski}-reduced
                 lattice-bases",
  crossref =     "Mehlhorn:1985:SAS",
  pages =        "173--179",
  year =         "1985",
  DOI =          "https://doi.org/10.1007/BFb0024006",
  bibdate =      "Sat Feb 18 21:45:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Helfrich:1985:ACMb,
  author =       "B. Helfrich",
  title =        "Algorithms to construct {Minkowski} reduced and
                 {Hermite} reduced lattice bases",
  journal =      j-THEOR-COMP-SCI,
  volume =       "41",
  number =       "2-3",
  pages =        "125--139",
  month =        "????",
  year =         "1985",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Fachbereich Math., Johann Wolfgang Goethe-Univ.,
                 Frankfurt-Main, West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "fixed dimension; Hermite reduced lattice bases;
                 Minkowski reduced lattice bases; polynomial;
                 polynomials; runtime",
  pubcountry =   "Netherlands A01",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hill:1985:SAR,
  author =       "I. D. Hill",
  title =        "Statistical Algorithms: {Remark AS R57}: a Remark on
                 {Algorithm AS 193}: a Revised Algorithm for the
                 Spectral Test",
  journal =      j-APPL-STAT,
  volume =       "34",
  number =       "1",
  pages =        "102--103",
  year =         "1985",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:17 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Hopkins:1983:SAAb}.",
  URL =          "http://lib.stat.cmu.edu/apstat/193",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Hurd:1985:NEM,
  author =       "Cuthbert C. Hurd",
  title =        "A Note on Early {Monte Carlo} Computations and
                 Scientific Meetings",
  journal =      j-ANN-HIST-COMPUT,
  volume =       "7",
  number =       "2",
  pages =        "141--155",
  month =        apr # "\slash " # jun,
  year =         "1985",
  CODEN =        "AHCOE5",
  ISSN =         "0164-1239",
  bibdate =      "Fri Nov 1 15:29:22 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dlib.computer.org/an/books/an1985/pdf/a2141.pdf;
                 http://www.computer.org/annals/an1985/a2141abs.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the History of Computing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5488650",
}

@Article{Imai:1985:PNG,
  author =       "T. Imai and Masanori Fushimi",
  title =        "Pseudorandom number generators whose subsequences are
                 multidimensionally equidistributed",
  journal =      j-TRANS-INFO-PROCESSING-SOC-JAPAN,
  volume =       "26",
  pages =        "454--458",
  month =        "????",
  year =         "1985",
  CODEN =        "JSGRD5",
  ISSN =         "0387-5806",
  ISSN-L =       "0387-5806",
  bibdate =      "Tue Jan 10 19:13:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the Information Processing Society of
                 Japan",
  language =     "Japanese",
}

@Article{Jodrey:1985:CSC,
  author =       "W. S. Jodrey and E. M. Tory",
  title =        "Computer simulation of close random packing of equal
                 spheres",
  journal =      j-PHYS-REV-A,
  volume =       "32",
  number =       "4",
  pages =        "2347--2351",
  month =        oct,
  year =         "1985",
  CODEN =        "PLRAAN",
  DOI =          "https://doi.org/10.1103/PhysRevA.32.2347",
  ISSN =         "1050-2947 (print), 1094-1622, 1538-4446, 1538-4519",
  ISSN-L =       "1050-2947",
  bibdate =      "Thu Aug 13 17:43:15 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevA.32.2347",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review A (Atomic, Molecular, and Optical
                 Physics)",
  journal-URL =  "http://pra.aps.org/browse",
}

@Article{Kachitvichyanukul:1985:CGH,
  author =       "Voratas Kachitvichyanukul and Burce Schmeiser",
  title =        "Computer generation of hypergeometric random
                 variates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "22",
  number =       "2",
  pages =        "127--145",
  year =         "1985",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658508810839",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:11:04 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Kallenberg:1985:NCC,
  author =       "W. C. M. Kallenberg and J. Oosterhoff and B. F.
                 Schriever",
  title =        "The number of classes in chi-squared goodness-of-fit
                 tests",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "80",
  number =       "392",
  pages =        "959--968",
  month =        dec,
  year =         "1985",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62G10",
  MRnumber =     "87e:62049",
  MRreviewer =   "M. G. Akritas",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2288561",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Knuth:1985:DLC,
  author =       "Donald E. Knuth",
  title =        "Deciphering a linear congruential encryption",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "IT-31",
  number =       "1",
  pages =        "49--52",
  month =        jan,
  year =         "1985",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.1985.1056997",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  MRclass =      "94A60",
  MRnumber =     "87c:94040",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  note =         "Russian translation, to appear.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  keywords =     "algorithms; design",
  subject =      "G.3 Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation E Data, DATA
                 ENCRYPTION",
}

@InProceedings{Lambrou:1985:DPR,
  author =       "L. Lambrou and V. C. Bhavsar and U. G. Gujar",
  booktitle =    "Proceedings of the Annual {APICS} Computer Science
                 Seminar",
  title =        "On the discrepancy of pseudo-random number sequences
                 generated by the linear congruential method",
  organization = "Department of Mathematics, Statistics and Computing
                 Science, Dalhousie University, Halifax, NS, Canada",
  publisher =    "????",
  address =      "????",
  pages =        "53--68",
  month =        nov,
  year =         "1985",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "I cannot find this in major search engines or
                 databases, or library catalogs.",
}

@Article{Leemis:1985:RVG,
  author =       "L. Leemis and B. W. Schmeiser",
  title =        "Random Variate Generation for {Monte Carlo}
                 Experiments",
  journal =      j-IEEE-TRANS-RELIAB,
  volume =       "R-34",
  number =       "1",
  pages =        "81--85",
  month =        apr,
  year =         "1985",
  CODEN =        "IEERAJ",
  DOI =          "https://doi.org/10.1109/TR.1985.5221941",
  ISSN =         "0018-9529 (print), 1558-1721 (electronic)",
  ISSN-L =       "0018-9529",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Reliability",
}

@Article{Lenstra:1985:FMP,
  author =       "Arjen K. Lenstra",
  title =        "Factoring multivariate polynomials over finite
                 fields",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "30",
  number =       "2",
  pages =        "235--248",
  month =        apr,
  year =         "1985",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(85)90016-9",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Sat Mar 17 06:55:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000085900169",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@InProceedings{Levin:1985:OWF,
  author =       "L. A. Levin",
  title =        "One-way functions and pseudorandom generators",
  crossref =     "ACM:1985:PSA",
  pages =        "363--365",
  year =         "1985",
  bibdate =      "Wed Feb 20 18:33:46 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/22145/p363-levin/p363-levin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/22145/p363-levin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Marsaglia:1985:CVR,
  author =       "George Marsaglia",
  title =        "A Current View of Random Number Generators",
  crossref =     "Billard:1985:CSS",
  pages =        "3--10",
  year =         "1985",
  bibdate =      "Thu Dec 18 13:39:28 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://stat.fsu.edu/pub/diehard/;
                 http://www.evensen.org/marsaglia/keynote.ps",
  acknowledgement = ack-nhfb,
  remark =       "This paper introduces the Parking Lot test used in the
                 Diehard Battery test suite.",
}

@Article{Marsaglia:1985:MSR,
  author =       "George Marsaglia and Liang-Huei Tsay",
  title =        "Matrices and the structure of random number
                 sequences",
  journal =      j-LINEAR-ALGEBRA-APPL,
  volume =       "67",
  pages =        "147--156",
  year =         "1985",
  CODEN =        "LAAPAW",
  ISSN =         "0024-3795 (print), 1873-1856 (electronic)",
  ISSN-L =       "0024-3795",
  MRclass =      "65C10 (15A99)",
  MRnumber =     "86g:65018",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Thu Jan 23 11:18:08 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Linear Algebra and its Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00243795",
}

@Article{Marsaglia:1985:NPT,
  author =       "George Marsaglia",
  title =        "Note on a Proposed Test for Random Number Generators",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-34",
  number =       "8",
  pages =        "756--758",
  month =        aug,
  year =         "1985",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1985.1676623",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  MRclass =      "65C10",
  MRnumber =     "86h:65010",
  bibdate =      "Sun Jul 10 08:33:24 MDT 2011",
  bibsource =    "http://dblp.uni-trier.de/db/journals/tc/tc34.html#Marsaglia85;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676623",
  ZMnumber =     "0572.65001",
  abstract =     "This paper shows that many random number generators
                 with symmetric output would have the same mean as a
                 truly uniform random number generator in the recently
                 proposed test by {\it J. Savir} [IEEE Trans. Comput.
                 C-32, 960--961 (1983; Zbl 0518.65003)] and pass the
                 test. So, the author provides a better test based on
                 the exact distribution of the outcome of random number
                 sequences. The distribution is derived by using Markov
                 chain model.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "Markov chain; test of randomness; uniform random
                 number",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/tc/Marsaglia85",
  ZMclass =      "65C10 Random number generation",
  ZMreviewer =   "K. Uosaki",
}

@Article{McLeod:1985:SAR,
  author =       "A. Ian McLeod",
  title =        "Statistical Algorithms: {Remark AS R58}: a Remark on
                 {Algorithm AS 183}. An Efficient and Portable
                 Pseudo-Random Number Generator",
  journal =      j-APPL-STAT,
  volume =       "34",
  number =       "2",
  pages =        "198--200",
  year =         "1985",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:20 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Wichmann:1982:SAA,Zeisel:1986:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/183",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Monahan:1985:ARN,
  author =       "John F. Monahan",
  title =        "Accuracy in Random Number Generation",
  journal =      j-MATH-COMPUT,
  volume =       "45",
  number =       "172",
  pages =        "559--568",
  month =        oct,
  year =         "1985",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (68U20)",
  MRnumber =     "86i:65009",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290B (Error analysis in numerical methods); B0290F
                 (Interpolation and function approximation); C4110
                 (Error analysis in numerical methods); C4130
                 (Interpolation and function approximation)",
  corpsource =   "Dept. of Stat., North Carolina State Univ., Raleigh,
                 NC, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "accuracy; approximation; approximations; continuous
                 distribution; continuous random variables; digital
                 computer; discrete; discretization error; error
                 analysis; generation; heuristic analysis; overflow
                 problems; random number; random number generation;
                 simulation bias",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Montgomery:1985:MMT,
  author =       "Peter L. Montgomery",
  title =        "Modular Multiplication Without Trial Division",
  journal =      j-MATH-COMPUT,
  volume =       "44",
  number =       "170",
  pages =        "519--521",
  month =        apr,
  year =         "1985",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11Y16",
  MRnumber =     "86e:11121",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods); C6130 (Data handling techniques)",
  corpsource =   "Syst. Dev. Corp., Santa Monica, CA, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "digital arithmetic; integer; integer arithmetic;
                 modular arithmetic; modular multiplication;
                 multiplication; N-residue; N-residue arithmetic; number
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niederreiter:1985:STP,
  author =       "Harald Niederreiter",
  title =        "The serial test for pseudo-random numbers generated by
                 the linear congruential method",
  journal =      j-NUM-MATH,
  volume =       "46",
  number =       "1",
  pages =        "51--68",
  month =        mar,
  year =         "1985",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "86i:65010",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C7310 (Mathematics
                 computing)",
  corpsource =   "Math. Inst., Austrian Acad. of Sci., Vienna, Austria",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "linear congruential method; Monte Carlo methods;
                 numerical integration; numerical methods; pseudorandom
                 numbers generation; random number generation; serial
                 test",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Norton:1985:EBG,
  author =       "G. Norton",
  title =        "Extending the binary {GCD} algorithm",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "229",
  pages =        "363--372",
  year =         "1985",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Dec 29 07:18:28 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Percus:1985:PBS,
  author =       "Ora E. Percus and Jerome K. Percus",
  title =        "Probability Bounds on the Sum of Independent
                 Nonidentically Distributed Binomial Random Variables",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "45",
  number =       "4",
  pages =        "621--640",
  month =        aug,
  year =         "1985",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "60E05 (62E15)",
  MRnumber =     "86k:60022",
  MRreviewer =   "R. J. Tomkins",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  affiliationaddress = "New York Univ, Courant Inst of Mathematical
                 Sciences, New York, NY, USA",
  classification = "922",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  journalabr =   "SIAM J Appl Math",
  keywords =     "CDC 48-bit multiplicative congruential generator {\tt
                 rannyu()}; nonidentically distributed binomial random
                 variables; probability; probability bounds; random
                 processes",
}

@Article{Pierchala:1985:IMU,
  author =       "Carl D. Pierchala",
  title =        "An Improvement for the {McGill University Random
                 Number Package}",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "2",
  number =       "4",
  pages =        "317--322",
  month =        feb,
  year =         "1985",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(85)90004-0",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 12:35:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper documents and provides code for two new
                 entry points which increase the flexibility of the
                 McGill University Random Number Package. With these
                 additions the user can access internal locations
                 containing the pseudo-random integers that control the
                 random sequences produced by the generator. A detailed
                 example of the use of the new entry points is provided.
                 Finally, some comments about the documentation of
                 random number generators are made.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
  keywords =     "congruential generators; documentation; FORTRAN; IBM
                 360/370 assembler; random numbers; shift-register
                 generators",
}

@Article{Reichert:1985:LLT,
  author =       "P. Reichert and R. Schilling",
  title =        "A local limit theorem for strongly dependent random
                 variables and its application to a chaotic
                 configuration of atoms",
  journal =      j-J-MATH-PHYS,
  volume =       "26",
  number =       "6",
  pages =        "1165--1172",
  month =        jun,
  year =         "1985",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.526519",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  MRclass =      "60F05 (81C20 82A31)",
  MRnumber =     "86i:60076",
  bibdate =      "Mon Oct 31 11:57:22 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1985.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v26/i6/p1165_s1",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  pagecount =    "8",
}

@Book{Riesel:1985:PNC,
  author =       "Hans Riesel",
  title =        "Prime numbers and computer methods for factorization",
  volume =       "57",
  publisher =    pub-BIRKHAUSER-BOSTON,
  address =      pub-BIRKHAUSER-BOSTON:adr,
  pages =        "xvi + 463",
  year =         "1985",
  ISBN =         "0-8176-3291-3",
  ISBN-13 =      "978-0-8176-3291-5",
  LCCN =         "QA246 .R54 1985",
  bibdate =      "Fri Mar 9 15:07:11 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Numbers, Prime; Data processing; Factorization
                 (Mathematics)",
}

@Article{Saito:1985:HSS,
  author =       "T. Saito and Masanori Fushimi and T. Imai",
  title =        "High-speed {$M$}-sequence random number generation
                 based on the primitive polynomials with many terms",
  journal =      j-TRANS-INFO-PROCESSING-SOC-JAPAN,
  volume =       "26",
  number =       "??",
  pages =        "148--152",
  month =        "????",
  year =         "1985",
  CODEN =        "JSGRD5",
  ISSN =         "0387-5806",
  ISSN-L =       "0387-5806",
  bibdate =      "Tue Jan 10 19:18:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the Information Processing Society of
                 Japan",
  language =     "Japanese",
}

@Article{Sawitzki:1985:ARN,
  author =       "G. Sawitzki",
  title =        "Another Random Number Generator Which Should Be
                 Avoided",
  journal =      "Statistical Software Newsletter",
  volume =       "11",
  number =       "2",
  pages =        "81--82",
  month =        "????",
  year =         "1985",
  CODEN =        "SSNEEX",
  ISSN =         "0173-5896",
  bibdate =      "Thu Jan 05 11:28:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "I cannot find this article online, or any online
                 archives for this journal. It merged in 1991 into a
                 section of {\em Computational Statistics and Data
                 Analysis}, ISSN 0167-9473 (1983--date),
                 http://www.sciencedirect.com/science/journal/01679473.
                 One reference suggests this is about a generator in the
                 IBM PC BASIC language. Ripley \cite{Ripley:1990:TPN}
                 shows it to be an incorrectly-implemented LCG with a
                 period of only $ 2^{16} $, and nonuniform distribution
                 in $ [0, 2^{24} - 1] $; it exhibits severe lattice
                 structure when successive pairs are plotted.",
}

@Article{Shanthikumar:1985:DRV,
  author =       "J. G. Shanthikumar",
  title =        "Discrete Random Variate Generation Using
                 Uniformization",
  journal =      j-EUR-J-OPER-RES,
  volume =       "21",
  number =       "3",
  pages =        "387--398",
  month =        sep,
  year =         "1985",
  CODEN =        "EJORDT",
  DOI =          "https://doi.org/10.1016/0377-2217(85)90159-6",
  ISSN =         "0377-2217 (print), 1872-6860 (electronic)",
  ISSN-L =       "0377-2217",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "European Journal of Operational Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03772217",
}

@Article{Smith:1985:VHP,
  author =       "K. A. Smith and S. F. Reddaway and D. M. Scott",
  title =        "Very high performance pseudo-random number generation
                 on {DAP}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "37",
  number =       "1--3",
  pages =        "239--244",
  month =        jul,
  year =         "1985",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(85)90158-4",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465585901584",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Thesen:1985:EGU,
  author =       "Arne Thesen",
  title =        "An efficient generator of uniformly distributed random
                 variates between zero and one",
  journal =      j-SIMULATION,
  volume =       "44",
  number =       "1",
  pages =        "17--22",
  month =        jan,
  year =         "1985",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978504400103",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 10:09:05 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/44/1/17",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@InProceedings{Vazirani:1985:ESP,
  author =       "Umesh V. Vazirani and Vijay V. Vazirani",
  title =        "Efficient and Secure Pseudo-Random Number Generation
                 (Extended Abstract)",
  crossref =     "Blakley:1985:ACP",
  pages =        "193--202",
  year =         "1985",
  bibdate =      "Thu Feb 23 08:43:57 MST 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=????&volume=0&issue=0;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=????&volume=0&issue=0&spage=193",
  acknowledgement = ack-nhfb,
}

@Article{Vitter:1985:RSR,
  author =       "Jeffrey Scott Vitter",
  title =        "Random Sampling with a Reservoir",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "37--57",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (62-04)",
  MRnumber =     "87b:65007",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/3147.3165;
                 http://www.acm.org/pubs/citations/journals/toms/1985-11-1/p37-vitter/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; design; performance; theory;
                 verification",
  reviewer =     "Brian Conolly",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf G.3}: Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Random number generation.
                 {\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical software. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis. {\bf D.4.3}: Software, OPERATING
                 SYSTEMS, File Systems Management, Access methods.",
}

@Article{Yashchin:1985:ADC,
  author =       "Emmanuel Yashchin",
  title =        "On the Analysis and Design of {Cusum-Shewhart} Control
                 Schemes",
  journal =      j-IBM-JRD,
  volume =       "29",
  number =       "4",
  pages =        "377--391",
  month =        jul,
  year =         "1985",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Tue Mar 25 14:26:59 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper presents a new approach to design of
                 CUSUM-Shewhart control schemes and analysis of the
                 associated run length distributions (under the
                 assumption that the observations correspond to a
                 sequence of independent and identically distributed
                 random variables). This approach is based on the theory
                 of Markov chains and it enables one to analyze the ARL
                 (Average Run Length), the distribution function of the
                 run length, and other quantities associated with a
                 CUSUM-Shewhart scheme. In addition, it enables one to
                 analyze situations in which out-of-target conditions
                 are not present initially, but rather appear after a
                 substantial period of time during which the process has
                 operated in on-target mode (steady state analysis). The
                 paper also introduces an APL package, DARCS, for
                 design, analysis, and running of both one-and two-sided
                 CUSUM-Shewhart control schemes and gives several
                 examples of its application.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM, Research Div, Yorktown Heights, NY, USA",
  affiliationaddress = "IBM, Research Div, Yorktown Heights, NY, USA",
  classcodes =   "C1310 (Control system analysis and synthesis
                 methods)",
  classification = "723; 913",
  corpsource =   "Div. of Res., Yorktown Heights, NY, USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  journalabr =   "IBM J Res Dev",
  keywords =     "APL package; average run length; computer software;
                 control system analysis; control system synthesis;
                 cumulative sum control charts; CUSUM; Cusum-Shewhart
                 control schemes; DARCS; DARCS software package;
                 distribution function; Markov chains; quality control;
                 run length distributions; sequential hypothesis
                 testing; Shewhart control schemes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Afflerbach:1986:SLS,
  author =       "L. Afflerbach",
  title =        "The sub-lattice structure of linear congruential
                 random number generators",
  journal =      j-MANUSCR-MATH,
  volume =       "55",
  number =       "??",
  pages =        "455--465",
  month =        "????",
  year =         "1986",
  CODEN =        "MSMHB2",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  bibdate =      "Tue Jan 10 15:31:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Manuscripta Mathematica",
}

@Article{Anderson:1986:MMC,
  author =       "Herbert L. Anderson",
  title =        "{Metropolis}, {Monte Carlo}, and the {MANIAC}",
  journal =      j-LOS-ALAMOS-SCIENCE,
  volume =       "14",
  pages =        "96--108",
  month =        "Fall",
  year =         "1986",
  CODEN =        "LASCDI",
  ISSN =         "0273-7116",
  bibdate =      "Mon Mar 19 18:07:48 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Report LA-UR-85-1202;CONF-8504110-3",
  URL =          "http://library.lanl.gov/cgi-bin/getfile?00326886.pdf;
                 http://library.lanl.gov/cgi-bin/getfile?number14.htm;
                 http://www.osti.gov/energycitations/product.biblio.jsp?osti_id=5697932&query_id=0",
  abstract =     "The central theme will be on the historical setting
                 and origins of the Monte Carlo Method. The scene was
                 post-war Los Alamos Scientific Laboratory. There was an
                 inevitability about the Monte Carlo Event: the ENIAC
                 had recently enjoyed its meteoric rise (on a classified
                 Los Alamos problem); Stan Ulam had returned to Los
                 Alamos; John von Neumann was a frequent visitor.
                 Techniques, algorithms, and applications developed
                 rapidly at Los Alamos. Soon, the fascination of the
                 Method reached wider horizons. The first paper was
                 submitted for publication in the spring of 1949. In the
                 summer of 1949, the first open conference was held at
                 the University of California at Los Angeles. Of some
                 interest perhaps is an account of Fermi's earlier,
                 independent application in neutron moderation studies
                 while at the University of Rome. The quantum leap
                 expected with the advent of massively parallel
                 processors will provide stimuli for very ambitious
                 applications of the Monte Carlo Method in disciplines
                 ranging from field theories to cosmology, including
                 more realistic models in the neurosciences. A structure
                 of multi-instruction sets for parallel processing is
                 ideally suited for the Monte Carlo approach. One may
                 even hope for a modest hardening of the soft
                 sciences.",
  acknowledgement = ack-nhfb,
  annote =       "P. 98 of this article notes that Enrico Fermi used
                 random-number generation for statistical sampling by
                 hand as early as 1934. Figure 3 on p. 102 shows a
                 program written by Fermi in numerical machine language
                 on the Maniac I for converting hexadecimal numbers to
                 decimal for printing.",
  fjournal =     "Los Alamos Science",
  remark =       "OSTI ID: 5697932; DE85010789",
}

@Article{Anon:1986:IRN,
  author =       "Anon",
  title =        "Integer Random Number Generator",
  journal =      j-IBM-TDB,
  volume =       "28",
  number =       "11",
  pages =        "4869--??",
  month =        apr,
  year =         "1986",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Sat Jan 25 17:38:12 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The generation of random numbers without using
                 floating-point arithmetic reduces program size by using
                 logical arithmetic for hashing the random number seed.
                 A random number seed hashed according to a given
                 algorithm produces results that have been shown to be
                 `sufficiently random'.",
  acknowledgement = ack-nhfb,
  classification = "723; 922",
  fjournal =     "IBM Technical Disclosure Bulletin",
  journalabr =   "IBM Tech Discl Bull",
  keywords =     "computer metatheory; floating-point arithmetic;
                 hashing; logical arithmetic; mathematical statistics;
                 program size; Random Number Generation; random number
                 seed",
}

@Article{Blum:1986:IUC,
  author =       "M. Blum",
  title =        "Independent unbiased coin flips from a correlated
                 biased source --- a finite state {Markov} chain",
  journal =      j-COMBINATORICA,
  volume =       "6",
  number =       "2",
  pages =        "97--108",
  month =        "????",
  year =         "1986",
  CODEN =        "COMBDI",
  ISSN =         "0209-9683 (print), 1439-6912 (electronic)",
  ISSN-L =       "0209-9683",
  bibdate =      "Tue Jan 31 15:26:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Combinatorica",
  journal-URL =  "http://link.springer.com/journal/volumesAndIssues/493",
}

@Article{Blum:1986:SUP,
  author =       "L. Blum and M. Blum and M. Shub",
  title =        "A Simple Unpredictable Pseudo-Random Number
                 Generator",
  journal =      j-SIAM-J-COMPUT,
  volume =       "15",
  number =       "2",
  pages =        "364--383",
  month =        "????",
  year =         "1986",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "65C10 (11K06 68Q25)",
  MRnumber =     "87k:65007",
  MRreviewer =   "Claus-Peter Schnorr",
  bibdate =      "Mon Nov 29 11:00:35 MST 2010",
  bibsource =    "Distributed/QLD/1987.bib;
                 http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/15/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  annote =       "(VBI-001945)",
  date =         "01/07/93",
  descriptors =  "random number",
  enum =         "9323",
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  keywords =     "BBS (Blum, Blum, Shub) random-number generator",
  references =   "0",
  remark =       "From the abstract: ``Two closely-related pseudo-random
                 sequence generators are presented: The $ {1 / P} $
                 generator, with input $P$ a prime, outputs the quotient
                 digits obtained on dividing 1 by $P$. The $ x^2 \bmod N
                 $ generator with inputs $N$, $ x_0 $ (where $ N = P
                 \cdot Q $ is a product of distinct primes, each
                 congruent to 3 mod 4, and $ x_0 $ is a quadratic
                 residue $ \bmod N $ ), outputs $ b_0 b_1 b_2 \cdots $
                 where $ b_i = {\operatorname {parity}}(x_i) $ and $
                 x_{i + 1} = x_i^2 \bmod N $.''",
}

@InProceedings{Bowman:1986:SRN,
  author =       "K. O. Bowman and M. T. Robinson",
  title =        "Studies of random number generators for parallel
                 processing",
  crossref =     "Heath:1986:HMP",
  pages =        "445--453",
  year =         "1986",
  bibdate =      "Fri Jan 6 10:47:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "According to \cite{Eddy:1990:RNG}, this is the first
                 paper to suggest the leap-frog method for starting
                 independent nonoverlapping streams of random numbers
                 from an LCG.",
}

@Article{Brown:1986:DFP,
  author =       "Robert H. Brown",
  title =        "The distribution function of positive definite
                 quadratic forms in normal random variables",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "7",
  number =       "2",
  pages =        "689--695",
  month =        apr,
  year =         "1986",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "62H10",
  MRnumber =     "88b:62100",
  MRreviewer =   "Yasuko Chikuse",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "McNeil Pharm., Spring House, PA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "computation theory; computational algorithms;
                 distribution function; normal random variables;
                 polynomials; positive definite quadratic forms; test
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Celmaster:1986:MVR,
  author =       "William Celmaster and K. J. M. Moriarty",
  title =        "A method for vectorized random number generators",
  journal =      j-J-COMPUT-PHYS,
  volume =       "64",
  number =       "1",
  pages =        "271--275",
  month =        may,
  year =         "1986",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(86)90032-X",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002199918690032X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Chandrasekaran:1986:IAR,
  author =       "U. Chandrasekaran and S. Sheppard",
  title =        "Implementation and Analysis of Random Variate
                 Generators in {Ada}",
  journal =      j-J-PAS-ADA-MOD,
  volume =       "5",
  number =       "??",
  pages =        "27--39",
  month =        jul # "/" # aug,
  year =         "1986",
  CODEN =        "JOPAD5",
  ISSN =         "0735-1232",
  bibdate =      "Thu Feb 23 09:35:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Pascal, Ada and Modula-2",
}

@Article{Chernoff:1986:NSB,
  author =       "Herman Chernoff and A. John Petkau",
  title =        "Numerical solutions for {Bayes} sequential decision
                 problems",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "7",
  number =       "1",
  pages =        "46--59",
  month =        jan,
  year =         "1986",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "62L10",
  MRnumber =     "819 456",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0290P (Differential
                 equations); C1140E (Game theory); C4170 (Differential
                 equations)",
  corpsource =   "Stat. Center, MIT, Cambridge, MA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "backward induction; Bayes methods; Bayes sequential
                 decision problems; boundary-value problems; continuity
                 corrections; decision theory; free boundary problems;
                 function approximation; heat equation; heat transfer;
                 monotone boundaries; normal random variables; numerical
                 methods; numerical solution; one-sided boundaries;
                 optimal stopping problems; partial differential
                 equations; rough approximations; symmetric boundaries;
                 truncated procedures",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@InProceedings{Clark:1986:BSP,
  author =       "G. M. Clark and W. Yang",
  title =        "A {Bonferroni} Selection Procedure when Using Common
                 Random Numbers with Unknown Variances",
  crossref =     "Wilson:1986:WSC",
  pages =        "313--315",
  year =         "1986",
  bibdate =      "Thu Jan 05 17:22:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Collings:1986:IGF,
  author =       "Bruce Jay Collings and G. Barry Hembree",
  title =        "Initializing Generalized Feedback Shift Register
                 Pseudorandom Number Generators",
  journal =      j-J-ACM,
  volume =       "33",
  number =       "4",
  pages =        "706--711",
  month =        oct,
  year =         "1986",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/6490.6493",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1986.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Collings:1988:AIG}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6493.html",
  abstract =     "The generalized feedback shift register pseudorandom
                 number generators proposed by T. G. Lewis and W. H.
                 Payne provide a very attractive method of random number
                 generation. Unfortunately, the published initialization
                 procedure can be extremely time consuming. This paper
                 considers an alternative method of initialization based
                 on a natural polynomial representation for the terms of
                 a feedback shift register sequence that results in
                 substantial improvements in the initialization
                 process.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Montana State Univ, Bozeman, MT, USA",
  classification = "723; 922",
  descriptors =  "Shift register sequences",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "algorithms; computers, digital --- Shift Registers;
                 generalized feedback shift register; mathematical
                 statistics; measurement; performance; pseudorandom
                 number generators; Random Number Generation",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@Article{Deak:1986:EMG,
  author =       "I. Deak",
  title =        "The Economical Method for Generating Random Samples
                 from Discrete Distributions",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "34--36",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sun Sep 04 21:11:10 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/5960.214321;
                 http://www.acm.org/pubs/citations/journals/toms/1986-12-1/p34-deak/",
  abstract =     "The idea of the economical method is applied for
                 generating samples from any discrete distribution. In
                 the resulting procedure, the expected number of
                 uniformly distributed random numbers is less than in
                 the alias method (practically 1). A refinement gives a
                 version where in limit just one uniformly distributed
                 number is required at the expense of some storage
                 space.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7183",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
}

@Article{Devroye:1986:AMG,
  author =       "Luc Devroye",
  title =        "An Automatic Method for Generating Random Variates
                 with a Given Characteristic Function",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "46",
  number =       "4",
  pages =        "698--719",
  month =        aug,
  year =         "1986",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "65C10",
  MRnumber =     "87k:65009",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Thu Oct 15 18:16:06 MDT 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib;
                 JSTOR database",
  acknowledgement = ack-nhfb,
  affiliationaddress = "McGill Univ, Montreal, Que, Can",
  classification = "921; 922",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  journalabr =   "SIAM J Appl Math",
  keywords =     "characteristic functions; mathematical statistics ---
                 Random Number Generation; mathematical transformations
                 --- Fourier Transforms; probability; Random Processes;
                 random variates",
}

@Article{Devroye:1986:GMS,
  author =       "Luc Devroye",
  title =        "Grid Methods in Simulation and Random Variate
                 Generation",
  journal =      j-COMPUTING,
  volume =       "37",
  number =       "1",
  pages =        "71--84",
  month =        mar,
  year =         "1986",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (68U20)",
  MRnumber =     "87i:65011",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  classification = "723; 922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "computer simulation; grid methods; mathematical
                 statistics; random variate generation",
}

@Book{Devroye:1986:NUR,
  author =       "Luc Devroye",
  title =        "Non-uniform random variate generation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 843",
  year =         "1986",
  ISBN =         "0-387-96305-7",
  ISBN-13 =      "978-0-387-96305-1",
  LCCN =         "QA274 .D48 1986",
  bibdate =      "Tue Jun 01 15:12:57 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$54.00",
  acknowledgement = ack-nhfb,
}

@Article{Dyadkin:1986:EAM,
  author =       "I. G. Dyad'kin",
  title =        "On efficient algorithms for the modelling of neutron
                 and $ \gamma $-quanta transport events by the
                 {Monte-Carlo} method",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "26",
  number =       "1",
  pages =        "134--140",
  month =        "????",
  year =         "1986",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(86)90197-7",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Mon Feb 27 09:59:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "English translation of Russian original published in
                 Zh. vychisl. Mat. mat. Fiz., {\bf 26}(2), 220--229,
                 1986.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0041555386901977",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@Article{Edgeman:1986:GPS,
  author =       "Rick L. Edgeman and Robert C. Scott",
  title =        "{GENERATOR}: a Program for Simulating Nonuniform
                 Random Variates",
  journal =      j-AMER-STAT,
  volume =       "40",
  number =       "1",
  pages =        "54--54",
  month =        feb,
  year =         "1986",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 12:40:29 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326431;
                 https://www.math.utah.edu/pub/tex/bib/amstat1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2683125",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Ehrhardt:1986:GPN,
  author =       "J. C. Ehrhardt",
  title =        "Generation of Pseudorandom Numbers",
  journal =      "Medical Physics (Woodbury)",
  volume =       "13",
  number =       "2",
  pages =        "240--241",
  month =        "????",
  year =         "1986",
  DOI =          "https://doi.org/10.1118/1.595903",
  ISSN =         "0094-2405 (print), 1522-8541 (electronic)",
  ISSN-L =       "0094-2405",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Medical Physics (Woodbury)",
}

@Article{Eichenauer:1986:NLC,
  author =       "J{\"u}rgen Eichenauer and J{\"u}rgen Lehn",
  title =        "A non-linear congruential pseudo random number
                 generator",
  journal =      j-STATIST-PAPERS,
  volume =       "27",
  number =       "1",
  pages =        "315--326",
  month =        sep,
  year =         "1986",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02932576",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  bibdate =      "Fri Dec 23 22:06:39 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A non-linear congruential pseudo random number
                 generator is introduced. This generator does not have
                 the lattice structure in the distribution of tuples of
                 consecutive pseudo random numbers which appears in the
                 case of linear congruential generators. A theorem on
                 the period length of sequences produced by this type of
                 generators is proved. This theorem justifies an
                 algorithm to determine the period length. Finally a
                 simulation problem is described where a linear
                 congruential generator produces completely useless
                 results whereas good results are obtained if a
                 non-linear congruential generator of about the same
                 period length is applied.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers = Statistische Hefte",
  journal-URL =  "http://link.springer.com/journal/362",
  remark =       "From page 317, the average iteration count of an
                 inversive multiplicative congruential generator $ \pmod
                 P $ is $ 12 (\log (2) / \pi^2) \log (P) + 1 $. Thus,
                 for $ P = 2^{31} - 1 $, that count is $ 19.108 $.",
}

@InProceedings{Eremin:1986:DIM,
  author =       "I. I. Eremin and A. A. Vatolin",
  title =        "Duality in improper mathematical programming problems
                 under uncertainty",
  crossref =     "Arkin:1986:SOP",
  year =         "1986",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/stoprog.bib.gz;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "[For the entire collection see Zbl. 585.00014.] \par
                 The paper deals with linear programming (LP) problems
                 with random or interval data. Corresponding to the
                 proposed duality scheme, to a pair of dual LP problems
                 L and $ L \sp * $ (all elements of vectors and matrices
                 involved are random variables) with no assumption about
                 their solvability, new solvable problems D and $ D \sp
                 {\# } $ are assigned according to the same
                 transformation scheme. The problems D and $ D \sp {\# }
                 $ are dual to each other and play the role of
                 approximating problems for L and $ L \sp *. $ \par The
                 second part of the paper considers linear equations and
                 inequality systems and LP problems in which all
                 elements of the vectors and matrices involved (except
                 the vector of unknowns) are given not as exact values
                 but as intervals. Two kinds of uncertainty are
                 distinguished: ``controlled parameters'' and ``inexact
                 parameters''. A quite general scheme of ``elimination''
                 of uncertainties is proposed, which in particular
                 contains the scheme of generalized LP of G. B. Dantzig
                 and Ph. Wolfe and the scheme of inexact LP of L. A.
                 Soyster. Methods for solution of thus formulated
                 problems are suggested.",
  acknowledgement = ack-nhfb,
  classmath =    "*90C05 Linear programming 49N15 Duality theory
                 (optimization) 90C15 Stochastic programming 65K05
                 Mathematical programming (numerical methods) 49M35
                 Methods of linear programming type 65G10 Interval
                 arithmetic",
  keywords =     "controlled parameters; elimination of uncertainties;
                 generalized; inexact parameters; inexact programming;
                 programming; random or interval data",
}

@Article{Fishman:1986:EAM,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "An exhaustive analysis of multiplicative congruential
                 random number generators with modulus $ 2^{31} - 1 $",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "7",
  number =       "1",
  pages =        "24--45",
  month =        jan,
  year =         "1986",
  CODEN =        "SIJCD4",
  DOI =          "https://doi.org/10.1137/0907002",
  ISSN =         "0196-5204",
  MRclass =      "65C10",
  MRnumber =     "87g:65010a",
  MRreviewer =   "A. S. Rasulov",
  bibdate =      "Sat Oct 28 08:44:48 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  note =         "See erratum \cite{Fishman:1986:EEA}.",
  URL =          "http://link.aip.org/link/?SCE/7/24/1",
  abstract =     "This paper presents the results of an exhaustive
                 search to find optimal full period multipliers for the
                 multiplicative congruential random number generator
                 with prime modulus $ 2^{31} - 1 $. Here a multiplier is
                 said to be optimal if the distance between adjacent
                 parallel hyperplanes on which k-tuples lie does not
                 exceed the minimal achievable distance by more than 25
                 percent for $ k = 2, \cdots, 6 $. This criterion is
                 considerably more stringent than prevailing standards
                 of acceptability and leads to a total of only 414
                 multipliers among the more than 534 million candidate
                 multipliers.",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1160
                 (Combinatorial mathematics); C7310 (Mathematics
                 computing)",
  corpsource =   "North Carolina Univ., Chapel Hill, NC, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "linear congruential generators; multiplicative
                 congruential random number generators; number theory;
                 optimal full period multipliers; optimal multipliers;
                 performance evaluation; prime modulus 2/sup 31/-1;
                 random number generation; worst case performance
                 measures",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Fishman:1986:EEA,
  author =       "George S. Fishman and Louis R. {Moore III}",
  title =        "Erratum: {``An exhaustive analysis of multiplicative
                 congruential random number generators with modulus $
                 2^{31} - 1 $''}",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "7",
  number =       "3",
  pages =        "1058--1058",
  month =        jul,
  year =         "1986",
  CODEN =        "SIJCD4",
  DOI =          "https://doi.org/10.1137/0907072",
  ISSN =         "0196-5204",
  MRclass =      "65C10",
  MRnumber =     "87g:65010b",
  MRreviewer =   "A. S. Rasulov",
  bibdate =      "Sat Oct 28 08:38:02 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  note =         "See \cite{Fishman:1986:EAM}.",
  URL =          "http://epubs.siam.org/sisc/resource/1/sjoce3/v7/i3/p1058_s1;
                 http://link.aip.org/link/?SCE/7/1058/1",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  remark =       "The erratum is trivial: change $N$ to $ N' $ in
                 equation (17) on page 30.",
}

@Article{Flury:1986:SRV,
  author =       "Bernhard K. Flury",
  title =        "On sums of random variables and independence",
  journal =      j-AMER-STAT,
  volume =       "40",
  number =       "3",
  pages =        "214--215",
  month =        "????",
  year =         "1986",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "62E15 (60E05)",
  MRnumber =     "87m:62051",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Fox:1986:AIR,
  author =       "Bennett L. Fox",
  title =        "{Algorithm 647}: Implementation and Relative
                 Efficiency of Quasirandom Sequence Generators",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "362--376",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/22721.356187",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Fri Mar 28 10:43:26 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Friedman:1986:CSA,
  author =       "Linda Weiser Friedman and Hershey H. Friedman",
  title =        "Comparing simulated alternatives using a
                 distribution-free statistic with blocking by random
                 number stream",
  journal =      j-SIMULATION,
  volume =       "47",
  number =       "2",
  pages =        "68--70",
  month =        aug,
  year =         "1986",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978604700204",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:49:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/47/2/68.abstract",
  abstract =     "When comparing system alternatives, simulationists
                 will often use analysis of variance, a parametric
                 statistical procedure. Using an example in which three
                 different M/M/s queuing system configurations are
                 simulated, the authors demonstrate the importance of
                 using the common random number streams as blocks. In
                 addition, Friedman's Two-way Analysis of Variance by
                 Ranks test, a distribution-free statistical procedure,
                 is used to analyze the output.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Fushimi:1986:STE,
  author =       "Masanori Fushimi",
  title =        "Statistical tests of eight hundred million
                 pseudorandom numbers based on an {$M$}-sequence",
  journal =      "Japan J. Appl. Statist.",
  volume =       "15",
  number =       "??",
  pages =        "147--162",
  month =        "????",
  year =         "1986",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Tue Jan 10 19:09:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Japanese",
}

@Article{Gleason:1986:TLF,
  author =       "John R. Gleason",
  title =        "{TURBO\_RAND}: a Library for Fast {Monte Carlo}
                 Sampling and Simulation on Microcomputers",
  journal =      j-AMER-STAT,
  volume =       "40",
  number =       "3",
  pages =        "233--233",
  month =        aug,
  year =         "1986",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 12:40:29 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326433;
                 https://www.math.utah.edu/pub/tex/bib/amstat1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2684551",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Goldreich:1986:HCR,
  author =       "Oded Goldreich and Shafi Goldwasser and Silvio
                 Micali",
  title =        "How to Construct Random Functions",
  journal =      j-J-ACM,
  volume =       "33",
  number =       "4",
  pages =        "792--807",
  month =        oct,
  year =         "1986",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/6490.6503",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "A computational complexity measure of the randomness
                 of functions is introduced, and, assuming the existence
                 of one-way functions, a pseudo-random function
                 generator is presented.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6503.html",
  abstract =     "A constructive theory of randomness for functions,
                 based on computational complexity, is developed, and a
                 pseudorandom function generator is presented. The
                 generator is a deterministic polynomial-time algorithm
                 that transforms pairs $ (g, r) $, where $g$ is any
                 one-way function and $r$ is a random $k$-bit string, to
                 polynomial-time computable functions that cannot be
                 distinguished from random functions by any
                 probabilistic polynomial-time algorithm that asks and
                 receives the value of a function at arguments of its
                 choice. The result has applications in cryptography,
                 random constructions, and complexity theory.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "MIT, Cambridge, MA, USA",
  classification = "723; 922",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "algorithms; computational complexity; computer
                 metatheory; computer programming --- Algorithms;
                 cryptography; probability; pseudorandom function
                 generator; random functions; Random Processes;
                 security; theory",
  subject =      "{\bf F.1.3}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Complexity Classes. {\bf F.1.1}:
                 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Models of Computation. {\bf F.1.2}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Probabilistic computation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Probabilistic algorithms (including Monte Carlo). {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@InProceedings{Grothe:1986:MEG,
  author =       "H. Grothe",
  editor =       "Lothar Afflerbach and J{\"u}rgen Lehn",
  booktitle =    "{Kolloquium {\"u}ber Zufallszahlen und Simulationen:
                 Darmstadt, 21. M{\"a}rz, 1986}. ({German})
                 [{Conference} on random numbers and simulation.
                 {Darmstadt, 21 March 1986}]",
  title =        "{Matrixgeneratoren zur Erzeugung gleichverteilter
                 Zufallsvektoren}. ({German}) [{Matrix} generators for
                 generating uniformly distributed random vectors]",
  publisher =    pub-TEUBNER,
  address =      pub-TEUBNER:adr,
  bookpages =    "128",
  pages =        "29--34",
  year =         "1986",
  ISBN =         "3-519-02624-4",
  ISBN-13 =      "978-3-519-02624-2",
  LCCN =         "QA274.A1 K65 1986",
  bibdate =      "Tue Jan 10 16:05:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  language =     "German",
  subject =      "numbers, random; congresses; simulation methods",
}

@Book{Hamming:1986:NMS,
  author =       "R. W. (Richard Wesley) Hamming",
  title =        "Numerical methods for scientists and engineers",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  edition =      "Second",
  pages =        "ix + 721",
  year =         "1986",
  ISBN =         "0-486-65241-6 (paperback)",
  ISBN-13 =      "978-0-486-65241-2 (paperback)",
  LCCN =         "QA297 .H28 1986",
  bibdate =      "Fri Aug 20 09:12:08 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$14.95",
  URL =          "http://www.loc.gov/catdir/description/dover032/86016226.html",
  acknowledgement = ack-nhfb,
  keywords =     "random numbers",
  remark =       "Reprint of \cite{Hamming:1973:NMS}.",
  subject =      "numerical analysis; data processing",
}

@Article{Hosack:1986:UCM,
  author =       "John M. Hosack",
  title =        "The use of {{\v{C}}eby{\v{s}}ev} mixing to generate
                 pseudo-random numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "67",
  number =       "2",
  pages =        "482--486",
  month =        dec,
  year =         "1986",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(86)90274-3",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:30:33 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999186902743",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Hultquist:1986:LST,
  author =       "Paul F. Hultquist and R. N. Clark",
  title =        "Letter: Statistical tests of a random number
                 generator",
  journal =      j-SIMULATION,
  volume =       "47",
  number =       "2",
  pages =        "72--74",
  month =        aug,
  year =         "1986",
  CODEN =        "SIMUA2",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:36:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Clark:1985:PNG}.",
  URL =          "http://sim.sagepub.com/content/47/2/72.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Inoue:1986:MAR,
  author =       "Hikaru Inoue and Naoki Furukawa and Yasukazu Yoshizawa
                 and Minoru Ichimura and Osamu Miyatake",
  title =        "Mathematical analysis of random number generator using
                 gamma rays. {II}",
  journal =      j-MATH-JAPON,
  volume =       "31",
  number =       "2",
  pages =        "287--300",
  year =         "1986",
  CODEN =        "MAJAA9",
  ISSN =         "0025-5513",
  MRclass =      "65C10",
  MRnumber =     "838009 (87i:65013)",
  bibdate =      "Thu Jan 5 15:42:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also part I \cite{Miyatake:1983:MAR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Japonica",
}

@Article{Kahaner:1986:MSB,
  author =       "David K. Kahaner and Jeffrey Horlick and Debra K.
                 Foer",
  title =        "Mathematical software in {BASIC}: {RV}, generation of
                 uniform and normal random variables",
  journal =      j-IEEE-MICRO,
  volume =       "6",
  number =       "3",
  pages =        "52--60",
  month =        may # "\slash " # jun,
  year =         "1986",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.1986.304678",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; Science
                 Citation Index database (1980--2000)",
  acknowledgement = ack-nhfb,
  affiliationaddress = "NBS, Gaithersburg, MD, USA",
  classcodes =   "C7310 (Mathematics computing)",
  classification = "723; 921; 922",
  corpsource =   "NBS, Gaithersburg, MD, USA",
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
  keywords =     "algorithmic generators; Applications; BASIC; computer
                 programming languages --- basic; computer software;
                 mathematical software; mathematical statistics ---
                 Random Number Generation; normal random variables;
                 pseudorandom numbers; random number generation; random
                 number generator; RNOR; RV; statistical tests; UNI;
                 uniform random variables",
  treatment =    "P Practical",
  xxauthor =     "D. K. Kahaner and D. K. Foer and J. Horlick",
}

@Book{Kalos:1986:MCM,
  author =       "Malvin H. Kalos and Paula A. Whitlock",
  title =        "{Monte Carlo} methods",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "ix + 186",
  year =         "1986",
  ISBN =         "0-471-89839-2",
  ISBN-13 =      "978-0-471-89839-9",
  LCCN =         "QA298 .K35 1986",
  bibdate =      "Fri Jan 6 10:40:27 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0607/86011009-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0607/86011009-d.html;
                 http://www.loc.gov/catdir/toc/onix05/86011009.html",
  acknowledgement = ack-nhfb,
  remark =       "See also second edition \cite{Kalos:2008:MCM}.",
  subject =      "Monte Carlo method",
  tableofcontents = "What is Monte Carlo? A Bit of Probability Theory
                 \\
                 Sampling Random Variables \\
                 Monte Carlo Evaluation of Finite-Dimensional Integrals
                 \\
                 Statistical Physics \\
                 Simulations of Stochastic Systems: Radiation Transport
                 \\
                 Random Walks and Integral Equations \\
                 Introduction to Green's Function Monte Carlo \\
                 Appendixes \\
                 Index",
}

@Article{Kleijnen:1986:SRN,
  author =       "Jack P. C. Kleijnen",
  title =        "Selecting random number seeds in practice",
  journal =      j-SIMULATION,
  volume =       "47",
  number =       "1",
  pages =        "15--17",
  month =        jul,
  year =         "1986",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978604700103",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:18:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/47/1/15.abstract",
  abstract =     "A pseudorandom number generator, such as a
                 multiplicative congruential generator, depends on its
                 initial value or seed. The computer may select a seed
                 using its internal clock. Alternatively the simulation
                 analyst may use Fishman's tables with seeds spaced
                 100,000 apart. Theoretically, the concepts of sampling
                 with and without replacement are involved. Practical
                 problems arise if consecutive simulation runs cannot be
                 made in a single terminal session. The user may select
                 the simplest option. Runs for different systems may use
                 common seeds to decrease the variability; then the
                 internal clock is an impractical source since its
                 internal (binary) representation must be saved.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Ko:1986:NIP,
  author =       "K.-I. Ko",
  title =        "On the notion of infinite pseudorandom sequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "48",
  number =       "1",
  pages =        "9--33",
  month =        "????",
  year =         "1986",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "computational complexity; infinite pseudorandom
                 sequences; Martin-L{\"o}f's notion; monotonic operator
                 complexity; polynomial time; sequential tests; space
                 complexity",
  pubcountry =   "Netherlands A02",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{LEcuyer:1986:EPB,
  author =       "P. L'Ecuyer",
  title =        "Efficient and Portable 32-Bit Random Variate
                 Generators",
  crossref =     "Wilson:1986:WSC",
  pages =        "275--277",
  year =         "1986",
  bibdate =      "Thu Feb 23 09:43:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Lidl:1986:IFF,
  author =       "Rudolph Lidl and Harald Niederreiter",
  title =        "Introduction to Finite Fields and Their Applications",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 407",
  year =         "1986",
  ISBN =         "0-521-30706-6",
  ISBN-13 =      "978-0-521-30706-2",
  LCCN =         "QA247.3L54 1986",
  bibdate =      "Sat Apr 5 15:43:29 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0629.12016",
  acknowledgement = ack-nhfb,
  remark =       "See also second edition \cite{Lidl:1994:IFF}",
  shorttableofcontents = "Preface / vii \\
                 1: Algebraic Foundations / 1 \\
                 2: Structure of Finite Fields / 43 \\
                 3: Polynomials over Finite Fields / 74 \\
                 4: Factorization of Polynomials / 129 \\
                 5: Exponential Sums / 162 \\
                 6: Linear Recurring Sequences / 185 \\
                 7: Theoretical Applications of Finite Fields / 251 \\
                 8: Algebraic Coding Theory / 299 \\
                 9: Cryptology / 338 \\
                 10: Tables / 367",
  subject =      "Finite fields (Algebra); Corps finis; Finite fields
                 (Algebra)",
  tableofcontents = "Preface / vii \\
                 1: Algebraic Foundations / 1 \\
                 1 Groups / 2 \\
                 2 Rings and Fields / 11 \\
                 3 Polynomials / 18 \\
                 4 Field Extensions / 30 \\
                 Exercises / 37 \\
                 \\
                 2: Structure of Finite Fields / 43 \\
                 1 Characterization of Finite Fields / 44 \\
                 2 Roots of Irreducible Polynomials / 47 \\
                 3 Traces, Norms, and Bases / 50 \\
                 4 Roots of Unity and Cyclotomic Polynomials / 59 \\
                 5 Representation of Elements of Finite Fields / 62 \\
                 6 Wedderburn s Theorem / 65 \\
                 Exercises / 69 \\
                 \\
                 3: Polynomials over Finite Fields / 74 \\
                 1 Order of Polynomials and Primitive Polynomials / 75
                 \\
                 2 Irreducible Polynomials / 82 \\
                 3 Construction of Irreducible Polynomials / 87 \\
                 4 Linearized Polynomials / 98 \\
                 5 Binomials and Trinomials / 115 \\
                 Exercises / 122 \\
                 \\
                 4: Factorization of Polynomials / 129 \\
                 1 Factorization over Small Finite Fields / 130 \\
                 2 Factorization over Large Finite Fields / 139 \\
                 3 Calculation of Roots of Polynomials / 150 \\
                 Exercises / 159 \\
                 \\
                 5: Exponential Sums / 162 \\
                 1 Characters / 163 \\
                 2 Gaussian Sums 168 | Exercises / 181 \\
                 \\
                 6: Linear Recurring Sequences / 185 \\
                 1 Feedback Shift Registers, Periodicity Properties /
                 186 \\
                 2 Impulse Response Sequences, Characteristic Polynomial
                 / 193 \\
                 3 Generating Functions / 202 \\
                 4 The Minimal Polynomial / 210 \\
                 5 Families of Linear Recurring Sequences / 215 \\
                 6 Characterization of Linear Recurring Sequences / 228
                 \\
                 7 Distribution Properties of Linear Recurring Sequences
                 / 235 \\
                 Exercises / 245 \\
                 \\
                 7: Theoretical Applications of Finite Fields / 251 \\
                 1 Finite Geometries / 252 \\
                 2 Combinatorics / 262 \\
                 3 Linear Modular Systems / 271 \\
                 4 Pseudorandom Sequences / 281 \\
                 Exercises / 294 \\
                 \\
                 8: Algebraic Coding Theory / 299 \\
                 1 Linear Codes / 300 \\
                 2 Cyclic Codes / 311 \\
                 3 Goppa Codes / 325 \\
                 Exercises / 332 \\
                 \\
                 9: Cryptology / 338 \\
                 1 Background / 339 \\
                 2 Stream Ciphers / 342 \\
                 3 Discrete Logarithms / 346 \\
                 4 Further Cryptosystems / 360 \\
                 Exercises / 363 \\
                 \\
                 10: Tables / 367 \\
                 1 Computation in Finite Fields / 367 \\
                 2 Tables of Irreducible Polynomials / 377 \\
                 \\
                 Bibliography / 392 \\
                 List of Symbols / 397 \\
                 Index / 401",
}

@Article{Loukas:1986:CGB,
  author =       "S. Loukas and C. D. Kemp",
  title =        "The computer generation of bivariate binomial and
                 negative binomial random variables",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "15",
  number =       "1",
  pages =        "15--25",
  year =         "1986",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610918608812489",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:25 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@InProceedings{Luby:1986:PRP,
  author =       "M. Luby and C. Rackoff",
  title =        "Pseudo-random permutation generators and cryptographic
                 composition",
  crossref =     "ACM:1986:PEA",
  pages =        "356--363",
  year =         "1986",
  bibdate =      "Wed Feb 20 18:33:46 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/12130/p356-luby/p356-luby.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/12130/p356-luby/",
  acknowledgement = ack-nhfb,
}

@Article{Malik:1986:PDF,
  author =       "Henrick J. Malik and Roger Trudel",
  title =        "Probability density function of the product and
                 quotient of two correlated exponential random
                 variables",
  journal =      j-CAN-MATH-BULL,
  volume =       "29",
  number =       "??",
  pages =        "413--418",
  month =        "????",
  year =         "1986",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1986-065-3",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:05:32 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v29/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Marsaglia:1986:IFC,
  author =       "George Marsaglia",
  title =        "The incomplete {$ \Gamma $} function as a continuous
                 {Poisson} distribution",
  journal =      j-COMPUT-MATH-APPL-B,
  volume =       "12",
  number =       "5--6",
  pages =        "1187--1190",
  month =        sep # "\slash " # dec,
  year =         "1986",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(86)90242-7",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0628.65149",
  abstract =     "The paper illustrates the use of the incomplete $
                 \Gamma $ function as a means for computer generation of
                 Poisson random variables.",
  abstract-2 =   "Among the many contributions of Professor Luke to the
                 theory of special functions, the most useful in
                 computational statistics is probably that on the
                 incomplete $\Gamma$ function. This short paper points
                 out that an incomplete $\Gamma$ function routine is so
                 important that it should be a standard part of any
                 library of statistical subroutines. The paper goes on
                 to give another example of use of the incomplete
                 $\Gamma$ function: as a means for computer generation
                 of Poisson random variables. and, having urged wide use
                 of the incomplete $\Gamma$ function, proceeds with
                 development of a Poisson generator whose principal aim
                 is to avoid use of the very function it has previously
                 lauded. Occasional use of an accurate incomplete
                 $\Gamma$ routine is essential however, in order that
                 the composite method be exact.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications. Part B",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  keywords =     "computer generation of Poisson random variables;
                 incomplete gamma function",
  ZMclass =      "65C99 Numerical simulation 65C10 Random number
                 generation 62E99 Statistical distribution theory 65D20
                 Computation of special functions",
  ZMreviewer =   "P. Reichensperger",
}

@Article{Nicola:1986:QAF,
  author =       "Victor F. Nicola and V. G. Kulkarni and Kishor S.
                 Trivedi",
  title =        "Queueing analysis of fault-tolerant computer systems
                 (extended abstract)",
  journal =      j-SIGMETRICS,
  volume =       "14",
  number =       "1",
  pages =        "203--203",
  month =        may,
  year =         "1986",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/317531.317553",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:02:55 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "Queueing models provide a useful tool for predicting
                 the performance of many service systems including
                 computer systems, telecommunication systems,
                 computer/communication networks and flexible
                 manufacturing systems. Traditional queueing models
                 predict system performance under the assumption that
                 all service facilities provide failure-free service. It
                 must, however, be acknowledged that service facilities
                 do experience failures and that they get repaired. In
                 recent years, it has been increasingly recognized that
                 this separation of performance and
                 reliability/availability models is no longer adequate.
                 An exact steady-state queueing analysis of such systems
                 is considered by several authors and is carried out by
                 means of generating functions, supplementary variables,
                 embedded Markov process and renewal theory, or
                 probabilistic techniques [1,2,7,8]. Another approach is
                 approximate, in which it is assumed that the time to
                 reach the steady-state is much smaller than the times
                 to failures/repairs. Therefore, it is reasonable to
                 associate a performance measure (reward) with each
                 state of the underlying Markov (or semi-Markov) model
                 describing the failure/repair behavior of the system.
                 Each of these performance measures is obtained from the
                 steady-state queueing analysis of the system in the
                 corresponding state [3,5]. Earlier we have developed
                 models to derive the distribution of job completion
                 time in a failure-prone environment [3,4]. In these
                 models, we need to consider a possible loss of work due
                 to the occurrence of a failure, i.e., the interrupted
                 job may be resumed or restarted upon service
                 resumption. Note that the job completion time analysis
                 includes the delays due to failures and repairs. The
                 purpose of this paper [9] is to extend our earlier
                 analysis so as to account for the queueing delays. In
                 effect, we consider an exact queueing analysis of
                 fault-tolerant systems in order to obtain the
                 steady-state distribution and the mean of the number of
                 jobs in the system. In particular, we study a system in
                 which jobs arrive in a Poisson fashion and are serviced
                 according to FCFS discipline. The service requirements
                 of the incoming jobs form a sequence of independent and
                 identically distributed random variables. The
                 failure/repair behaviour of the system is modelled by
                 an irreducible continuous-time Markov chain, which is
                 independent of the number of jobs in the system. Let
                 the state-space be $ \{ 1, 2, \ldots {}, n \} $. When
                 the computer system is in state $i$ it delivers service
                 at rate $ r_i \geq 0 $. Furthermore, depending on the
                 type of the state, the work done on the job is
                 preserved or lost upon entering that state. The actual
                 time required to complete a job depends in a complex
                 way upon the service requirement of the job and the
                 evolution of the state of the system. Note that even
                 though the service requirements of jobs are independent
                 and identically distributed, the actual times required
                 to complete these jobs are neither independent nor
                 identically distributed, and hence the model cannot be
                 reduced to a standard M/G/1 queue [8]. As loss of work
                 due to failures and interruptions is quite a common
                 phenomenon in fault-tolerant computer systems, the
                 model proposed here is of obvious interest. Using our
                 earlier results on the distribution of job completion
                 time we set up a queueing model and show that it has
                 the block M/G/1 structure. Queueing models with such a
                 structure have been studied by Neuts, Lucantoni and
                 others [6]. We demonstrate the usefulness of our
                 approach by performing the numerical analysis for a
                 system with two processors subject to failures and
                 repairs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Niederreiter:1986:DFS,
  author =       "Harald Niederreiter",
  title =        "Dyadic fractions with small partial quotients",
  journal =      j-MONAT-MATH,
  volume =       "101",
  number =       "4",
  pages =        "309--315",
  month =        dec,
  year =         "1986",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01559394",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 11:51:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/q87291681r81t782/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:1986:LDP,
  author =       "Harald Niederreiter",
  title =        "Low-discrepancy point sets",
  journal =      j-MONAT-MATH,
  volume =       "102",
  number =       "2",
  pages =        "155--167",
  month =        jun,
  year =         "1986",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01490206",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K38 (11K45)",
  MRnumber =     "861937 (87m:11074)",
  MRreviewer =   "Gerold S. Wagner",
  bibdate =      "Thu Feb 23 09:48:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:1986:MNI,
  author =       "Harald Niederreiter",
  title =        "Multidimensional numerical integration using
                 pseudorandom numbers",
  journal =      j-MATH-PROG-STUDY,
  volume =       "27",
  number =       "??",
  pages =        "17--38",
  month =        "????",
  year =         "1986",
  CODEN =        "MPSTDF",
  ISSN =         "0303-3929",
  MRclass =      "11K38 (11K06 65D30)",
  MRnumber =     "836749 (87m:11075)",
  MRreviewer =   "J. H. Halton",
  bibdate =      "Thu Feb 23 09:45:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Stochastic programming 84. I.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Programming Study",
}

@Article{Niederreiter:1986:PVG,
  author =       "H. Niederreiter",
  title =        "A pseudorandom vector generator based on finite field
                 arithmetic",
  journal =      j-MATH-JAPON,
  volume =       "31",
  number =       "5",
  pages =        "759--774",
  month =        "????",
  year =         "1986",
  CODEN =        "MAJAA9",
  ISSN =         "0025-5513",
  bibdate =      "Fri Jan 6 10:44:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Japonica",
}

@Article{Panny:1986:NHM,
  author =       "Wolfgang Panny",
  title =        "A note on the higher moments of the expected behavior
                 of straight insertion sort",
  journal =      j-INFO-PROC-LETT,
  volume =       "22",
  number =       "4",
  pages =        "175--177",
  day =          "17",
  month =        apr,
  year =         "1986",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Wirtschaftsuniversitaet Wien, Vienna, Austria",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Abteilung for Math. Methoden der Stat.,
                 Wirtschaftsuniv. Wien, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm analysis; algorithm theory; algorithms;
                 analysis of algorithms; asymptotic behaviour; computer
                 programming --- Algorithms; computer systems
                 programming; higher moments; insertion sort;
                 inversions; permutations; random variable; runtime; RV;
                 Sorting; sorting; sorting algorithms; straight
                 insertion sort; theory",
  pubcountry =   "Netherlands A03",
  subject =      "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis \\ I.1.2 Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Algorithms, Analysis of
                 algorithms \\ G.2.1 Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Permutations and
                 combinations \\ F.2.2 Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sorting and searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Santha:1986:GQR,
  author =       "Miklos Santha and Umesh V. Vazirani",
  title =        "Generating Quasi-Random Sequences from Semi-Random
                 Sources",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "33",
  number =       "1",
  pages =        "75--87",
  month =        aug,
  year =         "1986",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(86)90044-9",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Thu Feb 23 09:51:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000086900449",
  abstract =     "We consider mathematically the problem of generating
                 random bit-sequences from physical noise sources (such
                 as zener diodes). We propose a very general
                 mathematical model for such physical sources: the
                 semi-random source, and show how to convert the output
                 of such sources into quasi-random sequences. Such
                 sequences are indistinguishable from truly random ones
                 in a strong sense. This enables us to prove that
                 quasi-random sequences can be used in place of truly
                 random ones for applications such as seeds for
                 pseudo-random number generators, randomizing
                 algorithms, and stochastic simulation experiments.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
  keywords =     "true random numbers from physical sources",
}

@Article{Shore:1986:AID,
  author =       "Haim Shore",
  title =        "An approximation for the inverse distribution function
                 of a combination of random variables, with an
                 application to operating theatres",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "23",
  number =       "3",
  pages =        "157--181",
  year =         "1986",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949658608810870",
  ISSN =         "0094-9655 (print), 1563-5163 (electronic)",
  ISSN-L =       "0094-9655",
  bibdate =      "Fri Nov 8 18:01:57 MST 2002",
  bibsource =    "ACM Computing Archive CD-ROM database (1991);
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ban-llan University, Israel",
  bibno =        "5358",
  catcode =      "G.3; G.m; G.1.2; G.2.1; J.3; G.3",
  content =      "The author worked on a project to predict the
                 percentage of time that operations are carried out
                 relative to the time that the operating theater is
                 available. The numerator of the percentage is a
                 weighted sum of the times required to carry out
                 different kinds of operations, where the weights are
                 the numbers of operations of each kind to be performed.
                 Since different kinds of operations have different mean
                 times, this sum has a skewed distribution.\par

                 Based on the Central Limit Theorem, the normal
                 distribution is the most widely used approximation to
                 the distribution of a weighted sum of random variables.
                 However, this approximation is not very good if the sum
                 has a skewed distribution.\par

                 In a separate paper [1], the author derived an
                 alternative approximation based on the first four
                 moments of the sum. In the present paper, he applies
                 this approximation to the operating theater problem by
                 estimating the moments of the times of the different
                 kinds of operations. The paper also contains a Monte
                 Carlo comparison of the normal approximation with the
                 proposed approximation for four underlying
                 distributions of the sum.",
  CRclass =      "G.3 Statistical computing; G.1.2 Approximation; G.1.2
                 Elementary function approximation; G.2.1 Combinatorics;
                 G.2.1 Generating functions; J.3 Health; G.3
                 Probabilistic algorithms (including Monte Carlo)",
  CRnumber =     "8612-1109",
  descriptor =   "Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing; Mathematics of Computing,
                 MISCELLANEOUS; Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Elementary function
                 approximation; Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Generating functions;
                 Computer Applications, LIFE AND MEDICAL SCIENCES,
                 Health; Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo)",
  fjournal =     "Journal of Statistical Computation and Simulation",
  genterm =      "algorithms; measurement",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  journalabbrev = "J. Stat. Comput. Simul.",
  jrldate =      "1986",
  reviewer =     "M. Snyder",
  subject =      "G. Mathematics of Computing; G.3 PROBABILITY AND
                 STATISTICS; G. Mathematics of Computing; G.m
                 MISCELLANEOUS; G. Mathematics of Computing; G.1
                 NUMERICAL ANALYSIS; G. Mathematics of Computing; G.2
                 DISCRETE MATHEMATICS; J. Computer Applications; J.3
                 LIFE AND MEDICAL SCIENCES; G. Mathematics of Computing;
                 G.3 PROBABILITY AND STATISTICS",
}

@Article{Shore:1986:SGA,
  author =       "H. Shore",
  title =        "Simple general approximations for a random variable
                 and its inverse distribution function based on linear
                 transformations of a nonskewed variate",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "7",
  number =       "1",
  pages =        "1--23",
  month =        jan,
  year =         "1986",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); B0290F
                 (Interpolation and function approximation); C1140Z
                 (Other topics in statistics); C4130 (Interpolation and
                 function approximation)",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "explicit inverse cumulative density function; function
                 approximation; hypothesis testing; interval estimation;
                 inventory analysis; inverse distribution function;
                 linear normal approximations; linear transformations;
                 loss function; nonskewed random variable; Poisson
                 distribution; probability; random processes; simple
                 general approximations; statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sowey:1986:TCB,
  author =       "Eric R. Sowey",
  title =        "A Third Classified Bibliography on Random Number
                 Generation and Testing",
  journal =      j-J-R-STAT-SOC-SER-A-GENERAL,
  volume =       "149",
  number =       "1",
  pages =        "83--107",
  month =        "????",
  year =         "1986",
  CODEN =        "JSSAEF",
  ISSN =         "0035-9238",
  bibdate =      "Wed Dec 21 09:58:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2981887",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series A
                 (General)",
  journal-URL =  "http://www.jstor.org/journals/00359238.html",
}

@InCollection{Stephens:1986:TBE,
  author =       "M. S. Stephens",
  title =        "Tests based on {EDF} statistics",
  crossref =     "DAgostino:1986:GFT",
  pages =        "??--??",
  year =         "1986",
  bibdate =      "Fri Jan 06 16:35:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Stephens:1986:TUD,
  author =       "M. S. Stephens",
  title =        "Tests for the uniform distribution",
  crossref =     "DAgostino:1986:GFT",
  pages =        "??--??",
  year =         "1986",
  bibdate =      "Fri Jan 06 16:35:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Wolfram:1986:RSG,
  author =       "Stephen Wolfram",
  title =        "Random sequence generation by cellular automata",
  journal =      j-ADV-APPL-MATH,
  volume =       "7",
  number =       "2",
  pages =        "123--169",
  month =        jun,
  year =         "1986",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/0196-8858(86)90028-X",
  ISSN =         "0196-8858 (print), 1090-2074 (electronic)",
  ISSN-L =       "0196-8858",
  bibdate =      "Thu Feb 23 09:20:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/019688588690028X",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances in Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01968858",
  remark =       "Reprinted in \cite{Wolfram:1994:CAC}.",
}

@Book{Wolfram:1986:TAC,
  editor =       "Stephen Wolfram",
  title =        "Theory and applications of cellular automata:
                 including selected papers, 1983--1986",
  volume =       "1",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "ix + 560",
  year =         "1986",
  ISBN =         "9971-5-0123-6, 9971-5-0124-4 (paperback)",
  ISBN-13 =      "978-9971-5-0123-5, 978-9971-5-0124-2 (paperback)",
  LCCN =         "QA267.5.C45 T48 1986",
  bibdate =      "Thu Feb 23 09:54:18 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Advanced series on complex systems",
  acknowledgement = ack-nhfb,
  remark =       "Reprints of articles from various journals originally
                 published 1983--1985.",
  subject =      "Cellular automata",
}

@Article{Zeisel:1986:SAR,
  author =       "H. Zeisel",
  title =        "Statistical Algorithms: Remark {ASR 61}: a Remark on
                 {Algorithm AS 183}. An Efficient and Portable
                 Pseudo-Random Number Generator",
  journal =      j-APPL-STAT,
  volume =       "35",
  number =       "1",
  pages =        "89--89",
  year =         "1986",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:24:34 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See \cite{Wichmann:1982:SAA,McLeod:1985:SAR}.",
  URL =          "http://lib.stat.cmu.edu/apstat/183;
                 http://www.jstor.org/stable/2347876",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
  remark =       "This short article shows that the 1982 Wichmann--Hill
                 \cite{Wichmann:1982:SAA} combined generator is,
                 according to the Chinese Remainder Theorem, equivalent
                 to a single multiplicative congruential generator with
                 $ A = 16 \, 555 \, 425 \, 264 \, 690 = 0 x f0 e \_ 9 c3
                 d \_ f432 $ and $ M = 27 \, 817 \, 185 \, 604 \, 309 =
                 + 0 x194 c \_ b177 \_ 72 d5 $. Those constants need 44
                 and 45 bits, respectively, and the period is about $
                 2^{43} \approx 10^{12} $ (precisely, $ M / 4 = 6 \, 954
                 \, 296 \, 401 \, 077 = 0 x653 \_ 2 c5 d \_ d c b5 $ ).
                 However, the Wichmann--Hill procedure allows its
                 computation with only 16-bit integer arithmetic.",
}

@Article{Zielinski:1986:QRN,
  author =       "Ryszard Zieli{\'n}ski",
  title =        "A quasi-random number generator with infinite period",
  journal =      j-STAT-PROB-LETT,
  volume =       "4",
  number =       "5",
  pages =        "259--259",
  month =        aug,
  year =         "1986",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(86)90099-4",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  bibdate =      "Tue Jan 10 10:22:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
}

@InProceedings{Agnew:1987:RSC,
  author =       "G. B. Agnew",
  title =        "Random Sources for Cryptographic Systems",
  crossref =     "Chaum:1987:ACE",
  pages =        "77--81",
  year =         "1987",
  bibdate =      "Thu Feb 23 10:04:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Aldridge:1987:CRR,
  author =       "James W. Aldridge",
  title =        "Cautions regarding random number generation on the
                 {Apple II}",
  journal =      j-BEHAV-RES-METH-INSTR-COMP,
  volume =       "19",
  number =       "4",
  pages =        "397--399",
  month =        jul,
  year =         "1987",
  CODEN =        "BRMCEW",
  DOI =          "https://doi.org/10.3758/BF03202585",
  ISSN =         "0743-3808 (print), 1532-5970 (electronic)",
  ISSN-L =       "0743-3808",
  bibdate =      "Fri Mar 09 07:30:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/x612304327m6jm52/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods, Instruments, and
                 Computers",
  journal-URL =  "http://link.springer.com/journal/13428",
  remark =       "The author describes the poorly-documented seeding
                 behavior of the Apple II in Basic and Pascal, and
                 recommends workarounds.",
}

@InProceedings{Allender:1987:SCE,
  author =       "E. Allender",
  title =        "Some consequences of the existence of pseudorandom
                 generators",
  crossref =     "ACM:1987:PNA",
  pages =        "151--159",
  year =         "1987",
  bibdate =      "Wed Feb 20 18:33:47 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/28395/p151-allender/p151-allender.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/28395/p151-allender/",
  acknowledgement = ack-nhfb,
}

@Article{Anderson:1987:GRO,
  author =       "T. W. Anderson and I. Olkin and L. G. Underhill",
  title =        "Generation of random orthogonal matrices",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "8",
  number =       "4",
  pages =        "625--629",
  month =        jul,
  year =         "1987",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "15A52 (65C10)",
  MRnumber =     "88g:15017",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4290 (Other computer
                 theory)",
  corpsource =   "Dept. of Stat., Stanford Univ., CA, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "computation theory; Haar measure; Householder
                 transformations; matrix algebra; Monte Carlo methods;
                 normal random variables; random orthogonal matrices
                 generation; singular value decomposition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barbu:1987:NFM,
  author =       "Gh. Barbu",
  title =        "A new fast method for computer generation of gamma and
                 beta random variables by transformations of uniform
                 variables",
  journal =      j-STATISTICS,
  volume =       "18",
  number =       "3",
  pages =        "453--464",
  year =         "1987",
  CODEN =        "MOSSD5",
  DOI =          "https://doi.org/10.1080/02331888708802043",
  ISSN =         "0233-1888 (print), 1029-4910 (electronic)",
  ISSN-L =       "0233-1888",
  bibdate =      "Wed Oct 8 11:23:39 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statistics.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics: a Journal of Theoretical and Applied
                 Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/gsta20",
}

@Article{Bojanczyk:1987:SAE,
  author =       "Adam W. Bojanczyk and Richard P. Brent",
  title =        "A systolic algorithm for extended {GCD} computation",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "14",
  number =       "4",
  pages =        "233--238",
  year =         "1987",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(87)90130-1",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Fri Jan 13 11:50:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  remark =       "Brent \cite{Brent:1999:FAB} points out that Section 4
                 of this paper gives an $ O(n) $ algorithm for computing
                 the extended binary algorithm for the gcd, which finds
                 values $ (a, b) $ such that $ a x + b y = \gcd (x, y) $
                 where $ n = \ceil (\lg (x)) + \ceil (\lg (y)) $, the
                 number of bits in the inputs, improving on the best
                 previous result of \cite{Purdy:1983:CFA}, which runs in
                 $ O(n^2) $ time.",
  remark-2 =     "A preliminary version of this paper was presented at
                 the 9th Australian Computer Science Conference,
                 Canberra (Jan. 1986).",
  xxmonth =      "????",
}

@Article{Boncelet:1987:ACO,
  author =       "Charles G. {Boncelet, Jr.}",
  title =        "Algorithms to computer order statistic distributions",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "8",
  number =       "5",
  pages =        "868--876",
  month =        sep,
  year =         "1987",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "62G30 (62E15)",
  MRnumber =     "88g:62102",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other and miscellaneous); C1140Z (Other and
                 miscellaneous)",
  corpsource =   "Dept. of Electr. Eng., Delaware Univ., Newark, DE,
                 USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "computer order statistic distributions; L-statistics;
                 multivariate distributions; order statistics;
                 probability; sequences of random variables",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Bratley:1987:GS,
  author =       "Paul Bratley and Bennett L. Fox and Linus E. Schrage",
  title =        "A Guide to Simulation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 397",
  year =         "1987",
  ISBN =         "0-387-96467-3",
  ISBN-13 =      "978-0-387-96467-6",
  LCCN =         "QA76.9.C65 B73 1987",
  bibdate =      "Thu Jan 5 15:12:43 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "Digital computer simulation",
}

@Article{Burton:1987:CLT,
  author =       "Robert Burton and Manfred Denker",
  title =        "On the {Central Limit Theorem} for dynamical systems",
  journal =      j-TRANS-AM-MATH-SOC,
  volume =       "302",
  number =       "2",
  pages =        "715--726",
  year =         "1987",
  CODEN =        "TAMTAM",
  DOI =          "https://doi.org/10.2307/2000864",
  ISSN =         "0002-9947 (print), 1088-6850 (electronic)",
  ISSN-L =       "0002-9947",
  MRclass =      "60F05 (28D05)",
  MRnumber =     "891642 (88i:60039)",
  MRreviewer =   "Ulrich Wacker",
  bibdate =      "Thu Mar 1 11:29:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Sugita:1995:PRN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Transactions of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/journals/tran/",
}

@Article{Chambers:1987:CMS,
  author =       "J. M. Chambers and C. L. Mallows and B. W. Stuck",
  title =        "Correction to: {``A method for simulating stable
                 random variables'' [J. Amer. Statist. Assoc. {\bf 71}
                 (1976), no. 354, 340--344, MR 54 \#4059]}",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "82",
  number =       "398",
  pages =        "704--704",
  month =        jun,
  year =         "1987",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "65C10 (62E99)",
  MRnumber =     "88f:65019",
  bibdate =      "Wed Jan 25 08:05:59 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314282;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Chambers:1976:MSS}.",
  URL =          "http://www.jstor.org/stable/2289515",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Chin:1987:TLP,
  author =       "Cary K. Chin and Edward J. McCluskey",
  title =        "Test Length for Pseudorandom Testing",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-36",
  number =       "2",
  pages =        "252--256",
  month =        feb,
  year =         "1987",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.1987.1676892",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sat Jul 9 09:28:50 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676892;
                 http://www.mendeley.com/research/test-length-pseudorandom-testing/",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Chiu:1987:SRS,
  author =       "Ting-Wai Chiu and Tian-Shin Guu",
  title =        "A shift-register sequence random number generator
                 implemented on the microcomputers with 8088\slash 8086
                 and 8087",
  journal =      j-COMP-PHYS-COMM,
  volume =       "47",
  number =       "1",
  pages =        "129--137",
  month =        oct,
  year =         "1987",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(87)90072-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 10:28:20 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465587900725",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Chung:1987:RWA,
  author =       "F. R. K. Chung and Persi Diaconis and R. L. Graham",
  title =        "Random Walks Arising in Random Number Generation",
  journal =      j-ANN-PROBAB,
  volume =       "15",
  number =       "3",
  pages =        "1148--1165",
  month =        jul,
  year =         "1987",
  CODEN =        "APBYAE",
  ISSN =         "0091-1798 (print), 2168-894X (electronic)",
  ISSN-L =       "0091-1798",
  bibdate =      "Sun Apr 20 10:44:17 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annprobab1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aop/1176992088;
                 http://www.jstor.org/stable/2244046",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aop",
}

@Article{Collings:1987:CRN,
  author =       "Bruce Jay Collings",
  title =        "Compound Random Number Generators",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "82",
  number =       "398",
  pages =        "525--527",
  month =        jun,
  year =         "1987",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:05:59 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314282;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2289456",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Compagner:1987:MLS,
  author =       "A. Compagner and A. Hoogland",
  title =        "Maximum-length sequences, cellular automata, and
                 random numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "71",
  number =       "2",
  pages =        "391--428",
  month =        aug,
  year =         "1987",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(87)90037-4",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 15:59:36 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999187900374",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Dagpunar:1987:NMS,
  author =       "J. S. Dagpunar",
  title =        "Nomograms for the Manual Sampling of Random Variates
                 from Gamma, Normal and Associated Distributions",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "36",
  number =       "1",
  pages =        "31--36",
  month =        "????",
  year =         "1987",
  CODEN =        "????",
  DOI =          "https://doi.org/10.2307/2988272",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Thu Jan 22 18:10:23 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i349988;
                 https://www.math.utah.edu/pub/tex/bib/jrss-d-1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2988272",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
}

@Article{Diaconis:1987:SAG,
  author =       "Persi Diaconis and Mehrdad Shahshahani",
  title =        "The Subgroup Algorithm for Generating Uniform Random
                 Variables",
  journal =      j-PROBAB-ENGRG-INFORM-SCI,
  volume =       "1",
  number =       "1",
  pages =        "15--32",
  month =        jan,
  year =         "1987",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1017/S0269964800000255",
  ISSN =         "0269-9648 (print), 1469-8951 (electronic)",
  ISSN-L =       "0269-9648",
  bibdate =      "Thu Aug 24 07:58:11 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib",
  URL =          "https://www.cambridge.org/core/product/5F15097B60994F362F6926689FA8A465",
  acknowledgement = ack-nhfb,
  ajournal =     "Probab. Engrg. Inform. Sci.",
  fjournal =     "Probability in the Engineering and Informational
                 Sciences",
  journal-URL =  "http://www.journals.cambridge.org/jid_PES",
  onlinedate =   "01 July 2009",
}

@Article{Doolen:1987:MCW,
  author =       "Gary D. Doolen and John Hendricks",
  title =        "{Monte Carlo} at Work: {MCNP} and the {Metropolis}
                 Method",
  journal =      j-LOS-ALAMOS-SCIENCE,
  volume =       "15 (Special Issue, {Stanis{\l}aw Ulam 1909--1984})",
  pages =        "142--143",
  year =         "1987",
  CODEN =        "LASCDI",
  ISSN =         "0273-7116",
  bibdate =      "Tue Jun 25 08:49:23 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://library.lanl.gov/cgi-bin/getfile?00326867.pdf;
                 http://library.lanl.gov/cgi-bin/getfile?15-12.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Los Alamos Science",
}

@Book{Edgington:1987:RT,
  author =       "Eugene S. Edgington",
  title =        "Randomization tests",
  volume =       "77",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Second",
  pages =        "xvii + 341",
  year =         "1987",
  ISBN =         "0-8247-7656-9",
  ISBN-13 =      "978-0-8247-7656-5",
  LCCN =         "QA277 .E32 1987",
  bibdate =      "Thu Jan 26 12:03:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  acknowledgement = ack-nhfb,
  subject =      "Statistical hypothesis testing",
}

@Article{Eichenauer:1987:MRN,
  author =       "J{\"u}rgen Eichenauer and Holger Grothe and J{\"u}rgen
                 Lehn and Alev Topuzo{\u{g}}lu",
  title =        "A multiple recursive non-linear congruential pseudo
                 random number generator",
  journal =      j-MANUSCR-MATH,
  volume =       "59",
  number =       "??",
  pages =        "331--346",
  month =        "????",
  year =         "1987",
  CODEN =        "MSMHB2",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  bibdate =      "Tue Dec 27 15:31:37 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Manuscripta Mathematica",
}

@Article{Eichenauer:1987:SQC,
  author =       "J. Eichenauer and J. Lehn",
  title =        "On the structure of quadratic congruential sequences",
  journal =      j-MANUSCR-MATH,
  volume =       "58",
  number =       "??",
  pages =        "129--140",
  month =        "????",
  year =         "1987",
  CODEN =        "MSMHB2",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  bibdate =      "Tue Dec 27 09:28:11 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Manuscripta Mathematica",
}

@Article{Federickson:1987:PMC,
  author =       "P. Federickson and R. Hiromoto and J. Larson",
  title =        "A parallel {Monte Carlo} transport algorithm using a
                 pseudo-random tree to guarantee reproducibility",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "4",
  number =       "3",
  pages =        "281--290",
  month =        jun,
  year =         "1987",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Mon Apr 14 11:08:33 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C7320
                 (Physics and Chemistry)",
  corpsource =   "Dept. of Comput. and Commun., Los Alamos Nat. Lab.,
                 NM, USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "CRAY X-MP/48; Denelcor HEP; generators; Monte Carlo
                 methods; nuclear physics; number; parallel algorithms;
                 parallel Monte Carlo transport algorithm; photon
                 transport algorithm; physics computing; pseudorandom
                 tree; random number generation; reproducibility",
  treatment =    "P Practical",
}

@Article{Fullerton:1987:NPN,
  author =       "James Fullerton",
  title =        "Note on a pseudorandom number generator",
  journal =      j-SIGNUM,
  volume =       "22",
  number =       "4",
  pages =        "3--5",
  month =        oct,
  year =         "1987",
  CODEN =        "SNEWD6",
  ISSN =         "0163-5778 (print), 1558-0237 (electronic)",
  ISSN-L =       "0163-5778",
  bibdate =      "Tue Apr 12 07:50:16 MDT 2005",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/signum.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGNUM Newsletter",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J690",
  keywords =     "algorithms; performance; theory",
  subject =      "G.3 Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation",
}

@InProceedings{Fushimi:1987:MAP,
  author =       "Masanori Fushimi",
  editor =       "????",
  booktitle =    "{First IASC (Internat. Assoc. Statist. Computing)
                 World Conference on Computational Statistics and Data
                 Analysis, Shizuoka, Japan, 1987}",
  title =        "On misunderstandings about pseudorandom number
                 generation by linear recurrence modulo two",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1987",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Tue Jan 10 19:10:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Greenberg:1987:SAS,
  author =       "Irwin Greenberg",
  title =        "A simple approximation for the simulation of
                 continuous random variables",
  journal =      j-SIMULATION,
  volume =       "49",
  number =       "1",
  pages =        "32--33",
  month =        jul,
  year =         "1987",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754978704900105",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 12:09:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/49/1/32.abstract",
  abstract =     "A simple technique is described for simulations and
                 analytical studies where the indication is of a
                 unimodal, right-skewed distribution of a continuous
                 random variable, the type of distribution often
                 approximated by a gamma distribution. The technique is
                 more realistic and more general than the `simple'
                 techniques described in the simulation literature in
                 that it does not require integer parameters.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Grothe:1987:MGP,
  author =       "Holger Grothe",
  title =        "Matrix generators for pseudo-random vectors
                 generation",
  journal =      j-STATIST-PAPERS,
  volume =       "28",
  number =       "1",
  pages =        "233--238",
  month =        dec,
  year =         "1987",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02932602",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers = Statistische Hefte",
  journal-URL =  "http://link.springer.com/journal/362",
}

@Article{Haas:1987:MPR,
  author =       "Alexander Haas",
  title =        "The Multiple Prime Random Number Generator",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "368--381",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10",
  MRnumber =     "89h:65018",
  bibdate =      "Sun Sep 04 21:45:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/35078.214349;
                 http://www.acm.org/pubs/citations/journals/toms/1987-13-4/p368-haas/",
  abstract =     "A new pseudorandom number generator, the Multiple
                 Prime Random Number Generator, has been developed; it
                 is efficient, conceptually simple, flexible, and easy
                 to program. The generator utilizes cycles around prime
                 numbers to guarantee the length of the period, which
                 can easily be programmed to surpass the maximum period
                 of any other presently available random number
                 generator. There are minimum limits placed on the seed
                 values of the variables because the period of the
                 generator is not a function of the initial values of
                 the variables. The generator passes thirteen standard
                 random number generator tests. It requires only about
                 fifteen lines of FORTRAN code to program and utilizes
                 programming language constructs found in most major
                 languages. Finally, it compares very favorably to the
                 fastest of the other available generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; economics; experimentation; performance;
                 reliability",
  reviewer =     "Brian Conolly",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf G.3}: Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Random number generation.
                 {\bf I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications. {\bf I.6.4}: Computing
                 Methodologies, SIMULATION AND MODELING, Model
                 Validation and Analysis. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING,
                 Mathematics and statistics. {\bf J.4}: Computer
                 Applications, SOCIAL AND BEHAVIORAL SCIENCES,
                 Economics. {\bf J.4}: Computer Applications, SOCIAL AND
                 BEHAVIORAL SCIENCES, Sociology.",
}

@Book{Johnson:1987:MSS,
  author =       "Mark E. Johnson",
  title =        "Multivariate statistical simulation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "ix + 230",
  year =         "1987",
  ISBN =         "0-471-82290-6",
  ISBN-13 =      "978-0-471-82290-5",
  LCCN =         "QA278 .J62 1987",
  bibdate =      "Thu Jan 5 14:45:44 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Wiley series in probability and mathematical
                 statistics. Applied probability and statistics",
  URL =          "http://www.loc.gov/catdir/description/wiley031/86022469.html;
                 http://www.loc.gov/catdir/toc/onix01/86022469.html",
  acknowledgement = ack-nhfb,
  subject =      "Multivariate analysis; Data processing",
  tableofcontents = "1. Introduction \\
                 2. Univariate distributions and their generation \\
                 3. Multivariate generation techniques \\
                 4. Multivariate normal and related distributions \\
                 5. Johnson's translation system \\
                 6. Elliptically contoured distributions \\
                 7. Circular, spherical, and related distributions \\
                 8. Khintchine distributions \\
                 9. Multivariate Burr, Pareto, and logistic
                 distributions \\
                 10. Miscellaneous distributions \\
                 11. Research directions.",
}

@Article{Kabaya:1987:SUD,
  author =       "K. Kabaya and Masoa Iri",
  title =        "Sum of uniformly distributed random variables and
                 family of nonanalytic $ {C}^\infty $-functions",
  journal =      "Japan Journal of Applied Mathematics",
  volume =       "4",
  number =       "??",
  pages =        "1--22",
  year =         "1987",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  referred =     "[Irim91a].",
}

@InProceedings{Kaliski:1987:PBG,
  author =       "B. Kaliski",
  title =        "A pseudorandom bit generator based on elliptic
                 logarithms",
  crossref =     "Odlyzko:1987:ACC",
  pages =        "84--103",
  year =         "1987",
  bibdate =      "Thu Dec 29 14:59:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kannan:1987:SPA,
  author =       "Ravindran Kannan and Gary Miller and Larry Rudolph",
  key =          "Kannan et al.",
  title =        "Sublinear Parallel Algorithm for Computing the
                 Greatest Common Divisor of Two Integers",
  journal =      j-SIAM-J-COMPUT,
  volume =       "16",
  number =       "1",
  pages =        "7--16",
  month =        feb,
  year =         "1987",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q25 (11Y16)",
  MRnumber =     "88f:68057",
  MRreviewer =   "J. C. Lagarias",
  bibdate =      "Mon Nov 29 11:00:46 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/16/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 Parallel/Multi.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@InProceedings{LEcuyer:1987:PRN,
  author =       "P. L'Ecuyer",
  editor =       "Paul Hogan",
  booktitle =    "{Modeling and Simulation on Microcomputers 1987:
                 Proceedings of the Conference on Modeling and
                 Simulation on Microcomputers, 14--16 January 1987, San
                 Diego, California}",
  title =        "A Portable Random Number Generator for 16-Bit
                 Computers",
  publisher =    pub-SOC-COMPUT-SIM,
  address =      pub-SOC-COMPUT-SIM:adr,
  bookpages =    "ix + 153",
  pages =        "45--49",
  year =         "1987",
  ISBN =         "9997784952",
  ISBN-13 =      "9789997784957",
  ISSN =         "0735-6773",
  LCCN =         "????",
  bibdate =      "Thu Jan 05 14:02:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxbookpages =  "xii + 257",
  xxeditor =     "Claude C. Barnett",
}

@Article{Lenstra:1987:FIE,
  author =       "H. W. {Lenstra, Jr.}",
  title =        "Factoring integers with elliptic curves",
  journal =      j-ANN-MATH,
  volume =       "126",
  number =       "3",
  pages =        "649--673",
  year =         "1987",
  CODEN =        "ANMAAH",
  ISSN =         "0003-486X (print), 1939-8980 (electronic)",
  ISSN-L =       "0003-486X",
  bibdate =      "Fri Nov 20 15:54:39 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1971363",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Mathematics",
  journal-URL =  "http://annals.math.princeton.edu/",
  referencedin = "Referenced in \cite[Ref. 15]{Kaliski:1995:SUR}.",
}

@Article{Levin:1987:OWF,
  author =       "L. A. Levin",
  title =        "One-way functions and pseudorandom generators",
  journal =      j-COMBINATORICA,
  volume =       "7",
  number =       "4",
  pages =        "357--363",
  month =        dec,
  year =         "1987",
  CODEN =        "COMBDI",
  DOI =          "https://doi.org/10.1007/BF02579323",
  ISSN =         "0209-9683 (print), 1439-6912 (electronic)",
  ISSN-L =       "0209-9683",
  bibdate =      "Thu Dec 29 15:07:02 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Combinatorica",
  journal-URL =  "http://link.springer.com/journal/volumesAndIssues/493",
}

@Article{Michener:1987:UCN,
  author =       "John R. Michener",
  title =        "The Use of Complete, Nonlinear, Block Codes for
                 Nonlinear, Noninvertible Mixing of Pseudorandom
                 Sequences",
  journal =      j-CRYPTOLOGIA,
  volume =       "11",
  number =       "2",
  pages =        "108--111",
  month =        apr,
  year =         "1987",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-118791861884",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:49 MDT 2008",
  bibsource =    "http://www.dean.usma.edu/math/pubs/cryptologia/;
                 https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.informaworld.com/smpp/content~content=a741903012~db=all~order=page",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  romanvolume =  "XI",
}

@Article{Modianos:1987:TIR,
  author =       "D. T. Modianos and R. C. Scott and L. W. Cornwell",
  title =        "Testing Intrinsic Random Number Generators",
  journal =      j-BYTE,
  volume =       "12",
  number =       "1",
  pages =        "175--178",
  year =         "1987",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  bibdate =      "Thu Feb 23 10:01:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "BYTE Magazine",
}

@Article{Monahan:1987:AGC,
  author =       "John F. Monahan",
  title =        "An Algorithm for Generating Chi Random Variables",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "168--172",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/328512.328522",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10",
  MRnumber =     "88d:65013",
  bibdate =      "Sat Nov 19 13:08:24 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  note =         "See corrigendum \cite{Monahan:1988:CAG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Mullen:1987:OCP,
  author =       "G. L. Mullen and H. Niederreiter",
  title =        "Optimal Characteristic Polynomials for Digital
                 Multistep Pseudorandom Numbers",
  journal =      j-COMPUTING,
  volume =       "39",
  number =       "2",
  pages =        "155--163",
  month =        jun,
  year =         "1987",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "88m:65011",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  classification = "921; 922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "digital multistep pseudorandom numbers; mathematical
                 statistics; mathematical techniques --- Polynomials;
                 optimal characteristic polynomials; uniform
                 pseudorandom numbers",
}

@Article{Nelsen:1987:CMP,
  author =       "Roger B. Nelsen",
  title =        "Consequences of the memoryless property for random
                 variables",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "94",
  number =       "10",
  pages =        "981--984",
  month =        "????",
  year =         "1987",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  MRclass =      "60E05 (62E10)",
  MRnumber =     "89d:60022",
  MRreviewer =   "Barry C. Arnold",
  bibdate =      "Wed Dec 3 17:17:33 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Niederreiter:1987:PSS,
  author =       "Harald Niederreiter",
  title =        "Point sets and sequences with small discrepancy",
  journal =      j-MONAT-MATH,
  volume =       "104",
  number =       "4",
  pages =        "273--337",
  month =        dec,
  year =         "1987",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01294651",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K38 (05A15 51E20 65C10)",
  MRnumber =     "918037 (89c:11120)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Thu Feb 23 17:57:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:1987:SAG,
  author =       "Harald Niederreiter",
  title =        "A statistical analysis of generalized feedback shift
                 register pseudorandom number generators",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "8",
  number =       "6",
  pages =        "1035--1051",
  month =        nov,
  year =         "1987",
  CODEN =        "SIJCD4",
  DOI =          "https://doi.org/10.1137/0908084",
  ISSN =         "0196-5204",
  MRclass =      "65C10 (11K06)",
  MRnumber =     "89f:65009",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C1160
                 (Combinatorial mathematics); C5230 (Digital arithmetic
                 methods)",
  corpsource =   "Math. Inst., Austrian Acad. of Sci., Vienna, Austria",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "algorithm; discrepancy; equidistribution; generalized
                 feedback shift register; generalized feedback shift
                 register pseudorandom number generators; GFSR
                 algorithm; Lewis; number theory; Payne; random number
                 generation; serial test; statistical analysis;
                 statistical independence; statistical performance;
                 uniform pseudorandom numbers; uniformity test",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Norton:1987:SRG,
  author =       "G. Norton",
  title =        "A shift-remainder {GCD} algorithm",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "356",
  pages =        "350--356",
  year =         "1987",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Dec 29 07:20:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@TechReport{Percus:1987:RNG,
  author =       "O. E. Percus and M. H. Kalos",
  title =        "Rand number generators for ultracomputers",
  type =         "NYU Ultracomputer Note",
  number =       "114",
  institution =  "New York University",
  address =      "New York, NY, USA",
  year =         "1987",
  bibdate =      "Wed Jan 04 18:28:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Pierre:1987:NRN,
  author =       "L. Pierre and T. Giamarchi and H. J. Schulz",
  title =        "A new random-number generator for multispin {Monte
                 Carlo} algorithms",
  journal =      j-J-STAT-PHYS,
  volume =       "48",
  number =       "1--2",
  pages =        "135--149",
  month =        jul,
  year =         "1987",
  CODEN =        "JSTPSB",
  DOI =          "https://doi.org/10.1007/BF01010404",
  ISSN =         "0022-4715 (print), 1572-9613 (electronic)",
  ISSN-L =       "0022-4715",
  bibdate =      "Thu Aug 28 18:38:46 MDT 2014",
  bibsource =    "http://link.springer.com/journal/10955;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0022-4715&volume=48&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/jstatphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01010404",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Physics",
  journal-URL =  "http://link.springer.com/journal/10955",
}

@Book{Ripley:1987:SS,
  author =       "Brian D. Ripley",
  title =        "Stochastic Simulation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 237",
  year =         "1987",
  DOI =          "https://doi.org/10.1002/9780470316726",
  ISBN =         "0-471-81884-4",
  ISBN-13 =      "978-0-471-81884-7",
  ISSN =         "0271-6356",
  LCCN =         "QA76.9.C65 R57 1987",
  bibdate =      "Thu Jan 5 13:53:44 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$29.95",
  series =       "Wiley series in probability and mathematical
                 statistics. Applied probability and statistics",
  URL =          "http://www.loc.gov/catdir/description/wiley032/86015728.html;
                 http://www.loc.gov/catdir/toc/onix03/86015728.html",
  acknowledgement = ack-nhfb,
  subject =      "Digital computer simulation; Stochastic processes",
  tableofcontents = "1. Aims of Simulation 1--13 \\
                 2. Pseudo-Random Numbers 14--52 \\
                 3. Random Variables 53--95 \\
                 4. Stochastic Models 96--117 \\
                 5. Variance Reduction 118--141 \\
                 6. Output Analysis 146--169 \\
                 7. Uses of Simulation 170--199 \\
                 Appendix A. Computer Systems 215--216 \\
                 Appendix B. Computer Programs 217--233 \\
                 References 200--214 \\
                 Appendix A. Computer Systems \\
                 Appendix B. Computer Programs \\
                 Index",
}

@Article{Salvat:1987:ARS,
  author =       "Francesc Salvat",
  title =        "Algorithms for random sampling from single-variate
                 distributions",
  journal =      j-COMP-PHYS-COMM,
  volume =       "46",
  number =       "3",
  pages =        "427--436",
  month =        sep,
  year =         "1987",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(87)90096-8",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 10:28:20 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465587900968",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Schmidt:1987:VGF,
  author =       "K. E. Schmidt",
  editor =       "L. S. Ferreira and A. C. Fonseca and L. Streit",
  booktitle =    "Models and Methods in Few-Body Physics: proceedings of
                 the {8th Autumn School on Models and Methods in
                 Few-Body Physics, held in Lisboa, Portugal, October
                 13--18, 1986}",
  title =        "Variational and {Green}'s function {Monte Carlo}
                 calculations of few-body systems",
  volume =       "273",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  bookpages =    "xix + 674",
  pages =        "363--407",
  year =         "1987",
  ISBN =         "0-387-17647-0",
  ISBN-13 =      "978-0-387-17647-5",
  LCCN =         "QC174.17.P7 M63 1987",
  bibdate =      "Wed Feb 29 21:35:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Lecture Notes in Physics",
  acknowledgement = ack-nhfb,
  keywords =     "CDC 48-bit multiplicative congruential generator {\tt
                 rannyu()}",
}

@Article{Steele:1987:BRB,
  author =       "J. Michael Steele",
  title =        "Book Review: {{\booktitle{Non-Uniform Random Variate
                 Generation}} (Luc Devroye)}",
  journal =      j-SIAM-REVIEW,
  volume =       "29",
  number =       "4",
  pages =        "675--676",
  month =        "????",
  year =         "1987",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1029148",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Sat Mar 29 09:54:19 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/29/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "December 1987",
}

@InProceedings{Stern:1987:SLC,
  author =       "J. Stern",
  title =        "Secret linear congruential generators are not
                 cryptographically secure",
  crossref =     "IEEE:1987:ASF",
  pages =        "421--426",
  year =         "1987",
  bibdate =      "Wed Dec 21 07:47:04 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/focs1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tezuka:1987:DGP,
  author =       "Shu Tezuka",
  title =        "On the Discrepancy of {GFSR} Pseudorandom Numbers",
  journal =      j-J-ACM,
  volume =       "34",
  number =       "4",
  pages =        "939--949",
  month =        oct,
  year =         "1987",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/31846.31848",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31848.html",
  abstract =     "A new summation formula based on the orthogonal
                 property of Walsh functions is devised. Using this
                 formula, the $k$-dimensional discrepancy of the
                 generalized feedback shift register (GFSR) pseudorandom
                 numbers is derived. The relation between the
                 discrepancy and $k$-distribution of GFSR sequences is
                 also obtained. Finally the definition of optimal GFSR
                 pseudorandom number generators is introduced.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "IBM Tokyo Research Lab, Tokyo, Jpn",
  classification = "723; 922",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "algorithms; computer programming --- Algorithms;
                 generalized feedback shift register; GFSR algorithm;
                 mathematical statistics; pseudorandom numbers; Random
                 Number Generation; theory; verification; Walsh
                 functions",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Random number
                 generation.",
}

@Article{Tezuka:1987:WST,
  author =       "Shu Tezuka",
  title =        "{Walsh}-spectral test for {GFSR} pseudorandom
                 numbers",
  journal =      j-CACM,
  volume =       "30",
  number =       "8",
  pages =        "731--735",
  month =        aug,
  year =         "1987",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "88f:65020",
  bibdate =      "Sat Apr 06 08:06:26 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/27657.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; experimentation; measurement; theory",
  review =       "ACM CR 8806-0438",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Random number
                 generation.",
}

@Article{Tsang:1987:DTA,
  author =       "Wai Wan Tsang and George Marsaglia",
  title =        "A decision tree algorithm for squaring histograms in
                 random number generation",
  journal =      j-ARS-COMB,
  volume =       "23A",
  pages =        "291--301",
  year =         "1987",
  CODEN =        "????",
  ISSN =         "0381-7032",
  MRclass =      "65C10",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0614.65002",
  abstract =     "The squaring histogram method is a fast and flexible
                 way for generating random variables. It was developed
                 by the second author based upon the alias method
                 suggested by A. J. Walker. This paper describes a new
                 algorithm for the set-up procedure of the squaring
                 histogram method. The algorithm organizes data into a
                 binary search tree so that insertion of elements and
                 searching for minimum and maximum can be done in O(log
                 n) time. The average time complexity of the algorithm
                 is O(n log n) while the worst-case complexity is $
                 O(n^2) $. Empirical results confirm that the algorithm
                 runs much faster than the previously fastest algorithm
                 whose time complexity is $ O(n^2) $. Moreover, the
                 proposed algorithm can be implemented on a computer
                 without using more data storage than the existing
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "Ars Combinatoria. The Canadian Journal of
                 Combinatorics",
  journal-URL =  "http://www.combinatorialmath.ca/arscombinatoria/",
  keywords =     "algorithms; average time complexity; random number
                 generation; squaring histogram method; worst-case
                 complexity",
  ZMclass =      "65C10 Random number generation",
}

@Article{Ulrich:1987:MCG,
  author =       "Gary Ulrich and Layne T. Watson",
  title =        "A method for computer generation of variates from
                 arbitrary continuous distributions",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "8",
  number =       "2",
  pages =        "185--197",
  month =        mar,
  year =         "1987",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65C10 (65C05 65D07 65L05 65U05)",
  MRnumber =     "88c:65006",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C4130
                 (Interpolation and function approximation); C4170
                 (Differential equations)",
  corpsource =   "Syst. Training Center, AT and T Bell Labs.,
                 Piscataway, NJ, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "accuracy; arbitrary continuous distributions; best
                 discrete least squares cubic spline approximation;
                 Cauchy distribution; computerised variate-generation;
                 continuous random variable; cumulative distribution
                 function; density function; differential equation;
                 differential equations; efficiency; exponential
                 distribution; gamma distribution; interpolation;
                 interpolatory Runge--Kutta algorithm; inverse CDF
                 transform; least squares approximations; normal
                 distribution; probability; Runge--Kutta methods; setup
                 requirements; transforms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vaziranni:1987:SCC,
  author =       "U. V. Vaziranni",
  title =        "Strong Communication Complexity or Generating
                 Quasi-Random Sequences from Two Communicating
                 Semi-Random Sources",
  journal =      j-COMBINATORICA,
  volume =       "7",
  number =       "4",
  pages =        "375--392",
  month =        "????",
  year =         "1987",
  CODEN =        "COMBDI",
  ISSN =         "0209-9683 (print), 1439-6912 (electronic)",
  ISSN-L =       "0209-9683",
  bibdate =      "Thu Feb 02 17:56:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Combinatorica",
  journal-URL =  "http://link.springer.com/journal/volumesAndIssues/493",
}

@Article{Warnock:1987:RNG,
  author =       "Tony Warnock",
  title =        "Random-Number Generators",
  journal =      j-LOS-ALAMOS-SCIENCE,
  volume =       "15 (Special Issue, {Stanis{\l}aw Ulam 1909--1984})",
  pages =        "137--141",
  year =         "1987",
  CODEN =        "LASCDI",
  ISSN =         "0273-7116",
  bibdate =      "Tue Jun 25 08:49:23 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://library.lanl.gov/cgi-bin/getfile?00326867.pdf;
                 http://library.lanl.gov/cgi-bin/getfile?15-12.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Los Alamos Science",
}

@Article{Wichmann:1987:BRN,
  author =       "Brian A. Wichmann and I. D. Hill",
  title =        "Building a Random-Number Generator: {A Pascal} Routine
                 for Very-Long-Cycle Random-Number Sequences",
  journal =      j-BYTE,
  volume =       "12",
  number =       "3",
  pages =        "127--128",
  month =        "????",
  year =         "1987",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "BYTE Magazine",
}

@Article{Afflerbach:1988:LSP,
  author =       "Lothar Afflerbach and Holger Grothe",
  title =        "The lattice structure of pseudo-random vectors
                 generated by matrix generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "23",
  number =       "1",
  pages =        "127--131",
  month =        jul,
  year =         "1988",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(88)90338-X",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704278890338X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Afflerbach:1988:NRN,
  author =       "Lothar Afflerbach and Klaus Wenzel",
  title =        "Normal random numbers lying on spirals and clubs",
  journal =      j-STATIST-PAPERS,
  volume =       "29",
  number =       "1",
  pages =        "237--244",
  month =        dec,
  year =         "1988",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02924529",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  bibdate =      "Sat Dec 24 08:32:53 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/q7885421202m6565/",
  abstract =     "Two methods for transforming uniformly distributed
                 random numbers into normally distributed random numbers
                 are considered in conjunction with linear congruential
                 generators. The two-dimensional lattice structure of
                 the uniform random numbers is transformed by the
                 Box--Muller method into a spiral structure and by the
                 polar method into a club-shaped structure. The
                 approximation of the two-dimensional normal
                 distribution and the independence of the associated
                 random variables are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers = Statistische Hefte",
  journal-URL =  "http://link.springer.com/journal/362",
  keywords =     "Box--Muller method; lattice structure; linear
                 congruential generators; polar method; Random number
                 generation",
  remark =       "The Box--Muller method \cite{Box:1958:NGR} is this: if
                 $ \{ u, v \} $ is a pair of uniformly-distributed
                 random numbers on $ (0, 1) $, then the pair $ \{ x, y
                 \} $ is normally distributed with mean zero ($ \mu = 0
                 $ ) and standard deviation one ($ \sigma = 1 $ ), if
                 its members are computed from $ x = \cos (2 \pi v)
                 \sqrt {-2 \log u} $ and $ y = \sin (2 \pi u) \sqrt {-2
                 \log v} $. According to \cite[page
                 1614]{Holian:1994:PNG}, the Box--Muller method
                 amplifies correlations between pairs of pseudorandom
                 numbers.\par

                 The polar method is this \cite{Marsaglia:1964:FPG}: If
                 $ \{ u, v \} $ is a pair of uniformly-distributed
                 random numbers on $ (0, 1) $, compute $ s = (2 u - 1)^2
                 + (2 v - 1)^2 $. If $ s = 0 $ or $ s > 1 $, reject the
                 pair and choose another pair. Otherwise, the pair $ \{
                 x, y \} $ is normally distributed with mean zero ($ \mu
                 = 0 $ ) and standard deviation one ($ \sigma = 1 $ ),
                 if its members are computed from $ x = (2 u - 1) *
                 \sqrt (( - 2 \ln s) / s) $ and $ y = (2 v - 1) * \sqrt
                 (( - 2 \ln s) / s) $.\par

                 The polar method is much cheaper, but it requires
                 discarding pairs from the uniform distribution based on
                 a computation that may show slight hardware dependence.
                 Thus, with the polar method, the same sequence of
                 output normally-distributed numbers cannot be
                 guaranteed across platforms.",
}

@TechReport{Afflerbach:1988:UDA,
  author =       "Lothar Afflerbach and Rainer Weilb{\"a}cher",
  title =        "On using discrepancy for the assessment of
                 pseudo-random number generators",
  type =         "Report",
  institution =  "Fachbereich Mathematik, Technische Hochschule
                 Darmstadt",
  address =      "Darmstadt, West Germany",
  year =         "1988",
  bibdate =      "Tue Jan 10 15:33:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agnew:1988:RSC,
  author =       "G. B. Agnew",
  title =        "Random Sources for Cryptographic Systems",
  crossref =     "Chaum:1987:ACE",
  pages =        "77--81",
  year =         "1988",
  bibdate =      "Thu Feb 23 10:04:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ahrens:1988:ETF,
  author =       "Joachim H. Ahrens and Ulrich Dieter",
  title =        "Efficient table-free sampling methods for the
                 exponential, {Cauchy}, and normal distributions",
  journal =      j-CACM,
  volume =       "31",
  number =       "11",
  pages =        "1330--1337",
  month =        nov,
  year =         "1988",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu May 30 09:41:10 MDT 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/50094.html",
  abstract =     "Three algorithms for sampling from exponential, Cauchy
                 and normal distributions are developed. They are based
                 on the ``exact approximation'' method, and their
                 expected numbers of consumed uniform deviates are less
                 than 1.04 per sample from the target distributions. The
                 algorithms are simple and easily implemented in any
                 desired precision. They require no space for long
                 tables of auxiliary vectors, merely a few constants are
                 needed. Nevertheless, their speed compares well with
                 the performance of much more complex and table-aided
                 sampling procedures.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms",
  subject =      "{\bf I.6.m}: Computing Methodologies, SIMULATION AND
                 MODELING, Miscellaneous. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Statistical
                 computing.",
}

@Article{Alexi:1988:RRF,
  author =       "Werner Alexi and Benny Chor and Oded Goldreich and
                 Claus-P. Schnorr",
  title =        "{RSA} and {Rabin} functions: certain parts are as hard
                 as the whole",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "194--209",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "11Y11 (11T71 11Y16 68P25 68Q15 94A60)",
  MRnumber =     "89j:11120",
  MRreviewer =   "Melvin M. Sweet",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Altman:1988:BWB,
  author =       "N. S. Altman",
  title =        "Bit-wise behavior of random number generators",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "9",
  number =       "5",
  pages =        "941--949",
  month =        sep,
  year =         "1988",
  CODEN =        "SIJCD4",
  DOI =          "https://doi.org/10.1137/0909065",
  ISSN =         "0196-5204",
  MRclass =      "65C10",
  MRnumber =     "89i:65006",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C5230 (Digital
                 arithmetic methods); C7310 (Mathematics)",
  corpsource =   "Dept. of Biometrics, Cornell Univ., Ithaca, NY, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "central bits; combination generators; Fibonacci
                 generators; linear congruential generator; lower-order
                 bits; m-tuple test; modulo 2/sup p/; nonrandom
                 behavior; nonrandomness; pseudorandom integers;
                 pseudorandom number generators; random number
                 generation; shift register generators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bach:1988:HGF,
  author =       "Eric Bach",
  title =        "How to Generate Factored Random Numbers",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "179--193",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "11Y16 (11Y11 68Q25)",
  MRnumber =     "89e:11082",
  MRreviewer =   "Claus-Peter Schnorr",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Bakry:1988:PFG,
  author =       "S. H. Bakry and M. Shatila",
  title =        "{Pascal} functions for the generation of random
                 numbers",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "15",
  number =       "11",
  pages =        "969--973",
  month =        "????",
  year =         "1988",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 19:01:05 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122188900429",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Beauchemin:1988:GRN,
  author =       "Pierre Beauchemin and Gilles Brassard and Claude
                 Cr{\'e}peau and Claude Goutier and Carl Pomerance",
  title =        "The Generation of Random Numbers that Are Probably
                 Prime",
  journal =      j-J-CRYPTOLOGY,
  volume =       "1",
  number =       "1",
  pages =        "53--64",
  month =        "????",
  year =         "1988",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/BF00206325",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "11Y11 (11A51)",
  MRnumber =     "89g:11126",
  MRreviewer =   "Sun Qi",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-ksm # " and " # ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@Book{Binder:1988:MCS,
  author =       "K. (Kurt) Binder and Dieter W. Heermann",
  title =        "{Monte Carlo} simulation in statistical physics: an
                 introduction",
  volume =       "80",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 127",
  year =         "1988",
  ISBN =         "0-387-19107-0",
  ISBN-13 =      "978-0-387-19107-2",
  LCCN =         "QC174.85.M64 B56 1988",
  bibdate =      "Sat Feb 8 18:03:14 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in solid-state sciences",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method; Statistical physics; Random walks
                 (Mathematics)",
}

@Article{Bratley:1988:AIS,
  author =       "Paul Bratley and Bennett L. Fox",
  title =        "{Algorithm 659}: Implementing {Sobol}'s Quasirandom
                 Sequence Generator",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "88--100",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/42288.214372",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1988-14-1/p88-bratley/",
  abstract =     "We compare empirically accuracy and speed of
                 low-discrepancy sequence generators of Sobol' and
                 Faure. These generators are useful for multidimensional
                 integration and global optimization. We discuss our
                 implementation of the Sobol' generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Brickell:1988:CSR,
  author =       "Ernest F. Brickell and Andrew M. Odlyzko",
  title =        "Cryptanalysis: a Survey of Recent Results",
  journal =      j-PROC-IEEE,
  volume =       "76",
  number =       "5",
  pages =        "578--593",
  month =        may,
  year =         "1988",
  CODEN =        "IEEPAD",
  DOI =          "https://doi.org/10.1109/5.4443",
  ISSN =         "0018-9219 (print), 1558-2256 (electronic)",
  ISSN-L =       "0018-9219",
  bibdate =      "Sun Mar 11 10:50:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In spite of the progress in computational complexity,
                 it is still true that cryptosystems are tested by
                 subjecting them to cryptanalytic attacks by experts.
                 Most of the cryptosystems that have been publicly
                 proposed in the last decade have been broken. This
                 paper outlines a selection of the attacks that have
                 been used and explains some of the basic tools
                 available to cryptanalyst. Attacks on knapsack
                 cryptosystems, congruential generators, and a variety
                 of two key secrecy and signature schemes are discussed.
                 There is also a brief discussion of the status of the
                 security of cryptosystems for which there is no known
                 feasible attack, such as the RSA, discrete
                 exponentiation, and DES cryptosystems.",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the IEEE",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
  keywords =     "code breaking; congruential generators; cryptanalytic
                 attacks; cryptosystem testing; data security; DES
                 system; discrete exponentiation; knapsack
                 cryptosystems; RSA system; signature schemes; two key
                 secrecy scheme",
}

@Book{Brillhart:1988:FHP,
  author =       "John Brillhart and D. H. Lehmer and J. L. Selfridge
                 and Bryant Tuckerman and S. S. {Wagstaff, Jr.}",
  title =        "Factorizations of $ b^n \pm 1 $, $ b = 2, 3, 5, 6, 7,
                 10, 11, 12 $ up to high powers",
  volume =       "22",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  edition =      "Second",
  pages =        "xcv + 236",
  year =         "1988",
  ISBN =         "0-8218-5078-4",
  ISBN-13 =      "978-0-8218-5078-7",
  ISSN =         "0271-4132 (print), 1098-3627 (electronic)",
  ISSN-L =       "0271-4132",
  LCCN =         "QA161.F3 F33 1988",
  bibdate =      "Sat Mar 10 10:18:16 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Contemporary mathematics",
  ZMnumber =     "Zbl 0659.10001",
  acknowledgement = ack-nhfb,
  remark =       "Factorizations of the form in the title are of
                 interest for simplifying computations in the
                 determination of optimal parameters for linear and
                 multiplicative congruential generators.",
  subject =      "factors (algebra); tables",
}

@Article{Chor:1988:UBS,
  author =       "Benny Chor and Oded Goldreich",
  title =        "Unbiased bits from sources of weak randomness and
                 probabilistic communication complexity",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "230--261",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q25",
  MRnumber =     "89e:68044",
  MRreviewer =   "Claus-Peter Schnorr",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Collings:1988:AIG,
  author =       "Bruce Jay Collings and G. Barry Hembree",
  title =        "Addendum to {``Initializing} Generalized Feedback
                 Shift Register Pseudorandom Number Generators''",
  journal =      j-J-ACM,
  volume =       "35",
  number =       "4",
  pages =        "1001--1001",
  month =        oct,
  year =         "1988",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Oct 21 23:55:47 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Collings:1986:IGF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Dagpunar:1988:CGR,
  author =       "J. S. Dagpunar",
  title =        "Computer generation of random variates from the tail
                 of $t$ and normal distributions",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "653--661",
  year =         "1988",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610918808812684",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:28 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Book{Dagpunar:1988:PRV,
  author =       "John Dagpunar",
  title =        "Principles of Random Variate Generation",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xv + 228",
  year =         "1988",
  ISBN =         "0-19-852202-9",
  ISBN-13 =      "978-0-19-852202-7",
  LCCN =         "QA273 .D24 1988",
  bibdate =      "Thu Jan 5 17:26:35 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$45.00 (U.S.)",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0638/88003212-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0638/88003212-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Random variables",
}

@Article{DeAngelis:1988:CDP,
  author =       "A. {De Angelis}",
  title =        "A class of {$N$}-dimensional probability density
                 functions suitable for random generation",
  journal =      j-COMP-PHYS-COMM,
  volume =       "52",
  number =       "1",
  pages =        "61--64",
  month =        dec,
  year =         "1988",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(88)90172-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 10:28:25 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465588901725",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{DeMatteis:1988:PRN,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Parallelization of random number generators and
                 long-range correlations",
  journal =      j-NUM-MATH,
  volume =       "53",
  number =       "5",
  pages =        "595--608",
  month =        aug,
  year =         "1988",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65C10 (11K45 65W05)",
  MRnumber =     "89h:65016",
  MRreviewer =   "Norbert Schmitz",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4190 (Other numerical
                 methods)C7310 (Mathematics)",
  corpsource =   "Lab. Matematica Appl., ENEA, Bologna, Italy",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "congruential schemes; long-range correlations; Monte
                 Carlo methods; Monte Carlo problem; number theoretic
                 framework; parallel algorithms; parallelization;
                 pseudo-random sequences; random number generation;
                 random number generators",
  treatment =    "P Practical",
}

@InProceedings{Deng:1988:RSS,
  author =       "Lih-Yuan Deng",
  title =        "Robustness Study of Some Random Variate Generators",
  crossref =     "Wegman:1988:CSS",
  pages =        "624--626",
  year =         "1988",
  bibdate =      "Wed Nov 12 16:52:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Denzer:1988:OML,
  author =       "V. Denzer and A. Ecker",
  title =        "Optimal multipliers for linear congruential
                 pseudo-random number generators with prime moduli",
  journal =      j-BIT,
  volume =       "28",
  number =       "4",
  pages =        "803--808",
  month =        dec,
  year =         "1988",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01954900",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "90h:65010",
  MRreviewer =   "Brian Conolly",
  bibdate =      "Wed Jan 4 18:52:20 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=28&issue=4;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=28&issue=4&spage=803",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Dudewicz:1988:TVF,
  author =       "Edward J. Dudewicz and Zaven A. Karian",
  title =        "{TESTRAND} for the {VAX-11} Family of Computers: a
                 Random-Number Generation and Testing Library",
  journal =      j-AMER-STAT,
  volume =       "42",
  number =       "3",
  pages =        "228--228",
  month =        aug,
  year =         "1988",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 12:40:30 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326441;
                 https://www.math.utah.edu/pub/tex/bib/amstat1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2685018",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@InProceedings{Durst:1988:TPR,
  author =       "Mark J. Durst",
  title =        "Testing Parallel Random Number Generators",
  crossref =     "Wegman:1988:CSS",
  pages =        "228--231",
  year =         "1988",
  bibdate =      "Wed Nov 12 16:52:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Edwards:1988:CAM,
  author =       "Lynne K. Edwards",
  title =        "On Comparative Accuracy of Multivariate Nonnormal
                 Random Number Generators",
  crossref =     "Wegman:1988:CSS",
  pages =        "618--623",
  year =         "1988",
  bibdate =      "Wed Nov 12 16:52:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Eichenauer:1988:MLTb,
  author =       "J{\"u}rgen Eichenauer and Harald Niederreiter",
  title =        "On {Marsaglia}'s lattice test for pseudorandom
                 numbers",
  journal =      j-MANUSCR-MATH,
  volume =       "62",
  number =       "2",
  pages =        "245--248",
  year =         "1988",
  CODEN =        "MSMHB2",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "90c:65011",
  MRreviewer =   "J. Patrick Lambert",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0663.65006",
  abstract =     "Nonlinear recursive congruential pseudorandom number
                 equations with prime modulus and maximal period length
                 are considered. The authors give characterizations for
                 these generator which behave optimally with respect to
                 Marsaglia's lattice test.",
  acknowledgement = ack-nhfb,
  classmath =    "*65C10 Random number generation; 11K99 Probabilistic
                 theory",
  fjournal =     "Manuscripta Mathematica",
  keywords =     "Marsaglia's lattice test; maximal period length;
                 Nonlinear recursive congruential pseudorandom number
                 equations",
  ZMreviewer =   "R. F. Tichy",
}

@Article{Eichenauer:1988:MLTc,
  author =       "J{\"u}rgen Eichenauer and Holger Grothe and J{\"u}rgen
                 Lehn",
  title =        "{Marsaglia}'s lattice test and non-linear congruential
                 pseudo-random number generators",
  journal =      j-METRIKA,
  volume =       "35",
  number =       "3/4",
  pages =        "241--250",
  year =         "1988",
  CODEN =        "MTRKA8",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  MRclass =      "65C10",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0653.65006",
  abstract =     "A recursive congruential non-additive generator of the
                 form $ (1) \quad x_{n + 1} \equiv f(x_n)(m o d p), $ $
                 x_{n + 1} \in {\bbfZ }_p $, $ n \ge 0 $, is considered,
                 where p is a large prime number, $ {\bbfZ }_p = \{ 0,
                 1, \ldots {}, p - 1 \} $, $ x_0 \in {\bbfZ }_p $, and
                 f: $ {\bbfZ }_p \to {\bbfZ }_p $ is a function such
                 that (1) has maximal period length. The sequences of
                 integers $ \{ x_i : $ $ i \ge 0 \} $ generated by (1)
                 are divided into vectors of $ d \ge 2 $ consecutive
                 numbers: $ v^d_i = (x_i, \ldots {}, x_{i + d - 1})^T
                 \in {\bbfZ }^d_p $ and let $ w^d_i \equiv v_i^d - v^d_0
                 (m o d p), $ $ i \ge 0 $. For $ d \le 3 $, it is shown
                 that $ V^d = {\bbfZ }^d_p, $ where $ V^d = \{ v \in
                 {\bbfZ }^d_p \vert \quad v \equiv \sum^{p - 1}_{i =
                 1z}_i w^d_i (m o d p); \quad z_1, \ldots {}, z_{p - 1}
                 \in {\bbfZ }_p \} . $ In other words, (1) passes {\it
                 G. Marsaglia}'s lattice test [Applications of number
                 theory to numerical analysis, 249-285 (1972; Zbl
                 0266.65007)]. For $ d \ge 4 $ there are generators (1)
                 which fail this test. It is also shown that the
                 generators of a class of nonlinear generators
                 introduced by the first and the third author [Stat.
                 Hefte 27, 315-326 (1986; Zbl 0607.65001)] pass
                 Marsaglia's lattice test for $ d \le (p - 1) / 2 $.",
  acknowledgement = ack-nhfb,
  classmath =    "*65C10 Random number generation",
  fjournal =     "Metrika. International Journal for Theoretical and
                 Applied Statistics.",
  journal-URL =  "http://link.springer.com/journal/184",
  keywords =     "Marsaglia's lattice test; nonlinear generators; pseudo
                 random number generators; recursive congruential
                 non-additive generator",
  ZMreviewer =   "R. Theodorescu",
}

@Article{Eichenauer:1988:NCP,
  author =       "J{\"u}rgen Eichenauer and J{\"u}rgen Lehn and Alev
                 Topuzo{\v{g}}lu",
  title =        "A nonlinear congruential pseudorandom number generator
                 with power of two modulus",
  journal =      j-MATH-COMPUT,
  volume =       "51",
  number =       "184",
  pages =        "757--759",
  month =        oct,
  year =         "1988",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45 65C05)",
  MRnumber =     "89i:65007",
  MRreviewer =   "J. Spanier",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008776.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Tech. Hochschule Darmstadt, West Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "maximal; necessary and sufficient condition; nonlinear
                 congruential pseudorandom number generator; number
                 theory; of two modulus; period length; power",
  treatment =    "T Theoretical or Mathematical",
}

@TechReport{Fishman:1988:MCR,
  author =       "G. S. Fishman",
  title =        "Multiplicative congruential random number generators
                 with modulus $ 2^\beta $: An exhaustive analysis for $
                 \beta = 32 $ and a partial analysis for $ \beta = 48
                 $",
  type =         "Technical Report",
  number =       "UNC/OR/TR-87/10",
  institution =  "University of North Carolina at Chapel Hill",
  address =      "Chapel Hill, NC, USA",
  year =         "1988",
  bibdate =      "Tue Jan 10 15:39:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Frieze:1988:RTI,
  author =       "Alan M. Frieze and Johan H{\aa}stad and Ravi Kannan
                 and Jeffrey C. Lagarias and Adi Shamir",
  title =        "Reconstructing truncated integer variables satisfying
                 linear congruences",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "262--280",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "11Y16 (11T71 94A60)",
  MRnumber =     "89d:11115",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Fushimi:1988:DUR,
  author =       "Masanori Fushimi",
  title =        "Designing a uniform random number generator whose
                 subsequences are $k$-distributed",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "1",
  pages =        "89--99",
  month =        feb,
  year =         "1988",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/0217006",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "65C10 (90C09)",
  MRnumber =     "89b:65021",
  MRreviewer =   "P. Neumann",
  bibdate =      "Mon Nov 29 11:01:00 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  keywords =     "decimated sequence; heuristic algorithm;
                 k-distribution; set covering problem; Tausworthe
                 sequence",
}

@InProceedings{Fushimi:1988:STP,
  author =       "Masanori Fushimi",
  editor =       "????",
  booktitle =    "{First APORS (Assoc. Asian-Pacific Oper. Res. Soc.
                 IFORS) Conf, Seoul, Korea, 1988}",
  title =        "Statistical tests of pseudorandom numbers generated by
                 a linear recurrence modulo two",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1988",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Tue Jan 10 19:12:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Gifford:1988:NRN,
  author =       "David K. Gifford",
  title =        "Natural Random Numbers",
  type =         "Report",
  number =       "MIT/LCS/TM-371",
  institution =  "Laboratory for Computer Science, Massachusetts
                 Institute of Technology",
  address =      "Cambridge, MA, USA",
  month =        sep,
  year =         "1988",
  bibdate =      "Thu Feb 02 17:13:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-371.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Gleason:1988:IPS,
  author =       "John M. Gleason",
  title =        "The Importance of Proper Seeding of the {Applesoft}
                 Pseudorandom Number Generator",
  journal =      j-COMPUT-METH-PROG-BIOMED,
  volume =       "26",
  number =       "3",
  pages =        "229--232",
  month =        may # "\slash " # jun,
  year =         "1988",
  CODEN =        "CMPBEK",
  DOI =          "https://doi.org/10.1016/0169-2607(88)90002-8",
  ISSN =         "0169-2607 (print), 1872-7565 (electronic)",
  ISSN-L =       "0169-2607",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Methods and Programs in Biomedicine",
  onlinedate =   "10 June 2003",
}

@Article{Gleick:1988:QTR,
  author =       "J. Gleick",
  title =        "The Quest for True Randomness Finally Appears
                 Successful",
  journal =      j-NY-TIMES,
  volume =       "??",
  number =       "??",
  pages =        "C1, C8",
  day =          "19",
  month =        apr,
  year =         "1988",
  CODEN =        "NYTIAO",
  ISSN =         "0362-4331 (print), 1542-667X, 1553-8095",
  ISSN-L =       "0362-4331",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "New York Times",
  journal-URL =  "http://www.nytimes.com/",
}

@InProceedings{Goldreich:1988:EPG,
  author =       "O. Goldreich and H. Krawczyk and M. Luby",
  title =        "On the existence of pseudorandom generators",
  crossref =     "IEEE:1988:ASF",
  pages =        "12--24",
  year =         "1988",
  bibdate =      "Thu Apr 5 06:13:40 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Greiner:1988:NIS,
  author =       "A. Greiner and W. Strittmatter and J. Honerkamp",
  title =        "Numerical integration of stochastic differential
                 equations",
  journal =      j-J-STAT-PHYS,
  volume =       "51",
  number =       "1--2",
  pages =        "95--108",
  month =        apr,
  year =         "1988",
  CODEN =        "JSTPSB",
  DOI =          "https://doi.org/10.1007/BF01015322",
  ISSN =         "0022-4715 (print), 1572-9613 (electronic)",
  ISSN-L =       "0022-4715",
  bibdate =      "Thu Aug 28 18:39:48 MDT 2014",
  bibsource =    "http://link.springer.com/journal/10955;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0022-4715&volume=51&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/jstatphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01015322;
                 http://www.springerlink.com/content/k655227v66316102/",
  abstract =     "Several numerical methods for treating stochastic
                 differential equations are considered. Both the
                 convergence in the mean square limit and the
                 convergence of the moments is discussed and the
                 generation of appropriate random numbers is treated.
                 The necessity of simulations at various time steps with
                 an extrapolation to time step zero is emphasized and
                 demonstrated by a simple example.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Physics",
  journal-URL =  "http://link.springer.com/journal/10955",
  keywords =     "generation of random numbers; numerical treatment;
                 order of convergence; stochastic differential
                 equations",
}

@PhdThesis{Grothe:1988:MEG,
  author =       "H. Grothe",
  title =        "{Matrixgeneratoren zur erzeugung gleichverteilter
                 pseudozufallsvektoren}. ({German}) [Matrix generators
                 for the generation of equally distributed pseudo-random
                 vectors]",
  type =         "Dissertation",
  school =       "Technische Hochschule Darmstadt",
  address =      "Darmstadt, Germany",
  year =         "1988",
  bibdate =      "Sun Feb 19 06:59:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Article{Guinier:1988:FPU,
  author =       "D. Guinier",
  title =        "A fast and portable uniform quasi-random generator of
                 very large period based on a generalized multi-moduli
                 congruential method",
  journal =      j-SIMULETTER,
  volume =       "19",
  number =       "3",
  pages =        "27--33",
  year =         "1988",
  CODEN =        "SIMUD5",
  ISSN =         "0163-6103",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1988.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "10/02/89",
  descriptors =  "RNG; linear congruential generator; Fortran",
  enum =         "1228",
  fjournal =     "ACM Simuletter",
  location =     "PKI-OG: Li-Ord.Le",
  references =   "18",
  revision =     "21/04/91",
}

@InProceedings{Gunther:1988:ASG,
  author =       "C. G. G{\"u}nther",
  editor =       "D. Chaum and W. L. Price",
  booktitle =    "Advances in Cryptology --- {EUROCRYPT 87}",
  title =        "Alternating Step Generators Controlled by {de Bruijn}
                 Sequences",
  volume =       "304",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "5--14",
  year =         "1988",
  DOI =          "https://doi.org/10.1007/3-540-39118-5_2",
  bibdate =      "Sat Apr 05 12:00:56 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://scispace.com/pdf/alternating-step-generators-controlled-by-de-bruijn-2fg3dor74t.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Haberman:1988:WUC,
  author =       "Shelby J. Haberman",
  title =        "A warning on the use of chi-squared statistics with
                 frequency tables with small expected cell counts",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "83",
  number =       "402",
  pages =        "555--560",
  month =        jun,
  year =         "1988",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62F05 (62F04 62H17)",
  MRnumber =     "90f:62080",
  MRreviewer =   "Nariaki Sugiura",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2288877",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Hallin:1988:RBT,
  author =       "Marc Hallin and Guy M{\'e}lard",
  title =        "Rank-based tests for randomness against first-order
                 serial dependence",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "83",
  number =       "404",
  pages =        "1117--1128",
  month =        dec,
  year =         "1988",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62M10 (62G10)",
  MRnumber =     "91d:62138",
  bibdate =      "Wed Jan 25 08:05:59 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314288;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2290144",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Harmon:1988:AIM,
  author =       "Marion G. Harmon and Ted P. Baker",
  title =        "An {Ada} Implementation of {Marsaglia}'s
                 {``Universal''} Random Number Generator",
  journal =      j-SIGADA-LETTERS,
  volume =       "8",
  number =       "2",
  pages =        "110--112",
  month =        mar # "\slash " # apr,
  year =         "1988",
  CODEN =        "AALEE5",
  ISSN =         "1094-3641 (print), 1557-9476 (electronic)",
  ISSN-L =       "1094-3641",
  bibdate =      "Sat Aug 9 09:05:28 MDT 2003",
  bibsource =    "ftp://ftp.uu.net/library/bibliography;
                 http://portal.acm.org/;
                 http://www.adahome.com/Resources/Bibliography/articles.ref;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigada.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGADA Ada Letters",
  journal-URL =  "http://portal.acm.org/citation.cfm?id=J32",
  keywords =     "algorithms; design; languages; real numbers; theory",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Ada \\ G.3 Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Random number generation",
}

@Article{Heidelberger:1988:DES,
  author =       "Philip Heidelberger",
  title =        "Discrete event simulations and parallel processing:
                 statistical properties",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "9",
  number =       "6",
  pages =        "1114--1132",
  month =        nov,
  year =         "1988",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "68U20 (60K10 65W05)",
  MRnumber =     "89j:68152",
  MRreviewer =   "Do Le Minh",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240G (Monte Carlo methods); C1140G (Monte Carlo
                 methods); C7310 (Mathematics)",
  corpsource =   "Div. of IBM Res., Thomas J. Watson Res. Center,
                 Yorktown Heights, NY, USA",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "bias expansions; central limit theorems; completion
                 times; convergence properties; discrete event
                 simulation; estimation theory; estimators; Monte Carlo
                 methods; multiple processor computing system; parallel
                 independent replications; parallel processing;
                 parallelism; reliability theory; scheduling theory;
                 statistical analysis; strong laws",
  treatment =    "B Bibliography; T Theoretical or Mathematical; X
                 Experimental",
}

@Article{Hong:1988:LGA,
  author =       "J. Hong and X. Tan and M. Chen",
  title =        "From local to global: an analysis of nearest neighbor
                 balancing on hypercube",
  journal =      j-SIGMETRICS,
  volume =       "16",
  number =       "1",
  pages =        "73--82",
  month =        may,
  year =         "1988",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/1007771.55605",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:05:57 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "This paper will focus on the issue of load balancing
                 on a hypercube network of $N$ processors. We will
                 investigate a typical nearest neighbor balancing
                 strategy --- in which workloads among neighboring
                 processors are averaged at discrete time steps. The
                 computation model allows tasks, described by
                 independent random variables, to be generated and
                 terminated at all times. We assume that the random
                 variables at all nodes have equal expected value and
                 their variances are bounded by a constant d2, and we
                 let the difference DIFF between the actual load on each
                 node and the average load on the system describe the
                 deviation of the load on a node from the global average
                 value. The following analytical results are obtained:
                 The expected value of DIFF, denoted by E(DIFF), is 0.
                 The variance of DIFF, denoted by Var(DIFF), is
                 independent of time $t$, and Var(DIFF) $ \leq 1.386 d^2
                 + 0.231 \log N $.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Izumi:1988:FGW,
  author =       "T. Izumi",
  title =        "Fast Generation of a White and Normal Random Signal",
  journal =      j-IEEE-TRANS-INSTRUM-MEAS,
  volume =       "37",
  number =       "2",
  pages =        "316--318",
  year =         "1988",
  CODEN =        "IEIMAO",
  DOI =          "https://doi.org/10.1109/19.6075",
  ISSN =         "0018-9456 (print), 1557-9662 (electronic)",
  ISSN-L =       "0018-9456",
  bibdate =      "Thu Feb 23 10:09:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Instrumentation and Measurement",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=19",
}

@Article{Kachitvichyanukul:1988:AHS,
  author =       "Voratas Kachitvichyanukul and Bruce W. Schmeiser",
  title =        "{Algorithm 668}: {H2PEC}: Sampling from the
                 Hypergeometric Distribution",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "397--398",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sun Sep 4 22:37:31 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/50063.214387;
                 http://www.acm.org/pubs/citations/journals/toms/1988-14-4/p397-kachitvichyanukul/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.m}:
                 Mathematics of Computing, MISCELLANEOUS.",
}

@Article{Kachitvichyanukul:1988:BRV,
  author =       "Voratas Kachitvichyanukul and Bruce W. Schmeiser",
  title =        "Binomial Random Variate Generation",
  journal =      j-CACM,
  volume =       "31",
  number =       "2",
  pages =        "216--222",
  month =        feb,
  year =         "1988",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "88m:65010",
  bibdate =      "Sat Sep 24 11:20:03 1994",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214994.html;
                 http://www.acm.org/pubs/toc/Abstracts/0001-0782/42381.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@Article{Kannan:1988:PFN,
  author =       "R. Kannan and Arjen K. Lenstra and L. Lov{\'a}sz",
  title =        "Polynomial factorization and nonrandomness of bits of
                 algebraic and some transcendental numbers",
  journal =      j-MATH-COMPUT,
  volume =       "50",
  number =       "181",
  pages =        "235--250",
  month =        jan,
  year =         "1988",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "68Q20 (11A51 11A63 11J99 11Y16 68Q25)",
  MRnumber =     "89j:68061",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); B0250 (Combinatorial mathematics);
                 B6120B (Codes); C1110 (Algebra); C1160 (Combinatorial
                 mathematics); C1260 (Information theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
                 Pittsburg, PA, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "algebraic numbers; binary expansions; computational
                 complexity; cryptography; nonrandomness; number theory;
                 polynomial factorisation; polynomial time algorithms;
                 polynomials; random number generation; secure
                 pseudorandom sequences; transcendental numbers",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Karloff:1988:RAP,
  author =       "Howard Karloff and Prabhakar Raghavan",
  title =        "Randomized algorithms and pseudorandom numbers",
  crossref =     "ACM:1988:PTA",
  pages =        "310--321",
  year =         "1988",
  bibdate =      "Wed Feb 20 18:33:47 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/62212/p310-karloff/p310-karloff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/62212/p310-karloff/",
  acknowledgement = ack-nhfb,
  remark =       "Following up on Bach's work \cite{Bach87}, this paper
                 studies pseudo-random substitutes (with small seeds)
                 for purely random choices in sorting, selection and
                 oblivious message routing. An interesting result is
                 that the linear congruence pseudo-random number
                 generator proposed by Knuth \cite{Knuth73} can interact
                 with some {\tt quicksort} algorithms.",
}

@Article{Kleijnen:1988:ASE,
  author =       "Jack P. C. Kleijnen",
  title =        "Analyzing Simulation Experiments with {Common Random
                 Numbers}",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "34",
  number =       "1",
  pages =        "65--74",
  month =        jan,
  year =         "1988",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.34.1.65",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Kolmogorov:1988:AR,
  author =       "A. N. Kolmogorov and V. A. Uspenskii",
  title =        "Algorithms and Randomness",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "32",
  number =       "3",
  pages =        "389--412",
  month =        "????",
  year =         "1988",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1132060",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:39:58 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/32/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  URL =          "http://epubs.siam.org/tvp/resource/1/tprbau/v32/i3/p389_s1",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1988",
}

@Article{Korin:1988:TRM,
  author =       "Basil P. Korin",
  title =        "{Turbo Rand}: {Monte Carlo} sampling and simulations",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "6",
  number =       "2",
  pages =        "185--188",
  month =        mar,
  year =         "1988",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(88)90049-7",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:03:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167947388900497",
  abstract =     "The popularity of statistical simulation for a wide
                 variety of quantitative investigations has created
                 considerable interest in the generation of pseudo
                 random variables. While most statistical software
                 packages contain procedures for generating random
                 variates, even those for large scale computer systems
                 are commonly limited to the production of a very few
                 types. The Turbo Rand software provides a welcome
                 addition for at least one computer usage group.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Kurosawa:1988:CSP,
  author =       "K. Kurosawa and K. Matsu",
  title =        "Cryptographically secure pseudorandom sequence
                 generator based on reciprocal number cryptosystem",
  journal =      j-ELECT-LETTERS,
  volume =       "24",
  number =       "1",
  pages =        "16--17",
  day =          "7",
  month =        jan,
  year =         "1988",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19880011",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8134",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Lagarias:1988:UEP,
  author =       "Jeffrey C. Lagarias and James A. Reeds",
  title =        "Unique Extrapolation of Polynomial Recurrences",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "342--362",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "11B37 (11T71 11Y16 94A60)",
  MRnumber =     "89c:11025",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@TechReport{LEcuyer:1988:BLP,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Blouin",
  title =        "{BonGCL}, un logiciel pour la recherche de bons
                 g{\'e}n{\'e}rateurs {\`a} congruence lin{\'e}aire.
                 ({French}) [{BonGCL}, software for the search for good
                 linear congruential generators]",
  number =       "DIUL-RT-8803",
  institution =  "Computer Science Department, Laval University",
  address =      "Ste-Foy, Qu{\'e}bec, Canada",
  year =         "1988",
  bibdate =      "Thu Feb 23 10:16:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{LEcuyer:1988:EPC,
  author =       "Pierre L'Ecuyer",
  title =        "Efficient and portable combined random number
                 generators",
  journal =      j-CACM,
  volume =       "31",
  number =       "6",
  pages =        "742--749, 774",
  month =        jun,
  year =         "1988",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/62959.62969",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "89d:65005",
  bibdate =      "Tue Dec 26 13:35:07 1995",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/62969.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Portability.",
}

@TechReport{LEcuyer:1988:GLC,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Blouin",
  title =        "Generalized Linear Congruential Generators",
  type =         "Report",
  number =       "DIUL-RT-8814",
  institution =  "Computer Science Department, Laval University",
  address =      "Ste-Foy, Qu{\'e}bec, Canada",
  year =         "1988",
  bibdate =      "Thu Feb 23 10:15:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Also presented at ORSA/TIMS St-Louis, 1987.",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:1988:LCG,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Blouin",
  title =        "Linear Congruential Generators of Order $ k > 1 $",
  crossref =     "Abrams:1988:WSC",
  pages =        "432--439",
  year =         "1988",
  bibdate =      "Thu Jan 05 14:11:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Levitan:1988:QSN,
  author =       "Yu. L. Levitan and N. I. Markovich and S. G. Rozin and
                 I. M. Sobol'",
  title =        "On quasirandom sequences for numerical computations",
  journal =      j-USSR-COMP-MATH-MATH-PHYS,
  volume =       "28",
  number =       "3",
  pages =        "88--92",
  month =        "????",
  year =         "1988",
  CODEN =        "CMMPA9",
  DOI =          "https://doi.org/10.1016/0041-5553(88)90181-4",
  ISSN =         "0041-5553, 0502-9902",
  ISSN-L =       "0041-5553",
  bibdate =      "Sun Feb 12 11:21:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0041555388901814",
  acknowledgement = ack-nhfb,
  fjournal =     "U.S.S.R. Computational Mathematics and Mathematical
                 Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00415553",
}

@Article{Luby:1988:HCP,
  author =       "Michael Luby and Charles Rackoff",
  title =        "How to construct pseudorandom permutations from
                 pseudorandom functions",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "373--386",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68P25 (65C10 68Q15 68Q25 94A60)",
  MRnumber =     "89i:68025",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Mactutus:1988:CSN,
  author =       "C. F. Mactutus and R. M. Booze",
  title =        "Computer Simulations in Neuroscience Pseudo-Random
                 Numbers",
  journal =      "Society for Neuroscience Abstracts",
  volume =       "14",
  number =       "2",
  pages =        "863--863",
  month =        "????",
  year =         "1988",
  ISSN =         "0190-5295",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  conference-name = "18TH ANNUAL MEETING OF THE SOCIETY FOR
                 NEUROSCIENCE, TORONTO, ONTARIO, CANADA, NOVEMBER 13-18,
                 1988. SOC NEUROSCI ABSTR.",
  fjournal =     "Society for Neuroscience Abstracts",
}

@TechReport{Matsumoto:1988:FPS,
  author =       "M. Matsumoto and Y. Kurita",
  title =        "The Fixed Point of an $m$-sequence and Local
                 Non-Randomness",
  type =         "Report",
  number =       "88-027",
  institution =  "Department of Information Science, University of
                 Tokyo",
  address =      "Tokyo, Japan",
  year =         "1988",
  bibdate =      "Thu Feb 23 10:18:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Minh:1988:GGV,
  author =       "Do Le Minh",
  title =        "Generating Gamma Variates",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "261--266",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/44128.214382",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65-04 (65U05)",
  MRnumber =     "1 062 477",
  bibdate =      "Sun Sep 04 22:30:10 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1988-14-3/p261-minh/",
  abstract =     "An algorithm to generate variates having a gamma
                 distribution with shape parameter greater than one is
                 presented in this paper. This algorithm is faster than
                 Schmeiser and Lal's G4PE, which is the fastest one
                 currently available, yet is equally simple and easy to
                 implement.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG",
  enum =         "7672",
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
  keywords =     "algorithms; theory",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
}

@Article{Monahan:1988:CAG,
  author =       "John F. Monahan",
  title =        "Corrigendum: ``{An} Algorithm for Generating Chi
                 Random Variables''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "111--111",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/42288.356228",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "111. 65C10",
  MRnumber =     "89d:65006, 88d:65013",
  bibdate =      "Fri Mar 28 10:45:16 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  note =         "See \cite{Monahan:1987:AGC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Niederreiter:1988:LDL,
  author =       "Harald Niederreiter",
  title =        "Low-discrepancy and low-dispersion sequences",
  journal =      j-J-NUMBER-THEORY,
  volume =       "30",
  number =       "1",
  pages =        "51--70",
  year =         "1988",
  CODEN =        "JNUTA9",
  DOI =          "https://doi.org/10.1016/0022-314X(88)90025-X",
  ISSN =         "0022-314X (print), 1096-1658 (electronic)",
  ISSN-L =       "0022-314X",
  MRclass =      "11K38 (11K36)",
  MRnumber =     "960233 (89k:11064)",
  MRreviewer =   "J. Patrick Lambert",
  bibdate =      "Thu Feb 23 10:28:05 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Number Theory",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0022314X",
}

@Article{Niederreiter:1988:RNC,
  author =       "Harald Niederreiter",
  title =        "Remarks on nonlinear congruential pseudorandom
                 numbers",
  journal =      j-METRIKA,
  volume =       "35",
  number =       "??",
  pages =        "321--328",
  month =        "????",
  year =         "1988",
  CODEN =        "MTRKA8",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Tue Dec 27 11:23:34 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika. International Journal for Theoretical and
                 Applied Statistics.",
  journal-URL =  "http://link.springer.com/journal/184",
}

@Article{Niederreiter:1988:SIN,
  author =       "Harald Niederreiter",
  title =        "Statistical independence of nonlinear congruential
                 pseudorandom numbers",
  journal =      j-MONAT-MATH,
  volume =       "106",
  number =       "2",
  pages =        "149--159",
  month =        jun,
  year =         "1988",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01298835",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Tue Dec 27 11:24:29 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/x6g636675406h964/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:1988:SNC,
  author =       "Harald Niederreiter",
  title =        "Some new cryptosystems based on feedback shift
                 register sequences",
  journal =      "Math. J. Okayama Univ.",
  volume =       "30",
  pages =        "121--149",
  year =         "1988",
  CODEN =        "MJOKAP",
  ISSN =         "0030-1566",
  MRclass =      "94A60 (11T71)",
  MRnumber =     "90a:94039",
  MRreviewer =   "Wende Chen",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Journal of Okayama University",
}

@Article{Niederreiter:1988:STD,
  author =       "Harald Niederreiter",
  title =        "The serial test for digital $k$-step pseudorandom
                 numbers",
  journal =      "Math. J. Okayama Univ.",
  volume =       "30",
  number =       "??",
  pages =        "93--119",
  month =        "????",
  year =         "1988",
  CODEN =        "MJOKAP",
  ISSN =         "0030-1566",
  MRclass =      "65C10 (Random number generation (numerical
                 analysis))",
  bibdate =      "Sun Feb 19 07:07:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0666.65003",
  acknowledgement = ack-nhfb,
  keywords =     "digital $k$-step pseudorandom numbers; discrepancy;
                 lower bound; serial test; statistical independence;
                 upper bounds",
}

@Book{Ore:1988:NTH,
  author =       "{\O}ystein {\O}re",
  title =        "Number theory and its history",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "x + 370",
  year =         "1988",
  ISBN =         "0-486-65620-9 (paperback)",
  ISBN-13 =      "978-0-486-65620-5 (paperback)",
  LCCN =         "QA241 .O7 1988",
  bibdate =      "Mon Jun 27 15:30:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Dover classics of science and mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0707/88000372-d.htm",
  acknowledgement = ack-nhfb,
  author-dates = "1899--1968",
  HDnumber =     "92",
  remark =       "Reprint, with supplement. Originally published: New
                 York: McGraw-Hill, 1948.",
  subject =      "number theory; mathematics; history",
}

@Article{Panton:1988:PPS,
  author =       "Don B. Panton",
  title =        "A {PASCAL} program for simulating stable random
                 variates",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "17",
  number =       "3",
  pages =        "837--842",
  year =         "1988",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610918808812698",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:29 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Article{Park:1988:RNG,
  author =       "Stephen K. Park and Keith W. Miller",
  title =        "Random Number Generators: Good Ones are Hard to Find",
  journal =      j-CACM,
  volume =       "31",
  number =       "10",
  pages =        "1192--1201",
  month =        oct,
  year =         "1988",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/63039.63042",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91h:65012",
  bibdate =      "Sat Apr 06 08:06:30 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1988.bib;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63042.html",
  abstract =     "The widespread adoption of an industry-standardized
                 random-number generator, in a form that is portable to
                 all systems, is still elusive. The rationale for a
                 minimal standard generator is offered, followed by a
                 demonstration of how to implement this minimal standard
                 in a high-level language on various systems, with
                 theoretical considerations and implementation details
                 to support the rationale; and lastly, selected examples
                 of unacceptable generators that have been published
                 since 1980 are considered. Sources for learning more
                 about random number generation are recommended.",
  acknowledgement = ack-nhfb,
  annote =       "Practical and theoretical issues are presented
                 concerning the design, implementation, and use of a
                 good, minimal standard random number generator that
                 will port to virtually all systems.",
  country =      "USA",
  descriptors =  "Random number; random number testing; Pseudo-random
                 generator",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; design; performance; standardization;
                 theory",
  references =   "47",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf D.2.0}:
                 Software, SOFTWARE ENGINEERING, General, Standards.
                 {\bf K.6.2}: Computing Milieux, MANAGEMENT OF COMPUTING
                 AND INFORMATION SYSTEMS, Installation Management.",
}

@Article{Percus:1988:LRC,
  author =       "Ora E. Percus and Jerome K. Percus",
  title =        "Long range correlations in linear congruential
                 generators",
  journal =      j-J-COMPUT-PHYS,
  volume =       "77",
  number =       "1",
  pages =        "267--269",
  year =         "1988",
  CODEN =        "JCTPAH",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  MRclass =      "65C10 (11Y99)",
  MRnumber =     "954311 (90c:65013)",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Petersen:1988:SVR,
  author =       "W. P. Petersen",
  title =        "Some vectorized random number generators for uniform,
                 normal, and {Poisson} distributions for {CRAY X-MP}",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "1",
  number =       "3",
  pages =        "327--335",
  month =        apr,
  year =         "1988",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/BF00154342",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Wed Jul 6 11:12:58 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=1&issue=3;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=1&issue=3&spage=327",
  acknowledgement = ack-nhfb,
  affiliation =  "Cary Res., Inc., Bellevue, WA, USA",
  classification = "C7310 (Mathematics)",
  corpsource =   "Cary Res., Inc., Bellevue, WA, USA",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  keywords =     "CRAY X-MP; GAUSSQ; IFISHQ; Monte Carlo simulations;
                 normal distribution; parallel algorithms; parallel
                 methods; Poisson distributions; random number
                 generation; RANQ; uniform distribution; vectorized
                 random number generators",
  treatment =    "P Practical",
}

@Article{Reif:1988:EPP,
  author =       "J. H. Reif and J. D. Tygar",
  title =        "Efficient Parallel Pseudorandom Number Generation",
  journal =      j-SIAM-J-COMPUT,
  volume =       "17",
  number =       "2",
  pages =        "404--411",
  month =        apr,
  year =         "1988",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q25 (65C10 68Q10)",
  MRnumber =     "89k:68072",
  bibdate =      "Mon Nov 29 11:01:02 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/2;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  note =         "Special issue on cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Ripley:1988:UAS,
  author =       "B. D. Ripley",
  title =        "Uses and abuses of statistical simulation",
  journal =      j-MATH-PROG,
  volume =       "42",
  number =       "??",
  pages =        "53--68",
  month =        "????",
  year =         "1988",
  CODEN =        "MHPGA4",
  ISSN =         "0025-5610",
  bibdate =      "Fri Jan 6 10:49:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Programming",
  journal-URL =  "http://link.springer.com/journal/10107",
}

@Article{Rockower:1988:IIR,
  author =       "Edward B. Rockower",
  title =        "Integral identities for random variables",
  journal =      j-AMER-STAT,
  volume =       "42",
  number =       "1",
  pages =        "68--72",
  month =        "????",
  year =         "1988",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "60E05 (60E10 62E15)",
  MRnumber =     "89a:60041",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@InProceedings{Sezgin:1988:MOP,
  author =       "Fatin Sezgin",
  title =        "A method of obtaining portable random number
                 generators",
  crossref =     "Edwards:1988:CPC",
  pages =        "41--42",
  year =         "1988",
  bibdate =      "Tue Jan 10 12:28:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shi:1988:SRP,
  author =       "Wen-Hong Shi and Jin-Guang Chen",
  title =        "Study on the recurrences of pseudorandom array",
  journal =      j-ELECT-LETTERS,
  volume =       "24",
  number =       "8",
  pages =        "499--500",
  day =          "14",
  month =        apr,
  year =         "1988",
  CODEN =        "ELLEAK",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8260",
  abstract =     "For some kinds of pseudorandom array, there exists a
                 pair of recurrences, and using the pair of recurrences
                 the entire array can be determined from a subarray of
                 smaller size. We propose a general method to deduce the
                 pair of recurrences.",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Tezuka:1988:OGP,
  author =       "Shu Tezuka",
  title =        "On Optimal {GFSR} Pseudorandom Number Generators",
  journal =      j-MATH-COMPUT,
  volume =       "50",
  number =       "182",
  pages =        "531--533",
  month =        apr,
  year =         "1988",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C05 (65C10)",
  MRnumber =     "89h:65015",
  MRreviewer =   "Istv{\'a}n D{\'e}ak",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008621.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "IBM Japan Ltd., Tokyo, Japan",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "generalised feedback shift register pseudorandom
                 numbers; number theory; optimal GFSR pseudorandom
                 number generators; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Young:1988:RUM,
  author =       "Dean M. Young and Danny W. Turner and John W. {Seaman,
                 Jr.}",
  title =        "A Ratio-of-Uniforms Method for Generating Exponential
                 Power Variates",
  crossref =     "Wegman:1988:CSS",
  pages =        "627--629",
  year =         "1988",
  bibdate =      "Wed Nov 12 16:52:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Afflerbach:1989:CAR,
  author =       "L. Afflerbach",
  title =        "Criteria for the Assessment of Random Number
                 Generators",
  type =         "Technical Report",
  number =       "1205",
  institution =  "Fachbereich Mathematik, Technische Hochschule
                 Darmstadt",
  address =      "Darmstadt, Germany",
  year =         "1989",
  bibdate =      "Thu Feb 23 10:29:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Afflerbach:1989:EDR,
  author =       "Lothar Afflerbach and Rainer Weilb{\"a}cher",
  title =        "The exact determination of rectangle discrepancy for
                 linear congruential pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "53",
  number =       "187",
  pages =        "343--354",
  month =        jul,
  year =         "1989",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "90h:65009",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008367.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods); C6130 (Data handling
                 techniques)",
  corpsource =   "Tech. Hochschule Darmstadt, West Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "computation time; generators; linear congruential;
                 number generators; pseudorandom; random number
                 generation; rectangle discrepancy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ahrens:1989:AMS,
  author =       "J. H. Ahrens and U. Dieter",
  title =        "An alias method for sampling from the normal
                 distribution",
  journal =      j-COMPUTING,
  volume =       "42",
  number =       "2--3",
  pages =        "159--170",
  month =        jun,
  year =         "1989",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C05 (65U05)",
  MRnumber =     "90k:65015",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Ahrens:1989:HAL,
  author =       "J. H. Ahrens",
  title =        "How to avoid logarithms in comparisons with uniform
                 random variables",
  journal =      j-COMPUTING,
  volume =       "41",
  number =       "1--2",
  pages =        "163--166",
  month =        mar,
  year =         "1989",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "89k:65006",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@InProceedings{Ahrens:1989:NUR,
  author =       "J. H. Ahrens and E. Stadlober",
  title =        "Non-Uniform Random Number Generation: a Survey and
                 Tutorial",
  crossref =     "MacNair:1989:WSC",
  pages =        "50--50",
  year =         "1989",
  bibdate =      "Thu Feb 23 10:31:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/iel4/5823/15520/00718661.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Aiello:1989:HIG,
  author =       "G. R. Aiello and M. Budinich and E. Milotti",
  title =        "Hardware implementation of a {GFSR} pseudo-random
                 number generator",
  journal =      j-COMP-PHYS-COMM,
  volume =       "56",
  number =       "2",
  pages =        "135--139",
  day =          "1",
  month =        dec,
  year =         "1989",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(89)90014-3",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:41 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465589900143",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Allender:1989:SCE,
  author =       "Eric W. Allender",
  title =        "Some consequences of the existence of pseudorandom
                 generators",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "39",
  number =       "1",
  pages =        "101--124",
  month =        aug,
  year =         "1989",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(89)90021-4",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Sat Mar 17 07:31:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000089900214",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@InProceedings{Babai:1989:MPL,
  author =       "L. Babai and N. Nisan",
  title =        "Multiparty protocols and logspace-hard pseudorandom
                 sequences",
  crossref =     "ACM:1989:PTF",
  pages =        "1--11",
  year =         "1989",
  bibdate =      "Wed Feb 20 18:33:47 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p1-babai/p1-babai.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/73007/p1-babai/",
  acknowledgement = ack-nhfb,
}

@Article{Baccelli:1989:AFJ,
  author =       "Fran{\c{c}}ois Baccelli and William A. Massey and Don
                 Towsley",
  title =        "Acyclic Fork-Join Queueing Networks",
  journal =      j-J-ACM,
  volume =       "36",
  number =       "3",
  pages =        "615--642",
  month =        jul,
  year =         "1989",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/65950.65957",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65957.html",
  abstract =     "The class of acyclic fork-join queuing networks that
                 arise in various applications, including parallel
                 processing and flexible manufacturing are studied. In
                 such queuing networks, a fork describes the
                 simultaneous creation of several new customers, which
                 are sent to different queues. The corresponding join
                 occurs when the services of all these new customers are
                 completed. The evolution equations that govern the
                 behavior of such networks are derived. From this, the
                 stability conditions are obtained and upper and lower
                 bounds on the network response times are developed.
                 These bounds are based on various stochastic ordering
                 principles and on the notion of association of random
                 variables.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Valbonne, Fr",
  classification = "723; 922",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Associated Random Variables; associated random
                 variables; Computer Systems, Digital --- Performance;
                 design; ergodic theory; Industrial Plants --- Flexible
                 Manufacturing Systems; Lower Bounds; multiprogramming
                 and multitasking; Network Response Times; Parallelism;
                 performance; performance evaluation; precedence graph;
                 Probability; Queueing Theory; stability condition;
                 Stochastic Ordering; stochastic ordering; System
                 Modeling and Analysis; theory; Upper Bounds;
                 verification",
  subject =      "{\bf C.4}: Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS. {\bf C.1.2}: Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, Multiple Data Stream
                 Architectures (Multiprocessors), Parallel processors.
                 {\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems. {\bf
                 D.4.8}: Software, OPERATING SYSTEMS, Performance,
                 Queueing theory.",
}

@Article{Bardin:1989:IUI,
  author =       "B. Bardin and C. Colket and D. Smith",
  title =        "Implementation of unsigned integers in {Ada}",
  journal =      j-ADA-LETT,
  volume =       "9",
  number =       "1",
  pages =        "47--70",
  month =        jan # "--" # feb,
  year =         "1989",
  CODEN =        "AALEE5",
  ISSN =         "1094-3641 (print), 1557-9476 (electronic)",
  ISSN-L =       "1094-3641",
  bibdate =      "Thu Dec 14 17:19:19 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "It is suggested that the minimal goals for unsigned
                 integers should include at least: providing an extended
                 maximum non-negative integer range which fully exploits
                 the available hardware (and which allows full range
                 address arithmetic when appropriate); providing
                 straightforward and efficiently-implementable logical
                 operations (including shifts, rotates, and masks) on
                 all bits of unsigned types; providing numeric literals
                 in arbitrary bases (so that representations appropriate
                 to a given architecture may be chosen for bit-level
                 operations); and providing efficient support for
                 modular arithmetic of arbitrary range (which allows
                 checksums, hash functions, and pseudo-random number
                 generators which generate all possible bit patterns in
                 closed cycles to be cleanly written in Ada). The
                 authors present a strawman proposal (draft of a draft)
                 to meet the goals stated above.",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  keywords =     "Ada; Full range address arithmetic; Logical
                 operations; Modular arithmetic; Numeric literals;
                 Symbol manipulation; Unsigned integers",
  pubcountry =   "USA",
  thesaurus =    "Ada; Digital arithmetic; Symbol manipulation",
}

@Article{Benichou:1989:DMI,
  author =       "Jacques Benichou and Mitchell H. Gail",
  title =        "A delta method for implicitly defined random
                 variables",
  journal =      j-AMER-STAT,
  volume =       "43",
  number =       "1",
  pages =        "41--44",
  month =        "????",
  year =         "1989",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "62E20 (62H10 62H17)",
  MRnumber =     "90j:62022",
  MRreviewer =   "Nariaki Sugiura",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Bethmann:1989:LFT,
  author =       "J. Bethmann",
  title =        "The {Lindberg--Feller} Theorem for Sums of a Random
                 Number of Independent Random Variables in a Triangular
                 Array",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "33",
  number =       "2",
  pages =        "334--339",
  month =        "????",
  year =         "1989",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1133049",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60F05",
  MRnumber =     "89j:60034",
  MRreviewer =   "Dominik Szynal",
  bibdate =      "Tue Apr 1 10:40:08 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/33/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 33}(2), (1988), pp. 354--359.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1989",
  xxtitle =      "The {Lindeberg-Feller} theorem for sums of a random
                 number of independent random variables in a triangular
                 array",
}

@Article{Black:1989:GRN,
  author =       "S. C. Black and A. D. Kennedy",
  title =        "{Gaussian} random number generators on a {CYBER-205}",
  journal =      j-COMPUT-PHYS,
  volume =       "3",
  number =       "3",
  pages =        "59--??",
  month =        may,
  year =         "1989",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168326",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Wed Apr 10 08:45:18 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://aip.scitation.org/doi/10.1063/1.168326",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Phys",
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
}

@Article{Booth:1989:ZVS,
  author =       "Thomas E. Booth",
  title =        "Zero-Variance Solutions for Linear {Monte Carlo}",
  journal =      j-NUCL-SCI-ENG,
  volume =       "102",
  number =       "4",
  pages =        "332--340",
  month =        aug,
  year =         "1989",
  CODEN =        "NSENAO",
  ISSN =         "0029-5639 (print), 1943-748X (electronic)",
  ISSN-L =       "0029-5639",
  bibdate =      "Thu Apr 03 07:20:24 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ans.org/pubs/journals/nse/a_23646",
  acknowledgement = ack-nhfb,
  ajournal =     "Nucl. Sci. Eng. (La Grange Park, IL, USA)",
  fjournal =     "Nuclear Science and Engineering",
  journal-URL =  "http://www.ans.org/pubs/journals/nse/",
  keywords =     "quasi-Monte Carlo integration",
}

@Article{Boyar:1989:ISPa,
  author =       "Joan Boyar",
  title =        "Inferring Sequences Produced by Pseudo-Random Number
                 Generators",
  journal =      j-J-ACM,
  volume =       "36",
  number =       "1",
  pages =        "129--141",
  month =        jan,
  year =         "1989",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/58562.59305",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59305.html;
                 http://www.imada.sdu.dk/~joan/",
  abstract =     "In this paper, efficient algorithms are given for
                 inferring sequences produced by pseudo-random number
                 generators of a certain form. Using this general
                 method, specific examples of generators having this
                 form, the linear congruential method, linear
                 congruences with $n$ terms in the recurrence, and
                 quadratic congruences are shown to be cryptographically
                 insecure.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Chicago, IL, USA",
  classification = "723; 922",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "algorithms; Computer Programming --- Algorithms;
                 Cryptography; cryptography; inductive inference; linear
                 congruential method; Mathematical Statistics;
                 Pseudorandom Number Generators; Random Number
                 Generation; security; Sequence Inferring Algorithms;
                 Theory of Computation",
  remark =       "Early publications, including 1983 Berkeley Ph.D.
                 dissertation, as Joan B. Plumstead.",
  subject =      "{\bf E.3}: Data, DATA ENCRYPTION. {\bf F.2.1}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems. {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@Article{Boyar:1989:ISPb,
  author =       "Joan Boyar",
  title =        "Inferring sequences produced by a linear congruential
                 generator missing low-order bits",
  journal =      j-J-CRYPTOLOGY,
  volume =       "1",
  number =       "3",
  pages =        "177--184",
  month =        "????",
  year =         "1989",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/BF02252875",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60 (11B50 11T71 11Y16 65C10)",
  MRnumber =     "1007218 (90g:94012)",
  MRreviewer =   "Min Qiang Huang",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Chicago",
  affiliationaddress = "Chicago, IL, USA",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Computer Programming--Algorithms; Cryptography; Linear
                 Congruential Method; Mathematical Statistics--Random
                 Number Generation; Pseudorandom Number Generators",
}

@Article{Brody:1989:RNG,
  author =       "T. A. Brody",
  title =        "Random-number generation for parallel processors",
  journal =      j-COMP-PHYS-COMM,
  volume =       "56",
  number =       "2",
  pages =        "147--153",
  day =          "1",
  month =        dec,
  year =         "1989",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(89)90016-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 10:28:29 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465589900167",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Butler:1989:RBG,
  author =       "David A. Butler",
  title =        "A Random-Bit Generator for use in Simulating the
                 Reliability of a Coherent System",
  journal =      j-PROBAB-ENGRG-INFORM-SCI,
  volume =       "3",
  number =       "1",
  pages =        "141--147",
  month =        jan,
  year =         "1989",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1017/S0269964800001029",
  ISSN =         "0269-9648 (print), 1469-8951 (electronic)",
  ISSN-L =       "0269-9648",
  bibdate =      "Thu Aug 24 08:18:07 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib",
  URL =          "https://www.cambridge.org/core/product/2C2964E730008624C67C1262123E0D36",
  acknowledgement = ack-nhfb,
  ajournal =     "Probab. Engrg. Inform. Sci.",
  fjournal =     "Probability in the Engineering and Informational
                 Sciences",
  journal-URL =  "http://www.journals.cambridge.org/jid_PES",
  onlinedate =   "01 July 2009",
}

@Article{Chassaing:1989:ORN,
  author =       "Philippe Chassaing",
  title =        "An optimal random number generator on {$ Z_p $}",
  journal =      j-STAT-PROB-LETT,
  volume =       "7",
  number =       "4",
  pages =        "307--309",
  month =        feb,
  year =         "1989",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(89)90112-0",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  bibdate =      "Wed Jan 18 22:19:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
}

@Article{Dagpunar:1989:CPP,
  author =       "J. S. Dagpunar",
  title =        "A compact and portable {Poisson} random variate
                 generator",
  journal =      j-J-APPL-STAT,
  volume =       "16",
  number =       "3",
  pages =        "391--393",
  year =         "1989",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/02664768900000048",
  ISSN =         "0266-4763 (print), 1360-0532 (electronic)",
  ISSN-L =       "0266-4763",
  bibdate =      "Tue Sep 6 11:16:14 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/routledge/02664763.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/cjas20",
  onlinedate =   "28 Jul 2006",
}

@Article{Danilowicz:1989:DDP,
  author =       "Ronald L. Danilowicz",
  title =        "Demonstrating the dangers of pseudo-random numbers",
  journal =      j-SIGCSE,
  volume =       "21",
  number =       "2",
  pages =        "46--48",
  month =        jun,
  year =         "1989",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/65738.65746",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:10 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib",
  abstract =     "Computer simulations are everywhere, from the
                 corporate office to the local video game parlor. With
                 the increased role being played by these simulations,
                 it is important for students to be completely aware of
                 the limitations of pseudorandom number generators. The
                 fact that random number generators in use today are not
                 truly random is no secret (The New York Times, C1-C8).
                 Since most simulations produce reasonable results it
                 might be difficult to convince students that there are
                 any problems involved in trusting these random number
                 generators. A simple simulation which can be used as a
                 programming exercise in any language can dramatically
                 reveal these dangers. The exercise used requires a
                 statistical evaluation of $ \pi $ which yields horrible
                 results. The results are not difficult to explain and
                 the exercise can be extended by allowing students to
                 experiment with modifications to the pseudo-random
                 number generator used in attempts to ``fix'' the
                 problem. This can be useful, as the attempts to fix the
                 pseudorandom number generator usually aggravate rather
                 than alleviate the problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

@TechReport{Deak:1989:URN,
  author =       "I. Deak",
  title =        "Uniform random number generators for parallel
                 computers",
  type =         "Report",
  number =       "89-1",
  institution =  "Department of Industrial Engineering, University of
                 Wisconsin-Madison",
  address =      "Madison, WI, USA",
  year =         "1989",
  bibdate =      "Wed Feb 08 18:59:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Devroye:1989:RVG,
  author =       "Luc Devroye",
  title =        "Random variate generators for the {Poisson--Poisson}
                 and related distributions",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "8",
  number =       "3",
  pages =        "247--278",
  month =        nov,
  year =         "1989",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(89)90044-3",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:14:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167947389900443",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@InProceedings{Durst:1989:ULC,
  author =       "M. J. Durst",
  title =        "Using linear congruential generators for parallel
                 random number generation",
  crossref =     "MacNair:1989:WSC",
  pages =        "462--466",
  year =         "1989",
  bibdate =      "Fri Jan 06 16:13:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Edgeman:1989:RNG,
  author =       "Rick L. Edgeman and Paul W. Abrahams and Francis M.
                 Sand and James {Crawford, Jr.}",
  title =        "Random Number Generators and the Minimal Standard",
  journal =      j-CACM,
  volume =       "32",
  number =       "8",
  pages =        "1020--1024",
  month =        aug,
  year =         "1989",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91h:65013",
  bibdate =      "Tue Dec 26 13:35:07 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1989.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Eichenauer-Herrmann:1989:PLP,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Holger Grothe and
                 J{\"u}rgen Lehn",
  title =        "On the period length of pseudorandom vector sequences
                 generated by matrix generators",
  journal =      j-MATH-COMPUT,
  volume =       "52",
  number =       "185",
  pages =        "145--148",
  month =        jan,
  year =         "1989",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "89g:65010",
  MRreviewer =   "H. J. Godwin",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008659.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C1160 (Combinatorial
                 mathematics); C1110 (Algebra)",
  corpsource =   "Tech. Hochschule Darmstadt, West Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "generators; matrix; matrix algebra; number theory;
                 period length; prime; pseudorandom vector sequences;
                 random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eichenauer-Herrmann:1989:RLR,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Holger Grothe",
  title =        "A remark on long-range correlations in multiplicative
                 congruential pseudo random number generators",
  journal =      j-NUM-MATH,
  volume =       "56",
  number =       "6",
  pages =        "609--611",
  month =        dec,
  year =         "1989",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "90m:65017",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)",
  corpsource =   "Fachbereich Math., Tech. Hochschule, Darmstadt, West
                 Germany",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "composite moduli; long-range correlations;
                 multiplicative congruential pseudo random number
                 generators; number theory; prime moduli; random number
                 generation",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Evans:1989:PRN,
  author =       "W. Evans and B. Sulga",
  title =        "Parallel random number generation",
  crossref =     "Anonymous:1989:PFC",
  pages =        "415--420",
  year =         "1989",
  bibdate =      "Fri Jan 06 10:51:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Flajolet:1989:RMS,
  author =       "Philippe Flajolet and Andrew M. Odlyzko",
  editor =       "Jean-Jacques Quisquater and Joos Vandewalle",
  booktitle =    "{EUROCRYPT 1989: Advances in Cryptology --- EUROCRYPT
                 '89: Proceedings of the Workshop on the Theory and
                 Application of Cryptographic Techniques}",
  title =        "Random mapping statistics",
  volume =       "434",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "329--354",
  year =         "1989",
  DOI =          "https://doi.org/10.1007/3-540-46885-4_34",
  bibdate =      "Fri Jul 29 07:49:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  abstract =     "Random mappings from a finite set into itself are
                 either a heuristic or an exact model for a variety of
                 applications in random number generation, computational
                 number theory, cryptography, and the analysis of
                 algorithms at large. This paper introduces a general
                 framework in which the analysis of about twenty
                 characteristic parameters of random mappings is carried
                 out: These parameters are studied systematically
                 through the use of generating functions and singularity
                 analysis. In particular, an open problem of Knuth is
                 solved, namely that of finding the expected diameter of
                 a random mapping. The same approach is applicable to a
                 larger class of discrete combinatorial models and
                 possibilities of automated analysis using symbolic
                 manipulation systems (``computer algebra'') are also
                 briefly discussed.",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/3-540-46885-4",
  xxDOI =        "https://doi.org/10.5555/111563.111596",
}

@Article{Fushimi:1989:ERB,
  author =       "M. Fushimi",
  title =        "An equivalence relation between {Tausworthe} and
                 {GFSR} sequences and applications",
  journal =      j-APPL-MATH-LETT,
  volume =       "2",
  number =       "2",
  pages =        "135--137",
  month =        "????",
  year =         "1989",
  CODEN =        "AMLEEL",
  ISSN =         "0893-9659 (print), 1873-5452 (electronic)",
  ISSN-L =       "0893-9659",
  bibdate =      "Fri Jan 6 10:52:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08939659",
}

@InProceedings{Fushimi:1989:RNG,
  author =       "M. Fushimi",
  title =        "Random number generation on parallel processors",
  crossref =     "MacNair:1989:WSC",
  pages =        "459--461",
  year =         "1989",
  DOI =          "https://doi.org/10.1109/WSC.1989.718714",
  bibdate =      "Thu Feb 23 10:36:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Gilmore:1989:RSP,
  author =       "J. Barnard Gilmore",
  title =        "Randomness and the Search for {PSI}",
  journal =      j-J-PARAPSYCHOL,
  volume =       "53",
  number =       "4",
  pages =        "309--340",
  month =        dec,
  year =         "1989",
  CODEN =        "JPRPAU",
  ISSN =         "0022-3387",
  ISSN-L =       "0022-3387",
  bibdate =      "Thu Feb 23 10:37:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.rhine.org/journalarchive.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parapsychology",
  remark =       "As of 23 February 2012, publisher has back issues only
                 to volume 68, number 2 (Fall 2004).",
  xxpages =      "309--341",
}

@Article{Gleason:1989:STI,
  author =       "John M. Gleason",
  title =        "Statistical Tests of the {IBM PC} Pseudorandom Number
                 Generator",
  journal =      j-COMPUT-METH-PROG-BIOMED,
  volume =       "30",
  number =       "1",
  pages =        "43--46",
  month =        oct,
  year =         "1989",
  CODEN =        "CMPBEK",
  DOI =          "https://doi.org/10.1016/0169-2607(89)90121-1",
  ISSN =         "0169-2607 (print), 1872-7565 (electronic)",
  ISSN-L =       "0169-2607",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Methods and Programs in Biomedicine",
}

@InProceedings{Gordon:1989:FMI,
  author =       "J. Gordon",
  title =        "Fast multiplicative inverse in modular arithmetic",
  crossref =     "Beker:1989:CC",
  pages =        "269--279",
  year =         "1989",
  bibdate =      "Tue Dec 27 09:40:37 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Grzesik:1989:NRT,
  author =       "J. A. Grzesik",
  title =        "{Von Neumann}'s Rejection Technique Reexamined",
  journal =      j-SIAM-REVIEW,
  volume =       "31",
  number =       "3",
  pages =        "486--489",
  month =        sep,
  year =         "1989",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1031094",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "91b:65006",
  MRreviewer =   "Stefan C. V. Stef{\'a}nescu",
  bibdate =      "Sat Mar 29 09:54:36 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/31/3;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  abstract =     "Von Neumann's rejection technique for random number
                 sampling is restated as a renewal process governed by a
                 geometric distribution with regard to success
                 attainment. The pedagogical advantage of a derivation
                 that is more transparent than the one commonly
                 available is obtained. Another benefit is a
                 straightforward computation of the dispersion in trial
                 number around its mean.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Redondo Beach, CA, USA",
  classification = "922",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Geometric Probability Distribution; Mathematical
                 Statistics; Probability--Random Processes; Random
                 Number Generation; Rejection Sampling; Renewal Process;
                 Statistical Methods",
  onlinedate =   "September 1989",
  xxtitle =      "Vonneumann Rejection Technique Reexamined",
}

@Article{Guinier:1989:FUA,
  author =       "Daniel Guinier",
  title =        "A Fast Uniform `Astronomical' Random Number
                 Generator",
  journal =      j-SIGSAC-REVIEW,
  volume =       "7",
  number =       "1",
  pages =        "1--13",
  month =        "Spring",
  year =         "1989",
  CODEN =        "SSARE7",
  DOI =          "https://doi.org/10.1145/70951.70952",
  ISSN =         "0277-920X (print), 1558-0261 (electronic)",
  ISSN-L =       "0277-920X",
  bibdate =      "Thu Feb 23 10:39:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The present method generates machine-independent
                 uniform random sequences of real numbers in the
                 interval (0.,1.) excluding 1. It uses a set of up to
                 1024 independent multiplicative congruential generators
                 working with:\par

                 * modulii which are chosen prime numbers whose values
                 have been fixed according to the positive 31-bit
                 positive integer arithmetic available and in the form
                 of $ 2^P' + 1 $, where $P$'s are also primes.\par

                 * multipliers which are selected from one of their
                 corresponding primitive elements as multipliers to
                 achieve each full cycle independently.\par

                 The `astronomical' maximum periodicity can be
                 considered as infinite: $ O^(10^{6021}) $; it can be
                 adjusted if required by the user in the sequential
                 version RAN01 or statistically reaching the maximum in
                 the improved `stagger' version DAN01.\par

                 An `acceptable' composite period is estimated to be $
                 O(10^{189}) $ for a set of only 32 of such independent
                 generators: this fact could find a nice application in
                 the realization of efficient hash-functions in smart
                 cards.\par

                 An implementation in structured FORTRAN 77 shows very
                 good results in terms of statistical properties,
                 velocity and periodicity.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIG security, audit \& control review",
}

@Article{Halton:1989:PRT,
  author =       "John H. Halton",
  title =        "Pseudo-random trees: Multiple independent sequence
                 generators for parallel and branching computations",
  journal =      j-J-COMPUT-PHYS,
  volume =       "84",
  number =       "1",
  pages =        "1--56",
  month =        sep,
  year =         "1989",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(89)90180-0",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sun Jan 1 15:59:47 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999189901800",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Herring:1989:RNG,
  author =       "C. Herring and J. I. Palmore",
  title =        "Random number generators are chaotic",
  journal =      j-SIGPLAN,
  volume =       "24",
  number =       "11",
  pages =        "76--79",
  month =        nov,
  year =         "1989",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:15:47 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "algorithms; theory",
  subject =      "G.3 Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation",
}

@Article{Hortensius:1989:CAB,
  author =       "P. D. Hortensius and R. D. McLeod and W. Pries and D.
                 M. Miller and H. C. Card",
  title =        "Cellular automata-based pseudorandom number generators
                 for built-in self-test",
  journal =      j-IEEE-TRANS-CAD-ICS,
  volume =       "8",
  number =       "8",
  pages =        "842--859",
  month =        "????",
  year =         "1989",
  CODEN =        "ITCSDI",
  DOI =          "https://doi.org/10.1109/43.31545",
  ISSN =         "0278-0070 (print), 1937-4151 (electronic)",
  ISSN-L =       "0278-0070",
  bibdate =      "Thu Jan 19 17:45:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computer-Aided Design of
                 Integrated Circuits and Systems",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=43",
}

@Article{Hortensius:1989:PRN,
  author =       "P. D. Hortensius and R. D. McLeod and H. C. Card",
  title =        "Parallel random number generation for {VLSI} systems
                 using cellular automata",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "38",
  number =       "10",
  pages =        "1466--1473",
  month =        oct,
  year =         "1989",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.35843",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Fri Jul 8 19:00:42 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=35843",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InProceedings{Impagliazzo:1989:ECS,
  author =       "Russell Impagliazzo and Moni Naor",
  title =        "Efficient cryptographic schemes provably as secure as
                 subset sum",
  crossref =     "IEEE:1989:ASF",
  journal =      "Annual Symposium on Foundations of Computer Science
                 (Proceedings)",
  pages =        "236--241",
  month =        nov,
  year =         "1989",
  CODEN =        "ASFPDV",
  DOI =          "https://doi.org/10.1109/SFCS.1989.63484",
  ISBN =         "0-8186-1982-1",
  ISBN-13 =      "978-0-8186-1982-3",
  ISSN =         "0272-5428",
  LCCN =         "QA 76 S979 1989",
  bibdate =      "Tue May 12 09:49:52 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 89CH2808-4.",
  abstract =     "Very efficient constructions, based on the
                 intractability of the subset sum problem for certain
                 dimensions, are shown for a pseudorandom generator and
                 for a universal one-way hash function. (Pseudorandom
                 generators can be used for private key encryption, and
                 universal one-way hash functions for signature
                 schemes). The increase in efficiency in the
                 construction is due to the fact that many bits can be
                 generated\slash hashed with one application of the
                 assumed one-way function. All the constructions can be
                 implemented in NC using an optimal number of
                 processors.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Berkeley, CA, USA",
  classification = "723",
  conference =   "30th Annual Symposium on Foundations of Computer
                 Science",
  conferenceyear = "1989",
  journalabr =   "Annu Symp Found Comput Sci Proc",
  keywords =     "Cryptography; Hash Functions; Private Key Encryption;
                 Pseudorandom Generators; Signature Schemes; Subset Sum
                 Security; Universal One Way Rash Functions",
  meetingaddress = "Research Triangle Park, NC, USA",
  meetingdate =  "Oct 30--Nov 1 1989",
  meetingdate2 = "10/30--11/01/89",
  publisherinfo = "Computer Society",
  sponsor =      "IEEE Technical Committee on Mathematical Foundations
                 of Computing; Academic Press Inc.; Addison-Wesley
                 Publishing Co; AT\&T Bell Lab; Bell Communications
                 Research; et al",
}

@InProceedings{Impagliazzo:1989:HRR,
  author =       "R. Impagliazzo and D. Zuckerman",
  title =        "How to recycle random bits",
  crossref =     "IEEE:1989:ASF",
  pages =        "248--253",
  year =         "1989",
  DOI =          "https://doi.org/10.1109/SFCS.1989.63486",
  bibdate =      "Thu Apr 5 06:13:40 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "This paper proves that two very simple pseudo-random
                 number generators, which are minor modifications of
                 linear congruential generator and the simple shift
                 register generator, are good for amplifying the
                 correctness of probabilistic algorithms.",
}

@InProceedings{Impagliazzo:1989:PRG,
  author =       "R. Impagliazzo and L. A. Levin and M. Luby",
  title =        "Pseudo-random generation from one-way functions
                 (extended abstract)",
  crossref =     "ACM:1989:PTF",
  pages =        "12--24",
  year =         "1989",
  bibdate =      "Wed Feb 20 18:33:47 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p12-impagliazzo/p12-impagliazzo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/73007/p12-impagliazzo/",
  acknowledgement = ack-nhfb,
}

@Article{Kachitvichyanukul:1989:ABS,
  author =       "Voratas Kachitvichyanukul and Bruce W. Schmeiser",
  title =        "{Algorithm 678}: {BTPEC}: Sampling from the Binomial
                 Distribution",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "394--397",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/76909.76916;
                 http://www.acm.org/pubs/citations/journals/toms/1989-15-4/p394-kachitvichyanukul/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@Book{Kahaner:1989:NMS,
  author =       "David Kahaner and Cleve Moler and Stephen Nash",
  title =        "Numerical Methods and Software",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 495",
  year =         "1989",
  ISBN =         "0-13-627258-4",
  ISBN-13 =      "978-0-13-627258-8",
  LCCN =         "TA345 .K341 1989",
  bibdate =      "Fri Mar 21 15:55:27 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$50",
  series =       "Prentice-Hall series in computational mathematics",
  abstract =     "The following topics were dealt with: computer
                 arithmetic and computational errors; linear systems of
                 equations; interpolation; numerical quadrature; linear
                 least-squares data fitting; solution of nonlinear
                 equations; ordinary differential equations;
                 optimization and nonlinear least squares; simulation
                 and random numbers; and trigonometric approximation and
                 the fast Fourier transform. A significant part of the
                 book is a set of Fortran subroutines, these are
                 provided on a floppy disk for use on IBM PC compatibles
                 under MS DOS. They have been gathered from collections
                 such as Linpack, Quadpack, Minpack, SLATEC and others.
                 They represent the state of the art in mathematical
                 software and a significant part of each chapter acts as
                 a user guide to them and contains listings of the
                 routines.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0120 (Education and training); B0290 (Numerical
                 analysis); C7310 (Mathematics); C4100 (Numerical
                 analysis)",
  classification = "B0120 (Education and training); B0290 (Numerical
                 analysis); C4100 (Numerical analysis); C7310
                 (Mathematics)",
  keywords =     "algorithms; approximation; computational errors;
                 Computational errors; Computer arithmetic; computer
                 arithmetic; differential equations; equations; fast
                 Fourier transform; Fast Fourier transform; floppy disk;
                 Floppy disk; FORTRAN listings; Fortran subroutines; IBM
                 PC compatibles; interpolation; Interpolation; linear
                 least-; Linear least-squares data fitting; linear
                 systems of; Linear systems of equations; Linpack;
                 mathematical software; Mathematical software;
                 mathematics computing; Minpack; Nonlinear equations;
                 nonlinear equations; nonlinear least; Nonlinear least
                 squares; numerical methods; numerical quadrature;
                 Numerical quadrature; optimization; Optimization;
                 ordinary; Ordinary differential equations; Quadpack;
                 random numbers; Random numbers; Simulation; simulation;
                 SLATEC; squares; squares data fitting; theory;
                 trigonometric; Trigonometric approximation; user guide;
                 User guide",
  remark =       "Chapter 10, Simulation and Random Numbers, describes
                 the problems with linear congruential generators, and
                 generators from physical devices. It then introduces
                 the function {\tt uni()}, which uses a combination of a
                 linear congruential generator and a lagged Fibonacci
                 generator, $ x_{k + 1} = x_{k - 17} - x_{k - 5} $,
                 where the $ x_k $ are floating-point, rather than
                 integer, values. If the subtraction produces a negative
                 value, that value is incremented by 1.0. The Fibonacci
                 generator period is $ (2^{17} - 1) 2^n $, where $n$ is
                 the number of significand bits: about $ 2^{41} \approx
                 10^{12} $ for the 32-bit IEEE 754 format, and $ 2^{70}
                 \approx 10^{24} $ for the 64-bit format. The 17-element
                 state is set from a single seed that is used to
                 initialize a small integer-modular-arithmetic
                 bit-at-a-time generator that fills the state with
                 random bits. The precision defaults to 24 for
                 portability, but can be changed at run time. With the
                 LCG, the period is extended to about $ (2^{17} - 1)
                 2^48 \approx 10^{19} $ for a default 24-bit
                 significand. There is brief discussion of nonuniform
                 distributions, notably the exponential and normal ones.
                 Only the latter is implemented, as function {\tt
                 rnor()}. It uses the Marsaglia--Tsang ziggurat method
                 \cite{Marsaglia:1984:FEI}, with an embedded lagged
                 Fibonacci generator ({\tt uni()} is not called).",
  review =       "ACM CR 8911-0779",
  subject =      "G.1 Mathematics of Computing, NUMERICAL ANALYSIS \\
                 F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
                 Computation of transforms",
  thesaurus =    "FORTRAN listings; Mathematics computing; Numerical
                 methods",
  treatment =    "G General Review; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Kamps:1989:CPL,
  author =       "U. Kamps",
  title =        "{Chebyshev} polynomials and least squares estimation
                 based on one-dependent random variables",
  journal =      j-LINEAR-ALGEBRA-APPL,
  volume =       "112",
  number =       "??",
  pages =        "217--230",
  month =        jan,
  year =         "1989",
  CODEN =        "LAAPAW",
  DOI =          "https://doi.org/10.1016/0024-3795(89)90597-1",
  ISSN =         "0024-3795 (print), 1873-1856 (electronic)",
  ISSN-L =       "0024-3795",
  MRclass =      "62F10 (62M10)",
  MRnumber =     "90a:62081",
  bibdate =      "Wed Nov 30 13:51:07 MST 2011",
  bibsource =    "http://www.sciencedirect.com/science/journal/00243795;
                 https://www.math.utah.edu/pub/tex/bib/linala1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0024379589905971",
  acknowledgement = ack-nhfb,
  fjournal =     "Linear Algebra and its Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00243795",
}

@Article{Kao:1989:RNG,
  author =       "Chiang Kao",
  title =        "A random number generator for microcomputers",
  journal =      j-J-OPER-RES-SOC,
  volume =       "40",
  number =       "7",
  pages =        "687--691",
  month =        jul,
  year =         "1989",
  CODEN =        "OPRQAK",
  ISSN =         "0160-5682 (print), 1476-9360 (electronic)",
  ISSN-L =       "0160-5682",
  bibdate =      "Wed Feb 29 22:13:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments
                 \cite{Kao:1990:RNG,Sezgin:1990:RNG,Clementson:1991:CRN,Kao:1991:CRN}.",
  URL =          "http://www.jstor.org/stable/2582978",
  acknowledgement = ack-nhfb,
  fjournal =     "OR: the journal of the Operational Research Society",
}

@Article{Kelton:1989:RIM,
  author =       "W. D. Kelton",
  title =        "Random Initialization Methods in Simulation",
  journal =      j-IIE-TRANS,
  volume =       "21",
  number =       "4",
  pages =        "355--367",
  month =        "????",
  year =         "1989",
  CODEN =        "IIETDM",
  ISSN =         "0740-817X (print), 1573-9724 (electronic)",
  ISSN-L =       "0740-817X",
  bibdate =      "Thu Jan 05 17:49:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IIE Transactions",
}

@InProceedings{Kharitonov:1989:LBP,
  author =       "M. Kharitonov and A. V. Goldberg and M. Yung",
  title =        "Lower bounds for pseudorandom number generators",
  crossref =     "IEEE:1989:ASF",
  pages =        "242--247",
  year =         "1989",
  DOI =          "https://doi.org/10.1109/SFCS.1989.63485",
  bibdate =      "Thu Apr 5 06:13:40 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kim:1989:PRP,
  author =       "Su Hee Kim and Carl Pomerance",
  title =        "The probability that a random probable prime is
                 composite",
  journal =      j-MATH-COMPUT,
  volume =       "53",
  number =       "188",
  pages =        "721--741",
  month =        oct,
  year =         "1989",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11Y11 (11A51)",
  MRnumber =     "90e:11190",
  MRreviewer =   "Samuel S. Wagstaff, Jr.",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C1140Z (Other and
                 miscellaneous)",
  corpsource =   "Dept. of Comp. Sci., Univ. of Southern Univ.,
                 Columbia, SC, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "composite number; Erd{\H{o}}s; explicit inequalities;
                 number theory; probability; random odd number; random
                 probable prime",
  referencedin = "Referenced in \cite[Ref. 5]{Silverman:1997:FGR}.",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kleijnen:1989:PNG,
  author =       "J. Kleijnen",
  title =        "Pseudorandom number generation on supercomputers",
  journal =      j-SUPERCOMPUTER,
  volume =       "6",
  number =       "6",
  pages =        "34--40",
  month =        nov,
  year =         "1989",
  CODEN =        "SPCOEL",
  ISSN =         "0168-7875",
  bibdate =      "Wed Mar 18 08:37:01 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Inf. Syst. and Auditing, Sch. of Bus. and
                 Econ., Catholic Univ., Tilburg, Netherlands",
  classification = "C5230 (Digital arithmetic methods); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Inf. Syst. and Auditing, Sch. of Bus. and
                 Econ., Catholic Univ., Tilburg, Netherlands",
  fjournal =     "Supercomputer",
  keywords =     "Monte Carlo simulation; parallel processing;
                 pseudorandom number generation; random number
                 generation; supercomputers",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@InProceedings{Komo:1989:MLP,
  author =       "J. J. Komo and W. J. {Park, Jr.}",
  editor =       "????",
  booktitle =    "{Proceedings. Twenty-First Southeastern Symposium on
                 System Theory, 1989}",
  title =        "Maximal-length pseudorandom number generator",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1989",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Jan 19 17:13:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Koniges:1989:PPR,
  author =       "A. E. Koniges and C. E. Leith",
  title =        "Parallel processing of random number generation for
                 {Monte Carlo} turbulence simulation",
  journal =      j-J-COMPUT-PHYS,
  volume =       "81",
  number =       "1",
  pages =        "230--235",
  month =        mar,
  year =         "1989",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(89)90072-7",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999189900727",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Korolev:1989:ANA,
  author =       "V. Yu. Korolev",
  title =        "On the Accuracy of Normal Approximation for the
                 Distributions of Sums of a Random Number of Independent
                 Random Variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "33",
  number =       "3",
  pages =        "540--544",
  month =        "????",
  year =         "1989",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1133079",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60F05",
  MRnumber =     "90b:60028",
  MRreviewer =   "Dominik Szynal",
  bibdate =      "Tue Apr 1 10:40:11 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/33/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 33}(3), (1988), pp. 577--581.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1989",
  xxtitle =      "Accuracy of the normal approximation for distributions
                 of sums of a random number of independent random
                 variables",
}

@Article{Kuo:1989:DSF,
  author =       "Y. S. Kuo and S.-Y. Hwang and H. F. Hu",
  title =        "Data structure for fast region searches",
  journal =      j-IEEE-DES-TEST-COMPUT,
  volume =       "6",
  number =       "5",
  pages =        "20--28",
  month =        oct,
  year =         "1989",
  CODEN =        "IDTCEC",
  ISSN =         "0740-7475 (print), 1558-1918 (electronic)",
  ISSN-L =       "0740-7475",
  bibdate =      "Sat Jan 25 17:38:12 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Bucketing, also known as fixed cells, is a data
                 structure that is especially suitable for queries that
                 cover small windows. However, this technique is not
                 efficient if objects are long and narrow, such as
                 wires. Also, as more objects are added, the efficiency
                 of the query process may suffer. The authors describe a
                 dynamic bucketing structure that maintains a two-level
                 directory structure and uses a directory doubting and
                 merging technique called extendible hashing. This
                 technique allows directories to expand without
                 sacrificing performance as more objects are inserted
                 into the structure. They report the results of tests
                 comparing the performance of dynamic bucketing with the
                 performance of the quad-tree algorithms.",
  acknowledgement = ack-nhfb,
  affiliation =  "Acad Sinica, Taiwan",
  classification = "713; 714; 723; 922",
  fjournal =     "IEEE Design \& Test of Computers",
  journalabr =   "IEEE Des Test Comput",
  keywords =     "Computer Aided Design; Data Processing--Data
                 Structures; Design Automation Software; Dynamic
                 Bucketing Structure; Extendible Hashing; Integrated
                 Circuits, VLSI; Mathematical Statistics--Random Number
                 Generation; Quad-Tree Algorithms; Query Process
                 Efficiency; Region Searches",
}

@Article{Lecot:1989:AGL,
  author =       "C. Lecot",
  title =        "An algorithm for generating low discrepancy sequences
                 on vector computers",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "11",
  number =       "1",
  pages =        "113--116",
  month =        jul,
  year =         "1989",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Mon Apr 14 11:08:33 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4160 (Numerical
                 integration and differentiation); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Fachbereich Math., Kaiserslautern Univ., West
                 Germany",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "Carlo methods; FORTRAN listings; Halton sequence;
                 Hammersley sequence; initial value problems;
                 integration; low discrepancy; Monte; numerical
                 quadrature; parallel algorithms; quasi-Monte Carlo
                 integration; sequences; vector computers",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{LEcuyer:1989:APT,
  author =       "Pierre L'Ecuyer and R. Proulx",
  title =        "About polynomial-time ``unpredictable'' generators",
  crossref =     "MacNair:1989:WSC",
  pages =        "467--476",
  year =         "1989",
  bibdate =      "Fri Dec 30 15:08:49 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:1989:TUV,
  author =       "Pierre L'Ecuyer",
  title =        "A Tutorial on Uniform Variate Generation",
  crossref =     "MacNair:1989:WSC",
  pages =        "40--49",
  year =         "1989",
  bibdate =      "Thu Feb 23 17:01:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Lilja:1989:EGP,
  author =       "David J. Lilja",
  title =        "Efficient generation of {Poisson} distributed random
                 variables",
  type =         "Technical Report",
  number =       "CSRD 900",
  institution =  inst-UIUC-CSRD,
  address =      inst-UIUC-CSRD:adr,
  pages =        "15",
  day =          "31",
  month =        jul,
  year =         "1989",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Two algorithms are presented to generate random number
                 samples from a Poisson distribution. The first
                 algorithm exploits the relationship between the
                 exponential distribution and the Poisson distribution.
                 It is simple to implement, but its performance varies
                 as a function of the mean of the distribution. The
                 second algorithm uses a combination of techniques to
                 efficiently generate samples in a time that is
                 independent of the mean. This algorithm is found to be
                 about ten times faster than the first algorithm for a
                 particular set of parameters.",
  acknowledgement = ack-nhfb,
  annote =       "Submitted to the Transactions of the Society for
                 Computer Simulation International. Supported in part by
                 the National Science Foundation. Supported in part by
                 the U.S. Department of Energy. Supported in part by the
                 NASA Ames Research Center.",
  keywords =     "Poisson distribution; Random number generators",
}

@Article{Luby:1989:SPS,
  author =       "Michael Luby and Charles Rackoff",
  title =        "A study of password security",
  journal =      j-J-CRYPTOLOGY,
  volume =       "1",
  number =       "3",
  pages =        "151--158",
  month =        "????",
  year =         "1989",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/BF02252873",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "68P25 (68N25 68Q25 94A60)",
  MRnumber =     "91a:68053",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "We prove relationships between the security of a
                 function generator when used in an encryption scheme
                 and the security of a function generator when used in a
                 UNIX-like password scheme.",
  acknowledgement = ack-nhfb,
  affiliation =  "Int Computer Science Inst",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "723",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Cryptography; Data Processing--Security of Data;
                 Password Security; Pseudorandom Function Generators;
                 UNIX",
}

@Article{Maclaren:1989:GMI,
  author =       "N. M. Maclaren",
  title =        "The generation of multiple independent sequences of
                 pseudorandom numbers",
  journal =      j-APPL-STAT,
  volume =       "38",
  number =       "2",
  pages =        "351--359",
  year =         "1989",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:25:27 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2348065",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Manas:1989:PCI,
  author =       "G. J. Manas and D. H. Meyer",
  title =        "On a Problem of Coin Identification",
  journal =      j-SIAM-REVIEW,
  volume =       "31",
  number =       "1",
  pages =        "114--117",
  month =        mar,
  year =         "1989",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1031006",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "62A15 (62F03)",
  MRnumber =     "90a:62013",
  bibdate =      "Sat Mar 29 09:54:31 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/31/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  abstract =     "On the basis of the number of spins required to obtain
                 a certain number of heads, a rule with a specified
                 probability of being correct is given to decide which
                 of two unequal bias values is possessed by a chosen
                 coin. In addition, the expected number of spins until
                 this determination is possible is established. The
                 problem is then extended to the identification of the
                 bias of a coin from three possible values. This problem
                 arose in the testing of digital circuits with internal
                 memory. Such observations are expensive and may be
                 reduced by this probabilistic technique.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of the Witwatersrand",
  affiliationaddress = "Johannesburg, S Afr",
  classification = "713; 913; 922",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Binomial Random Variables; Electronic Circuits,
                 Digital--Testing; Hypothesis Testing; Negative
                 Binomial; Normal Approximation; Prior Probabilities;
                 Probability; Quality Control--Theory; Random Processes;
                 Semicurtailed Sampling; Statistical Methods",
  onlinedate =   "March 1989",
}

@InProceedings{Marsaglia:1989:RVS,
  author =       "George Marsaglia",
  title =        "Random Variables for Supercomputers",
  crossref =     "Wegman:1988:SIC",
  pages =        "103--103",
  year =         "1989",
  bibdate =      "Wed Nov 12 16:33:35 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Abstract only.",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a205068.pdf",
  abstract =     "A discussion of methods for generating random
                 variables in supercomputers, particularly the 205 and
                 ETA 10. Methods that exploit vector processing are
                 well-suited for generating uniform random variables,
                 both integer and real, and several of them are
                 described. For non-uniform variates, however, methods
                 that have proved best for conventional computers do not
                 readily yield to vector methods. For example, the best
                 methods for normal or exponential variates in
                 conventional computers take less than $ 1.2 T $, where
                 $T$ is the time for a uniform variate, yet in
                 supercomputers those methods take relatively much
                 longer. Different approaches to reducing these times
                 will be discussed.",
  acknowledgement = ack-nhfb,
}

@Article{Martin:1989:AMM,
  author =       "R. Douglas Martin and Ruben H. Zamar",
  title =        "Asymptotically min-max bias robust $ {M} $-estimates
                 of scale for positive random variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "84",
  number =       "406",
  pages =        "494--501",
  month =        jun,
  year =         "1989",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62G05 (62F10 62G30)",
  MRnumber =     "91a:62092",
  MRreviewer =   "M. M. Siddiqui",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2289935",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{McIntosh:1989:RAE,
  author =       "David McIntosh",
  title =        "Random {Atari}: Enhancing the Number Generator",
  journal =      "{ANTIC}",
  volume =       "7",
  number =       "11",
  pages =        "12--??",
  year =         "1989",
  CODEN =        "????",
  ISSN =         "0113-1141",
  ISSN-L =       "0113-1141",
  bibdate =      "Thu Feb 23 17:03:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.atarimagazines.com/v7n11/randomatari.html",
  acknowledgement = ack-nhfb,
  remark =       "From the introduction: ``Random numbers are generated
                 on the Atari by measuring random noise on an electronic
                 circuit, and converting this to a value between zero
                 and 65,535. This is divided by 65,536, to give a value
                 between zero and one. These are excellent random
                 numbers but they are non-repeatable. If you run a
                 program whose results depend on random numbers, you
                 will never be able to repeat those same results.'' The
                 author proposes an MCG with $ A = 397 \, 204 \, 094 $
                 and $ M = 2^{31} - 1 $ as an alternative for
                 reproducibility.",
}

@Article{Meer:1989:SIP,
  author =       "Peter Meer",
  title =        "Stochastic image pyramids",
  journal =      j-CVGIP,
  volume =       "45",
  number =       "3",
  pages =        "269--294",
  month =        mar,
  year =         "1989",
  CODEN =        "CVGPDB",
  ISSN =         "0734-189x (print), 1557-895x (electronic)",
  ISSN-L =       "0734-189X",
  bibdate =      "Thu Feb 6 18:44:11 MST 1997",
  bibsource =    "Compendex database; Graphics/rosenfeld/1989.bib;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Center for Autom. Res., Maryland Univ., College Park,
                 MD, USA",
  affiliationaddress = "College Park, MD, USA",
  classification = "723; 922; C1140 (Probability and statistics); C5260B
                 (Computer vision and picture processing)",
  fjournal =     "Computer Vision, Graphics, and Image Processing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0734189X",
  journalabr =   "Comput Vision Graphics Image Process",
  keywords =     "2-Dimensional image pyramids; Computer
                 Programming--Algorithms; Curve processing; Data
                 Processing; Data Structures; Deterministic Pyramid;
                 Distance Doubling Algorithm; Fast parallel synthesis
                 method, image processing, digital; Global sampling
                 structure; Identically distributed random variables;
                 Image Processing--Image Analysis; Local ordering
                 relations; Multiresolution algorithms; Probability;
                 Sampling; Sampling Grid; Stochastic Image Pyramids;
                 Stochastic image pyramids; Twofold reduced resolution
                 next level",
  thesaurus =    "Computerised picture processing; Stochastic
                 processes",
}

@Article{Meier:1989:FCA,
  author =       "Willi Meier and Othmar Staffelbach",
  title =        "Fast correlation attacks on certain stream ciphers",
  journal =      j-J-CRYPTOLOGY,
  volume =       "1",
  number =       "3",
  pages =        "159--176",
  month =        "????",
  year =         "1989",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60",
  MRnumber =     "90j:94029",
  MRreviewer =   "Zhao Zhi Zhang",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "HTL Brugg-Windisch",
  affiliationaddress = "Windisch, Switz",
  classification = "723",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Computer Programming--Algorithms; Cryptanalysis;
                 Cryptography; Fast Correlation Attacks; Linear Feedback
                 Shift Register Sequences; Stream Ciphers",
}

@PhdThesis{Mertsch:1989:PAS,
  author =       "M. K. Mertsch",
  title =        "On Performance Analysis and Selection Criteria of
                 Random Number Generators for Simulations",
  type =         "Dissertation",
  school =       "Institute for Electronic Systems and Switching,
                 University of Dortmund",
  address =      "Dortmund, Germany",
  year =         "1989",
  bibdate =      "Thu Mar 08 21:01:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1989:STC,
  author =       "Harald Niederreiter",
  title =        "The serial test for congruential pseudorandom numbers
                 generated by inversions",
  journal =      j-MATH-COMPUT,
  volume =       "52",
  number =       "185",
  pages =        "135--144",
  month =        jan,
  year =         "1989",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "90e:65008",
  MRreviewer =   "Istv{\'a}n D{\'e}ak",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008658.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Austrian Acad. of Sci., Vienna, Austria",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "bounds; character sums; congruential; congruential
                 pseudorandom numbers; finite fields; independence
                 properties; inversions; number theory; proof;
                 pseudorandom number generators; random number
                 generation; serial test; statistical; Stepanov bound;
                 Weil-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paul:1989:IRN,
  author =       "W. Paul and Dieter W. Heermann and Rashmi C. Desai",
  title =        "Implementation of a random number generator in
                 {OCCAM}",
  journal =      j-J-COMPUT-PHYS,
  volume =       "82",
  number =       "2",
  pages =        "487--491",
  month =        jun,
  year =         "1989",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(89)90059-4",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Sat Dec 31 08:29:49 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999189900594",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Percus:1989:RNG,
  author =       "Ora E. Percus and Malvin H. Kalos",
  title =        "Random number generators for {MIMD} parallel
                 processors",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "6",
  number =       "3",
  pages =        "477--497",
  month =        jun,
  year =         "1989",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/0743-7315(89)90002-6",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Sat Apr 12 19:06:31 MDT 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "New York, NY, USA",
  classification = "722; 723; 922; C5230 (Digital arithmetic methods);
                 C5440 (Multiprocessor systems and techniques)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
  journalabr =   "J Parallel Distrib Comput",
  keywords =     "calculations; Computer Systems, Digital; instruction
                 stream/multiple data stream; Mathematical
                 Statistics--Random Number Generation; MIMD Parallel
                 Processors; MIMD parallel processors; Monte Carlo;
                 Monte Carlo Calculations; multiple; Parallel
                 Processing; parallel processing; random number
                 generation; random number generators",
  treatment =    "P Practical",
}

@TechReport{Pickover:1989:PRG,
  author =       "Clifford A. Pickover",
  title =        "Picturing randomness on a graphics supercomputer",
  type =         "Research report",
  number =       "RC 14468 (\#64759)",
  institution =  "IBM T.J. Watson Research Center",
  address =      "Yorktown Heights, NY, USA",
  pages =        "iii + 8",
  year =         "1989",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Computer graphics; Random number generators;
                 Supercomputers",
}

@Article{Press:1989:QSR,
  author =       "William H. Press and Saul A. Teukolsky",
  title =        "Quasi- (that is, Sub-) Random Numbers",
  journal =      j-COMPUT-PHYS,
  volume =       "3",
  number =       "6",
  pages =        "76--??",
  month =        nov,
  year =         "1989",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.4822879",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Wed Apr 10 08:45:20 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://aip.scitation.org/doi/10.1063/1.4822879",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Phys",
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
}

@Article{Reber:1989:PNG,
  author =       "James C. Reber",
  title =        "Pseudorandom Number Generators in a Four-Bit Computer
                 System",
  journal =      j-COLLEGE-MATH-J,
  volume =       "20",
  number =       "1",
  pages =        "54--55",
  month =        jan,
  year =         "1989",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/07468342.1989.11973205",
  ISSN =         "0746-8342 (print), 1931-1346 (electronic)",
  ISSN-L =       "0746-8342",
  bibdate =      "Thu Feb 14 09:50:49 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/collegemathj.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2686821.pdf;
                 http://www.tandfonline.com/doi/abs/10.1080/07468342.1989.11973205",
  acknowledgement = ack-nhfb,
  fjournal =     "College Mathematics Journal",
  journal-URL =  "https://maa.tandfonline.com/loi/ucmj20;
                 https://www.jstor.org/journal/collmathj",
  onlinedate =   "30 Jan 2018",
}

@Article{Rhee:1989:OPIa,
  author =       "Wansoo T. Rhee and Michel Talagrand",
  title =        "Optimal bin packing with items of random sizes. {II}",
  journal =      j-SIAM-J-COMPUT,
  volume =       "18",
  number =       "1",
  pages =        "139--151",
  month =        feb,
  year =         "1989",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "90B05 (05B40 28A33)",
  MRnumber =     "89m:90055",
  MRreviewer =   "Ingo Wegener",
  bibdate =      "Mon Nov 29 11:01:14 MST 2010",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/18/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  abstract =     "Consider a probability measure $ \mu $ on $ [0, 1] $
                 and independent random variables $ X_1, \ldots {}, X_n
                 $, distributed according to $ \mu $. Let $ Q_n(X_1,
                 \ldots {}, X_n) $ be the minimum number of unit-size
                 bins needed to pack items of size $ X_1, \ldots {}, X_n
                 $. In this paper it is proven that $ |E(Q_n(X_1, \ldots
                 {}, X_n)) / n - c(\mu)| \leq K((\log n) / n) + {\rm
                 HLF} $, where $K$ is a universal constant and $ c(\mu)
                 $ depends on $ \mu $, $ c(\mu) = \lim - n{\rm YLD}
                 \infty / E(Q_n) / n $.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Columbus, OH, USA",
  classification = "921; 922",
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  journalabr =   "SIAM J Comput",
  keywords =     "Bin Packing Algorithms; Combinatorial Mathematics;
                 Mathematical Techniques; Optimization --- Applications;
                 Probability --- Random Processes",
}

@Article{Richards:1989:GRP,
  author =       "T. Richards",
  title =        "Graphical representation of pseudorandom sequences",
  journal =      j-COMPUTERS-AND-GRAPHICS,
  volume =       "13",
  number =       "2",
  pages =        "261--262",
  year =         "1989",
  CODEN =        "COGRD2",
  ISSN =         "0097-8493 (print), 1873-7684 (electronic)",
  ISSN-L =       "0097-8493",
  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
  bibsource =    "Compendex database; Graphics/imager/imager.89.bib;
                 Graphics/siggraph/89.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IMI Systems Inc",
  affiliationaddress = "Parsippany, NJ, USA",
  classification = "723; 922",
  fjournal =     "Computers and Graphics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00978493",
  journalabr =   "Comput Graphics (Pergamon)",
  keywords =     "Chaos Analysis; Computer Graphics--Applications;
                 Mathematical Statistics; Pseudorandom Sequences; Random
                 Number Generation",
}

@Article{Sezgin:1989:EPC,
  author =       "Fatin Sezgin",
  title =        "On efficient and portable combined random number
                 generators",
  journal =      j-CACM,
  volume =       "32",
  number =       "8",
  pages =        "1019--1020",
  month =        aug,
  year =         "1989",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91h:65014",
  bibdate =      "Tue Dec 26 13:35:07 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1989.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@TechReport{Tezuka:1989:ALC,
  author =       "Shu Tezuka",
  title =        "Analysis of {L'Ecuyer}'s Combined Random Number
                 Generator",
  type =         "Report",
  number =       "RT-5014",
  institution =  "IBM Research, Tokyo Research Laboratory",
  address =      "Tokyo, Japan",
  month =        nov,
  year =         "1989",
  bibdate =      "Thu Feb 23 17:23:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Tezuka:1989:RNG,
  author =       "Shu Tezuka",
  title =        "Random number generation based on the polynomial
                 arithmetic modulo two",
  type =         "Report",
  institution =  "IBM Research, Tokyo Research Laboratory",
  address =      "Tokyo, Japan",
  year =         "1989",
  bibdate =      "Fri Jan 06 10:55:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Thomas:1989:SNL,
  author =       "Marlin A. Thomas and Gary W. Gemmill and John R.
                 Crigler",
  title =        "{STATLIB}: {NSWC} Library of Statistical Programs and
                 Subroutines",
  type =         "Technical Report",
  number =       "NSWC TR 89-97",
  institution =  "Naval Surface Warfare Center",
  address =      "Dahlgren, VA 22448-5000, USA and Silver Spring, MD
                 20903-5000, USA",
  pages =        "viii + 280",
  month =        aug,
  year =         "1989",
  bibdate =      "Sat Nov 15 10:39:12 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.dtic.mil/dtic/tr/fulltext/u2/a221538.pdf",
  abstract =     "This document provides a description of each program
                 and subroutine in STATLIB, THE Naval Surface Warfare
                 Center library of statistical programs and subroutines
                 for its general purpose computers. The Library contains
                 thirty-four programs and twenty-four subroutines for
                 statistical analysis, probability evaluation, and
                 random number generation. It was written to enable
                 Center Scientists and Engineers to efficiently perform
                 a wide variety of analyses and to generate pseudo
                 random numbers from many different probability
                 distributions.",
  acknowledgement = ack-nhfb,
  onlinedate =   "255",
  tableofcontents = "Introduction / 1 \\
                 Overview of STATLIB / 1 \\
                 Origin of STATLIB / 1 \\
                 Establishment of STATLIB / 1 \\
                 Commercial Statistical Packages at NSWC / 2 \\
                 Using STATLIB / 5 \\
                 Library Organization / 5 \\
                 How to Call It / 5 \\
                 Information Needed to Run It / 5 \\
                 Examples / 9 \\
                 Program / 9 \\
                 Subroutine / 10 \\
                 Descriptions and Input Guides / 21 \\
                 Programs / 23 \\
                 Regression Analysis / 25 \\
                 GEMREG General Multiple Regression / 29 \\
                 DAMRCA Dahlgren Multiple Regression Comprehensive
                 Analysis / 35 \\
                 WEPORU Uncorrelated Weighted Polynomial Regression / 41
                 \\
                 WEPORC Correlated Weighted Polynomial Regression / 45
                 \\
                 MROP Multiple Regression Using Orthogonal Polynomials /
                 49 \\
                 CANON Canonical Analysis of Second Order Response
                 Functions / 57 \\
                 DURBWAT Durbin--Watson Test for Independence of
                 Residuals / 61 \\
                 NEARNEB Near Neighbor Estimation of Experimental Error
                 / 63 \\
                 Goodness of Fit Analysis / 67 \\
                 UNORGOF Univariate Normal Goodness of Fit / 69 \\
                 BNORGOF Bivariate Normal Goodness of Fit / 75 \\
                 EXPGOF Exponential Goodness of Fit / 81 \\
                 WBLGOF Weibull Goodness ot / 83 \\
                 PERGOF Pearson System Goodness of Fit / 87 \\
                 UNKSGOF Univariate Normal Kolmogorov--Smirnov Test of
                 Fit / 93 \\
                 RANDOM Test of Fit for Uniform Random Number Generators
                 / 99 \\
                 Power Evaluation / 103 \\
                 DISCRETE POWER EVALUATION / 107 \\
                 BINIPOW Power of the Test on a Binomial Proportion /
                 109 \\
                 BIN2POW Power of the Test on the Difference of Two
                 Binomial Proportions / 113 \\
                 POIIPOW Power of the Test on the Poisson Parameter /
                 121 \\
                 Continuous Power Evaluation / 125 \\
                 NORIPOW Power of the One-Sample Normal Test on the Mean
                 / 127 \\
                 NOR2PWE Power of the Two-Simple Normal Test on Means
                 with ample Sizes / 131 \\
                 NOR2PWU Power of the Two-Sample Normal Test on Means
                 with Unequal Sample Sizes / 135 \\
                 T1POW Power of the One-Sample $t$ Test on the Mean /
                 141 \\
                 T2POW Power of the Two-Sample (Pooled) $t$ Test on
                 Means / 147 \\
                 CHIVPOW Power of the Chi-square Test on the Variance /
                 153 \\
                 FVARPOW Power of the $F$ Test for the Equality of
                 Variances / 157 \\
                 FEMPOW Power of the Test for One-Way Fixed Effects
                 Analysis of Variance / 163 \\
                 REMPOW Power of the Test for One-Way Random Effects
                 Analysis of Variance / 167 \\
                 Probability Evaluation / 171 \\
                 BINVARP Binomial Probability Distribution with Unequal
                 Single Trial Probabilities / 173 \\
                 NEGBIN Negative Binomial Probability Distribution / 177
                 \\
                 Confidence Limit Evaluation / 179 \\
                 BINCL Confidence Limits for the Binomial Parameter p /
                 181 \\
                 CEPCL Confidence Limits for the CEP (Circular Probable
                 Error) / 185 \\
                 SEPCL Confidence Limits for the SEP (Spherical Probable
                 Error) / 191 \\
                 Miscellaneous Statistical Analysis / 197 \\
                 LD50EST Estimation of LD50 (Lethal Dose 50th
                 Percentile) / 199 \\
                 FFAC2K Analysis of the 2**k Fractional Factorial
                 Experiment / 203 \\
                 Subroutines / 211 \\
                 Random Number Generation / 213 \\
                 Discrete Random Number Generators, / 217 \\
                 RANARB Arbitrary (User Specified) Discrete Distribution
                 / 219 \\
                 RANBER Bernoulli Distribution / 221 \\
                 RANBIN Binomial Distribution / 223 \\
                 RANGEO Geometric Distribution / 225 \\
                 RANHYP Hypergeometric Distribution / 227 \\
                 RANNBI Negative Binomial Distribution / 229 \\
                 RANPOI Poisson Distribution / 231 \\
                 RANUWO Discrete Uniform Distribution (Without
                 Replacement) / 233 \\
                 RANUWR Discrete Uniform Distribution (With Replacement)
                 / 235 \\
                 Continuous Random Number Generators / 237 \\
                 RANBET Beta Distribution / 239 \\
                 RANCSQ Chi-square Distribution / 241 \\
                 RANEXP Exponential Distribution / 243 \\
                 RANFDI $F$ Distribution / 245 \\
                 RANGAM Gamma Distribution / 247 \\
                 RANLGS Logistic Distribution / 249 \\
                 RANLOG Lognormal Distribution / 251 \\
                 RANNOR Normal Distribution / 255 \\
                 RANNVE Multivariate Normal Distribution / 257 \\
                 RANPDI Pearson Distributions / 261 \\
                 RANTDI Student's $t$ Distribution / 265 \\
                 RANUNI Continuous Uniform Distribution (On a Line) /
                 267 \\
                 RANCIR Continuous Uniform Distribution (Within a
                 Circle) / 269 \\
                 RANWEI Three-parameter Weibull Distribution / 271 \\
                 RANMK1 1st Order Markov Process / 273 \\
                 Glossary / 275 \\
                 Distribution / 277",
}

@Article{Wang:1989:SMR,
  author =       "Mei-Cheng Wang",
  title =        "A Semiparametric Model for Randomly Truncated Data",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "84",
  number =       "407",
  pages =        "742--748",
  month =        sep,
  year =         "1989",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "62F10 (62G05 62P10)",
  MRnumber =     "92j:62038",
  bibdate =      "Wed Jan 25 08:06:00 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314291;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2289656",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Wikramaratna:1989:ANM,
  author =       "Roy S. Wikramaratna",
  title =        "{ACORN} --- a new method for generating sequences of
                 uniformly distributed pseudo-random Numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "83",
  number =       "1",
  pages =        "16--31",
  month =        jul,
  year =         "1989",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(89)90221-0",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Fri Dec 30 22:28:25 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999189902210",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
  keywords =     "ACORN (additive congruential random number)
                 generator",
}

@InProceedings{Yang:1989:OUC,
  author =       "W.-N. Yang and B. L. Nelson",
  title =        "Optimization Using {Common Random Numbers}, Control
                 Variates and Multiple Comparisons with the Best",
  crossref =     "MacNair:1989:WSC",
  pages =        "444--449",
  year =         "1989",
  bibdate =      "Thu Jan 05 18:25:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Afflerbach:1990:CAR,
  author =       "Lothar Afflerbach",
  title =        "Criteria for the assessment of random number
                 generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "3--10",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90330-3",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Fri Jul 01 08:18:11 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903303",
  abstract =     "For any finite sequence of (pseudo)random numbers
                 special simulation problems can be constructed such
                 that this sequence yields useless results. In order to
                 study the quality of the result of a simulation the
                 assessment of a pseudorandom number generator based on
                 theoretical considerations is a great advantage.
                 Several criteria for the assessment of random number
                 generators are known. The most important criteria are
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "discrepancy; hyperplanes; lattice structure; linear
                 congruential generators; Random number generation;
                 spectral test",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@InProceedings{Alon:1990:SCA,
  author =       "N. Alon and O. Goldreich and J. H{\aa}stad and R.
                 Peralta",
  title =        "Simple construction of almost $k$-wise independent
                 random variables",
  crossref =     "IEEE:1990:PAS",
  volume =       "2",
  pages =        "544--553",
  year =         "1990",
  bibdate =      "Thu Apr 5 06:13:50 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Anderson:1990:RNG,
  author =       "Stuart L. Anderson",
  title =        "Random Number Generators on Vector Supercomputers and
                 Other Advanced Architectures",
  journal =      j-SIAM-REVIEW,
  volume =       "32",
  number =       "2",
  pages =        "221--251",
  month =        jun,
  year =         "1990",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1032044",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65C10 (65Y05)",
  MRnumber =     "91g:65015",
  bibdate =      "Mon Jan 20 10:31:25 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://www.jstor.org/stable/2030521",
  abstract =     "This paper is divided into three parts. The first part
                 surveys the more common techniques for generating and
                 testing uniformly distributed random numbers. The
                 second part considers the efficient generation of
                 random numbers on vector computers. The third part
                 discusses the generation and use of random numbers in
                 multitasking environments (which may include multiple
                 processor computers).",
  acknowledgement = ack-nhfb,
  affiliation =  "Boeing Computer Services",
  affiliationaddress = "Seattle, WA, USA",
  classification = "723; 921; 922",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Computer Programs; Computers, Supercomputer; Lagged
                 Fibonacci Generators; Mathematical Statistics;
                 Mathematical Techniques--Vectors; Multitasking;
                 Pseudorandom Trees; Random Number Generation; Random
                 Number Tests; Spectral Test; Vector Supercomputers",
}

@Article{Anderson:1990:SCS,
  author =       "Ross J. Anderson",
  title =        "Solving a Class of Stream Ciphers",
  journal =      j-CRYPTOLOGIA,
  volume =       "14",
  number =       "3",
  pages =        "285--288",
  month =        jul,
  year =         "1990",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119091864977",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:57 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "keystream sequences; linear feedback shift registers;
                 multiplexor; consistency check; observed keystream;
                 address information",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902650~db=all~order=page",
  abstract =     "S. M. Jennings (1980) and H. Beker and F. Piper (1982)
                 have proposed generating keystream sequences by
                 combining the output of two linear feedback shift
                 registers using a multiplexor. Such sequences can be
                 solved by a consistency check between the observed
                 keystream and the possible states of the shift register
                 which provides the address information to the
                 multiplexor",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "cryptography; data integrity; shift registers",
  romanvolume =  "XIV",
}

@Article{Andre:1990:FMD,
  author =       "Debra A. Andr{\'e} and Gary L. Mullen and Harald
                 Niederreiter",
  title =        "Figures of merit for digital multistep pseudorandom
                 numbers",
  journal =      j-MATH-COMPUT,
  volume =       "54",
  number =       "190",
  pages =        "737--748",
  month =        apr,
  year =         "1990",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "91d:65012",
  MRreviewer =   "Istv{\'a}n D{\'e}ak",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008509.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Pennsylvania State Univ., University Park, PA, USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "characteristic polynomial; digital multistep
                 pseudorandom numbers; figure of merit; independence;
                 polynomials; random number generation; recursion;
                 statistical; statistical independence properties",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Asada:1990:GCH,
  author =       "Y. Asada and N. Kobayashi and T. Hayashi and M. Suzuki
                 and N. Hidaka and K. Odani and K. Kondo and T. Mimura
                 and M. Abe",
  editor =       "????",
  booktitle =    "Digest of Technical Papers. {IEEE} International 37th
                 {ISSCC} Solid-State Circuits Conference, 16--16
                 February 1990, San Francisco, {CA}, {USA}",
  title =        "A gigahertz cryogenic {HEMT} pseudorandom number
                 generator chip set",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "186--187",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/ISSCC.1990.110188",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Jan 19 16:57:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ascheid:1990:GWD,
  author =       "G. Ascheid",
  title =        "On the generation of {WMC}-distributed random
                 numbers",
  journal =      j-IEEE-TRANS-COMM,
  volume =       "38",
  number =       "12",
  pages =        "2117--2118",
  month =        dec,
  year =         "1990",
  CODEN =        "IECMBT",
  DOI =          "https://doi.org/10.1109/26.64653",
  ISSN =         "0090-6778 (print), 1558-0857 (electronic)",
  ISSN-L =       "0090-6778",
  bibdate =      "Thu Mar 08 21:09:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Communications",
}

@Article{Baccelli:1990:EPP,
  author =       "Fran{\c{c}}ois Baccelli and Zhen Liu",
  title =        "On the Execution of Parallel Programs on
                 Multiprocessor Systems --- a Queuing Theory Approach",
  journal =      j-J-ACM,
  volume =       "37",
  number =       "2",
  pages =        "373--414",
  month =        apr,
  year =         "1990",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/77600.77622",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77622.html",
  acknowledgement = ack-nhfb,
  annote =       "The new class of queueing models, called Synchronized
                 Queueing Networks, is proposed for evaluating the
                 performance of multiprogrammed and multitasked
                 multiprocessor systems, where workloads consist of
                 parallel programs of similar structure and where the
                 scheduling discipline is FIFO.",
  descriptors =  "Multiprocessor system; queueing network; scheduling;
                 performance evaluation",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "algorithms; associated random variables; design;
                 ergodic theory; multiprogramming and multitasking;
                 Parallelism; performance; performance evaluation;
                 response times; stability condition; stochastic
                 ordering; System Modeling and Analysis; task graph;
                 theory; waiting times",
  subject =      "{\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems. {\bf
                 C.1.2}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors), Parallel processors. {\bf D.4.1}:
                 Software, OPERATING SYSTEMS, Process Management,
                 Synchronization. {\bf D.4.8}: Software, OPERATING
                 SYSTEMS, Performance, Queueing theory. {\bf D.4.8}:
                 Software, OPERATING SYSTEMS, Performance, Stochastic
                 analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS,
                 Performance, Modeling and prediction. {\bf G.m}:
                 Mathematics of Computing, MISCELLANEOUS, Queueing
                 theory. {\bf C.4}: Computer Systems Organization,
                 PERFORMANCE OF SYSTEMS, Modeling techniques.",
}

@Article{Bays:1990:CIR,
  author =       "Carter Bays",
  title =        "{C364}. {Improving} a random number generator: a
                 comparison between two shuffling methods",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "36",
  number =       "1",
  pages =        "57--59",
  month =        may,
  year =         "1990",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659008811264",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 7 06:50:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Learmonth:1973:NPS,Bays:1976:IPR} for the
                 two nearly identical shuffling algorithms. This paper
                 explains why the first does not lengthen the generator
                 period, or much reduce the lattice structure of linear
                 congruential generators, but the second improves both
                 dramatically.",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659008811264",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  keywords =     "random number; shuffling",
  onlinedate =   "20 Mar 2007",
}

@Article{Behboodian:1990:EUD,
  author =       "Javad Behboodian",
  title =        "Examples of Uncorrelated Dependent Random Variables
                 Using a Bivariate Mixture",
  journal =      j-AMER-STAT,
  volume =       "44",
  number =       "3",
  pages =        "218--218",
  month =        aug,
  year =         "1990",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "62H05 (60E05)",
  MRnumber =     "1 130 912",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Bernstein:1990:SRN,
  author =       "G. M. Bernstein and M. A. Lieberman",
  title =        "Secure Random Number Generation Using Chaotic
                 Circuits",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "37",
  number =       "9",
  pages =        "1157--1164",
  month =        sep,
  year =         "1990",
  CODEN =        "ICSYBT",
  DOI =          "https://doi.org/10.1109/MILCOM.1989.104003",
  ISSN =         "0098-4094 (print), 1558-1276 (electronic)",
  ISSN-L =       "0098-4094",
  bibdate =      "Thu Feb 23 17:24:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "chaos, physical",
  fjournal =     "IEEE Transactions on Circuits and Systems",
}

@Article{Beth:1990:CPR,
  author =       "Thomas Beth and Zong-Duo Dai",
  title =        "On the Complexity of Pseudo-random Sequences --- or:
                 If You Can Describe a Sequence It Can't Be Random",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "434",
  pages =        "533--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:57 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0434.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0434/04340533.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0434/04340533.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Bhavsar:1990:EDL,
  author =       "Virendra C. Bhavsar and Uday G. Gujar and Joseph D.
                 Horton and Lambros A. Lambrou",
  title =        "Evaluation of the discrepancy of the linear
                 congruential pseudo-random number sequences",
  journal =      j-BIT,
  volume =       "30",
  number =       "2",
  pages =        "257--267",
  month =        jun,
  year =         "1990",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF02017347",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65C10 (11K45 11Y55)",
  MRnumber =     "91b:65005",
  bibdate =      "Wed Jan 4 18:52:21 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=30&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=30&issue=2&spage=257",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
  xxpages =      "258--267??",
}

@Article{Bralic:1990:AGR,
  author =       "N. Brali{\'c} and R. Espinosa and C. Saavedra",
  title =        "An algorithm for the generation of random numbers with
                 density {$ C \exp ( - \lambda |x|^\nu) $}",
  journal =      j-J-COMPUT-PHYS,
  volume =       "88",
  number =       "2",
  pages =        "484--489",
  month =        jun,
  year =         "1990",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(90)90191-3",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:41 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999190901913",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Burford:1990:RNG,
  author =       "Roger L. Burford",
  title =        "Random number generators for microcomputers",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "19",
  number =       "2",
  pages =        "649--662",
  month =        "????",
  year =         "1990",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919008812880",
  ISSN =         "0361-0918",
  bibdate =      "Tue Feb 07 08:10:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/03610919008812880",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
  onlinedate =   "24 Oct 2007",
}

@Article{Carta:1990:TFI,
  author =       "David G. Carta",
  title =        "Two Fast Implementations of the ``Minimal Standard''
                 Random Number Generator",
  journal =      j-CACM,
  volume =       "33",
  number =       "1",
  pages =        "87--88",
  month =        jan,
  year =         "1990",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Jan 28 14:46:37 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See criticism and errata \cite{Sezgin:1992:SCC}, and
                 further criticism in \cite{Park:1993:ATR}. The latter
                 point out that Carta's implementation does not
                 correspond to their proposal.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/76379.html",
  abstract =     "Although superficially time-consuming, on 32-bit
                 computers the minimal standard random number generator
                 can be implemented with surprising economy.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; experimentation; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Dagpunar:1990:SMD,
  author =       "J. S. Dagpunar",
  title =        "Sampling from the {von Mises} distribution via a
                 comparison of random numbers",
  journal =      j-J-APPL-STAT,
  volume =       "17",
  number =       "1",
  pages =        "165--168",
  year =         "1990",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/757582656",
  ISSN =         "0266-4763 (print), 1360-0532 (electronic)",
  ISSN-L =       "0266-4763",
  bibdate =      "Tue Sep 6 11:16:16 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/routledge/02664763.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/cjas20",
  onlinedate =   "18 Jul 2011",
}

@Book{Deak:1990:RNG,
  author =       "Istv{\'a}n De{\'a}k",
  title =        "Random number generators and simulation",
  volume =       "4",
  publisher =    "Akad{\'e}miai Kiad{\'o}",
  address =      "Budapest, Hungary",
  pages =        "341",
  year =         "1990",
  ISBN =         "963-05-5316-3",
  ISBN-13 =      "978-963-05-5316-2",
  LCCN =         "QA298 .D4313 1990",
  bibdate =      "Wed Dec 21 10:24:06 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematical methods of operations research",
  acknowledgement = ack-nhfb,
  remark =       "Revised translation of the Hungarian original,
                 \booktitle{V{\'e}letlensz{\'a}m-gener{\'a}torok {\'e}s
                 alkalmaz{\'a}suk}.",
  subject =      "Monte Carlo method; Random number generators",
}

@Article{Deak:1990:URN,
  author =       "Istv{\'a}n De{\'a}k",
  title =        "Uniform random number generators for parallel
                 computers",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "15",
  number =       "1--3",
  pages =        "155--164",
  month =        sep,
  year =         "1990",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10 (65Y05 94A55)",
  MRnumber =     "1 089 836",
  bibdate =      "Mon Apr 14 12:07:40 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods); C5440
                 (Multiprocessor systems and techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Ind. Eng., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "computations; Connection Machine; feedback shift
                 register; large Mersenne; parallel computers; parallel
                 processing; prime; random number generation; registers;
                 shift; simulational; T Series; type generators; uniform
                 random number generation",
  treatment =    "P Practical",
}

@Article{DeArman:1990:IRN,
  author =       "James DeArman",
  title =        "Improving Random Number Generators on
                 Micro-Computers",
  journal =      j-COMP-OP-RES,
  volume =       "17",
  number =       "3",
  pages =        "283--295",
  month =        "????",
  year =         "1990",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/0305-0548(90)90005-R",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Thu Mar 08 21:13:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/030505489090005R",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
  remark =       "The author reports experiments with composite
                 generators to remove serial correlations at low-order
                 lags.",
}

@Article{DeMatteis:1990:CPR,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "A class of parallel random number generators",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "13",
  number =       "2",
  pages =        "193--198",
  month =        feb,
  year =         "1990",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10 (65Y05)",
  MRnumber =     "91a:65007",
  bibdate =      "Mon Apr 14 12:07:40 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods)",
  corpsource =   "Lab. Matematica Applicata, ENEA, Bologna, Italy",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "algorithms; multiplicative-additive congruential;
                 mutual stochastic independence; number theory; parallel
                 algorithms; parallel computation; parallel random
                 number generators; random number generation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{DeMatteis:1990:LRC,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Long-range correlations in linear and nonlinear random
                 number generators",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "14",
  number =       "2",
  pages =        "207--210",
  month =        jun,
  year =         "1990",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10",
  MRnumber =     "91g:65017",
  bibdate =      "Mon Apr 14 12:07:40 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C1260 (Information
                 theory); C4190 (Other numerical methods); C5230
                 (Digital arithmetic methods); C7310 (Mathematics)",
  corpsource =   "Lab. Matematica Applicata, ENEA, Bologna, Italy",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "concurrent; correlation methods; generation; linear
                 congruential methods; MIMD; mutual independence;
                 non-linear random number generators; nonlinear
                 congruential generators; parallel algorithms; parallel
                 computing; periodic algorithm; processors; pseudorandom
                 numbers; random number; recursive; strong long-range
                 correlations",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "A. {De Matteis} and S. Pagnutti",
}

@Article{Deng:1990:GUV,
  author =       "Lih-Yuan Deng and E. Olusegun George",
  title =        "Generation of uniform variates from several nearly
                 uniformly distributed variables",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "19",
  number =       "1",
  pages =        "145--154",
  month =        "????",
  year =         "1990",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919008812849",
  ISSN =         "0361-0918",
  bibdate =      "Thu Dec 29 15:23:11 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics. Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Article{Doring:1990:ENZ,
  author =       "H. D{\"o}ring",
  title =        "{Erzeugung normalverteilter Zufallsszahlen mit
                 16-bit-PC}. ({German}) [{Generation} of
                 normally-distributed random numbers on an 16-bit
                 {PC}]",
  journal =      j-NACH-ELEK,
  volume =       "40",
  number =       "8",
  pages =        "306--309",
  year =         "1990",
  CODEN =        "NTELAP",
  ISSN =         "0323-4657",
  bibdate =      "Thu Mar 8 21:04:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Nachrichtentech., Elektron.",
  fjournal =     "Nachrichtentechnik Elektronik",
  keywords =     "Comparison; Normal Distribution; Pascal; PC; Random
                 Number",
  language =     "German",
}

@Article{Eddy:1990:RNG,
  author =       "William F. Eddy",
  title =        "Random number generators for parallel processors",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "63--71",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90336-X",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:58:02 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{MacLaren:1965:URN,Collings:1987:CRN} for
                 combined generators",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090336X",
  abstract =     "The fundamental requirements for the sequence of
                 numbers produced by a random number generator in a
                 computer program are that (1) the sequence be
                 indistinguishable from that produced by an iid sequence
                 of standard uniformly distributed random variables; (2)
                 the sequence be identically reproduced on a subsequent
                 execution of the same computer program. For computers
                 with multiple processors it is sensible to add the
                 additional requirement that (3) the sequences used by
                 each of the several processors be indistinguishable
                 from independent sequences. If one uses a standard
                 random number generator developed for a uniprocessor in
                 an environment with multiple processors, then each one
                 of these requirements may be violated. This paper
                 contains a review of previous attempts to satisfy the
                 three requirements for a multiprocessor and concludes
                 that none are really successful.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "combination generators; compound generator;
                 congruential generator; lagged-Fibonacci generator;
                 leap-frog method; Lehmer trees; shift-register
                 generator",
  remark-1 =     "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
  remark-2 =     "From the abstract: ``This paper contains a review of
                 previous attempts to satisfy the three requirements for
                 a multiprocessor and concludes that none are really
                 successful.''",
  remark-3 =     "This paper has a good discussion of the issues in
                 generating independent, nonoverlapping, and
                 reproducible, random number streams in parallel
                 computations.",
}

@Article{Eichenauer-Herrmann:1990:LSN,
  author =       "J. Eichenauer-Herrmann and H. Grothe and H.
                 Niederreiter and A. Topuzo{\u{g}}lu",
  title =        "On the lattice structure of a nonlinear generator with
                 modulus $ 2^\alpha $",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "81--85",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90338-Z",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Dec 26 13:13:40 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090338Z",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Eichenauer-Herrmann:1990:PLC,
  author =       "J. Eichenauer-Herrmann and A. Topuzo{\u{g}}lu",
  title =        "On the period length of congruential pseudorandom
                 number sequences generated by inversions",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "87--96",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90339-2",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903392",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "inversive congruential generators; period length;
                 pseudorandom number sequences",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Eichenauer-Herrmann:1990:UBB,
  author =       "J. Eichenauer-Herrmann and H. Grothe",
  title =        "Upper bounds for the {Beyer} ratios of linear
                 congruential generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "73--80",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90337-Y",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  MRclass =      "65C10",
  MRnumber =     "1068150 (91i:65011)",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Random numbers and simulation (Lambrecht, 1988)",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090337Y",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Ermakov:1990:LTT,
  author =       "S. M. Ermakov and V. V. Dovgal",
  title =        "Limit theorems for the {Tausworthe} randomizer",
  journal =      "Vestnik Leningradskogo Universiteta. Matematika",
  volume =       "23",
  number =       "1",
  pages =        "105--106",
  month =        "????",
  year =         "1990",
  CODEN =        "????",
  ISSN =         "0024-0850",
  bibdate =      "Fri Jan 6 10:56:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxpages =      "62--63",
}

@InCollection{Etzion:1990:PRA,
  author =       "T. Etzion",
  title =        "On Pseudo-Random Arrays Constructed from Patterns with
                 Distinct Differences",
  crossref =     "Capocelli:1990:SCC",
  pages =        "195--207",
  year =         "1990",
  bibdate =      "Thu Feb 23 17:28:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Faure:1990:UPR,
  author =       "H. Faure",
  title =        "Using permutations to reduce discrepancy",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "97--103",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Feb 28 09:07:09 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputapplmath1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903406",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@InProceedings{Filippone:1990:VLS,
  author =       "Salvatore Filippone and Paolo Santangelo and Marcello
                 Vitaletti",
  title =        "A vectorized long-period shift-register random number
                 generator",
  crossref =     "IEEE:1990:PSN",
  pages =        "676--684",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/SUPERC.1990.130085",
  bibdate =      "Wed Apr 15 18:34:48 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A pseudo-random number generator, based on a
                 linear-feedback shift-register sequence, is presented.
                 The very long period of the generator, $ 2^{1279} - 1
                 $, makes it useful in modern statistical simulations
                 where the shorter period of other generators could
                 either be exhausted during a single run or determine
                 departures from uniform randomness when generating
                 positions in a multidimensional space. In particular,
                 the proposed generator overcomes the limitations of
                 multiplicative-congruential generators with modulus $
                 2^{31} - 1 $, which are widely used on computers with a
                 32-bit integer word size, such as the IBM S/370 family
                 of computers. In this paper the properties of
                 linear-feedback shift-register sequences are shortly
                 reviewed and a sequence of order $ p = 1279 $ is
                 proposed as a source of pseudorandom numbers. The
                 production rule, by itself recursive, is efficiently
                 vectorized on existing pipelined vector processors, due
                 to the large distance between the feedback positions
                 and the positions to be generated. The algorithm may be
                 implemented in FORTRAN and may be easily ported on
                 computers with different word-lengths. Using a
                 vectorized FORTRAN implementation of the algorithm on
                 the IBM 3090 model E Vector Facility, a rate of about
                 6.5 million normalized random numbers per second
                 (Mrands) is achieved. A rate of about 3 Mrands is
                 obtained by an implementation of the algorithm on the
                 IBM RISC/6000 model 530. Simple statistical tests have
                 shown the superiority of the proposed generator with
                 respect to the widely used multiplicative-congruential
                 generator with modulus $ M = 2^{31} - 1 $ and
                 multiplier $ A = 75 $.",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods); C5440
                 (Multiprocessor systems and techniques); C6130 (Data
                 handling techniques); C7310 (Mathematics)",
  corpsource =   "IBM Eur. Center for Sci. and Eng. Comput., Rome,
                 Italy",
  keywords =     "digital arithmetic; linear-feedback shift-register
                 sequence; pseudorandom number generator; random number
                 generation; shift register algorithm; shift registers;
                 statistical simulations; statistical test results;
                 vectorization; vectorized long-period shift-register
                 random number generator",
  sponsororg =   "IEEE; ACM; Lawrence Livermore Nat. Lab.; Los Alamos
                 Nat. Lab.; NASA Ames Res. Center; Nat. Center Atmos.
                 Res.; NSF; SIAM; Supercomput. Res. Center",
  treatment =    "P Practical; X Experimental",
}

@Article{Fishman:1990:MCR,
  author =       "George S. Fishman",
  title =        "Multiplicative Congruential Random Number Generators
                 with Modulus $ 2^\beta $: An Exhaustive Analysis for $
                 \beta \simeq 32 $ and a Partial Analysis for $ \beta
                 \simeq 48 $",
  journal =      j-MATH-COMPUT,
  volume =       "54",
  number =       "189",
  pages =        "331--344",
  month =        jan,
  year =         "1990",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91e:65012",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2008698",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "exhaustive analysis; multiplicative congruential
                 random number generators; optimal maximal; parallel
                 hyperplanes; partial analysis; period multipliers;
                 random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Flury:1990:ARS,
  author =       "Bernard D. Flury",
  title =        "Acceptance-Rejection Sampling Made Easy",
  journal =      j-SIAM-REVIEW,
  volume =       "32",
  number =       "3",
  pages =        "474--476",
  month =        sep,
  year =         "1990",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1032082",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65C05",
  MRnumber =     "91i:65007",
  bibdate =      "Sat Mar 29 09:54:45 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/32/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  abstract =     "A simple proof, consisting of three lemmas, is given
                 for the acceptance-rejection method in Monte Carlo
                 sampling from a density f. The proof is valid for
                 random variables in general dimension, for bounded as
                 well as for unbounded support, and it is not affected
                 by discontinuities or infinite peaks of f.",
  acknowledgement = ack-nhfb,
  affiliation =  "Indiana Univ",
  affiliationaddress = "Bloomington, IN, USA",
  classification = "723; 922",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Acceptance-Rejection Sampling; Computer Simulation;
                 Mathematical Statistics--Monte Carlo Methods; Random
                 Variable Generation; Sampling; Stochastic Simulation",
  onlinedate =   "September 1990",
}

@Article{Fruit:1990:PRN,
  author =       "Robert Fruit",
  title =        "A Pseudo-Random Number Generator",
  journal =      j-CUJ,
  volume =       "8",
  number =       "5",
  pages =        "83--??",
  month =        may,
  year =         "1990",
  CODEN =        "????",
  ISSN =         "0898-9788",
  bibdate =      "Fri Aug 30 16:52:23 MDT 1996",
  bibsource =    "http://www.cuj.com/cbklist.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "C Users Journal",
}

@Article{Fushimi:1990:RNG,
  author =       "Masanori Fushimi",
  title =        "Random number generation with the recursion {$ X_t =
                 X_{t - 3p} \oplus X_{t - 3q} $}",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "105--118",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90341-V",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090341V",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "generalized feedback shift register (GFSR) algorithm;
                 M-sequence; multidimensional uniformity; statistical
                 tests",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
  remark-2 =     "See \cite{Ripley:1990:TPN} for a new implementation of
                 Fushimi's GFSR generator that reduces array storage
                 from $8 P$ to $3 P$ (where $P = 521$ is related to the
                 generator period, $2^P$).",
  remark-3 =     "Fushima points out some errors in
                 \cite{Lewis:1973:GFS} that caused later authors to
                 reject GFSR generators. Fushima improves the randomness
                 of the Lewis and Payne generator, and speeds up its
                 initialization by a factor of 250. Tests with a C
                 translation of Ripley's variant of the Fushima/Saito
                 Fortran code show that the generator is fast, and
                 capable of passing all of the Diehard Battery suite,
                 except for a small p value (0.000005) for the
                 OVERLAPPING SUMS tests when only the top bit of each
                 word is used to produce a random bit stream.",
}

@Article{Gentle:1990:CIR,
  author =       "James E. Gentle",
  title =        "Computer Implementation of Random Number Generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "119--125",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90342-W",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Aug 09 07:17:37 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments \cite{Sezgin:1992:SCC}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090342W",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "computer programming; Fortran; linear congruential
                 generator; numerical analysis; random number
                 generation; vector processors",
  remark-1 =     "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
  remark-2 =     "This article has a good discussion of the problems of
                 implementing LCGs in Fortran on various platforms. It
                 treats six different ways of computing $((A x + c)
                 \bmod M)$, and shows that only two of them are
                 portable. It also discusses vectorization issues, with
                 powers $A^1, A^2, \ldots{}, A^K$, all $\bmod M$,
                 precomputed and then used with vector instructions to
                 produce a vector of K random numbers. Finally, it
                 points out that simply dividing the result by $M$ may
                 not be sufficient to guarantee uniform values in $[0,
                 1)$.",
}

@Article{Gleason:1990:ETI,
  author =       "John M. Gleason",
  title =        "Empirical Tests of the Intrinsic Pseudorandom Number
                 Generator on {IBM}-Compatible Microcomputers",
  journal =      j-COMPUT-METH-PROG-BIOMED,
  volume =       "33",
  number =       "3",
  pages =        "171--174",
  month =        dec,
  year =         "1990",
  CODEN =        "CMPBEK",
  DOI =          "https://doi.org/10.1016/0169-2607(90)90039-C",
  ISSN =         "0169-2607 (print), 1872-7565 (electronic)",
  ISSN-L =       "0169-2607",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Methods and Programs in Biomedicine",
}

@Article{Goldreich:1990:NCI,
  author =       "Oded Goldreich",
  title =        "A note on computational indistinguishability",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "6",
  pages =        "277--281",
  day =          "28",
  month =        may,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion Computer Science Dep",
  affiliationaddress = "Haifa, Isr",
  classification = "723; 922; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Technion, Haifa, Israel",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Computational Complexity; computational complexity;
                 Computational Indistinguishability; computational
                 indistinguishability; Computer Metatheory; Computer
                 Programming--Algorithms; efficiently constructible
                 distributions; Mathematical Statistics--Random Number
                 Generation; Pseudorandom Generators; pseudorandom
                 generators; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goldreich:1990:SPD,
  author =       "Oded Goldreich and Hugo Krawczyk",
  title =        "Sparse Pseudorandom Distributions (Extended
                 Abstract)",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "435",
  pages =        "113--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:59 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0435.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0435/04350113.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0435/04350113.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Golland:1990:BRB,
  author =       "Ronald W. Golland",
  title =        "Book Review: {{\booktitle{Principles of Random Variate
                 Generation}} by John Dagpunar}",
  journal =      j-TECHNOMETRICS,
  volume =       "32",
  number =       "2",
  pages =        "226--227",
  month =        may,
  year =         "1990",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.2307/1268875",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 13:19:39 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i254341;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1990.bib",
  URL =          "http://www.jstor.org/stable/1268875",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html",
}

@Article{Granville:1990:NTR,
  author =       "V. Granville and J.-P. Rasson",
  title =        "A new type of random permutations generator to
                 simulate random images",
  journal =      j-COMPUT-STAT-Q,
  volume =       "6",
  number =       "1",
  pages =        "55--64",
  year =         "1990",
  CODEN =        "CSQUEM",
  ISSN =         "0723-712X",
  ISSN-L =       "0723-712X",
  MRclass =      "65C10 (65C20)",
  MRnumber =     "1085834",
  bibdate =      "Thu Jun 18 18:49:37 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "CSQ---Computational Statistics Quarterly",
}

@InProceedings{Haastad:1990:PRG,
  author =       "J. H{\aa}stad",
  title =        "Pseudo-random generators under uniform assumptions",
  crossref =     "ACM:1990:PTS",
  pages =        "395--404",
  year =         "1990",
  bibdate =      "Wed Feb 20 18:33:59 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/stoc/100216/p395-hastad/",
  acknowledgement = ack-nhfb,
}

@PhdThesis{Hildebrand:1990:RCS,
  author =       "M. Hildebrand",
  title =        "Rates of convergence of some random processes on
                 finite groups",
  type =         "{Ph.D.} dissertation",
  school =       "Department of Mathematics, Harvard University",
  address =      "Cambridge, MA, USA",
  year =         "1990",
  bibdate =      "Sat Mar 03 14:25:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hormann:1990:AMG,
  author =       "Wolfgang H{\"o}rmann and Gerhard Derflinger",
  title =        "The {ACR} method for generating normal random
                 variables",
  journal =      "OR Spektrum: Quantitative approaches in management",
  volume =       "12",
  number =       "??",
  pages =        "181--185",
  month =        "????",
  year =         "1990",
  ISSN =         "0171-6468 (print), 1436-6304 (electronic)",
  ISSN-L =       "0171-6468",
  bibdate =      "Thu Feb 23 17:32:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hortensius:1990:CAC,
  author =       "P. D. Hortensius and R. D. McLeod and B. W. Podaima",
  title =        "Cellular automata circuits for built-in self-test",
  journal =      j-IBM-JRD,
  volume =       "34",
  number =       "2/3",
  pages =        "389--405",
  month =        mar # "\slash " # may,
  year =         "1990",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Tue Mar 25 14:26:59 MST 1997",
  bibsource =    "http://www.research.ibm.com/journal/;
                 https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Results are presented for a variation on a built-in
                 self-test (BIST) technique based upon a distributed
                 pseudorandom number generator derived from a
                 one-dimensional cellular automata array. These cellular
                 automata logic block observation circuits provide an
                 alternative to conventional design for testability
                 circuitry. The issue of generating probabilistically
                 weighted test patterns for use in built-in self-test is
                 also addressed. The methodology presented considers the
                 suitability of incorporating structures based on
                 cellular automata, a strategy which, in general,
                 improves test pattern quality. Thus, these structures
                 qualify as attractive candidates for use in weighted
                 test pattern generator design. The analysis involved in
                 determining and statistically evaluating these
                 potential models is discussed, and is compared with
                 that for previous as well as statistically independent
                 models. Relevant signature analysis properties for
                 elementary one-dimensional cellular automata are also
                 discussed. It is found that cellular automata with
                 cyclic-group rules provide signature analysis
                 properties comparable to those of the linear feedback
                 shift register. The results presented are based upon
                 simulation.",
  acknowledgement = ack-nhfb,
  affiliation =  "Div. of IBM Res., Thomas J Watson Res. Centre,
                 Yorktown Heights, NY, USA",
  classcodes =   "B1265B (Logic circuits); B2570 (Semiconductor
                 integrated circuits); C5120 (Logic and switching
                 circuits); C7410D (Electronic engineering); C4220
                 (Automata theory)",
  classification = "B1265B (Logic circuits); B2570 (Semiconductor
                 integrated circuits); C4220 (Automata theory); C5120
                 (Logic and switching circuits); C7410D (Electronic
                 engineering)",
  corpsource =   "Div. of IBM Res., Thomas J Watson Res. Centre,
                 Yorktown Heights, NY, USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  keywords =     "automata; automata logic block observation circuits;
                 automatic testing; Built-in self-test; built-in
                 self-test; cellular; cellular arrays; Cellular automata
                 logic block observation circuits; circuitry;
                 Cyclic-group rules; cyclic-group rules; distributed
                 pseudorandom number; Distributed pseudorandom number
                 generator; finite automata; generator; integrated
                 circuit testing; one-dimensional cellular;
                 One-dimensional cellular automata; One-dimensional
                 cellular automata array; one-dimensional cellular
                 automata array; Probabilistically weighted test
                 patterns; probabilistically weighted test patterns;
                 Signature analysis properties; signature analysis
                 properties; Simulation; simulation; testability;
                 Testability circuitry",
  thesaurus =    "Automatic testing; Cellular arrays; Finite automata;
                 Integrated circuit testing",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Ito:1990:MCS,
  author =       "N. Ito and Y. Kanada",
  title =        "{Monte Carlo} simulation of the {Ising} model and
                 random number generation on the vector processor",
  crossref =     "IEEE:1990:PSN",
  pages =        "753--763",
  year =         "1990",
  bibdate =      "Wed Apr 15 18:34:48 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "A0250 (Probability theory, stochastic processes, and
                 statistics); A0260 (Numerical approximation and
                 analysis); A0270 (Computational techniques); A0550
                 (Lattice theory and statistics; A7510H (Ising and other
                 classical spin models); A7540M (Numerical simulation
                 studies); C7310 (Mathematics); C7320 (Physics and
                 Chemistry); Ising problems)",
  corpsource =   "Tokyo Univ., Japan",
  keywords =     "ferromagnetic Ising models; HITAC S820/80; Ising
                 model; maximum simulation speed; Monte Carlo methods;
                 Monte Carlo simulation; parallel processing; physics
                 computing; pipeline processing; random number
                 generation; simple cubic lattice; two-dimensional Ising
                 model; vector processor; vectorizable algorithm",
  sponsororg =   "IEEE; ACM; Lawrence Livermore Nat. Lab.; Los Alamos
                 Nat. Lab.; NASA Ames Res. Center; Nat. Center Atmos.
                 Res.; NSF; SIAM; Supercomput. Res. Center",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ito:1990:RNG,
  author =       "N. Ito and Y. Kanada",
  title =        "Random number generation on a vector processor",
  journal =      j-SUPERCOMPUTER,
  volume =       "7",
  number =       "1",
  pages =        "29--35",
  month =        jan,
  year =         "1990",
  CODEN =        "SPCOEL",
  ISSN =         "0168-7875",
  bibdate =      "Wed Mar 18 08:37:01 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Phys., Fac. of Sci., Tokyo Univ., Japan",
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Phys., Fac. of Sci., Tokyo Univ., Japan",
  fjournal =     "Supercomputer",
  keywords =     "Fortran codes; HITAC S820/80; parallel algorithms;
                 pseudo-random generator; random number generation;
                 random numbers; Tausworthe type; vector processor;
                 vectorizable algorithm",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{James:1990:RPN,
  author =       "F. James",
  title =        "A review of pseudorandom number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "60",
  number =       "3",
  pages =        "329--344",
  month =        oct,
  year =         "1990",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(90)90032-V",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu May 20 19:20:18 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559090032V",
  abstract =     "This is a brief review of the current situation
                 concerning practical pseudorandom number generation for
                 Monte Carlo calculations. The conclusion is that
                 pseudorandom number generators with the required
                 properties are now available, but the generators
                 actually used are often not good enough. Portable
                 Fortran code is given for three different pseudorandom
                 number generators, all of which have much better
                 properties than any of the traditional generators
                 commonly supplied in most program libraries.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Jansen:1990:SFS,
  author =       "Cees J. A. Jansen and Dick E. Boekee",
  title =        "The Shortest Feedback Shift Register that Can Generate
                 a Given Sequence",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "435",
  pages =        "90--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:59 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0435.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0435/04350090.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0435/04350090.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Joe:1990:RLR,
  author =       "S. Joe",
  title =        "Randomization of lattice rules for numerical multiple
                 integration",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "2",
  pages =        "299--304",
  day =          "31",
  month =        aug,
  year =         "1990",
  CODEN =        "JCAMDI",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Sat Feb 25 12:20:46 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputapplmath1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090172V",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Johnson:1990:SDC,
  author =       "Bruce R. Johnson and David J. Leeming",
  title =        "A study of the digits of $ \pi $, $e$, and certain
                 other irrational numbers",
  journal =      j-SANKHYA-B,
  volume =       "52",
  number =       "2",
  pages =        "183--189",
  month =        "????",
  year =         "1990",
  CODEN =        "SANBBV",
  ISSN =         "0976-8386 (print), 0976-8394 (electronic)",
  ISSN-L =       "0976-8386",
  bibdate =      "Fri Jul 01 10:43:38 2011",
  bibsource =    "http://sankhya.isical.ac.in/index.html;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The first 100,000 digits in the decimal expansions of
                 $ \pi $, $e$, $ \sqrt {2} $, $ \sqrt {3} $, $ \sqrt {5}
                 $, $ \sqrt {7} $, $ \sqrt {11} $ and $ \sqrt {13} $
                 were investigated for properties of randomness. Using a
                 measure of randomness based on several different runs
                 statistics, the decimal expansions of these irrational
                 numbers behaved very much like random sequences when
                 compared to the outputs of two popular random number
                 generators. Also, for a better understanding of power,
                 the measure of randomness was evaluated for several
                 different kinds of nonrandom digit sequences.",
  acknowledgement = ack-nhfb,
  fjournal =     "Sankhy{\=a} (Indian Journal of Statistics), Series B.
                 Methodological",
  remark =       "The authors report statistics for the randomness of
                 the first 100,000 digits of $ \pi $, $e$, $ \sqrt {2}
                 $, $ \sqrt {3} $, $ \sqrt {5} $, $ \sqrt {7} $, $ \sqrt
                 {11} $, and $ \sqrt {13} $, and show that the digits of
                 $ \pi $ and $ \sqrt {7} $ appear to be more random than
                 those from \texttt{urand()} and \texttt{c05dyf()}.",
  xxnote =       "The journal Web site does not have an online form of
                 this article.",
}

@Article{Just:1990:IRA,
  author =       "Bettina Just",
  title =        "Integer Relations Among Algebraic Numbers",
  journal =      j-MATH-COMPUT,
  volume =       "54",
  number =       "189",
  pages =        "467--477",
  month =        jan,
  year =         "1990",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11R04 (11Y40 68Q25 68Q40)",
  MRnumber =     "90e:11154",
  MRreviewer =   "A. K. Lenstra",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 B0250 (Combinatorial mathematics); C4130 (Interpolation
                 and function approximation); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Johann Wolfgang Goethe-Univ., Frankfurt, West
                 Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "algebraic numbers; Euclidean length; integer
                 relations; minimal polynomial; number theory;
                 polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kao:1990:RNG,
  author =       "Chiang Kao",
  title =        "On a Random-Number Generator for Microcomputers:
                 Reply",
  journal =      j-J-OPER-RES-SOC,
  volume =       "41",
  number =       "12",
  pages =        "1193--1193",
  month =        dec,
  year =         "1990",
  CODEN =        "OPRQAK",
  ISSN =         "0160-5682 (print), 1476-9360 (electronic)",
  ISSN-L =       "0160-5682",
  bibdate =      "Wed Feb 29 22:36:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See
                 \cite{Kao:1989:RNG,Sezgin:1990:RNG,Clementson:1991:CRN,Kao:1991:CRN}.",
  URL =          "http://www.jstor.org/stable/2583127",
  acknowledgement = ack-nhfb,
  fjournal =     "OR: the journal of the Operational Research Society",
}

@Article{Kelton:1990:BRB,
  author =       "W. David Kelton",
  title =        "Book Review: {{\booktitle{Principles of Random Variate
                 Generation}} (John Dagpunar)}",
  journal =      j-SIAM-REVIEW,
  volume =       "32",
  number =       "3",
  pages =        "508--511",
  month =        "????",
  year =         "1990",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1032107",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Sat Mar 29 09:54:45 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/32/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "September 1990",
}

@Article{Kemp:1990:BRB,
  author =       "C. David Kemp",
  title =        "Book Review: {{\booktitle{Principles of Random Variate
                 Generation}}, by J. Dagpunar}",
  journal =      j-J-R-STAT-SOC-SER-D-STATISTICIAN,
  volume =       "39",
  number =       "4",
  pages =        "472--473",
  month =        "????",
  year =         "1990",
  CODEN =        "????",
  DOI =          "https://doi.org/10.2307/2349098",
  ISSN =         "0039-0526 (print), 1467-9884 (electronic)",
  ISSN-L =       "0039-0526",
  bibdate =      "Thu Jan 22 18:10:23 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i316129;
                 https://www.math.utah.edu/pub/tex/bib/jrss-d-1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2349098",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series D
                 (The Statistician)",
  journal-URL =  "http://www.jstor.org/journals/00390526.html",
}

@Article{Kemp:1990:NAG,
  author =       "C. D. Kemp",
  title =        "New algorithms for generating {Poisson} variates",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "133--137",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90344-Y",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 07:48:09 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090344Y",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark-1 =     "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
  remark-2 =     "From the abstract: ``The paper discusses three
                 recently-developed algorithms for generating
                 Poisson($\lambda$) random variates in situations where
                 $\lambda$ may vary between calls.''",
}

@Article{Kemp:1990:PRA,
  author =       "A. W. Kemp",
  title =        "Patchwork rejection algorithms",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "127--131",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90343-X",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090343X",
  abstract =     "New methods for implementing rejection algorithms are
                 suggested. The objectives are to avoid the generation
                 of unwanted envelope variates, to use fewer
                 pseudorandom uniform variates, and to bypass as far as
                 possible the need to decide whether to accept or to
                 reject. Considerably fewer than two uniforms on
                 average, per attempted output of a target random
                 variable, can be achieved, together with an increased
                 acceptance rate. The generation of tail variates from a
                 normal distribution is used as illustration.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "acceptance--rejection algorithm; patchwork rejection;
                 pseudorandom number; unit square partition",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Kinderman:1990:CCG,
  author =       "A. J. Kinderman and J. G. Ramage",
  title =        "Correction: Computer Generation of Normal Random
                 Variables",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "85",
  number =       "409",
  pages =        "272--272",
  month =        mar,
  year =         "1990",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Wed Jan 25 08:06:11 MST 2012",
  bibsource =    "http://www.jstor.org/journals/01621459.html;
                 http://www.jstor.org/stable/i314293;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kinderman:1976:CGN} and further correction
                 \cite{Tirler:2004:EKR}.",
  URL =          "http://www.jstor.org/stable/2289582",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Korolev:1990:ADR,
  author =       "V. Yu. Korolev",
  title =        "Approximation of Distributions of Random Sums of
                 Independent Random Variables by Mixtures of Normal
                 Laws",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "34",
  number =       "3",
  pages =        "523--531",
  month =        "????",
  year =         "1990",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1134062",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60F05",
  MRnumber =     "91e:60070",
  MRreviewer =   "Zdzis{\l}aw Rychlik",
  bibdate =      "Tue Apr 1 10:40:25 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/34/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 34}(3), (1989), pp. 581--588.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1990",
  xxtitle =      "Approximation of distributions of sums of a random
                 number of independent random variables by mixtures of
                 normal laws",
}

@Article{Koutras:1990:TCN,
  author =       "M. Koutras",
  title =        "Two Classes of Numbers Appearing in the Convolution of
                 Binomial-Truncated {Poisson} and {Poisson}-Truncated
                 Binomial Random Variables",
  journal =      j-FIB-QUART,
  volume =       "28",
  number =       "4",
  pages =        "321--333",
  month =        nov,
  year =         "1990",
  CODEN =        "FIBQAU",
  ISSN =         "0015-0517",
  ISSN-L =       "0015-0517",
  bibdate =      "Thu Oct 20 18:01:27 MDT 2011",
  bibsource =    "http://www.fq.math.ca/28-4.html;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.fq.math.ca/Scanned/28-4/koutras.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Fib. Quart",
  fjournal =     "Fibonacci Quarterly",
  journal-URL =  "http://www.fq.math.ca/",
}

@Article{Krawczyk:1990:HPC,
  author =       "Hugo Krawczyk",
  title =        "How to Predict Congruential Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "435",
  bookpages =    "xiii + 634",
  pages =        "138--153",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISBN =         "0-387-97317-6 (NY), 3-540-97317-6 (Berlin)",
  ISBN-13 =      "978-0-387-97317-3 (NY), 978-3-540-97317-1 (Berlin)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.9.A25 C79 1989",
  bibdate =      "Wed Aug 11 15:15:00 2004",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0435.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0435/04350138.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0435/04350138.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Lagarias:1990:PNG,
  author =       "J. C. Lagarias",
  title =        "Pseudorandom number generators in cryptography and
                 number theory",
  crossref =     "Pomerance:1990:CCNb",
  pages =        "115--143",
  year =         "1990",
  MRclass =      "11K45 (11T71 68P25 94A60)",
  MRnumber =     "1095554 (92f:11109)",
  MRreviewer =   "Kevin S. McCurley",
  bibdate =      "Fri Sep 17 09:26:34 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Abridged and revised version of
                 \cite{Lagarias:1990:PNG}.",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:1990:RNS,
  author =       "Pierre L'Ecuyer",
  title =        "Random Numbers for Simulation",
  journal =      j-CACM,
  volume =       "33",
  number =       "10",
  pages =        "85--97",
  month =        oct,
  year =         "1990",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/84537.84555",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Jan 09 09:23:42 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/84555.html",
  acknowledgement = ack-nhfb,
  annote =       "This paper gives a survey of the pros and cons of
                 pseudo-RNGs.",
  descriptors =  "RNG; RVG; survey; method",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf I.6.3}:
                 Computing Methodologies, SIMULATION AND MODELING,
                 Applications.",
}

@Article{LEcuyer:1990:UVW,
  author =       "P. L'Ecuyer",
  title =        "A Unified View of the {WA}, {SF}, and {LR} Gradient
                 Estimation Techniques",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "36",
  number =       "??",
  pages =        "1364--1383",
  month =        "????",
  year =         "1990",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{Levitan:1990:PNG,
  author =       "Yu. L. Levitan and I. M. Sobol",
  title =        "On a pseudorandom number generator for personal
                 computers",
  journal =      "Matematicheskoe Modelirovanie",
  volume =       "2",
  number =       "8",
  pages =        "119--126",
  month =        "????",
  year =         "1990",
  CODEN =        "????",
  ISSN =         "0234-0879",
  bibdate =      "Fri Dec 30 09:02:14 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lutz:1990:PSB,
  author =       "Jack H. Lutz",
  title =        "Pseudorandom sources for {BPP}",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "41",
  number =       "3",
  pages =        "307--320",
  month =        dec,
  year =         "1990",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(90)90023-E",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Wed Feb 29 21:45:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002200009090023E",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
  keywords =     "class BPP of decision problems computable with bounded
                 error in probabilistic polynomial time",
}

@Article{Macomber:1990:DUR,
  author =       "James H. Macomber and Charles S. White",
  title =        "An $n$-Dimensional Uniform Random Number Generator
                 Suitable for {IBM}-Compatible Microcomputers",
  journal =      j-INTERFACES,
  volume =       "20",
  number =       "3",
  pages =        "49--59",
  year =         "1990",
  CODEN =        "INFAC4",
  DOI =          "https://doi.org/10.1287/inte.20.3.49",
  ISSN =         "0092-2102 (print), 1526-551X (electronic)",
  ISSN-L =       "0092-2102",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Interfaces",
  keywords =     "generalized feedback shift register (GFSR) generator;
                 random number; simulation",
}

@Article{Marsaglia:1990:DBR,
  author =       "George Marsaglia and B. Narasimhan and Arif Zaman",
  title =        "The distance between random points in rectangles",
  journal =      j-COMMUN-STAT-THEORY-METH,
  volume =       "19",
  number =       "11",
  pages =        "4199--4212",
  year =         "1990",
  CODEN =        "CSTMDC",
  DOI =          "https://doi.org/10.1080/03610929008830437",
  ISSN =         "0361-0926 (print), 1532-415X (electronic)",
  ISSN-L =       "0361-0926",
  MRclass =      "60D05 (62E15)",
  MRnumber =     "92b:60015",
  bibdate =      "Wed Jan 27 05:38:53 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/communstattheorymeth1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0731.60012",
  abstract =     "Consider two oriented rectangles in $ {\bbfR }^2 $
                 with sides parallel to the x and y axes, possibly
                 overlapping or even coincident; choose a point randomly
                 and uniformly in each rectangle. This paper describes a
                 method for finding the distribution function for the
                 random distance between the points. The required
                 density is described as a sum of elementary integrals
                 whose computation is then reduced to evaluations of one
                 particular function. For this a Fortran program is
                 described. Several special cases are treated more
                 specifically.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Theory and Methods",
  journal-URL =  "http://www.tandfonline.com/loi/lsta20",
  keywords =     "Fortran program; random distance between the points",
  ZMclass =      "60D05 Geometric probability 60-04 Machine computation,
                 programs (probability theory)",
  ZMreviewer =   "W. J. Firey (Corvallis)",
}

@Article{Marsaglia:1990:RNG,
  author =       "George Marsaglia and B. Narasimhan and Arif Zaman",
  title =        "A random number generator for {PC}'s",
  journal =      j-COMP-PHYS-COMM,
  volume =       "60",
  number =       "3",
  pages =        "345--349",
  month =        oct,
  year =         "1990",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(90)90033-W",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  MRclass =      "65C10",
  MRnumber =     "1 076 268",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559090033W",
  ZMnumber =     "0997.65510",
  abstract =     "It is now possible to do serious scientific work on
                 personal computers (PC's). Many simulation studies,
                 whether exploratory or for production runs, call for
                 random numbers. We offer here a new kind of random
                 number generator with implementation tailored
                 specifically for PC's using Intel 8088/8086 or
                 80286/80386 processors. A floating-point coprocessor is
                 not required or even useful for the generator,
                 although, of course, a coprocessor may help other parts
                 of a simulation. The generator has an extremely long
                 period --- some $ 2^{1407} $ --- requires only 43
                 stored values and uses only one arithmetic operation:
                 subtraction. It is one of a new class of generators
                 that we have recently developed. They are called
                 add-with-carry and subtract-with-borrow generators.
                 Related to lagged-Fibonacci generators, the new class
                 has an interesting underlying theory, astonishingly
                 long periods and provable uniformity for full
                 sequences. This article describes a machine language
                 subroutine that provides 32-bit random integers as well
                 as uniform (single precision) reals with standard
                 24-bit fractions.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  ZMclass =      "65C10 Random number generation",
}

@Article{Marsaglia:1990:TUR,
  author =       "George Marsaglia and Arif Zaman and Wai Wan Tsang",
  title =        "Toward a universal random number generator",
  journal =      j-STAT-PROB-LETT,
  volume =       "9",
  number =       "1",
  pages =        "35--39",
  year =         "1990",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(90)90092-L",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "65C10",
  MRnumber =     "91a:65008",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/QLD/1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0692.65001",
  abstract-1 =   "This paper presents a ``universal'' random number
                 generator that is able to produce the same sequence of
                 random variables in a wide variety of computers and
                 that passes some tests of randomness and independence.
                 The generator combines two different generators: a
                 lagged-Fibonacci generator $F(97,33.\cdot)$ and a
                 simple arithmetic sequence for the prime modulus
                 $2^{24}-3$. Results of a randomness test are presented
                 and a Fortran implementation of the generator is
                 suggested.",
  abstract-2 =   "This article describes an approach towards a random
                 number generator that passes all of the stringent tests
                 for randomness we have put to it, and that is able to
                 produce exactly the same sequence of uniform random
                 variables in a wide variety of computers, including
                 TRS80, Apple, Mackintosh, Commodore, Kaypro, IBM PC,
                 AT, PC and AT clones, Sun, Vax, IBM 360/370, 3090,
                 Amdahl, CDC Cyber and even 205 ETA supercomputers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
  keywords =     "arithmetic sequence; Fortran implementation;
                 independence test; lagged-Fibonacci generator;
                 randomness test; universal random number generator",
  ZMclass =      "65C10 Random number generation",
  ZMreviewer =   "K. Uosaki",
}

@Article{Maurer:1990:PLR,
  author =       "Ueli M. Maurer and James L. Massey",
  title =        "Perfect Local Randomness in Pseudo-random Sequences",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "435",
  pages =        "100--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:59 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0435.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0435/04350100.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0435/04350100.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Micali:1990:EPR,
  author =       "Silvio Micali and Claus-Peter Schnorr",
  title =        "Efficient, Perfect Random Number Generators",
  crossref =     "Goldwasser:1990:ACC",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "173--198",
  year =         "1990",
  bibdate =      "Thu Feb 23 10:25:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We describe a method that transforms every perfect
                 random number generator into one that can be
                 accelerated by parallel evaluation. Our method of
                 parallelization is perfect, $m$ parallel processors
                 speed the generation of pseudo-random bits by a factor
                 $m$; these parallel processors need not to communicate.
                 Using sufficiently many parallel processors we can
                 generate pseudo-random bits with nearly any speed.
                 These parallel generators enable fast retrieval of
                 substrings of very long pseudo-random strings.
                 Individual bits of pseudo-random strings of length $
                 10^{20} $ can be accessed within a few seconds. We
                 improve and extend the RSA-random number generator to a
                 polynomial generator that is almost as efficient as the
                 linear congruential generator. We question the
                 existence of polynomial random number generators that
                 are perfect and use a prime modulus.",
  acknowledgement = ack-nhfb,
}

@Article{Mitchell:1990:EEA,
  author =       "Ricardo A. Mitchell",
  title =        "Error estimates arising from certain pseudorandom
                 sequences in a quasi-random search method",
  journal =      j-MATH-COMPUT,
  volume =       "55",
  number =       "191",
  pages =        "289--297",
  month =        jul,
  year =         "1990",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91b:65007",
  MRreviewer =   "Kazuo Goto",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008806.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C4110 (Error
                 analysis in numerical methods)",
  corpsource =   "Dept. of Math., West Indies Univ., Jamaica",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "denseness for; dispersion; error analysis; error
                 estimates; method; number-theoretic results;
                 pseudorandom sequences; quasi-random search; random
                 number generation; sequences",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mitchell:1990:NKG,
  author =       "Douglas W. Mitchell",
  title =        "Nonlinear Key Generators",
  journal =      j-CRYPTOLOGIA,
  volume =       "14",
  number =       "4",
  pages =        "350--354",
  month =        oct,
  year =         "1990",
  CODEN =        "CRYPE6",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Fri Mar 15 09:01:38 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "key generators; nonlinear generation; key sequences;
                 chaos-based approach; simulations; desirable
                 properties",
  abstract =     "A method of nonlinear generation of key sequences is
                 shown. While D. Wheeler (1989), has shown R. Matthews'
                 (1989), earlier chaos-based approach to have potential
                 pitfalls, the present method is shown-in part via
                 simulations-to be invulnerable to Wheeler's criticisms
                 and to have various other desirable properties",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "cryptography; digital simulation; random number
                 generation",
  romanvolume =  "XIV",
}

@TechReport{Morris:1990:NLM,
  author =       "Alfred H. {Morris, Jr.}",
  title =        "{NSWC} Library of Mathematics Subroutines",
  type =         "Report",
  number =       "NSWC TR 90-21",
  institution =  "Naval Surface Warfare Center",
  address =      "Dahlgren, VA 22448-5000, USA; Silver Spring, MD
                 20903-5000, USA",
  pages =        "xii + 492 + 9",
  month =        jan,
  year =         "1990",
  bibdate =      "Tue Jun 13 08:47:19 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also later edition \cite{Morris:1993:NLM}.",
  URL =          "https://apps.dtic.mil/sti/citations/ADA476840;
                 https://apps.dtic.mil/sti/pdfs/ADA476840.pdf;
                 https://people.math.sc.edu/Burkardt/f_src/nswc/nswc.f90;
                 https://people.math.sc.edu/Burkardt/f_src/nswc/nswc.html",
  abstract =     "The NSWC library is a library of general-purpose
                 Fortran subroutines that provide a basic computational
                 capability in a variety of mathematical activities and
                 emphasis has been placed on the transportability of the
                 codes. Subroutines are available in the following areas
                 Elementary Operations, Geometry, Special Functions,
                 Polynomials, Vectors, Matrices, Large Dense Systems of
                 Linear Equations, Banded Matrices, Sparse Matrices,
                 Eigenvalues and Eigenvectors, Solution of Linear
                 Equations, Least-Squares Solution of Linear Equations,
                 Optimization, Transforms, Approximation of Functions,
                 Curve Fitting, Surface Fitting, Manifold Fitting,
                 Numerical Integration, Integral Equations,
                 Ordinary--Differential Equations, Partial Differential
                 Equations, and Random Number Generation.",
  acknowledgement = ack-nhfb,
  remark =       "The single Fortran 90 file of 99,021 nonblank lines
                 compiles into a library of 905 distinct functions and
                 subroutines: the source code appears to contain 139
                 functions and 762 subroutines (901 total entry
                 points).

                 The tableofcontents values in this entry is derived
                 from optical character recognition (OCR) of the 8-page
                 listing from the PDF files, with editorial correction
                 of spelling and OCR errors, and matching of uppercase
                 software names against the entry points of the compiled
                 library. There are about five names in the PDF table of
                 contents that disagree with subroutine names in the
                 source code: they have been edited here to reflect the
                 correct code names. There are numerous routine names in
                 the compiled library that are not mentioned in the
                 table of contents.",
  tableofcontents = "Introduction / 1 \\
                 \\
                 Elementary Operations \\
                 \\
                 Machine Constants --- SPMPAR, DPMPAR, IPMPAR / 3 \\
                 Sorting Lists --- ISHELL, SHELL, AORD, RISORT, SHELL2,
                 DSORT, DAORD, DISORT, DDSORT / 5 \\
                 Cube Root --- CBRT, DCBRT / 7 \\
                 Four Quadrant Arctangent --- ARTNQ, DARTNQ / 7 \\
                 Length of a Two-Dimensional Vector --- CPABS, DCPABS /
                 7 \\
                 Reciprocal of a Complex Number --- CREC, DCREC / 9 \\
                 Square Root of a Double Precision Complex Number ---
                 DCSQRT / 9 \\
                 Conversion of Polar to Cartesian Coordinates --- POCA /
                 11 \\
                 Conversion of Cartesian to Polar Coordinates --- CAPO /
                 11 \\
                 Rotation of Axes --- ROTA / 11 \\
                 Planar Givens Rotations --- SROTG, DROTG / 13 \\
                 Three Dimensional Rotations --- ROT3 / 15 \\
                 Rotation of a Point on the Unit Sphere to the North
                 Pole --- CONSTR / 17 \\
                 Hyperbolic Sine and Cosine Functions --- SNHCSH / 19
                 \\
                 Exponentials --- REXP, DREXP / 21 \\
                 Logarithms --- ALNREL, RLOG, RLOG1, DLNREL, DRLOG,
                 DRLOG1 / 23 \\
                 \\
                 Geometry \\
                 \\
                 Determining if a Point is Inside or Outside a Polygon
                 --- LOCPT / 25 \\
                 The Convex Hull for a Finite Planar Set --- HULL / 27
                 \\
                 Areas of Planar Polygons --- PAREA / 29 \\
                 Hamiltonian Circuits --- HC / 31 \\
                 \\
                 Special Functions \\
                 \\
                 Error Function --- CERF, CERFC, ERF, ERFC, ERFC1,
                 DCERF, DCERFC, DERF, DERFC, DERFC1 / 35 \\
                 Inverse Error Function --- ERFINV / 41 \\
                 Normal Probability Distribution Function --- PNDF / 43
                 \\
                 Inverse Normal Probability Distribution Function ---
                 PNINV / 45 \\
                 Dawson's Integral --- DAWSON / 47 \\
                 Complex Fresnel Integral --- CFRNLI / 49 \\
                 Real Fresnel Integrals --- FRESNEL / 51 \\
                 Exponential Integral Function --- CEXPLI, EXPLI, DEI,
                 DEI1 / 53 \\
                 Sine and Cosine Integral Functions --- SI, CIN / 57 \\
                 Dilogarithm Function --- CLI, ALI / 59 \\
                 Gamma Function --- CGAMMA, GAMMA, GAMLN, DCGAMA,
                 DGAMMA, DGAMLN / 61 \\
                 Diganma Function --- CPSI, PSI, DCPSI, DPSI / 65 \\
                 Logarithm of the Beta Function --- BETALN, DBETLN / 67
                 \\
                 Incomplete Gamma Ratio Functions --- GRATIO, RCOMP / 69
                 \\
                 Inverse Incomplete Gamma Ratio Function --- GAMINV / 71
                 \\
                 Incomplete Beta Function --- BRATIO, ISUBX, BRCOMP / 73
                 \\
                 Bessel Function $J_\nu(z)$ --- CBSSLJ, BSSLJ, BESJ / 75
                 \\
                 Bessel Function $Y_\nu(z)$ --- BSSLY / 77 \\
                 Modified Bessel Function $I_\nu(z)$ --- BSSLI, BESI /
                 79 \\
                 Modified Bessel Function $K_\nu(z)$ --- CBSSLK, BSSLK /
                 81 \\
                 Airy functions --- CAI, CBI, AI, AIE, BI, BIE / 83 \\
                 Complete Complex Elliptic Integrals of the First and
                 Second Kinds --- CK, CKE / 87 \\
                 Real Elliptic Integrals of the First and Second Kinds
                 --- ELLPI, RFVAL, RDVAL, DELLPI, DRFVAL, DRDVAL / 91
                 \\
                 Real Elliptic Integrals of the Third Kind --- EPI,
                 RJVAL, DEPI, DRJVAL / 95 \\
                 Jacobian Elliptic Functions --- ELLPF, ELPFC1 / 99 \\
                 Weierstrass Elliptic Function for the Equianharmonic
                 and Lemniscatic Cases --- PEQ, PEQ1, PLEM, PLEM1 / 103
                 \\
                 Integral of the Bivariate Density Function over
                 Arbitrary Polygons and Semi-infinite Angular Regions
                 --- VALR2 / 107 \\
                 Circular Coverage Function --- CIRCV / 109 \\
                 Elliptical Coverage Function --- PKILL, PKILL3 / 111
                 \\
                 \\
                 Polynomials \\
                 \\
                 Copying Polynomials --- PLCOPY, DPCOPY / 113 \\
                 Addition of Polynomials --- PADD, DPADD / 115 \\
                 Subtraction of Polynomials --- PSUBT, DPSUBT / 117 \\
                 Multiplication of Polynomials --- PMULT, DPMULT / 119
                 \\
                 Division of Polynomials --- PDIV, DPDIV / 121 \\
                 Real Powers of Polynomials --- PLPWR, DPLPWR / 123 \\
                 Inverses of Power Series --- PINV, DPINV / 125 \\
                 Derivatives and Integrals of Polynomials --- MPLNMV /
                 127 \\
                 Evaluation of Chebyshev Expansions --- CSEVL, DCSEVL /
                 129 \\
                 Lagrange Polynomials --- LGRNGN, LGRNGV, LGRNGX / 131
                 \\
                 Orthogonal Polynomials on Finite Sets --- ORTHOS,
                 ORTHOV, ORTHOX / 133 \\
                 \\
                 Solutions of Nonlinear Equations \\
                 \\
                 Zeros of Continuous Functions --- ZEROIN / 135 \\
                 Solution, of Systems of Nonlinear Equations --- HBRD /
                 137 \\
                 Solutions of Quadratic, Cubic, and Quartic Equations
                 --- QDCRT, CBCRT, QTCRT, DQDCRT, DCBCRT, DQTCRT / 139
                 \\
                 Double Precision Roots of Polynomials --- DRPOLY,
                 DCPOLY / 141 \\
                 Accuracy of the Roots of a Real Polynomial --- RBND /
                 143 \\
                 \\
                 Vectors \\
                 \\
                 Copying Vectors --- SCOPY, DCOPY, CCOPY / 145 \\
                 Interchanging Vectors --- SSWAP, DSWAP, CSWAP / 147 \\
                 Planar Rotation of Vectors --- SROT, DROT, CSROT / 149
                 \\
                 Dot Products of Vectors --- SDOT, DDOT, CDOTC, CDOTU /
                 151 \\
                 Scaling Vectors --- SSCAL, DSCAL, CSCAL, CSSCAL / 153
                 \\
                 Vector Addition --- SAXPY, DAXPY, CAXPY / 155 \\
                 $L_1$ Norm of a Vector-- SASUM, DASUM, SCASUM / 157 \\
                 $L_2$ Norm of a Vector --- SNRM2, DNRM2, SCNRM2 / 159
                 \\
                 $L_\infty$ Norm of a Vector --- ISAMAX, IDAMAX, ICAMAX
                 / 161 \\
                 \\
                 Matrices \\
                 \\
                 Packing and Unpacking Symmetric Matrices --- MCVFS,
                 DMCVFS, MCVSF, DMCVSF / 163 \\
                 Conversion of Real Matrices to and from Double
                 Precision Form --- MCVRD, MCVDR / 165 \\
                 Storage of Real Matrices in the Complex Matrix Format
                 --- MCVRC / 167 \\
                 The Real and Imaginary Parts of a Complex Matrix ---
                 CMREAL, CMIMAG / 169 \\
                 Copying Matrices --- MCOPY, SMCOPY, DMCOPY, CMCOPY /
                 171 \\
                 Computation of the Conjugate of a Complex Matrix ---
                 CMCONJ / 173 \\
                 Transposing Matrices --- TPOSE, DTPOSE, CTPOSE, TIP,
                 DTIP, CTIP / 175 \\
                 Computing Adjoints of Complex Matrices --- CMADJ,
                 CTRANS / 177 \\
                 Matrix Addition --- MADD, SMADD, DMADD, CMADD / 179 \\
                 Matrix Subtraction --- MSUBT, SMSUBT, DMSUBT, CMSUBT /
                 181 \\
                 Matrix Multiplication-- MTMS, DMTMS, CMTMS, MPROD,
                 DMPROD, CMPROD / 183 \\
                 Product of a Packed Symmetric Matrix and a Vector ---
                 SVPRD, DSVPRD / 185 \\
                 Transpose Matrix Products --- TMPROD / 187 \\
                 Symmetric Matrix Products --- SMPROD / 189 \\
                 Kronecker Product of Matrices --- KPROD, DKPROD, CKPROD
                 / 191 \\
                 Inverting General Real Matrices and Solving General
                 Systems of Real Linear Equations --- CROUT, KROUT,
                 NPIVOT, MSLV, DSMSLV / 193 \\
                 Solutions of Real Equations with Iterative Improvement
                 --- SLVMP / 197 \\
                 Solution of Almost Block Diagonal Systems of Linear
                 Equations --- ARCECO, ARCESL / 199 \\
                 Solution of Almost Block Tridiagonal Systems of Linear
                 Equations --- BTSLV / 201 \\
                 Inverting Symmetric Real Matrices and Solving Symmetric
                 Systems of Real Linear Equations --- SMSLV, DSMSLV /
                 203 \\
                 Inverting Positive Definite Symmetric Matrices and
                 Solving Positive Definite Symmetric Systems of Linear
                 Equations --- PCHOL, DPCHOL / 207 \\
                 Solution of Toeplitz Systems of Linear Equations ---
                 TOPLX, DTOPLX / 209 \\
                 Inverting General Complex Matrices and Solving General
                 Systems of Complex Linear Equations --- CMSLV, CMSLV1,
                 DCMSLV / 211 \\
                 Solution of Complex Equations with Iterative
                 Improvement --- CSLVMP / 215 \\
                 Singular Value Decomposition of a Matrix --- SSVDC,
                 DSVDC, CSVDC / 217 \\
                 Evaluation of the Characteristic Polynomial of a Matrix
                 --- DET, DPDET, CDET / 219 \\
                 Solution of the Matrix Equation $A X + X B = C$ ---
                 ABSLV, DABSLV / 221 \\
                 Solution of the Matrix Equation $A^t X + X B = C$ when
                 $C$ is Symmetric --- TASLV, DTASLV / 223 \\
                 Solution of the Matrix Equation $A X^2 + X B + C = 0$
                 --- SQUINT / 225 \\
                 Exponential of a Real Matrix --- MEXP, DMEXP / 227 \\
                 \\
                 Large Dense Systems of Linear Equations \\
                 \\
                 Solving systems of 200--400 Linear Equations --- LE,
                 DPLE, CLE / 229 \\
                 \\
                 Banded Matrices \\
                 \\
                 Band Matrix Storage / 231 \\
                 Conversion of Banded Matrices to and from the Standard
                 Format --- CVBR, CVBC, CVRB, CVCB, CVRB1, CVCB1 / 233
                 \\
                 Conversion of Banded Matrices to and from Sparse Form
                 --- MCVBS, CMCVBS, MCVSB, CMCVSB / 235 \\
                 Transposing Banded Matrices --- BPOSE, CBPOSE / 237 \\
                 Addition of Banded Matrices --- BADD, CBADD / 239 \\
                 Subtraction of Banded Matrices --- BSUBT, CBSUBT / 241
                 \\
                 Multiplication of Banded Matrices --- BPROD, CBPROD /
                 243 \\
                 Product of a Real Banded Matrix and Vector --- BVPRD,
                 BVPRD1, BTPRD, BTPRD1 / 245 \\
                 Product of a Complex Banded Matrix and Vector ---
                 CBVPD, CBVPD1, CBTPD, CBTPD1 / 247 \\
                 Solution of Banded Systems of Real Linear Equations ---
                 BSLV, BSLV1 / 249 \\
                 Solution of Banded Systems of Complex Linear Equations
                 --- CBSLV, CBSLV1 / 251 \\
                 \\
                 Sparse Matrices \\
                 \\
                 Storage of Sparse Matrices / 253 \\
                 Conversion of Sparse Matrices to and from the Standard
                 Format --- CVRS, CVDS, CVCS, CVSR, CVSD, CVSC / 255 \\
                 Conversion of Sparse Real Matrices to and from Double
                 Precision Form --- SCVRD, SCVDR / 257 \\
                 The Real and Imaginary Parts of a Sparse Complex Matrix
                 --- CSREAL, CSIMAG / 259 \\
                 \\
                 Computing $A + i D$ for Sparse Real Matrices $A$ and
                 $B$ --- SCVRC / 261 \\
                 Copying Sparse Matrices --- RSCOPY, DSCOPY, CSCOPY /
                 263 \\
                 Computing Conjugates of Sparse Complex Matrices ---
                 SCONJ / 265 \\
                 Transposing Sparse Real Matrices --- RPOSE, RPOSE1 /
                 267 \\
                 Transposing Sparse Double Precision Matrices --- DPOSE,
                 DPOSE1 / 269 \\
                 Transposing Sparse Complex Matrices --- CPOSE, CPOSE1 /
                 271 \\
                 Addition of Sparse Matrices --- SADD, DSADD, CSADD /
                 273 \\
                 Subtraction of Sparse Matrices --- SSUBT, DSSUBT,
                 CSSUBT / 275 \\
                 Multiplication of Sparse Matrices --- SPROD, DSPROD,
                 CSPROD / 277 \\
                 Product of a Real Sparse Matrix and Vector --- MVPRD,
                 MVPRD1, MTPRD, MTPRD1 / 279 \\
                 Product of a Double Precision Sparse Matrix and Vector
                 --- DVPRD, DVPRD1, DTPRD, DTPRD1 / 281 \\
                 Product of a Complex Sparse Matrix and Vector ---
                 CVPRD, CVPRD1, CTPRD, CTPRD1 / 283 \\
                 Ordering the Rows of a Sparse Matrix by Increasing
                 Length --- SPORD / 285 \\
                 Reordering Sparse Matrices into Block Triangular Form
                 --- BLKORD / 287 \\
                 Solution of Sparse Systems of Real Linear Equations ---
                 SPSLV, RSLV, TSLV / 289 \\
                 Double Precision Solution of Sparse Systems of Real
                 Linear Equations --- DSPSLV, DSLV, DTSLV / 293 \\
                 Solution of Sparse Systems of Complex Linear Equations
                 --- CSPSLV, CSLV, CTSLV / 297 \\
                 \\
                 Eigenvalues and Eigenvectors \\
                 \\
                 Computation of Eigenvalues of General Real Matrices ---
                 EIG, EIG1 / 301 \\
                 Computation of Eigenvalues and Eigenvectors of General
                 Real Matrices --- EIGV, EIGV1 / 303 \\
                 Double Precision Computation of Eigenvalues of Real
                 Matrices --- DEIG / 305 \\
                 Double Precision Computation of Eigenvalues and
                 Eigenvectors of Real Matrices --- DEIGV / 307 \\
                 Computation of Eigenvalues of Symmetric Real Matrices
                 --- SEIG, SEIG1 / 309 \\
                 Computation of Eigenvalues and Eigenvectors of
                 Symmetric Real Matrices --- SEIGV, SEIGV1 / 311 \\
                 Computation of Eigenvalues of Complex Matrices --- CEIG
                 / 313 \\
                 Computation of Eigenvalues and Eigenvectors of Complex
                 Matrices --- CEIGV / 315 \\
                 Double Precision Computation of Eigenvalues of Complex
                 Matrices --- DCEIG / 317 \\
                 Double Precision Computation of Eigenvalues and
                 Eigenvectors of Complex Matrices --- DCEIGV / 319 \\
                 \\
                 $\ell_1$ Solution of Linear Equations \\
                 \\
                 $\ell_1$ Solution of Systems of Linear Equations with
                 Equality and Inequality Constraints --- CL1 / 321 \\
                 \\
                 Least Squares Solution of Linear Equations \\
                 \\
                 Least Squares Solution of Systems of Linear Equations
                 --- LLSQ, HFTI, HFTI2 / 323 \\
                 Least Squares Solution of Overdetermined Systems of
                 Linear Equations with Iterative Improvement --- LLSQMP
                 / 327 \\
                 Double Precision Least Squares Solution of Systems of
                 Linear Equations --- DLLSQ, DHFTI, DHFTI2 / 329 \\
                 Least Squares Solution of Systems of Linear Equations
                 with Equality and Inequality Constraints --- LSEI / 333
                 \\
                 Least Squares Solution of Systems of Linear Equations
                 with Equality and Nonnegativity Constraints --- WNNLS /
                 337 \\
                 Least Squares Iterative Improvement Solution of Systems
                 of Linear Equations with Equality Constraints --- L2SLV
                 / 341 \\
                 Iterative Least Squares Solution of Banded Linear
                 Equations --- BLSQ / 345 \\
                 Iterative Least Squares Solution of Sparse Linear
                 Equations --- SPLSQ, STLSQ / 347 \\
                 \\
                 Optimization \\
                 \\
                 Minimization of Functions of a Single Variable --- FMIN
                 / 349 \\
                 Minimization of Functions of n Variables --- OPTF / 351
                 \\
                 Unconstrained Minimum of the Sum of Squares of
                 Nonlinear Functions --- LMDIFF / 353 \\
                 Linear Programming --- SMPLX, SSPLX / 355 \\
                 The Assignment Problem --- ASSGN / 359 \\
                 $0$--$1$ Knapsack Problem --- MKP / 361 \\
                 \\
                 Transforms \\
                 \\
                 Inversion of the Laplace Transform --- LAINV / 363 \\
                 Fast Fourier Transform --- FFT, FFT1 / 367 \\
                 Multivariate Fast Fourier Transform --- MFFT, MFFT1 /
                 369 \\
                 Discrete Cosine and Sine Transforms --- COSQI, COSQB,
                 COSQF, SINQB, SINQF / 371 \\
                 \\
                 Approximation of Functions \\
                 \\
                 Rational Minimax Approximation of Functions --- CHEBY /
                 375 \\
                 $L_p$ Approximation of Functions --- ADAPT / 377 \\
                 Calculation of the Taylor Series of a Complex Analytic
                 Function --- CPSC, DCPSC / 381 \\
                 \\
                 Curve Fitting \\
                 \\
                 Linear Interpolation --- TRP / 385 \\
                 Lagrange Interpolation --- LTRP / 387 \\
                 Hermite Interpolation --- HTRP / 389 \\
                 Conversion of Real Polynomials from Newton to Taylor
                 Series Form --- PCOEFF / 391 \\
                 Least Squares Polynomial Fit --- PFIT / 393 \\
                 Weighted Least Squares Polynomial Fit --- WPFIT / 395
                 \\
                 Cubic Spline Interpolation --- CBSPL, SPLIFT / 397 \\
                 Weighted Least Squares Cubic Spline Fitting --- SPFIT /
                 399 \\
                 Cubic Spline Evaluation --- SCOMP, SCOMP1, SCOMP2 / 401
                 \\
                 Cubic Spline Evaluation and Differentiation --- SEVAL,
                 SEVAL1, SEVAL2 / 403 \\
                 Integrals of Cubic Splines --- CSINT, CSINT1, CSINT2 /
                 405 \\
                 N-Dimensional Cubic Spline Closed Curve Fitting ---
                 CSLOOP, LOPCMP, LOPDF / 407 \\
                 Spline under Tension Interpolation --- CURV1 / 409 \\
                 Spline under Tension Evaluation --- CURV2 / 411 \\
                 Differentiation and Integration of Splines under
                 Tension --- CURVD, CURVI / 413 \\
                 Two Dimensional Spline under Tension Curve Fitting ---
                 KURV1, KURV2 / 415 \\
                 Two Dimensional Spline under Tension Closed Curve
                 Fitting --- KURVP1, KURVP2 / 417 \\
                 Three Dimensional Spline under Tension Curve Fitting
                 --- QURV1, QURV2 / 419 \\
                 B-Splines / 421 \\
                 Piecewise Polynomial Interpolation --- BSTRP / 423 \\
                 Conversion of Piecewise Polynomials from B-Spline to
                 Taylor Series Form --- BSPP / 425 \\
                 Piecewise Polynomial Evaluation --- PPVAL / 427 \\
                 Weighted Least Squares Piecewise Polynomial Fitting ---
                 BSL2 / 429 \\
                 \\
                 Surface Fitting over Rectangular Grids \\
                 \\
                 Bi-Splines under Tension / 431 \\
                 Bi-Spline under Tension Surface Interpolation --- SURF
                 / 433 \\
                 Bi-Spline under Tension Evaluation --- SURF2, NSURF2 /
                 435 \\
                 \\
                 Surface Fitting over Arbitrarily Positioned Data Points
                 \\
                 \\
                 Surface Interpolation for Arbitrarily Positioned Data
                 Points --- BVIP, BVIP2 / 437 \\
                 \\
                 Manifold Fitting \\
                 \\
                 Weighted Least Squares Fitting with Polynomials of $n$
                 Variables --- MFIT, DMFIT, MEVAL, DMEVAL / 441 \\
                 \\
                 Numerical Integration \\
                 \\
                 Evaluation of Integrals over Finite Intervals --- QAGS,
                 QSUBA, DQAGS / 445 \\
                 \\
                 Evaluation of Integrals over Infinite Intervals ---
                 QAGI, DQAGI / 449 \\
                 Evaluation of Double Integrals over Triangles ---
                 CUBTRI / 453 \\
                 \\
                 Integral Equations \\
                 \\
                 Solution of Fredholm Integral Equations of the Second
                 Kind --- IESLV / 455 \\
                 \\
                 Ordinary Differential Equations/Initial Value Problems
                 \\
                 \\
                 The Initial Value Solvers --- Introductory Comments /
                 459 \\
                 Adaptive Adams Solution of Nonstiff Differential
                 Equations --- ODE / 461 \\
                 Adaptive RKF Solution of Nonstiff Differential
                 Equations --- RKF45 / 465 \\
                 Adaptive RKF Solution of Nonstiff Differential
                 Equations with Global Error Estimation --- GERK / 469
                 \\
                 Adaptive Solution of Stiff Differential Equations ---
                 SFODE, SFODE1 / 473 \\
                 Fourth-Order Runge-Kutta --- RK / 477 \\
                 Eighth-Order Runge-Kutta --- RK8 / 479 \\
                 \\
                 Partial Differential Equations \\
                 \\
                 Separable Second-Order Elliptic Equations on
                 Rectangular Domains --- SEPDE / 481 \\
                 \\
                 Random Number Generation \\
                 \\
                 Uniform Random Number Generator --- URNG / 485 \\
                 Gaussian Random Number Generator using the
                 Box--M{\"u}ller Transformation --- NRNG / 487 \\
                 \\
                 Appendix. Installation of the NSWC Library / 489 \\
                 \\
                 Index / 491 \\
                 \\
                 Distribution",
}

@Article{Naor:1990:BCU,
  author =       "Moni Naor",
  title =        "Bit Commitment Using Pseudo-randomness (Extended
                 Abstract)",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "435",
  pages =        "128--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:59 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0435.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0435/04350128.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0435/04350128.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Naor:1990:SPS,
  author =       "Joseph Naor and Moni Naor",
  booktitle =    "Proceedings of the {22nd Annual ACM Symposium on
                 Theory of Computing (May 14--16 1990: Baltimore, MD,
                 USA)}",
  title =        "Small-bias probability spaces. Efficient constructions
                 and applications",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "viii + 574",
  pages =        "213--223",
  year =         "1990",
  ISBN =         "0-89791-361-2",
  ISBN-13 =      "978-0-89791-361-4",
  LCCN =         "QA75.5 .A14",
  bibdate =      "Sat Jan 25 17:38:12 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We show how to efficiently construct a small
                 probability space on n binary random variables such
                 that for every subset, its parity is either zero or one
                 with `almost' equal probability. They are called
                 \$epsilon@-biased random variables. The number of
                 random bits needed to generate the random variables is
                 O(log n + log 1/\$epsilon@). Thus, if \$epsilon is
                 polynomially small, then the size of the sample space
                 is also polynomial. \$epsilon@-biased random variables
                 can be used to construct `almost' k-wise independent
                 random variables where \$epsilon is a function of k.
                 Applications are shown to derandomization of
                 algorithms, reducing the number of random bits required
                 by certain randomized algorithms, exhaustive testing of
                 combinatorial circuits, communication complexity and
                 construction of hash functions.",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "721; 723; 922",
  conference =   "Proceedings of the 22nd Annual ACM Symposium on Theory
                 of Computing",
  conferenceyear = "1990",
  keywords =     "Communication Complexity; Computer
                 Programming--Algorithms; Data Processing--Data
                 Structures; Hash Functions; Logic Circuits,
                 Combinatorial--Testing; Probabilistic Algorithms;
                 Probability; Probability Spaces; Random Processes;
                 Randomized Algorithms",
  meetingabr =   "Proc 22nd Annu ACM Symp Theory Comput",
  meetingaddress = "Baltimore, MD, USA",
  meetingdate =  "May 14--16 1990",
  meetingdate2 = "05/14--16/90",
  sponsor =      "ACM Special Interest Group for Automata and
                 Computability Theory (SIGACT); IEEE Computer Soc, Los
                 Alamitos, CA, USA",
}

@Article{Niederreiter:1990:CAP,
  author =       "Harald Niederreiter",
  title =        "Combinatorial approach to probabilistic results on the
                 linear-complexity profile of random sequences",
  journal =      j-J-CRYPTOLOGY,
  volume =       "2",
  number =       "2",
  pages =        "105--112",
  month =        "????",
  year =         "1990",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60 (65C10)",
  MRnumber =     "91g:94018",
  MRreviewer =   "Jozef Vysko{\v{c}}",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Austrian Acad of Sciences, Inst for Information
                 Processing",
  affiliationaddress = "Vienna, Austria",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Complexity Profile; Cryptography; Linear Complexity;
                 Mathematical Statistics--Random Number Generation;
                 Probability--Random Processes",
}

@Article{Niederreiter:1990:LBD,
  author =       "Harald Niederreiter",
  title =        "Lower bounds for the discrepancy of inversive
                 congruential pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "55",
  number =       "191",
  pages =        "277--287",
  month =        jul,
  year =         "1990",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91e:65016",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2008805.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Inst. for Inf. Processing, Austrian Acad. of Sci.,
                 Vienna, Austria",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "admissible parameters; inversive congruential
                 pseudorandom numbers; lower bounds; random number
                 generation; statistical independence properties",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niederreiter:1990:PNG,
  author =       "Harald Niederreiter",
  title =        "Pseudorandom numbers generated from shift register
                 sequences",
  journal =      j-LECT-NOTES-MATH,
  volume =       "1452",
  pages =        "165--177",
  year =         "1990",
  CODEN =        "LNMAA2",
  DOI =          "https://doi.org/10.1007/BFb0096988",
  ISBN =         "3-540-53408-3 (print), 3-540-46864-1 (e-book)",
  ISBN-13 =      "978-3-540-53408-2 (print), 978-3-540-46864-6
                 (e-book)",
  ISSN =         "0075-8434 (print), 1617-9692 (electronic)",
  ISSN-L =       "0075-8434",
  bibdate =      "Fri May 9 19:07:19 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lnm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/chapter/10.1007/BFb0096988/",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/BFb0096975",
  book-URL =     "http://www.springerlink.com/content/978-3-540-46864-6",
  fjournal =     "Lecture Notes in Mathematics",
  journal-URL =  "http://link.springer.com/bookseries/304",
}

@Article{Niederreiter:1990:SIP,
  author =       "H. Niederreiter",
  title =        "Statistical independence properties of pseudorandom
                 vectors produced by matrix generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "139--151",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90345-Z",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090345Z",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@InProceedings{Nisan:1990:PGS,
  author =       "N. Nisan",
  title =        "Pseudorandom generators for space-bounded
                 computations",
  crossref =     "ACM:1990:PTS",
  pages =        "204--212",
  year =         "1990",
  bibdate =      "Wed Feb 20 18:33:59 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/stoc/100216/p204-nisan/",
  acknowledgement = ack-nhfb,
}

@Article{Norton:1990:AAE,
  author =       "G. H. Norton",
  title =        "On the Asymptotic Analysis of the {Euclidean}
                 Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "53--58",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11N64 (68Q25 68Q90)",
  MRnumber =     "91k:11088",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Centre for Commun. Res., Fac. of Eng., Bristol Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171",
  keywords =     "algorithm theory; asymptotic analysis; Euclidean
                 algorithm; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Oommen:1990:GRP,
  author =       "B. J. Oommen and D. T. H. Ng",
  title =        "On Generating Random Permutations with Arbitrary
                 Distributions",
  journal =      j-COMP-J,
  volume =       "33",
  number =       "4",
  pages =        "368--374",
  month =        aug,
  year =         "1990",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Mar 25 13:51:56 MST 1997",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/;
                 https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/368.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/369.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/370.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/371.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/372.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/373.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/374.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  classification = "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "arbitrary distributions; Arbitrary distributions;
                 generating random permutations; Generating random
                 permutations; random number generation; sorted lists;
                 Sorted lists; sorting; travelling salesman problem;
                 Travelling salesman problem",
  thesaurus =    "Random number generation; Sorting",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@TechReport{Oyanagi:1990:SPR,
  author =       "Yoshio Oyanagi and Eiichi Goto and N. Yoshida",
  title =        "Supercomputing pseudo random numbers: proposals on
                 hardware and software",
  type =         "Technical report",
  number =       "90-012",
  institution =  "University of Tokyo, Faculty of Science, Dept. of
                 Information Science",
  address =      "Tokyo, Japan",
  pages =        "6",
  month =        apr,
  year =         "1990",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "For generating pseudo random numbers according to the
                 multiplicative congruent sequence, architectural
                 (hardware) proposals are given so as to speed up
                 contemporary supercomputers. A software method for
                 elongating the period of the method is also proposed.",
  acknowledgement = ack-nhfb,
  keywords =     "Supercomputers",
}

@Article{Palmore:1990:CAC,
  author =       "J. Palmore and C. Herring",
  title =        "Computer arithmetic, chaos and fractals",
  journal =      j-PHYSICA-D,
  volume =       "42",
  number =       "1--3",
  pages =        "99--110",
  month =        jun,
  year =         "1990",
  CODEN =        "PDNPDT",
  DOI =          "https://doi.org/10.1016/0167-2789(90)90069-2",
  ISSN =         "0167-2789 (print), 1872-8022 (electronic)",
  ISSN-L =       "0167-2789",
  bibdate =      "Tue Dec 12 09:17:24 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Ninth Annual International Conference of the Center
                 for Nonlinear Studies on Self-Organizing, Collective
                 and Cooperative Phenomena in Natural and Artificial
                 Networks",
  abstract =     "The authors explore aspects of computer arithmetic
                 from the viewpoint of dynamical systems. They
                 demonstrate the effects of finite precision arithmetic
                 in three uniformly hyperbolic chaotic dynamical
                 systems: Bernoulli shifts, cat maps, and pseudorandom
                 number generators. They show that elementary
                 floating-point operations in binary computer arithmetic
                 possess an inherently fractal structure. Each of these
                 dynamical systems allows us to compare the exact
                 results in integer arithmetic with those obtained by
                 using floating-point arithmetic.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Illinois Univ., Urbana, IL, USA",
  classification = "C1160 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods)",
  confdate =     "22-26 May 1989",
  conflocation = "Los Alamos, NM, USA",
  fjournal =     "Physica. D, Nonlinear phenomena",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01672789",
  keywords =     "Bernoulli shifts; Binary computer arithmetic; Cat
                 maps; Chaos; Computer arithmetic; Dynamical systems;
                 Elementary floating-point operations; Finite precision
                 arithmetic; Floating-point arithmetic; Fractal
                 structure; Integer arithmetic; Pseudorandom number
                 generators; Self-similar structure; Uniformly
                 hyperbolic chaotic dynamical systems",
  pubcountry =   "Netherlands",
  thesaurus =    "Chaos; Digital arithmetic; Fractals; Random number
                 generation; Roundoff errors",
}

@Article{Parrish:1990:GRD,
  author =       "Rudolph S. Parrish",
  title =        "Generating random deviates from multivariate {Pearson}
                 distributions",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "9",
  number =       "3",
  pages =        "283--295",
  month =        may,
  year =         "1990",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(90)90110-4",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 10:56:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167947390901104",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Ripley:1990:TPN,
  author =       "B. D. Ripley",
  title =        "Thoughts on pseudorandom number generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "153--163",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90346-2",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903462",
  abstract =     "Much of the informal discussion at the Workshop
                 concerned the merits of different pseudorandom number
                 generators. Here we record some comments based on
                 comparing generators across a wide range of machines.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "Atari ST LCG; Bays\slash Durham shuffle for RNG output
                 randomization; discrepancy; drand48(); lattice test;
                 Lewis, Goodman and Miller LCG; linear congruential
                 generator; Los Alamos LCG; Marsaglia LCG; Payne,
                 Rabung, and Bogyo LCG; rand(); shift-register
                 generator",
  remark-1 =     "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
  remark-2 =     "Dodge \cite{Dodge:1996:NRN} quotes Ripley with this:
                 ``The whole history of pseudorandom number generation
                 is riddled with myths and extrapolations from
                 inadequate examples. A healthy dose of scepticism is
                 needed in reading the literature''",
  remark-3 =     "Ripley gives a revised Fortran version of code
                 developed by Masanori Fushimi and T. Saito that was
                 published in \cite{Fushimi:1990:RNG}. The latter
                 contains array storage with $8 P$ elements (where $P =
                 521$ is related to the generator period, $2^P$).
                 Ripley's code is somewhat shorter, and requires array
                 storage for only $3 P$ elements.",
}

@Article{Roggeman:1990:VFS,
  author =       "Yves Roggeman",
  title =        "Varying Feedback Shift Registers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "434",
  pages =        "670--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:57 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0434.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0434/04340670.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0434/04340670.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Rozovskii:1990:PLD,
  author =       "L. V. Rozovski{\u\i}",
  title =        "Probabilities of Large Deviations of Sums of
                 Independent Random Variables with Common Distribution
                 Function in the Domain of Attraction of the Normal
                 Law",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "34",
  number =       "4",
  pages =        "625--644",
  month =        "????",
  year =         "1990",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1134080",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60F10 (60F05)",
  MRnumber =     "91i:60078",
  MRreviewer =   "S. A. Book",
  bibdate =      "Tue Apr 1 10:40:28 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/34/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 34}(4), (1989), pp. 686--705.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1990",
  xxauthor =     "L. V. Rozovskii",
  xxtitle =      "Probabilities of large deviations of sums of
                 independent random variables with a common distribution
                 function that belongs to the domain of attraction of a
                 normal law",
}

@Article{Rueppel:1990:SSP,
  author =       "Rainer A. Rueppel",
  title =        "On the Security of {Schnorr}'s Pseudo Random
                 Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "434",
  pages =        "423--??",
  year =         "1990",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:01:57 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0434.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0434/04340423.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0434/04340423.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Sarno:1990:GDR,
  author =       "R. Sarno and V. C. Bhavsar and E. M. A. Hussein",
  title =        "Generation of Discrete Random Variables on Vector
                 Computers for {Monte Carlo} Simulations",
  journal =      j-INT-J-HIGH-SPEED-COMPUTING,
  volume =       "2",
  number =       "4",
  pages =        "335--350",
  month =        dec,
  year =         "1990",
  CODEN =        "IHSCEZ",
  ISSN =         "0129-0533",
  bibdate =      "Mon Feb 25 11:19:27 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of High Speed Computing
                 (IJHSC)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijhsc",
}

@Article{Schmeiser:1990:NCI,
  author =       "Bruce Schmeiser and Vorats Kachitvichyanukul",
  title =        "Noninverse correlation induction: guidelines for
                 algorithm development",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "173--180",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Jan 09 17:17:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@InProceedings{Schnorr:1990:EPR,
  author =       "C. P. Schnorr S. Micali",
  title =        "Efficient perfect random number generators",
  crossref =     "Goldwasser:1990:ACC",
  pages =        "173--??",
  year =         "1990",
  bibdate =      "Thu Dec 29 15:12:05 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxpages =      "198--??",
}

@Article{Sezgin:1990:FPU,
  author =       "Fatin Sezgin",
  title =        "On a Fast and Portable Uniform Quasi-random Number
                 Generator",
  journal =      "ACM SIGSIM Simulation Digest",
  volume =       "21",
  number =       "2",
  pages =        "30--36",
  month =        dec,
  year =         "1990",
  DOI =          "https://doi.org/10.1145/382264.382434",
  ISSN =         "0163-6103 (print), 2330-9083 (electronic)",
  ISSN-L =       "0163-6103",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/382264.382434",
  acmid =        "382434",
  ajournal =     "SIGSIM Simul. Dig.",
  pagecount =    "7",
}

@Article{Sezgin:1990:RNG,
  author =       "Fatin Sezgin",
  title =        "On a Random-Number Generator for Microcomputers",
  journal =      j-J-OPER-RES-SOC,
  volume =       "41",
  number =       "12",
  pages =        "1191--1193",
  month =        dec,
  year =         "1990",
  CODEN =        "OPRQAK",
  ISSN =         "0160-5682 (print), 1476-9360 (electronic)",
  ISSN-L =       "0160-5682",
  bibdate =      "Wed Feb 29 22:32:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See
                 \cite{Kao:1989:RNG,Kao:1990:RNG,Clementson:1991:CRN,Kao:1991:CRN}.",
  URL =          "http://www.jstor.org/stable/2583126",
  acknowledgement = ack-nhfb,
  fjournal =     "OR: the journal of the Operational Research Society",
}

@Article{Sherif:1990:DNC,
  author =       "Y. S. Sherif and R. G. Dear",
  title =        "Development of a New Composite Pseudo-Random Number
                 Generator",
  journal =      j-MICROELECT-RELIABILITY,
  volume =       "30",
  number =       "??",
  pages =        "545--553",
  month =        "????",
  year =         "1990",
  CODEN =        "MCRLAS",
  ISSN =         "0026-2714 (print), 1872-941X (electronic)",
  ISSN-L =       "0026-2714",
  bibdate =      "Thu Feb 23 17:41:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Microelectronics and Reliability",
}

@Article{Sobol:1990:QMC,
  author =       "I. M. Sobol'",
  title =        "Quasi-{Monte Carlo} Methods",
  journal =      j-PROGRESS-NUCLEAR-ENERGY,
  volume =       "24",
  number =       "??",
  pages =        "55--61",
  month =        "????",
  year =         "1990",
  CODEN =        "PNENDE",
  ISSN =         "0149-1970 (print), 1878-4224 (electronic)",
  ISSN-L =       "0149-1970",
  bibdate =      "Mon Feb 27 16:59:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Progress in Nuclear Energy",
}

@Article{Stadlober:1990:RUA,
  author =       "Ernst Stadlober",
  title =        "The ratio of uniforms approach for generating discrete
                 random variates",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "181--189",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90349-5",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 07:45:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903495",
  abstract =     "The most efficient algorithms for sampling from
                 classical discrete distributions are based upon the
                 acceptance\slash rejection principle. They are
                 complicated and not easy to understand. By adapting the
                 ratio of uniforms method to unimodal discrete
                 distributions, sampling procedures can be established,
                 which are both simple and fast. Algorithms for the
                 hypergeometric distribution are developed and compared
                 with competing methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "discrete random variate generation; hypergeometric
                 distribution; ratio of uniforms; simulation",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@InProceedings{Tezuka:1990:LSP,
  author =       "Shu Tezuka",
  title =        "Lattice Structure of Pseudorandom Sequences From
                 Shift-Register Generators",
  crossref =     "Balci:1990:WSC",
  pages =        "266--269",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/WSC.1990.129525",
  bibdate =      "Thu Feb 23 17:47:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Tezuka:1990:NFL,
  author =       "S. Tezuka",
  title =        "A New Family of Low-Discrepancy Point Sets",
  type =         "Report",
  number =       "RT-0031",
  institution =  "IBM Research, Tokyo Research Laboratory",
  address =      "Tokyo, Japan",
  month =        jan,
  year =         "1990",
  bibdate =      "Thu Feb 23 17:50:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tichy:1990:RPC,
  author =       "Robert F. Tichy",
  title =        "Random points in the cube and on the sphere with
                 applications to numerical analysis",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "191--197",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90350-9",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042790903509",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@PhdThesis{Tindo:1990:ACA,
  author =       "G. Tindo",
  title =        "Automates cellulaires: applications {\`a} la
                 mod{\'e}lisation de certains syst{\`e}mes discrets et
                 {\`a} la conception d'une architecture parall{\`e}le
                 pour la g{\'e}n{\'e}ration de suites
                 pseudo-al{\'e}atoires. ({French}) [Cellular automata:
                 applications to the modeling of certain discrete
                 systems and toward the design of a parallel
                 architecture for generation of random sequences]",
  type =         "Dissertation (thesis)",
  school =       "Universit{\'e} de Nantes",
  address =      "Nantes, France",
  year =         "1990",
  bibdate =      "Thu Feb 23 17:52:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@TechReport{Traub:1990:MCA,
  author =       "J. F. Traub and H. Wozniakowski",
  title =        "The {Monte Carlo} Algorithm with a Pseudo-Random
                 Generator",
  number =       "TR-90-039",
  institution =  "International Computer Science Institute",
  address =      "Berkeley, CA",
  month =        aug,
  year =         "1990",
  bibdate =      "Tue Mar 06 20:45:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We analyze the Monte Carlo algorithm for the
                 approximation of multivariate integrals when a
                 pseudo-random generator is used. We establish lower and
                 upper bounds on the error of such algorithms. We prove
                 that as long as a pseudo-random generator is capable of
                 producing only finitely many points, the Monte Carlo
                 algorithm with such a pseudo-random generator fails for
                 $ L_2 $ or continuous functions. It also fails for
                 Lipschitz functions if the number of points does not
                 depend on the number of variables. This is the case if
                 a linear congruential generator is used with one
                 initial seed. On the other hand, if a linear
                 congruential generator of period $m$ is used for each
                 component with independent uniformly distributed
                 initial seeds, then the Monte Carlo algorithm with such
                 a pseudo-random generator using $n$ function values
                 behaves as for the uniform distribution and its
                 expected error is roughly $ n^{-1 / 2} $ as long as the
                 number $n$ of function values is less than $ m^2 $.",
  acknowledgement = ack-nhfb,
}

@Article{vanderSteen:1990:PPG,
  author =       "A. {van der Steen}",
  title =        "Portable parallel generation of random numbers",
  journal =      j-SUPERCOMPUTER,
  volume =       "7",
  number =       "1",
  pages =        "18--20",
  month =        jan,
  year =         "1990",
  CODEN =        "SPCOEL",
  ISSN =         "0168-7875",
  bibdate =      "Wed Mar 18 08:37:01 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ACCU, Utrecht, Netherlands",
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "ACCU, Utrecht, Netherlands",
  fjournal =     "Supercomputer",
  keywords =     "parallel algorithms; parallel generation; portable;
                 random number generation; random number generator;
                 random numbers; software portability",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Velizhanin:1990:MCS,
  author =       "V. A. Velizhanin and I. G. Dyadkin and F. Kh. Enikeeva
                 and B. K. Zhuravlyov and B. E. Lukhminsky and R. T.
                 Khanatdinov",
  title =        "{Monte Carlo} simulation in nuclear geophysics --- 1.
                 {Features} of {Monte Carlo} algorithmic techniques for
                 solving problems in borehole nuclear geophysics",
  journal =      j-NUCL-GEOPHYS,
  volume =       "4",
  number =       "B12",
  pages =        "425--435, 2376",
  month =        "????",
  year =         "1990",
  ISSN =         "0969-8086 (print), 1878-6383 (electronic)",
  ISSN-L =       "0969-8086",
  bibdate =      "Fri Feb 24 13:58:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Nuclear Geophysics",
  remark =       "I cannot find (24 February 2012) any online archive of
                 this journal, which was published by Pergamon Press,
                 and was absorbed by the Elsevier journal Applied
                 Radiation and Isotopes. However, the Web site
                 http://www.sciencedirect.com/science/journal/09698043
                 for that journal only goes back to volume 44 (1993).",
}

@Article{Vinogradova:1990:ECF,
  author =       "T. R. Vinogradova",
  title =        "Estimation of Characteristic Functions of Functionals
                 of Multidimensional {Gaussian} Random Variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "34",
  number =       "2",
  pages =        "318--321",
  month =        "????",
  year =         "1990",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1134027",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60E10 (60B11)",
  MRnumber =     "91d:60039",
  MRreviewer =   "Gabriele Laue",
  bibdate =      "Tue Apr 1 10:40:21 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/34/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 34}(2), (1989), pp. 360--364.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1990",
  xxtitle =      "An estimate for the characteristic functions of
                 functionals of multidimensional {Gaussian} random
                 variables",
}

@Article{Wallace:1990:PRG,
  author =       "C. S. Wallace",
  title =        "Physically random generator",
  journal =      j-COMPUT-SYST-SCI-ENG,
  volume =       "5",
  number =       "2",
  pages =        "82--88",
  month =        apr,
  year =         "1990",
  CODEN =        "CSSEEI",
  ISSN =         "0267-6192",
  bibdate =      "Thu Feb 4 13:21:32 MST 1999",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib;
                 https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Contents1st database",
  acknowledgement = ack-nhfb,
  affiliation =  "Monash Univ",
  affiliationaddress = "Clayton, Aust",
  classification = "921; 922",
  fjournal =     "Computer Systems Science and Engineering",
  journal-URL =  "http://www.crlpublishing.co.uk/csse",
  journalabr =   "Comput Syst Sci Eng",
  keywords =     "Cryptographic Techniques; Cryptography; Mathematical
                 Statistics; Mathematical Techniques --- Algorithms;
                 true random numbers from physical sources",
}

@Article{Wang:1990:DRV,
  author =       "Y. H. Wang",
  title =        "Dependent random variables with independent subsets.
                 {II}",
  journal =      j-CAN-MATH-BULL,
  volume =       "33",
  number =       "??",
  pages =        "24--28",
  month =        "????",
  year =         "1990",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1990-004-6",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  bibdate =      "Thu Sep 8 10:05:54 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v33/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
}

@Article{Wang:1990:VDC,
  author =       "C. C. Wang and D. Pei",
  title =        "A {VLSI} design for computing exponentiations in {$
                 \mathrm {GF}(2^m) $} and its application to generate
                 pseudorandom number sequences",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "39",
  number =       "2",
  pages =        "258--262",
  month =        feb,
  year =         "1990",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.45211",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jul 7 14:19:59 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=45211",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Williamson:1990:PAN,
  author =       "R. C. Williamson and T. Downs",
  title =        "Probabilistic arithmetic. {I}. Numerical methods for
                 calculating convolutions and dependency bounds",
  journal =      j-INT-J-APPROX-REASONING,
  volume =       "4",
  number =       "2",
  pages =        "89--158",
  month =        mar,
  year =         "1990",
  CODEN =        "IJARE4",
  ISSN =         "0888-613x (print), 1873-4731 (electronic)",
  ISSN-L =       "0888-613X",
  bibdate =      "Thu Dec 14 17:20:01 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Probabilistic arithmetic involves the calculation of
                 the distribution of arithmetic functions of random
                 variables. This work on probabilistic arithmetic began
                 as an investigation into the possibility of adapting
                 existing numerical procedures to handle random
                 variables. The general idea is similar to interval
                 arithmetic and fuzzy arithmetic. The authors present a
                 new and general numerical method for calculating the
                 appropriate convolutions of a wide range of probability
                 distributions. An important feature of the method is
                 the manner in which the probability distributions are
                 represented. The authors use lower and upper discrete
                 approximations to the quantile function. This results
                 in any representation error being always contained
                 within the lower and upper bounds. This method of
                 representation has advantages over other methods
                 previously proposed. The representation fits in well
                 with the idea of dependency bounds. Stochastic
                 dependencies that arise within the course of a sequence
                 of operations on random variables are the severest
                 limit to the simple application of convolution
                 algorithms to the formation of a general probabilistic
                 arithmetic. The authors examine this dependency error
                 and show how dependency bounds are a possible means of
                 reducing its effect. Dependency bounds are lower and
                 upper bounds on the distribution of a function of
                 random variables that contain the true distribution
                 even when nothing is known of the dependence of the
                 random variables. They are based on the Frechet
                 inequalities for the joint distribution of a set of
                 random variables in terms of their marginal
                 distributions. The authors show how the dependency
                 bounds can be calculated numerically using their
                 numerical representation of probability distributions.
                 Examples of the methods developed are presented, and
                 relationships with other work on numerically handling
                 uncertainties are briefly described.",
  acknowledgement = ack-nhfb,
  affiliation =  "Queensland Univ., St. Lucia, Qld., Australia",
  classification = "C1140Z (Other and miscellaneous); C4100 (Numerical
                 analysis); C5230 (Digital arithmetic methods)",
  fjournal =     "International Journal of Approximate Reasoning",
  keywords =     "Arithmetic functions distribution; Convolutions;
                 Copula; Dependency bounds; Dependency error; Discrete
                 approximations; Frechet inequalities; Fuzzy arithmetic;
                 Interval arithmetic; Lower bound; Marginal
                 distributions; Numerical method; Probabilistic
                 arithmetic; Probability distributions; Quantile
                 function; Random variables; Representation error;
                 Spurious correlation; Stochastic dependencies;
                 Uncertainties; Upper bounds",
  pubcountry =   "USA",
  thesaurus =    "Digital arithmetic; Error analysis; Numerical methods;
                 Probability",
}

@Article{Wolff:1990:AFM,
  author =       "Ulli Wolff",
  title =        "Asymptotic freedom and mass generation in the {$ {\rm
                 O}(3) $} nonlinear $ \sigma $-model",
  journal =      j-NUCL-PHYS-B,
  volume =       "334",
  number =       "3",
  pages =        "581--610",
  day =          "23",
  month =        apr,
  year =         "1990",
  CODEN =        "NUPBBO",
  DOI =          "https://doi.org/10.1016/0550-3213(90)90313-3",
  ISSN =         "0550-3213 (print), 1873-1562 (electronic)",
  ISSN-L =       "0550-3213",
  bibdate =      "Thu Feb 16 18:38:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0550321390903133",
  acknowledgement = ack-nhfb,
  fjournal =     "Nuclear Physics B",
  journal-URL =  "http://www.sciencedirect.com/science/journal/05503213",
  remark =       "This is the original publication of the `Wolff
                 algorithm' that is cited by many papers on Monte Carlo
                 simulations, including some that discovered that
                 certain random number generators produce simulation
                 results that converge to incorrect answers.",
}

@InProceedings{Wong:1990:RNG,
  author =       "P. W. Wong",
  booktitle =    "Ninth Annual International Phoenix Conference on
                 Computers and Communications, March 21--23, 1990.
                 Proceedings",
  title =        "Random Number Generation Without Multiplication",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "xxii + 910",
  pages =        "217--221",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/PCCC.1990.101622",
  ISBN =         "0-8186-2030-7 (paperback), 0-8186-6030-9 (microfiche),
                 0-8186-9030-5 (case)",
  ISBN-13 =      "978-0-8186-2030-0 (paperback), 978-0-8186-6030-6
                 (microfiche), 978-0-8186-9030-3 (case)",
  LCCN =         "TK7885.A1 I567 1990",
  bibdate =      "Thu Mar 8 21:14:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 90CH2799-5. IEEE Computer Society
                 order number 2030.",
  acknowledgement = ack-nhfb,
}

@Article{Yeh:1990:ODT,
  author =       "Hsiaw-Chan Yeh",
  title =        "One discrete time series model for fat-tailed integer
                 random variables: {Zipf} process",
  journal =      "Bull. Inst. Math. Acad. Sinica",
  volume =       "18",
  number =       "1",
  pages =        "19--33",
  year =         "1990",
  CODEN =        "BIMSDG",
  ISSN =         "0304-9825",
  MRclass =      "60J10 (62M10)",
  MRnumber =     "1072827 (91i:60175)",
  MRreviewer =   "Ed McKenzie",
  bibdate =      "Sat Nov 12 09:13:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of the Institute of Mathematics. Academia
                 Sinica",
}

@Article{Zielinski:1990:APN,
  author =       "Ryszard Zieli{\'n}ski",
  title =        "An aperiodic pseudorandom number generator",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "31",
  number =       "1",
  pages =        "205--210",
  day =          "24",
  month =        jul,
  year =         "1990",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(90)90352-Z",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279090352Z",
  abstract =     "A pseudorandom number generator with infinite period
                 is constructed. Results of statistical tests are
                 presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "pseudorandom number generators; Pseudorandom numbers;
                 statistical test of pseudorandom numbers",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Akopov:1991:MGP,
  author =       "N. Z. Akopov and G. K. Savvidy and N. G.
                 Ter-Arutyunyan-Savvidy",
  title =        "Matrix generator of pseudorandom numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "97",
  number =       "2",
  pages =        "573--579",
  month =        dec,
  year =         "1991",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(91)90016-E",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:51 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002199919190016E",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@TechReport{Anastasio:1991:OCL,
  author =       "Thomas A. Anastasio and William W. Carlson",
  title =        "An observation on the {C} library procedure {\tt
                 random()}",
  type =         "Technical report",
  number =       "SRC-TR-91-044",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "6",
  day =          "25",
  month =        sep,
  year =         "1991",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Bit-level repetition of the sequences generated by the
                 C library procedure random() have been observed as a
                 function of seed. The effect of the repetition is that
                 there is only a small number of sequences produced by
                 the computation (random() and k), regardless of seed.
                 This report documents the observation that the number
                 of different such sequences is [formula]. The effect
                 has not been observed in drand48().",
  acknowledgement = ack-nhfb,
  keywords =     "C (Computer program language)",
}

@TechReport{Arno:1991:SDR,
  author =       "Steven Arno and Ferrell S. Wheeler",
  title =        "Signed digit representations of minimal {Hamming}
                 weight",
  type =         "Technical report",
  number =       "SRC-TR-91-046",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "18",
  month =        jul,
  year =         "1991",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A signed digit representation of an integer n in radix
                 r is a sequence of digits a = (\ldots{}, ab2s, ab1s,
                 ab0s) [formula] such that [formula]. Redundant
                 representations of this form have been used
                 successfully in several algorithmic applications.
                 Increased efficiency is usually derived from the
                 possibility of having fewer nonzero digits than the
                 standard radix r representation. Let k[subscript r](n)
                 denote the minimal Hamming weight over all signed digit
                 representations of n in radix r. In this paper, we give
                 a new on-line algorithm for computing a canonical
                 signed digit representation of minimal Hamming weight
                 for any integer n. Using combinatorial techniques on
                 the canonical representation, we compute the
                 probability distribution Pr[k[subscript r] = h], where
                 k[subscript r] is taken to be a random variable on the
                 uniform probability space of k-digit integers. Using a
                 Markov chain analysis we show that [formula]. We also
                 discuss the more general case in which the digit set
                 for the representation is some fixed subset of [0,
                 [plus or minus] 1,\ldots{},[plus or minus] (r-1)].",
  acknowledgement = ack-nhfb,
  keywords =     "Algorithms; Markov chains; Sequences (Mathematics)",
}

@Article{Bays:1991:GRN,
  author =       "Carter Bays and W. E. Sharp",
  title =        "Generating random numbers in the field",
  journal =      j-MATH-GEOL,
  volume =       "23",
  number =       "??",
  pages =        "541--548",
  month =        "????",
  year =         "1991",
  CODEN =        "MATGED",
  ISSN =         "0882-8121 (print), 1573-8868 (electronic)",
  ISSN-L =       "0882-8121",
  bibdate =      "Tue Feb 7 06:52:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Geology",
}

@Article{Berblinger:1991:MCI,
  author =       "Michael Berblinger and Christoph Schlier",
  title =        "{Monte Carlo} integration with quasi-random numbers:
                 some experience",
  journal =      j-COMP-PHYS-COMM,
  volume =       "66",
  number =       "2--3",
  pages =        "157--166",
  month =        sep # "\slash " # oct,
  year =         "1991",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(91)90064-R",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559190064R",
  abstract =     "We report on our general experience and on some test
                 calculations with quasi-random numbers of the Halton
                 type applied to Monte Carlo integration in several
                 (4--8) dimensions. Compared with the traditional use of
                 (pseudo-)random numbers we find that, at a prescribed
                 level of accuracy, at least one order of magnitude in
                 computing time may be saved even for a step function
                 integrand.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Berdnicov:1991:MCS,
  author =       "A. S. Berdnicov and S. B. Turtia",
  title =        "{Monte-Carlo} Simulation Artefacts in Physical
                 Modeling due to Pseudo-Random Generators",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "2",
  number =       "1",
  pages =        "244--249",
  month =        apr,
  year =         "1991",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183191000263",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 22:22:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/02/0201/S0129183191000263.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Bittner:1991:NSP,
  author =       "Leonhard Bittner",
  title =        "A numerical sampling problem and the {Weyl}
                 pseudorandom numbers",
  journal =      j-NUM-MATH,
  volume =       "59",
  number =       "7",
  pages =        "637--645",
  month =        oct,
  year =         "1991",
  CODEN =        "NUMMA7",
  ISSN =         "0029-599X (print), 0945-3245 (electronic)",
  ISSN-L =       "0029-599X",
  MRclass =      "65C05 (65C10 65D30)",
  MRnumber =     "92g:65004",
  MRreviewer =   "Sotiris Loukas",
  bibdate =      "Mon May 26 11:49:34 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "B0290Z (Other numerical methods); C4190 (Other
                 numerical methods); C7310 (Mathematics)",
  corpsource =   "Fachbereich Math., Greifswald Univ., Germany",
  fjournal =     "Numerische Mathematik",
  journal-URL =  "http://link.springer.com/journal/211",
  keywords =     "numerical integration; numerical methods; numerical
                 sampling problem; random number generation; rational
                 sequences; Weyl pseudorandom numbers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chambers:1991:SEM,
  author =       "W. G. Chambers and Z. D. Dai",
  title =        "Simple but effective modification to a multiplicative
                 congruential random-number generator",
  journal =      j-IEE-PROC-E,
  volume =       "138",
  number =       "3",
  pages =        "121--122",
  month =        may,
  year =         "1991",
  CODEN =        "IPETD3",
  DOI =          "https://doi.org/10.1049/ip-e.1991.0016",
  ISSN =         "0143-7062",
  bibdate =      "Thu Dec 29 09:17:01 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A popular form of random-number generator uses the
                 recurrence $ s_k = (A s_{k - 1}) \bmod 2^e $ with $A$
                 and $ s_0 $ odd to produce a pseudo-random sequence of
                 integers in the range $0$ to $ 2^e - 1 $. We give a
                 simple modification which increases the guaranteed
                 period by an enormous factor with only a small
                 computational overhead. The recurrence is changed to $
                 s_k = (A s_{k - 1} + s_{k - n}) \bmod 2^e $ where $n$
                 is such that $ x^n + x + 1 $ is a primitive binary
                 polynomial. The period is increased from $ 2^e 2 $ to $
                 (2^n - 1) 2^{e - 1} $. The overhead is an extra
                 addition and the inclusion of a circular buffer of
                 length $n$.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEE proceedings, E: Computers and digital techniques",
  journal-URL =  "https://digital-library.theiet.org/content/journals/ip-e",
}

@Article{Clementson:1991:CRN,
  author =       "Alan T. Clementson",
  title =        "A Comment on a Random-Number Generator for
                 Microcomputers",
  journal =      j-J-OPER-RES-SOC,
  volume =       "42",
  number =       "2",
  pages =        "193--193",
  month =        feb,
  year =         "1991",
  CODEN =        "OPRQAK",
  ISSN =         "0160-5682 (print), 1476-9360 (electronic)",
  ISSN-L =       "0160-5682",
  bibdate =      "Wed Feb 29 22:29:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See
                 \cite{Kao:1989:RNG,Sezgin:1990:RNG,Kao:1990:RNG,Kao:1991:CRN}.",
  URL =          "http://www.jstor.org/stable/2583193",
  acknowledgement = ack-nhfb,
  fjournal =     "OR: the journal of the Operational Research Society",
}

@Article{Compagner:1991:DR,
  author =       "Aaldert Compagner",
  title =        "Definitions of randomness",
  journal =      j-AMER-J-PHYSICS,
  volume =       "59",
  number =       "8",
  pages =        "700--705",
  month =        aug,
  year =         "1991",
  CODEN =        "AJPIAS",
  ISSN =         "0002-9505 (print), 1943-2909 (electronic)",
  ISSN-L =       "0002-9505",
  bibdate =      "Sat Sep 17 13:51:50 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://m.ajp.aapt.org/resource/1/ajpias/v59/i8/p700_s1",
  abstract =     "Randomness is a fundamental but elusive concept in
                 mathematics and physics. Even for the elementary case
                 of a random binary sequence, a generally accepted and
                 operational definition is lacking. However, when
                 ensembles are used for the foundation of probability
                 theory, randomness has to be identified with
                 uncorrelatedness, a neglected notion that yet solves
                 many puzzles surrounding randomness. In any single
                 sequence, a definite amount of correlation is
                 unavoidable. At best, the remaining correlations are of
                 high order or cover a large distance. This is the case
                 for properly defined well tempered pseudorandom
                 sequences. Reliable algorithms for the generation of
                 pseudorandom bits at rates of 1 GHz result.",
  acknowledgement = ack-nhfb,
  fjournal =     "American Journal of Physics",
  journal-URL =  "http://scitation.aip.org/content/aapt/journal/ajp",
}

@Article{Compagner:1991:HCR,
  author =       "Aaldert Compagner",
  title =        "The hierarchy of correlations in random binary
                 sequences",
  journal =      j-J-STAT-PHYS,
  volume =       "63",
  number =       "5--6",
  pages =        "883--896",
  month =        jun,
  year =         "1991",
  CODEN =        "JSTPSB",
  DOI =          "https://doi.org/10.1007/BF01029989",
  ISSN =         "0022-4715 (print), 1572-9613 (electronic)",
  ISSN-L =       "0022-4715",
  bibdate =      "Sat Aug 30 10:58:46 MDT 2014",
  bibsource =    "http://link.springer.com/journal/10955;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0022-4715&volume=63&issue=5;
                 https://www.math.utah.edu/pub/tex/bib/jstatphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01029989",
  abstract =     "The meaning of randomness is studied for the simple
                 case of binary sequences. Ensemble theory is used,
                 together with correlation coefficients of any order.
                 Conservation laws for the total amount of correlation
                 are obtained. They imply that true randomness is an
                 ensemble property and can never be achieved in a single
                 sequence. The relation with entropy is discussed for
                 different ensembles. Well-tempered pseudorandom
                 sequences turn out to be suitable sources of random
                 numbers, and practical recipes to generate them for use
                 in large-scale Monte Carlo simulations are found.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Physics",
  journal-URL =  "http://link.springer.com/journal/10955",
  keywords =     "correlation coefficients; entropy; Monte Carlo
                 calculations; random-number generation; randomness",
}

@InProceedings{Deng:1991:CRN,
  author =       "Lih-Yuan Deng and Yu-Chao Chu",
  title =        "Combining random number generators",
  crossref =     "Nelson:1991:WSC",
  pages =        "1043--1046",
  year =         "1991",
  bibdate =      "Mon Feb 27 18:08:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deng:1991:RDR,
  author =       "L. Y. Deng and C. Rousseau",
  title =        "Recent development in random number generation",
  crossref =     "Day:1991:PAA",
  pages =        "89--94",
  year =         "1991",
  bibdate =      "Thu Mar 15 17:26:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Devroye:1991:AGD,
  author =       "Luc Devroye",
  title =        "Algorithms for Generating Discrete Random Variables
                 with a Given Generating Function or a Given Moment
                 Sequence",
  journal =      j-SIAM-J-SCI-STAT-COMP,
  volume =       "12",
  number =       "1",
  pages =        "107--126",
  month =        jan,
  year =         "1991",
  CODEN =        "SIJCD4",
  ISSN =         "0196-5204",
  MRclass =      "65C10",
  MRnumber =     "91i:65009",
  bibdate =      "Tue Apr 29 19:18:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "SIAM Journal on Scientific and Statistical Computing",
  journal-URL =  "http://epubs.siam.org/loi/sijcd4",
  keywords =     "discrete random variables generating algorithms;
                 generating function; moment sequence; positive
                 integer-valued random variables; random number
                 generation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Devroye:1991:ETA,
  author =       "Luc Devroye",
  title =        "Expected Time Analysis of a Simple Recursive {Poisson}
                 Random Variate Generator",
  journal =      j-COMPUTING,
  volume =       "46",
  number =       "2",
  pages =        "165--173",
  month =        jun,
  year =         "1991",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (68Q25)",
  MRnumber =     "92c:65009",
  MRreviewer =   "I. V{\u{a}}duva",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  acknowledgement = ack-nhfb,
  classification = "723; 922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "computer metatheory; Expected Time Analysis;
                 mathematical statistics --- Random Number Generation;
                 Poisson Distribution; probability --- Random Processes;
                 Random Variate Generation; Recursive Methods",
}

@Article{Dohmann:1991:RNG,
  author =       "Birgit Dohmann and Michael Falk and Karin Lessenich",
  title =        "The random number generators of the {Turbo Pascal}
                 family",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "12",
  number =       "1",
  pages =        "129--132",
  month =        aug,
  year =         "1991",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/0167-9473(91)90108-E",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 10:58:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/016794739190108E",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
  remark =       "From the abstract: ``empirical tests could not detect
                 significant differences or defects''.",
}

@Article{Dunweg:1991:BDS,
  author =       "Burkhard D{\"u}nweg and Wolfgang Paul",
  title =        "{Brownian} Dynamics Simulations without {Gaussian}
                 Random Numbers",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "2",
  number =       "3",
  pages =        "817--827",
  month =        sep,
  year =         "1991",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183191001037",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Fri Feb 24 12:09:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/02/0203/S0129183191001037.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@TechReport{Eichenauer-Herrmann:1991:ASI,
  author =       "J. Eichenauer-Herrmann",
  title =        "On the Autocorrelation Structure of Inversive
                 Congruential Pseudorandom Number Sequences",
  number =       "1384",
  institution =  "Technische Hochschule Darmstadt, FB Mathematik",
  address =      "Darmstadt, Germany",
  pages =        "9",
  year =         "1991",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Eichenauer-Herrmann:1991:CCP,
  author =       "J. Eichenauer-Herrmann",
  title =        "Cubic Congruential Pseudorandom Numbers for
                 Simulation",
  number =       "1399",
  institution =  "Technische Hochschule Darmstadt, FB Mathematik",
  address =      "Darmstadt, Germany",
  pages =        "13",
  year =         "1991",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Eichenauer-Herrmann:1991:CIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Construction of Inversive Congruential Pseudorandom
                 Number Generators with Maximal Period Length",
  number =       "1363",
  institution =  "Technische Hochschule Darmstadt, FB Mathematik",
  address =      "Darmstadt, Germany",
  pages =        "10",
  year =         "1991",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Eichenauer-Herrmann:1991:DIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "On the discrepancy of inversive congruential
                 pseudorandom numbers with prime power modulus",
  journal =      j-MANUSCR-MATH,
  volume =       "71",
  number =       "2",
  pages =        "153--161",
  year =         "1991",
  CODEN =        "MSMHB2",
  DOI =          "https://doi.org/10.1007/BF02568399",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  MRclass =      "11K45 (11L07 65C10)",
  MRnumber =     "1101266 (92c:11081)",
  MRreviewer =   "G. Turnwald",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Manuscripta Mathematica",
}

@Article{Eichenauer-Herrmann:1991:DQC,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "On the discrepancy of quadratic congruential
                 pseudorandom numbers",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "34",
  number =       "2",
  pages =        "243--249",
  day =          "4",
  month =        apr,
  year =         "1991",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(91)90046-M",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Dec 26 13:16:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279190046M",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@TechReport{Eichenauer-Herrmann:1991:ICPa,
  author =       "J. Eichenauer-Herrmann",
  title =        "Inversive Congruential Pseudorandom Numbers: a
                 Tutorial",
  number =       "1405",
  institution =  "Technische Hochschule Darmstadt, FB Mathematik",
  address =      "Darmstadt, Germany",
  pages =        "21",
  year =         "1991",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Eichenauer-Herrmann:1991:ICPb,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Inversive congruential pseudorandom numbers avoid the
                 planes",
  journal =      j-MATH-COMPUT,
  volume =       "56",
  number =       "193",
  pages =        "297--301",
  month =        jan,
  year =         "1991",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2008543",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "91k:65021",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/2008543",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Fachbereich Math., Tech. Hochschule, Darmstadt,
                 Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "congruential pseudorandom number generators; d-space;
                 hyperplane; inversions; random number generation;
                 simulation problems",
  treatment =    "T Theoretical or Mathematical",
}

@TechReport{Eichenauer-Herrmann:1991:NIC,
  author =       "J. Eichenauer-Herrmann and H. Grothe",
  title =        "A new inversive congruential pseudorandom number
                 generator with power of two modulus",
  number =       "1392",
  institution =  "Technische Hochschule Darmstadt, FB Mathematik",
  address =      "Darmstadt, Germany",
  pages =        "13",
  year =         "1991",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Geers:1991:HEB,
  author =       "N. Geers and W. Walde",
  title =        "Highly efficient basic numerical software for
                 supercomputers",
  journal =      j-SUPERCOMPUTER,
  volume =       "8",
  number =       "6",
  pages =        "136--145",
  month =        nov,
  year =         "1991",
  CODEN =        "SPCOEL",
  ISSN =         "0168-7875",
  bibdate =      "Wed Mar 18 08:37:01 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput. Centre, Karlsruhe Univ., Germany",
  classification = "C1160 (Combinatorial mathematics); C4140 (Linear
                 algebra); C7310 (Mathematics)",
  conflocation = "Fokuoka, Japan; 6-8 Nov. 1991",
  conftitle =    "International Symposium on Supercomputing '91",
  corpsource =   "Comput. Centre, Karlsruhe Univ., Germany",
  fjournal =     "Supercomputer",
  keywords =     "fast Fourier transforms; Fujitsu vector processor
                 systems; linear algebra; mathematics computing; number
                 theory; numerical algorithms; numerical software;
                 optimization; random number generation; software
                 packages; subroutines; supercomputers",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gerasimov:1991:NOH,
  author =       "V. A. Gerasimov and B. S. Dobronets and M. Yu.
                 Shustrov",
  title =        "Numerical operations of histogram arithmetic and their
                 applications",
  journal =      j-AUTOMATION-REMOTE-CTL,
  volume =       "52",
  number =       "2",
  pages =        "83--88",
  month =        feb,
  year =         "1991",
  CODEN =        "AVTEAI",
  ISSN =         "0005-2310 (print), 2413-9777 (electronic)",
  ISSN-L =       "0005-2310",
  bibdate =      "Thu Dec 14 17:21:49 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In interval mathematics, the admissible values of the
                 variables are assumed uniformly distributed in a given
                 interval with known bounds. Interval operations are
                 applied to obtain upper and lower bounds on the
                 solution of the corresponding problem. In many applied
                 problems, however, in addition to the known bounds on
                 the admissible values of the variables, one also has
                 the distribution histograms (or probability densities)
                 of their values. In such cases, it is advisable to
                 extend the interval operations to numerical operations
                 on histograms, so as to supplement the estimated
                 intervals of output values with estimates of their
                 distribution histograms. Such problems are
                 traditionally solved by simulation methods. The authors
                 consider the main properties of numerical arithmetic
                 operations on histograms of random variables and their
                 application in control problems.",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput. Center, Acad. of Sci., Krasnoyarsk, USSR",
  classification = "C1140Z (Other and miscellaneous)",
  fjournal =     "Automation and Remote Control",
  keywords =     "Control problems; Distribution histograms; Histogram
                 arithmetic; Interval mathematics; Interval operations;
                 Numerical operations; Probability densities; Stochastic
                 processes",
  pubcountry =   "USSR",
  remark =       "English translation of: Avtomatika i Telemekhanika",
  thesaurus =    "Stochastic processes",
}

@Article{Gupta:1991:PAT,
  author =       "Anurag Gupta and Ian Akyildiz and Richard M.
                 Fujimoto",
  title =        "Performance analysis of {Time Warp} with homogeneous
                 processors and exponential task times",
  journal =      j-SIGMETRICS,
  volume =       "19",
  number =       "1",
  pages =        "101--110",
  month =        may,
  year =         "1991",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/107972.107983",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:11:17 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "The behavior of $n$ interacting processors
                 synchronized by the `Time Warp' protocol is analyzed
                 using a discrete state continuous time Markov chain
                 model. The performance and dynamics of the processes
                 are analyzed under the following assumptions:
                 exponential task times and times-tamp increments on
                 messages, each event message generates one new message
                 that is sent to a randomly selected process, negligible
                 rollback, state saving, and communication delay,
                 unbounded message buffers, and homogeneous processors
                 that are never idle. We determine the fraction of
                 processed events that commit, speedup, rollback
                 probability, expected length of rollback, the
                 probability mass function for the number of uncommitted
                 processed events, and the probability distribution
                 function for the virtual time of a process. The
                 analysis is approximate, so the results have been
                 validated through performance measurements of a Time
                 Warp testbed (PHOLD workload model) executing on a
                 shared memory multiprocessor.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Hultquist:1991:GRN,
  author =       "Paul F. Hultquist",
  title =        "A good random number generator for microcomputers",
  journal =      j-SIMULATION,
  volume =       "57",
  number =       "4",
  pages =        "258--259",
  month =        "????",
  year =         "1991",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979105700411",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:28:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/57/4/258",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@InProceedings{Ito:1991:PEU,
  author =       "N. Ito and Y. Kanada",
  title =        "Performance Evaluation Using Random Number Generator
                 and {Ising Monte Carlo} Simulation --- the
                 Application-based Benchmark {Test(AbBT)}",
  crossref =     "Anonymous:1991:PIS",
  pages =        "253--257",
  year =         "1991",
  bibdate =      "Mon Aug 26 10:38:41 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Jumarie:1991:QEN,
  author =       "Guy Jumarie",
  title =        "Quantum entropies of nonprobabilistic matrices",
  journal =      j-J-MATH-PHYS,
  volume =       "32",
  number =       "11",
  pages =        "2967--2971",
  month =        nov,
  year =         "1991",
  CODEN =        "JMAPAQ",
  DOI =          "https://doi.org/10.1063/1.529039",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  MRclass =      "94A17 (47B99 81Q99)",
  MRnumber =     "93a:94015",
  bibdate =      "Tue Nov 1 08:57:34 MDT 2011",
  bibsource =    "http://jmp.aip.org/;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://jmp.aip.org/resource/1/jmapaq/v32/i11/p2967_s1",
  acknowledgement = ack-nhfb,
  classification = "A0230 (Function theory, analysis); A0250
                 (Probability theory, stochastic processes, and
                 statistics); A0365B (Foundations, theory of
                 measurement, miscellaneous theories); A0540
                 (Fluctuation phenomena, random processes, and Brownian
                 motion); A0570C (Thermodynamic functions and equations
                 of state)",
  corpsource =   "Dept. of Math. and Comput. Sci., Quebec Univ.,
                 Montreal, Que., Canada",
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
  keywords =     "density matrix; entropy; Hilbert spaces; informational
                 entropy; nonprobabilistic matrices; positive trace
                 class; probabilistic framework; probability; quantum
                 entropy; quantum theory; random processes; random
                 variables; randomization; Renyi entropy; rules of
                 inference; Shannon entropy; structure complexity;
                 variational techniques; Von Neumann entropy",
  pagecount =    "5",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaliski:1991:OWP,
  author =       "Burton S. {Kaliski, Jr.}",
  title =        "One-way permutations on elliptic curves",
  journal =      j-J-CRYPTOLOGY,
  volume =       "3",
  number =       "3",
  pages =        "187--199",
  month =        "????",
  year =         "1991",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "11G07 (11T71 94A60)",
  MRnumber =     "92j:11054",
  MRreviewer =   "A. Peth{\"o}",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "RSA Data Security Inc",
  affiliationaddress = "Redwood City, CA, USA",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Computer Programming--Algorithms; Cryptography;
                 Discrete Logarithms; Elliptic Curves; Mathematical
                 Statistics--Random Number Generation; One-Way
                 Functions",
}

@Article{Kao:1991:CRN,
  author =       "Chiang Kao",
  title =        "A Comment on a Random-Number Generator for
                 Microcomputers: Response",
  journal =      j-J-OPER-RES-SOC,
  volume =       "42",
  number =       "2",
  pages =        "193--193",
  month =        feb,
  year =         "1991",
  CODEN =        "OPRQAK",
  ISSN =         "0160-5682 (print), 1476-9360 (electronic)",
  ISSN-L =       "0160-5682",
  bibdate =      "Wed Feb 29 22:33:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See
                 \cite{Kao:1989:RNG,Sezgin:1990:RNG,Clementson:1991:CRN}.",
  URL =          "http://www.jstor.org/stable/2583194",
  acknowledgement = ack-nhfb,
  fjournal =     "OR: the journal of the Operational Research Society",
}

@Article{Kemp:1991:PRV,
  author =       "C. D. Kemp and Adrienne W. Kemp",
  title =        "{Poisson} Random Variate Generation",
  journal =      j-APPL-STAT,
  volume =       "40",
  number =       "1",
  pages =        "143--158",
  year =         "1991",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:26:02 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Koen:1991:ACB,
  author =       "Chris Koen",
  title =        "Approximate confidence bounds for {Ripley}'s statistic
                 for random points in a square",
  journal =      j-BIOMETRICAL-J,
  volume =       "33",
  number =       "2",
  pages =        "173--177",
  month =        "????",
  year =         "1991",
  CODEN =        "BIJODN",
  DOI =          "https://doi.org/10.1002/bimj.4710330206",
  ISSN =         "0323-3847",
  bibdate =      "Tue Feb 07 09:32:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See correction \cite{Chiu:2007:CKC}.",
  URL =          "http://onlinelibrary.wiley.com/doi/10.1002/bimj.4710330206/abstract",
  acknowledgement = ack-nhfb,
  fjournal =     "Biometrical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4036",
  onlinedate =   "19 Jan 2007",
}

@Article{Komo:1991:DPR,
  author =       "John J. Komo and William J. {Park, Jr.}",
  title =        "Decimal pseudo-random number generator",
  journal =      j-SIMULATION,
  volume =       "57",
  number =       "4",
  pages =        "228--230",
  month =        oct,
  year =         "1991",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979105700405",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:25:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/57/4/228.abstract",
  abstract =     "A pseudo-random generator for decimal numbers
                 (biquinary pairs) based on a combination of a binary
                 and a quinary maximal-length sequence is presented.
                 With an appropriate vector mapping of the combined
                 maximal-length sequences the autocorrelation function
                 is shown to be tri-level with approximate values of 1,
                 0.5, and 0. This effectively renders the numbers
                 uncorrelated except at values equal to the lengths of
                 the individual maximal-length sequences, where this
                 autocorrelation is 0.5. The first peak value of the
                 autocorrelation function occurs at a value equal to the
                 length of the shorter of the component sequences.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@InCollection{Lai:1991:PNB,
  author =       "Xuejia Lai and James L. Massey",
  booktitle =    "Advances in {cryptology---EUROCRYPT '90} (Aarhus,
                 1990)",
  title =        "A proposal for a new block encryption standard",
  volume =       "473",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "389--404",
  year =         "1991",
  MRclass =      "68P25 (94A60)",
  MRnumber =     "1 102 498",
  bibdate =      "Fri Oct 25 18:39:09 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0473.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  note =         "See \cite{Luo:2010:PAE} for proofs of requirements on
                 the number of rounds.",
  series =       j-LECT-NOTES-COMP-SCI,
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0473/04730389.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0473/04730389.pdf",
  acknowledgement = ack-nhfb,
}

@Book{Law:1991:SMA,
  author =       "Averill M. Law and W. David Kelton",
  title =        "Simulation modeling and analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xxii + 759 + 2",
  year =         "1991",
  ISBN =         "0-07-100803-9, 0-07-036698-5",
  ISBN-13 =      "978-0-07-100803-7, 978-0-07-036698-5",
  LCCN =         "QA76.9.C65 L38 1991",
  bibdate =      "Mon Jan 2 15:05:31 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in industrial engineering and
                 management science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0602/90042969-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0602/90042969-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0602/90042969-t.html",
  acknowledgement = ack-nhfb,
  remark =       "See \cite{Law:1982:SMA,Law:2000:SMA,Law:2006:SMA} for
                 other editions.",
  subject =      "Digital computer simulation",
  tableofcontents = "1 Basic Simulation Modeling \\
                 2 Modeling Complex Systems \\
                 3 Simulation Software \\
                 4 Review of Basic Probability and Statistics \\
                 5 Building Valid, Credible, and Appropriately Detailed
                 Simulation Models \\
                 6 Selecting Input Probability Distributions \\
                 7 Random-Number Generators \\
                 8 Generating Random Variates \\
                 9 Output Data Analysis for a Single System \\
                 10 Comparing Alternative System Configurations \\
                 11 Variance-Reduction Techniques \\
                 12 Experimental Design, Sensitivity Analysis, and
                 Optimization \\
                 13 Simulation of Manufacturing Systems",
}

@Article{LEcuyer:1991:IRN,
  author =       "Pierre L'Ecuyer and Serge C{\^o}t{\'e}",
  title =        "Implementing a Random Number Package with Splitting
                 Facilities",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "98--111",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/103147.103158",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10",
  MRnumber =     "91m:65016",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/103147.103158;
                 http://www.acm.org/pubs/citations/journals/toms/1991-17-1/p98-lecuyer/",
  abstract =     "A portable set of software tools is described for
                 uniform random variates generation. It provides for
                 multiple generators running simultaneously, and each
                 generator has its sequence of numbers partitioned into
                 many long (disjoint) substreams. Simple procedure calls
                 allow the user to make any generator ``jump'' ahead to
                 the beginning of its next substream, back to the
                 beginning of its current substream, or back to the
                 beginning of its first substream\ldots. Implementation
                 issues are discussed\ldots. A Pascal implementation for
                 32-bit computers is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; performance",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{LEcuyer:1991:SPT,
  author =       "Pierre L'Ecuyer and Shu Tezuka",
  title =        "Structural properties for two classes of combined
                 random number generators",
  journal =      j-MATH-COMPUT,
  volume =       "57",
  number =       "196",
  pages =        "735--746",
  month =        oct,
  year =         "1991",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "92a:65034",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Montreal Univ., Que., Canada",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "distinct prime moduli; geometrical behavior; linear
                 congruential generators; random number generation;
                 random number generators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Luby:1991:PRG,
  author =       "Michael Luby",
  title =        "Pseudo-random Generators from One-Way Functions
                 (Invited Abstract)",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "576",
  pages =        "300--??",
  year =         "1991",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:48:11 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0576.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0576/05760300.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0576/05760300.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Maier:1991:FPR,
  author =       "William L. Maier",
  title =        "A fast pseudo random number generator",
  journal =      j-DDJ,
  volume =       "16",
  number =       "5",
  pages =        "152, 154--157",
  month =        may,
  year =         "1991",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 10 09:11:02 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "The r250 algorithm uses a 250-element array to
                 generate pseudo random numbers faster than better-known
                 techniques.",
  acknowledgement = ack-nhfb,
  classification = "C7310 (Mathematics)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  keywords =     "Bit values; Pseudo random number generator; R250
                 algorithm",
  thesaurus =    "C listings; Microcomputer applications; Random number
                 generation",
}

@Article{Makino:1991:GSR,
  author =       "Jun Makino and Osamu Miyamura",
  title =        "Generation of shift register random numbers on vector
                 processors",
  journal =      j-COMP-PHYS-COMM,
  volume =       "64",
  number =       "3",
  pages =        "363--368",
  month =        jun,
  year =         "1991",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(91)90132-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465591901325",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Marsaglia:1991:NCR,
  author =       "George Marsaglia and Arif Zaman",
  title =        "A new class of random number generators",
  journal =      j-ANN-APPL-PROBAB,
  volume =       "1",
  number =       "3",
  pages =        "462--480",
  month =        aug,
  year =         "1991",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1214/aoap/1177005878",
  ISSN =         "1050-5164 (print), 2168-8737 (electronic)",
  MRclass =      "65C10",
  MRnumber =     "92h:65009",
  MRreviewer =   "Renata Rotondi",
  bibdate =      "Mon Aug 02 11:01:47 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  note =         "See popular description in \cite{Peterson:1991:NRN}.
                 See remarks in
                 \cite{Eichenauer-Herrmann:1995:PNG,Tezuka:1993:LSA}
                 about the extremely bad lattice structure in high
                 dimensions of the generators proposed in this paper.",
  URL =          "http://projecteuclid.org/euclid.aoap/1177005878",
  ZMnumber =     "0733.65005",
  abstract =     "We introduce a new class of generators of two types:
                 add-with-carry and subtract-with-borrow. Related to
                 lagged-Fibonacci generators, the new class has
                 interesting underlying theory, astonishingly long
                 periods and provable uniformity for full sequences.
                 Among several that we mention, we recommend
                 particularly promising ones that will generate a
                 sequence of 2e1751 bits.",
  abstract-2 =   "We introduce a new class of generators of two types:
                 add-with-carry and subtract-with-borrow. Related to
                 lagged-Fibonacci generators, the new class has
                 interesting underlying theory, astonishingly long
                 periods and provable uniformity for full sequences.
                 Among several that we mention, we recommend
                 particularly promising ones that will generate a
                 sequence of $2^{1751}$ bits, or a sequence of
                 $2^{1376}$ 32-bit integers, or a sequence of $2^{931}$
                 reals with 24-bit fractions--all using simple computer
                 arithmetic (subtraction) and a few memory locations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of applied probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aoap/;
                 http://www.jstor.org/journals/10505164.html",
  keywords =     "add with carry generator; lagged Fibonacci generator;
                 Monte Carlo methods; numerical examples; random number
                 generators; subtract-with-borrow generators; very long
                 period sequences",
  ZMclass =      "65C10 Random number generation 65C05 Monte Carlo
                 methods",
  ZMreviewer =   "M. Cugiani (Milano)",
}

@Article{Marsaglia:1991:NGR,
  author =       "George Marsaglia",
  title =        "Normal ({Gaussian}) Random Variables for
                 Supercomputers",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "5",
  number =       "1",
  pages =        "49--55",
  month =        jun,
  year =         "1991",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/BF00155857",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Wed Jul 6 11:13:03 MDT 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/Parallel/JOURNAL.SUPER.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=5&issue=1;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=5&issue=1&spage=49",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Stat., Florida State Univ., Tallahassee, FL,
                 USA",
  classification = "C1140G (Monte Carlo methods); C1140Z (Other and
                 miscellaneous); C5440 (Multiprocessor systems and
                 techniques); C7310 (Mathematics)",
  corpsource =   "Dept. of Stat., Florida State Univ., Tallahassee, FL,
                 USA",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  keywords =     "efficient constant-time methods; exponential random
                 variables; Gaussian random variables; Monte Carlo
                 methods; Monte Carlo studies; normal distribution
                 function; parallel machines; parallel operations;
                 probability; statistical analysis; supercomputers",
  treatment =    "P Practical",
}

@Article{Matus:1991:AFD,
  author =       "F. Matus",
  title =        "Abstract functional dependency structures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "81",
  number =       "1",
  pages =        "117--126",
  day =          "22",
  month =        apr,
  year =         "1991",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory)",
  corpsource =   "Inst. of Inf. Theory Autom., Czechoslovak Acad. of
                 Sci., Prague, Czechoslovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "abstract functional dependency structures; Boolean;
                 closure systems; database relationships theory;
                 database theory; functions; Galois connection; matroid
                 theory; random variable",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maurer:1991:LRP,
  author =       "U. M. Maurer and J. L. Massey",
  title =        "Local Randomness in Pseudorandom Sequences",
  journal =      j-J-CRYPTOLOGY,
  volume =       "4",
  number =       "2",
  pages =        "135--149",
  month =        "????",
  year =         "1991",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  bibdate =      "Sat Nov 21 11:12:41 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@Article{Maurer:1991:UST,
  author =       "Ueli M. Maurer",
  title =        "A Universal Statistical Test for Random Bit
                 Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "537",
  pages =        "409--420",
  year =         "1991",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:48:02 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0537.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0537/05370409.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0537/05370409.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{McInnes:1991:IPK,
  author =       "J. L. McInnes and B. Pinkas",
  title =        "On the Impossibility of Private Key Cryptography with
                 Weakly Random Keys",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "537",
  pages =        "421--??",
  year =         "1991",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 08:51:55 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1991.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Melamed:1991:TCM,
  author =       "Benjamin Melamed",
  title =        "{TES}: A Class of Methods for Generating
                 Autocorrelated Uniform Variates",
  journal =      j-ORSA-J-COMPUT,
  volume =       "3",
  number =       "4",
  pages =        "317--329",
  year =         "1991",
  CODEN =        "OJCOE3",
  DOI =          "https://doi.org/10.1287/ijoc.3.4.317",
  ISSN =         "0899-1499 (print), 2326-3245 (electronic)",
  ISSN-L =       "0899-1499",
  bibdate =      "Wed Nov 12 14:30:40 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ORSA Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/loi/ojoc",
  keywords =     "TES (Transform-Expand-Sample) f",
}

@Article{Micali:1991:EPP,
  author =       "Silvio Micali and Claus-Peter Schnorr",
  title =        "Efficient, perfect polynomial random number
                 generators",
  journal =      j-J-CRYPTOLOGY,
  volume =       "3",
  number =       "3",
  pages =        "157--172",
  month =        "????",
  year =         "1991",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "65C10 (94A60)",
  MRnumber =     "92i:65020",
  MRreviewer =   "I. V{\u{a}}duva",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Computer Programming--Algorithms; Cryptography;
                 Mathematical Statistics--Random Number Generation;
                 Perfect Generators; Polynomial Generators; Random
                 Number Generators (RNGs); rsa-scheme; Statistical
                 Methods",
}

@Article{Mulmuley:1991:FPP,
  author =       "Ketan Mulmuley",
  title =        "A Fast Planar Partition Algorithm, {II}",
  journal =      j-J-ACM,
  volume =       "38",
  number =       "1",
  pages =        "74--103",
  month =        jan,
  year =         "1991",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/102782.102785",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102785.html",
  abstract =     "Randomized, optimal algorithms to find a partition of
                 the plane induced by a set of algebraic segments of a
                 bounded degree, and a set of linear chains of a bounded
                 degree, are given. This paper also provides a new
                 technique for clipping, called {\em virtual clipping},
                 whose overhead per window $W$ depends logarithmically
                 on the number if intersections between the borders of
                 $W$ and the input segments. In contrast, the overhead
                 of the conventional clipping technique depends linearly
                 on this number of intersections. As an application of
                 virtual clipping, a new simple and efficient algorithm
                 for plannar point location is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "Algorithms; computational complexity; Computational
                 Geometry; hidden surface removal; planar subdivision;
                 randomized geometric algorithms; Theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf F.2.2}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Computations on
                 discrete structures. {\bf G.2.1}: Mathematics of
                 Computing, DISCRETE MATHEMATICS, Combinatorics,
                 Combinatorial algorithms. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Naor:1991:BCU,
  author =       "M. Naor",
  title =        "Bit Commitment Using Pseudorandomness",
  journal =      j-J-CRYPTOLOGY,
  volume =       "4",
  number =       "2",
  pages =        "151--158",
  month =        "????",
  year =         "1991",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  bibdate =      "Sat Nov 21 11:12:41 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@InProceedings{Niederreiter:1991:FFT,
  author =       "Harald Niederreiter",
  title =        "Finite fields and their applications",
  crossref =     "Dorninger:1991:CGA",
  pages =        "251--264",
  year =         "1991",
  bibdate =      "Tue Dec 27 11:29:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1991:RTR,
  author =       "Harald Niederreiter",
  title =        "Recent trends in random number and random vector
                 generation",
  journal =      j-ANN-OPER-RESEARCH,
  volume =       "31",
  number =       "??",
  pages =        "323--345",
  month =        "????",
  year =         "1991",
  CODEN =        "AOREEV",
  ISSN =         "0254-5330 (print), 1572-9338 (electronic)",
  ISSN-L =       "0254-5330",
  MRnumber =     "92h:65010",
  bibdate =      "Mon Dec 26 13:19:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Operations Research",
  journal-URL =  "http://link.springer.com/journal/10479",
  xxpages =      "323--346",
}

@InProceedings{Oyanagi:1991:SPR,
  author =       "Y. Oyanagi and E. Goto and N. Yoshida",
  title =        "Supercomputing Pseudo Random Numbers --- Proposals on
                 Hardware and Software",
  crossref =     "Anonymous:1991:PIS",
  pages =        "97--98",
  year =         "1991",
  bibdate =      "Mon Aug 26 10:38:41 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Papoulis:1991:PRV,
  author =       "Athanasios Papoulis",
  title =        "Probability, random variables, and stochastic
                 processes",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Third",
  pages =        "xvii + 666",
  year =         "1991",
  ISBN =         "0-07-048477-5",
  ISBN-13 =      "978-0-07-048477-1",
  LCCN =         "QA273 .P2 1991",
  bibdate =      "Tue Jan 17 09:42:19 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$54.95",
  series =       "McGraw-Hill series in electrical engineering.
                 Communications and signal processing",
  URL =          "http://www.loc.gov/catdir/description/mh022/90023127.html;
                 http://www.loc.gov/catdir/toc/mh021/90023127.html",
  acknowledgement = ack-nhfb,
  remark =       "See other editions
                 \cite{Papoulis:1965:PRV,Papoulis:1984:PRV,Papoulis:2002:PRV}.",
  subject =      "Probabilities; Random variables; Stochastic
                 processes",
}

@Article{Pardalos:1991:CTP,
  author =       "Panos M. Pardalos",
  title =        "Construction of Test Problems in Quadratic Bivalent
                 Programming",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "74--87",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/103147.103156",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65K05",
  MRnumber =     "92c:65075",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1991-17-1/p74-pardalos/",
  abstract =     "A method of constructing test problems for constrained
                 bivalent quadratic programming is presented. For any
                 feasible integer point for a given domain, the method
                 generates quadratic functions whose minimum over the
                 given domain occurs at the selected point.\par Certain
                 properties of unconstrained quadratic zero-one programs
                 that determine the difficulty of the test problems are
                 also discussed. In addition, a standardized random test
                 problem generator for unconstrained quadratic zero-one
                 programming is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; experimentation; performance",
  reviewer =     "P. K. Subramanian",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Integer programming. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Patarin:1991:NRP,
  author =       "Jacques Patarin",
  title =        "New results on pseudorandom permutation generators
                 based on the {DES} scheme",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "576",
  pages =        "301--213",
  year =         "1991",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:48:11 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0576.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0576/05760301.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0576/05760301.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Peterson:1991:NRN,
  author =       "Ivars Peterson",
  title =        "Numbers at Random: Number theory supplies a superior
                 random-number generator",
  journal =      j-SCIENCE-NEWS,
  volume =       "140",
  number =       "19",
  pages =        "300--301",
  day =          "9",
  month =        nov,
  year =         "1991",
  CODEN =        "SCNEBK",
  ISSN =         "0036-8423 (print), 1943-0930 (electronic)",
  ISSN-L =       "0036-8423",
  bibdate =      "Sat Mar 03 15:20:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  URL =          "http://www.jstor.org/stable/3975915",
  acknowledgement = ack-nhfb,
  fjournal =     "Science News (Washington, DC)",
  journal-URL =  "http://www.jstor.org/journals/00368423.html;
                 http://www.sciencenews.org/view/archives;
                 http://www3.interscience.wiley.com/journal/122396840/home",
  remark =       "This is a sketchy popular account of the
                 add-with-carry and subtract-with-borrow Fibonacci-based
                 generators presented in \cite{Marsaglia:1991:NCR}. Such
                 generators can easily be constructed to have enormous
                 periods, such as $ 10^{500} $.",
}

@Article{Pickover:1991:PRG,
  author =       "C. A. Pickover",
  title =        "Picturing randomness on a graphics supercomputer",
  journal =      j-IBM-JRD,
  volume =       "35",
  number =       "1/2",
  pages =        "227--230",
  month =        jan # "\slash " # mar,
  year =         "1991",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Tue Mar 25 14:26:59 MST 1997",
  bibsource =    "http://www.research.ibm.com/journal/;
                 https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The paper provides a light introduction to a simple
                 graphics technique which can be used to represent
                 random data on a graphics supercomputer. The
                 representation, called a noise-sphere, can be used to
                 detect `bad' random-number generators with little
                 training on the part of the observer. The system uses
                 lighting and shading facilities of 3D extensions to the
                 X-Windows or the PHIGS+ standard. Computational recipes
                 and suggestions for future experiments are included.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  classcodes =   "C6130B (Graphics techniques); C7310 (Mathematics)",
  classification = "C6130B (Graphics techniques); C7310 (Mathematics)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  keywords =     "computer graphics; Graphics supercomputer; graphics
                 supercomputer; Graphics technique; graphics technique;
                 Lighting; lighting; mathematics computing;
                 Noise-sphere; noise-sphere; PHIGS+ standard; Random
                 data; random data; random processes; Random-number
                 generators; random-number generators; Randomness;
                 randomness; Shading; shading; X-Windows",
  thesaurus =    "Computer graphics; Mathematics computing; Random
                 processes",
  treatment =    "P Practical",
}

@MastersThesis{Revello:1991:CEC,
  author =       "Timothy E. Revello",
  title =        "A combination of exponentiation ciphers and the data
                 encryption standard as a pseudorandom number
                 generator",
  type =         "Thesis ({M.S.})",
  school =       "Rensselaer Polytechnic Institute at The Hartford
                 Graduate Center",
  address =      "Troy, NY, USA",
  pages =        "viii + 68",
  year =         "1991",
  bibdate =      "Mon Oct 19 08:47:56 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Ciphers; Cryptography; Random number generators.",
}

@Article{Ritter:1991:EGC,
  author =       "Terry Ritter",
  title =        "The Efficient Generation of Cryptographic Confusion
                 Sequences",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "2",
  pages =        "81--139",
  month =        apr,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119191865812",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "94A60 (65C10)",
  MRnumber =     "92b:94035",
  bibdate =      "Mon Jun 30 15:38:59 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "cryptographic confusion sequences; pseudo-random
                 sequence; random number generators; cryptographic
                 applications; random sequences; incompleteness theorem;
                 deterministic implementation; external analysis; RNG
                 comparison; chaos; {{\v{C}}eby{\v{s}}ev} mixing;
                 cellular automata; linear congruential; linear feedback
                 shift register; nonlinear shift register; generalized
                 feedback shift register; additive types; isolator
                 mechanisms; one-way functions; combined sequences;
                 random permutations; primitive mod 2 polynomials;
                 empirical state-trajectory approach; RNG design
                 analysis; GFSR",
  URL =          "http://fizz.sys.uea.ac.uk/~rs/ritter.html;
                 http://www.ciphersbyritter.com/ARTS/CRNG2ART.HTM;
                 http://www.informaworld.com/smpp/content~content=a741902748~db=all~order=page",
  abstract =     "A survey is given of pseudo-random sequence or random
                 number generators (RNGs) for cryptographic
                 applications, with extensive reference to the
                 literature, and seemingly unresolved issues discussed
                 throughout. An introduction to random sequences is
                 presented, with some speculative consequences suggested
                 by G{\"o}del's incompleteness theorem (G. Chaitin,
                 1987). Implications of a necessarily deterministic
                 implementation, techniques of external analysis, and
                 ways to complicate such analysis are discussed. A basis
                 for RNG comparison is suggested. Various RNGs are
                 described, including chaos, {{\v{C}}eby{\v{s}}ev}
                 mixing, cellular automata, x/sup 2/ mod N, linear
                 congruential, linear feedback shift register, nonlinear
                 shift register, generalized feedback shift register and
                 additive types. Randomizer and isolator mechanisms,
                 one-way functions, the combined sequences from multiple
                 RNGs, random permutations, and methods for finding
                 primitive mod 2 polynomials are also described. An
                 empirical state-trajectory approach to RNG design
                 analysis is given, and experimental results tabulated
                 for several cellular automata, x/sup 2/ mod N, GFSR,
                 and additive designs",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "automata theory; cryptography; random number
                 generation; shift registers",
  romanvolume =  "XV",
}

@Article{Saarinen:1991:VIT,
  author =       "J. Saarinen and J. Tomberg and L. Vehmanen and K.
                 Kaski",
  title =        "{VLSI} implementation of {Tausworthe} random number
                 generator for parallel processing environment",
  journal =      j-IEE-PROC-E,
  volume =       "138",
  number =       "3",
  publisher =    "IET",
  pages =        "138--146",
  year =         "1991",
  CODEN =        "IPETD3",
  DOI =          "https://doi.org/10.1049/ip-e.1991.0019",
  ISSN =         "0143-7062",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?PET/138/138/1",
  acknowledgement = ack-nhfb,
  fjournal =     "IEE proceedings, E: Computers and digital techniques",
  journal-URL =  "https://digital-library.theiet.org/content/journals/ip-e",
  keywords =     "concurrent architecture; I/O control lines;
                 Monte-Carlo simulation; parallel processing
                 environment; shift register sequences; statistical
                 tests; Tausworthe random number generator; VLSI
                 implementation",
}

@Article{Sadeghiyan:1991:COW,
  author =       "Babak Sadeghiyan and J{\'o}zef P. Pieprzyk",
  title =        "A Construction for One Way Hash Functions and
                 Pseudorandom Bit Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "547",
  pages =        "431--445",
  year =         "1991",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:02:05 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470431.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0547/05470431.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Savvidy:1991:MCS,
  author =       "G. K. Savvidy and N. G. Ter-Arutyunyan-Savvidy",
  title =        "On the {Monte Carlo} simulation of physical systems",
  journal =      j-J-COMPUT-PHYS,
  volume =       "97",
  number =       "2",
  pages =        "566--572",
  month =        dec,
  year =         "1991",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(91)90015-D",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:51 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002199919190015D",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Schwartz:1991:NGM,
  author =       "Charles Schwartz",
  title =        "A New Graphical Method for Encryption of Computer
                 Data",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "1",
  pages =        "43--46",
  month =        jan,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119191865777",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:58 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "pseudorandom number generator; decryption; graphical
                 method; encryption; computer data; text; pictures;
                 binary files; graphically generated inversions; bit
                 pattern; uncrackability",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902742~db=all~order=page",
  abstract =     "A new method for encryption of computer data (text,
                 pictures, or binary files) makes use of a sequence of
                 graphically generated inversions on the bit pattern,
                 keyed to a pseudo-random number generator. The method
                 is easy, fast and fun. Decryption requires knowledge of
                 the secret code number used at encryption. The argument
                 for `uncrackability' of this scheme is only heuristic;
                 but the author believes that it is practically immune
                 from attack. He invites others to see if they can prove
                 otherwise",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "cryptography",
  romanvolume =  "XV",
}

@Article{Sezgin:1991:FPU,
  author =       "Fatin Sezgin",
  title =        "On a fast and portable uniform quasi-random number
                 generator",
  journal =      j-SIMULETTER,
  volume =       "21",
  number =       "2",
  pages =        "30--36",
  year =         "1991",
  CODEN =        "SIMUD5",
  DOI =          "https://doi.org/10.1145/382264.382434",
  ISSN =         "0163-6103",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This study discusses and presents some comments on a
                 portable random number generator of very large period
                 based on a generalised multi-moduli congruential
                 method. It also shows that by using 50 generators it is
                 possible to extend the period to $ 1.01 \times 10^{105}
                 $ in a 16-bit machine and by 100 generators to $ 1.39
                 \ti 10^{592} $ in a 32-bit machine. For each linear
                 congruential parent generator a prime modulus is
                 determined to achieve the maximum period and the best
                 multiplier is found by applying Spectral Test. Some
                 weaknesses and problems are pointed out.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Simuletter",
}

@Article{Tezuka:1991:EPC,
  author =       "Shu Tezuka and Pierre L'Ecuyer",
  title =        "Efficient and portable combined {Tausworthe} random
                 number generators",
  journal =      j-TOMACS,
  volume =       "1",
  number =       "2",
  pages =        "99--112",
  month =        apr,
  year =         "1991",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:22 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Tonkin:1991:SB,
  author =       "Bruce W. Tonkin",
  title =        "Speedy buffering",
  journal =      j-DDJ,
  volume =       "16",
  number =       "3",
  pages =        "52--53",
  month =        mar,
  year =         "1991",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 10 09:11:02 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "Here's a technique for speeding up disk access for
                 many applications without buying faster, more expensive
                 hardware.",
  acknowledgement = ack-nhfb,
  affiliation =  "TNT Software Inc., Round Lake, IL, USA",
  classification = "C6110 (Systems analysis and programming)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  keywords =     "Buffering; Data file; Disk access times; Dummy file;
                 Memory; QuickBasic; Random-access; Record length;
                 Record number order",
  thesaurus =    "Programming",
}

@Article{Tsalides:1991:PNG,
  author =       "Ph. Tsalides and T. A. York and A. Thanailakis",
  title =        "Pseudorandom number generators for {VLSI} systems
                 based on linear cellular automata",
  journal =      j-IEE-PROC-E,
  volume =       "138",
  number =       "4",
  pages =        "241--249",
  month =        jul,
  year =         "1991",
  CODEN =        "IPETD3",
  ISSN =         "0143-7062",
  bibdate =      "Thu Feb 23 21:49:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEE proceedings, E: Computers and digital techniques",
  journal-URL =  "https://digital-library.theiet.org/content/journals/ip-e",
}

@Article{Tyurin:1991:TRN,
  author =       "Yu. N. Tyurin and V. E. Figurnov",
  title =        "On the Testing of Random Number Generators",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "35",
  number =       "1",
  pages =        "180--184",
  month =        "????",
  year =         "1991",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1135022",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:40:31 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/35/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1991",
}

@Article{Ugrin-Sparac:1991:SIP,
  author =       "G. Ugrin-{\v{S}}parac",
  title =        "Stochastic Investigations of Pseudo-Random Number
                 Generators",
  journal =      j-COMPUTING,
  volume =       "46",
  number =       "1",
  pages =        "53--65",
  month =        mar,
  year =         "1991",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "92a:65035",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst of Electrical Engineering `Rade Koncar'",
  affiliationaddress = "Zagreb, Yugosl",
  classification = "922",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Chi-Square Test; Goodness of Fit Tests; Mathematical
                 Statistics; Pseudorandom Number Generators; Quality
                 Statistics; Statistical Methods",
}

@Article{Vose:1991:LAG,
  author =       "Michael D. Vose",
  title =        "A linear algorithm for generating random numbers with
                 a given distribution",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "17",
  number =       "9",
  pages =        "972--975",
  month =        sep,
  year =         "1991",
  CODEN =        "IESEDJ",
  DOI =          "https://doi.org/10.1109/32.92917",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Thu Feb 1 11:00:42 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=92917",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Wakefield:1991:EGR,
  author =       "J. C. Wakefield and A. E. Gelfand and A. F. M. Smith",
  title =        "Efficient Generation of Random Variates via the
                 Ratio-of-Uniforms Method",
  journal =      j-STAT-COMPUT,
  volume =       "1",
  number =       "2",
  pages =        "129--133",
  month =        dec,
  year =         "1991",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF01889987",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:06 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01889987;
                 http://www.springerlink.com/content/w1vt431r722p17j8/",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
  keywords =     "Bayesian computation; beta distribution; multivariate
                 ratio-of-uniforms; power functions; ratio-of-uniforms",
}

@Article{Walsh:1991:MFR,
  author =       "John F. Walsh",
  title =        "{Microsoft}'s {FORTRAN 5.0} Random Number Generator:
                 be Aware",
  journal =      j-PERCEPTUAL-MOTOR-SKILLS,
  volume =       "72",
  number =       "1",
  pages =        "257--??",
  month =        feb,
  year =         "1991",
  CODEN =        "PMOSAZ",
  ISSN =         "0031-5125 (print), 1558-688x (electronic)",
  ISSN-L =       "0031-5125",
  bibdate =      "Sat Jan 27 07:37:25 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Perceptual and Motor Skills",
}

@Article{Wheeler:1991:PMN,
  author =       "Daniel D. Wheeler",
  title =        "Problems with {Mitchell}'s Nonlinear Key Generators",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "4",
  pages =        "355--363",
  month =        oct,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119191865993",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:39:00 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "pseudo random numbers; successive differences;
                 nonlinear key generators; probable-word attack",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902768~db=all~order=page",
  abstract =     "The key sequences from Mitchell's (ibid., vol. 14, p.
                 350--354, 1990) nonlinear key generator show clear
                 patterns when successive differences are examined.
                 These are sufficient to break the system with a
                 probable-word attack",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "cryptography; random number generation",
  romanvolume =  "XV",
}

@Article{Wheeler:1991:SIC,
  author =       "Daniel D. Wheeler and Robert A. J. Matthews",
  title =        "Supercomputer Investigations of a Chaotic Encryption
                 Algorithm",
  journal =      j-CRYPTOLOGIA,
  volume =       "15",
  number =       "2",
  pages =        "140--152",
  month =        apr,
  year =         "1991",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119191865821",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:38:59 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "chaotic encryption algorithm; nonlinear pseudo-random
                 number generator; chaos theory; cycling keys;
                 low-precision arithmetic; numerical investigation; Cray
                 Y-MP machine; cycling problem",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902749~db=all~order=page",
  abstract =     "A nonlinear pseudo-random number generator based on
                 chaos theory was criticized for producing cycling keys
                 if used with low-precision arithmetic. The authors
                 present the results of a numerical investigation of the
                 algorithm's properties using a Cray Y-MP machine. This
                 suggests that the cycling problem can be combatted to
                 any desired degree. They conclude that the generator is
                 still of cryptographic interest",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "chaos; cryptography; parallel programming; random
                 number generation; random processes",
  romanvolume =  "XV",
}

@Article{Yamamoto:1991:NEM,
  author =       "H. Yamamoto",
  title =        "Note on the efficiency of methods to generate
                 quasi-random sequences",
  journal =      j-SYS-COMP-JAPAN,
  volume =       "22",
  number =       "??",
  pages =        "385--365",
  month =        "????",
  year =         "1991",
  CODEN =        "SCJAEP",
  ISSN =         "0882-1666 (print), 1520-684X (electronic)",
  ISSN-L =       "0882-1666",
  bibdate =      "Fri Jan 6 10:58:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Systems and computers in Japan",
}

@Article{Yang:1991:UCR,
  author =       "W.-N. Yang and B. L. Nelson",
  title =        "Using {Common Random Numbers} and Control Variates in
                 Multiple-Comparison Procedures",
  journal =      j-OPER-RES,
  volume =       "39",
  number =       "??",
  pages =        "583--591",
  month =        "????",
  year =         "1991",
  CODEN =        "OPREAI",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Zeng:1991:PBG,
  author =       "Kencheng Zeng and Chung-Huang Yang and Dah-Yea Wei and
                 T. R. N. Rao",
  title =        "Pseudorandom Bit Generators in Stream-Cipher
                 Cryptography",
  journal =      j-COMPUTER,
  volume =       "24",
  number =       "2",
  pages =        "8--17",
  month =        feb,
  year =         "1991",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Tue Feb 4 06:56:11 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/computer.bib;
                 https://www.math.utah.edu/pub/tex/bib/computer1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The information age lends new dimensions to the art of
                 cryptography. Techniques for encryption, decryption,
                 and fending off attacks from intruders provide the only
                 protection of sensitive data.",
  acknowledgement = ack-nhfb,
  affiliation =  "Center for Adv Comput Studies, Univ of Southwestern
                 Louisiana, Lafayette, LA, USA",
  classification = "723; 922; C5230 (Digital arithmetic methods); C6130
                 (Data handling techniques)",
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  journalabr =   "Computer",
  keywords =     "Cryptography; Data Processing --- Security of Data;
                 Keystream generators; Linear Consistency Attack; Linear
                 feedback shift registers; Linear Syndrome Attack;
                 Mathematical Statistics --- Random Number Generation;
                 Multiclocking; Nonlinear feedforward transformation;
                 Nonlinear Feedforward Transformation; Pseudorandom Bit
                 Generators; Pseudorandom bit generators; Siegenthaler
                 Correlation Attack; Step control; Stream-cipher
                 cryptography; Stream-Cipher Cryptography",
  thesaurus =    "Cryptography; Feedback; Random number generation;
                 Shift registers",
}

@Article{Agrawal:1992:PAS,
  author =       "V. D. Agrawal and S. T. Chakradhar",
  title =        "Performance analysis of synchronized iterative
                 algorithms on multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "3",
  number =       "6",
  pages =        "739--746",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/71.180628",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6110P (Parallel
                 programming)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "http://www.computer.org/tpds/archives.htm",
  keywords =     "atoms; binomial random variable; computational
                 activity; computational effort; fixed probability;
                 instances; iterative methods; logic simulation;
                 maximum; multiprocessor system; order-statistic;
                 parallel algorithms; parallel machines; parallel
                 processing; performance evaluation; performance
                 evaluation technique; periodic; production VLSI chips;
                 random variables; statistical model; statistics;
                 synchronizations; synchronized iterative algorithms;
                 theoretical performance",
  treatment =    "P Practical",
}

@Article{Aluru:1992:RNG,
  author =       "Srinivas Aluru and G. M. Prabhu and John Gustafson",
  title =        "A random number generator for parallel computers",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "18",
  number =       "8",
  pages =        "839--847",
  month =        aug,
  year =         "1992",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10 (65Y05)",
  MRnumber =     "93e:65008",
  bibdate =      "Mon Apr 14 12:07:40 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "feedback; generalised feedback shift register
                 algorithm; generator; parallel architectures; parallel
                 computers; parallel processing; parallel random
                 sequences; random number; random number generation;
                 shift registers; uniform random sequences",
  treatment =    "P Practical",
}

@Article{Anastasio:1992:OCL,
  author =       "Thomas A. Anastasio and William W. Carlson",
  title =        "An observation on the {C} library procedure {\tt
                 random()}",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "3",
  pages =        "71--74",
  month =        mar,
  year =         "1992",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/130854.130863",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:16:18 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Bit-level repetition of the sequences generated by the
                 C library procedure random() have been observed as a
                 function of seed. This note documents that observation.
                 The effect has not been observed in drand48().",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
}

@Article{Anderson:1992:CRN,
  author =       "Ross Anderson",
  title =        "Chaos and Random Numbers",
  journal =      j-CRYPTOLOGIA,
  volume =       "16",
  number =       "3",
  pages =        "226--226",
  month =        jul,
  year =         "1992",
  CODEN =        "CRYPE6",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Fri Mar 15 09:01:38 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  romanvolume =  "XVI",
}

@TechReport{Arno:1992:PSC,
  author =       "Steven Arno and Ken Iobst",
  title =        "The {PETASYS} supercomputer and a class of
                 pseudo-random number generators",
  type =         "Technical report",
  number =       "SRC-TR-92-069",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "29",
  month =        apr,
  year =         "1992",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In this paper we describe a class of pseudo-random
                 number generators suitable for SIMD machines in general
                 and for PETASYS and the Connection Machine in
                 particular. Our method combines lagged (multiplicative)
                 Fibonacci sequences with some simple number theoretic
                 properties. All statements are proved in detail as an
                 aid to readers with varying backgrounds. In the case of
                 the PETASYS supercomputer our class of generators is
                 very fast, producing about 10p14s pseudo-random numbers
                 per second.",
  acknowledgement = ack-nhfb,
  keywords =     "Supercomputers",
}

@Article{Atkinson:1992:GBT,
  author =       "M. D. Atkinson and J. R. Sack",
  title =        "Generating binary trees at random",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "1",
  pages =        "21--23",
  day =          "21",
  month =        jan,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (60C05 60J15 68Q25)",
  MRnumber =     "92m:68090",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; 921; 922; C1160 (Combinatorial mathematics);
                 C6120 (File organisation); C7310 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary Trees; Chung-Feller theorem; Computer
                 Programming --- Algorithms; Data Processing; data
                 structures; Data Structures; generating random binary
                 trees; linear-time algorithm; Mathematical Techniques
                 --- Trees; n nodes; Probability --- Random Processes;
                 random number generation; trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Babai:1992:MPP,
  author =       "L{\'a}szl{\'o} Babai and Noam Nisant and M{\'a}ri{\'o}
                 Szegedy",
  title =        "Multiparty protocols, pseudorandom generators for
                 logspace, and time-space trade-offs",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "45",
  number =       "2",
  pages =        "204--232",
  month =        oct,
  year =         "1992",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(92)90047-M",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Sat Mar 17 07:32:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002200009290047M",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Baker:1992:PPT,
  author =       "B. M. Baker and D. E. Handelman",
  title =        "Positive polynomials and time dependent integer-valued
                 random variables",
  journal =      j-CAN-J-MATH,
  volume =       "44",
  number =       "1",
  pages =        "3--41",
  month =        feb,
  year =         "1992",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1992-001-6",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:39:03 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v44/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{Bays:1992:IRN,
  author =       "Carter Bays and W. E. Sharp",
  title =        "Improved random numbers for your personal computer or
                 workstation",
  journal =      j-GEOBYTE,
  volume =       "7",
  number =       "2",
  pages =        "25--32",
  month =        apr,
  year =         "1992",
  ISSN =         "0885-6362",
  bibdate =      "Wed Feb 08 14:48:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This paper describes a procedure that enables you to
                 enhance the random number generator supplied with your
                 personal computer or workstation to the point where it
                 is possible to perform significant Monte Carlo analyses
                 or conditional simulations at your desk. This is
                 accomplished by mapping the pseudo-random numbers
                 supplied by the manufacturer through a table that
                 vastly increases the length of the sequence and
                 eliminates any local non-randomness. Two BASIC programs
                 are given to illustrate implementation of the
                 procedure; one program yields uniform random numbers
                 for Monte Carlo studies while the other program yields
                 random normal deviates for conditional simulations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Geobyte",
}

@Article{Bellido:1992:SBR,
  author =       "M. J. Bellido and A. J. Acosta and M. Valencia and A.
                 Barriga and J. L. Huertas",
  title =        "Simple binary random number generator",
  journal =      j-ELECT-LETTERS,
  volume =       "28",
  number =       "6",
  pages =        "617--618",
  day =          "26",
  month =        mar,
  year =         "1992",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19920389",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:32 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=133026",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@InProceedings{Berdnikov:1992:RNG,
  author =       "A. S. Berdnikov and S. B. Tunia and A. Compagner",
  editor =       "Robert A. de Groot and Jaroslav Nadrhal",
  booktitle =    "{Physics computing '92: proceedings of the 4th
                 international conference, Prague, Czechoslovakia,
                 August 24--28, 1992}",
  title =        "Random-number generators: testing procedures and
                 comparison of {RNG} algorithms",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  bookpages =    "xix + 517",
  pages =        "264--265",
  year =         "1992",
  ISBN =         "981-02-1245-3",
  ISBN-13 =      "978-981-02-1245-2",
  LCCN =         "QC20 .I45 1992",
  bibdate =      "Sun Feb 12 09:18:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "physics; data processing; congresses; mathematical
                 physics; methodology",
}

@Book{Binder:1992:MCS,
  author =       "K. (Kurt) Binder and Dieter W. Heermann",
  title =        "{Monte Carlo} simulation in statistical physics: an
                 introduction",
  volume =       "80",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "viii + 129",
  year =         "1992",
  ISBN =         "3-540-55729-6 (Berlin), 0-387-55729-6 (New York)",
  ISBN-13 =      "978-3-540-55729-6 (Berlin), 978-0-387-55729-8 (New
                 York)",
  LCCN =         "QC174.85.M64 B55 1992",
  bibdate =      "Sat Feb 8 18:03:14 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in solid state sciences",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method; Statistical physics; Random walks
                 (Mathematics)",
}

@Article{Bratley:1992:ITL,
  author =       "Paul Bratley and Bennett L. Fox and Harald
                 Niederreiter",
  title =        "Implementation and tests of low-discrepancy
                 sequences",
  journal =      j-TOMACS,
  volume =       "2",
  number =       "3",
  pages =        "195--213",
  month =        jul,
  year =         "1992",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:25 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Brenner:1992:PRL,
  author =       "N. Brenner and S. Fishman",
  title =        "Pseudo-randomness and localization",
  journal =      j-NONLINEARITY,
  volume =       "5",
  number =       "1",
  pages =        "211",
  year =         "1992",
  CODEN =        "NONLE5",
  DOI =          "https://doi.org/10.1088/0951-7715/5/1/009",
  ISSN =         "0951-7715 (print), 1361-6544 (electronic)",
  ISSN-L =       "0951-7715",
  bibdate =      "Wed Feb 22 09:02:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://stacks.iop.org/0951-7715/5/i=1/a=009",
  abstract =     "The degree of pseudo-randomness of several sequences
                 and its relation to Anderson localization is
                 investigated. It is rated with the help of the chi 2
                 test and the spectral test, which are extensively used
                 in computer science. The relationship between this
                 rating and localization for tight-binding models with
                 hopping to nearest neighbours and to next-nearest
                 neighbours in one dimension is investigated. The
                 results are relevant for localization in systems which
                 are studied in 'quantum chaos', where the potentials
                 are pseudo-random but not truly random.",
  acknowledgement = ack-nhfb,
  fjournal =     "Nonlinearity (Bristol)",
  journal-URL =  "http://iopscience.iop.org/0951-7715",
}

@InProceedings{Brent:1992:URN,
  author =       "R. P. Brent",
  editor =       "????",
  booktitle =    "Supercomputing, the competitive advantage: proceedings
                 of the {Fifth Australian Supercomputing Conference,
                 5ASC Organising Committee, Melbourne, 1992}",
  title =        "Uniform random number generators for supercomputers",
  publisher =    "????",
  address =      "????",
  bookpages =    "307",
  pages =        "95--104",
  year =         "1992",
  ISBN =         "0-86444-270-X",
  ISBN-13 =      "978-0-86444-270-3",
  bibdate =      "Mon Feb 27 18:37:34 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pd/rpb132.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Brickell:1992:CSR,
  author =       "E. F. Brickell and A. M. Odlyzko",
  title =        "Cryptanalysis: a survey of recent results",
  crossref =     "Simmons:1992:CCS",
  pages =        "501--540",
  year =         "1992",
  MRclass =      "94A60 (68P25)",
  MRnumber =     "1 205 139",
  bibdate =      "Tue Nov 05 07:36:38 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.research.att.com/~amo/doc/arch/cryptanalysis.surv.pdf;
                 http://www.research.att.com/~amo/doc/arch/cryptanalysis.surv.ps;
                 http://www.research.att.com/~amo/doc/arch/cryptanalysis.surv.tex",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brightwell:1992:TSP,
  author =       "Graham Brightwell and Teunis J. Ott and Peter
                 Winkler",
  title =        "Target shooting with programmed random variables",
  crossref =     "ACM:1992:PTF",
  pages =        "691--698",
  year =         "1992",
  bibdate =      "Wed Feb 20 18:34:00 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/129712/p691-brightwell/p691-brightwell.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/129712/p691-brightwell/",
  acknowledgement = ack-nhfb,
}

@Article{Burgess:1992:FLC,
  author =       "N. Burgess and K. V. Lever",
  title =        "Fast linear congruential pseudorandom number
                 generators using the {Messerschmitt} pipelining
                 transformation",
  journal =      j-IEE-PROC-E,
  volume =       "139",
  number =       "2",
  pages =        "131--133",
  year =         "1992",
  CODEN =        "IPETD3",
  DOI =          "https://doi.org/10.1049/ip-e.1992.0020",
  ISSN =         "0143-7062",
  bibdate =      "Thu Dec 29 09:09:57 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The speed of generation of uniformly distributed
                 pseudorandom numbers by means of the conventional
                 linear congruence algorithm is limited by the time
                 taken to perform the arithmetic operations required.
                 Iterating the system equation provides new forms of the
                 algorithm which can be pipelined for higher speed.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEE proceedings, E: Computers and digital techniques",
  journal-URL =  "https://digital-library.theiet.org/content/journals/ip-e",
  keywords =     "linear congruential pseudorandom number generators;
                 Messerschmitt pipelining transformation,
                 initialisation; multiply iterated LCG; multiply
                 iterated Wichmann--Hill algorithms",
}

@Article{Burton:1992:DRN,
  author =       "F. Warren Burton and Rex L. Page",
  title =        "Distributed random number generation",
  journal =      j-J-FUNCT-PROGRAM,
  volume =       "2",
  number =       "2",
  pages =        "203--212",
  month =        apr,
  year =         "1992",
  CODEN =        "JFPRES",
  DOI =          "https://doi.org/10.1017/S0956796800000320",
  ISSN =         "0956-7968 (print), 1469-7653 (electronic)",
  ISSN-L =       "0956-7968",
  bibdate =      "Tue Jul 11 18:01:51 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.cambridge.org/core/product/6D10F1D0A2FB7E66D5F746F6D0822D78",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Funct. Program.",
  fjournal =     "Journal of Functional Programming",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=JFP",
  keywords =     "splittable random-number streams",
  onlinedate =   "01 November 2008",
}

@Article{Canfield:1992:RARa,
  author =       "E. H. {Canfield, Jr.} and J. A. Viecelli",
  title =        "Random access to a random number sequence",
  journal =      j-J-COMPUT-PHYS,
  volume =       "98",
  number =       "2",
  pages =        "349--349",
  month =        feb,
  year =         "1992",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(92)90164-T",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:53 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/002199919290164T",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{Canfield:1992:RARb,
  author =       "E. H. {Canfield, Jr.} and J. A. Viecelli",
  title =        "Random access to a random number sequence",
  journal =      j-J-COMPUT-PHYS,
  volume =       "99",
  number =       "1",
  pages =        "176--178",
  month =        mar,
  year =         "1992",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(92)90285-7",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:54 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999192902857",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
  keywords =     "jump ahead method; leapfrog scheme",
}

@Article{Carroll:1992:CCE,
  author =       "John M. Carroll and Jeff Verhagen and Perry T. Wong",
  title =        "Chaos in Cryptography: The Escape from the Strange
                 Attractor",
  journal =      j-CRYPTOLOGIA,
  volume =       "16",
  number =       "1",
  pages =        "52--72",
  month =        jan,
  year =         "1992",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119291866766",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "94A60 (58F13)",
  MRnumber =     "1 145 809",
  bibdate =      "Mon Jun 30 15:39:01 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "cryptography; random characteristics; cipher system;
                 pseudo-random number generators; random generators;
                 Lorenz attractor; chaotic nature; strange attractor;
                 key management; authentication protocols",
  URL =          "http://www.informaworld.com/smpp/content~content=a741902824~db=all~order=page",
  ZMnumber =     "746.94012",
  abstract =     "Modern cryptography has a voracious appetite for
                 reproducible sequences of large numbers that possess
                 random characteristics. Because a cipher system is
                 vulnerable to attack if cryptanalysts can successfully
                 guess the nature of its underlying pseudo-random number
                 generators, it is helpful for cryptographers to have a
                 large repertoire of them. Chaos theory provides many
                 formulations that can be used as random generators. The
                 paper describes one of these, the Lorenz attractor. The
                 chaotic nature of the Lorenz system of equations makes
                 it a good candidate for pseudo-random number
                 generation. However, to ensure that its sequences are
                 not serially autocorrelated, they must be modified so
                 that the particle can escape from the field of the
                 strange attractor. The modified system produces
                 extremely long sequences with good random properties.
                 The generating algorithm is fast and efficient.
                 Significantly, several components are needed to specify
                 the starting point, which increases resistance to
                 cryptanalysis and admits a number of key management and
                 authentication protocols",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "chaos; cryptography; random number generation; random
                 processes",
  romanvolume =  "XVI",
}

@Article{Collins:1992:RNG,
  author =       "J. J. Collins and M. Fanciulli and R. G. Hohlfeld and
                 D. C. Finch and G. v. H. Sandri and E. S. Shtatland",
  title =        "A random number generator based on the logit transform
                 of the logistic variable",
  journal =      j-COMPUT-PHYS,
  volume =       "6",
  number =       "6",
  pages =        "630--??",
  month =        nov,
  year =         "1992",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168442",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Wed Apr 10 08:45:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://aip.scitation.org/doi/10.1063/1.168442",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Phys",
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
}

@Article{Dai:1992:BSD,
  author =       "Zong Duo Dai",
  title =        "Binary sequences derived from {ML}-sequences over
                 rings {I}: {Periods} and minimal polynomials",
  journal =      j-J-CRYPTOLOGY,
  volume =       "5",
  number =       "3",
  pages =        "193--207",
  month =        "????",
  year =         "1992",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "68P25 (68Q40)",
  MRnumber =     "93g:68030",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of London",
  affiliationaddress = "Surrey, Engl",
  classification = "723.1; 723.2; 921.1",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Algebra; Binary sequences; Cryptography; Integral
                 rings; Maximal length sequences; Minimal polynomials;
                 Number theory; Periods; Polynomials; Random number
                 generation",
}

@InProceedings{DalleMolle:1992:HOC,
  author =       "J. W. {Dalle Molle} and M. J. Hinich and D. J.
                 Morrice",
  title =        "Higher-Order Cumulant Spectral Based Statistical Tests
                 of Pseudo Random Variate Generators",
  crossref =     "Swain:1992:PWS",
  pages =        "618--625",
  year =         "1992",
  bibdate =      "Mon Feb 27 18:16:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{DeMatteis:1992:CCD,
  author =       "A. {De Matteis} and J. Eichenauer-Herrmann and H.
                 Grothe",
  title =        "Computation of critical distances within
                 multiplicative congruential pseudorandom number
                 sequences",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "39",
  number =       "1",
  pages =        "49--55",
  day =          "28",
  month =        feb,
  year =         "1992",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(92)90221-I",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279290221I",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{DeMatteis:1992:CDP,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Critical distances in pseudorandom sequences generated
                 with composite moduli",
  journal =      j-INT-J-COMPUT-MATH,
  volume =       "43",
  number =       "??",
  pages =        "189--196",
  month =        "????",
  year =         "1992",
  CODEN =        "IJCMAT",
  ISSN =         "0020-7160",
  ISSN-L =       "0020-7160",
  bibdate =      "Fri Jan 6 11:00:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computer Mathematics",
  journal-URL =  "http://www.tandfonline.com/loi/gcom20",
}

@InProceedings{Deng:1992:GLT,
  author =       "L.-Y. Deng and C. Rousseau and Y. Yuan",
  title =        "Generalized {Lehmer--Tausworthe} Random Number
                 Generators",
  crossref =     "Vouk:1992:PAS",
  pages =        "108--115",
  year =         "1992",
  DOI =          "https://doi.org/10.1145/503720.503758",
  bibdate =      "Mon Feb 27 18:16:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Deng:1992:RSN,
  author =       "L. Y. Deng and R. S. Chhikara",
  title =        "Robustness of some non-uniform random variate
                 generators",
  journal =      j-STAT-NEERLANDICA,
  volume =       "46",
  number =       "2--3",
  pages =        "195--207",
  month =        jul,
  year =         "1992",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1111/j.1467-9574.1992.tb01337.x",
  ISSN =         "0039-0402 (print), 1467-9574 (electronic)",
  ISSN-L =       "0039-0402",
  bibdate =      "Mon Jan 16 12:41:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistica Neerlandica. Journal of the Netherlands
                 Society for Statistics and Operations Research",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9574",
}

@Article{Deng:1992:SCU,
  author =       "Lih-Yuan Deng and E. Olusegun George",
  title =        "Some characterizations of the uniform distribution
                 with applications to random number generation",
  journal =      j-ANN-INST-STAT-MATH-TOKYO,
  volume =       "44",
  number =       "2",
  pages =        "379--385",
  month =        jun,
  year =         "1992",
  CODEN =        "AISXAD",
  DOI =          "https://doi.org/10.1007/BF00058647",
  ISSN =         "0020-3157 (print), 1572-9052 (electronic)",
  ISSN-L =       "0020-3157",
  bibdate =      "Sat Jan 31 16:59:47 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/anninststatmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00058647",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of the Institute of Statistical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10463",
}

@Article{Devroye:1992:BPM,
  author =       "Luc Devroye",
  title =        "A branching process method in {Lagrange} random
                 variate generation",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "21",
  number =       "1",
  pages =        "1--14",
  year =         "1992",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919208813005",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:35 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Article{Devroye:1992:RVG,
  author =       "Luc Devroye",
  title =        "Random variate generation for the digamma and trigamma
                 distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "43",
  number =       "3--4",
  pages =        "197--216",
  month =        "????",
  year =         "1992",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659208811438",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:39:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659208811438",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Dougherty:1992:OMSa,
  author =       "Edward R. Dougherty",
  title =        "Optimal mean-square {$N$}-observation digital
                 morphological filters. {I}. {Optimal} binary filters",
  journal =      j-CVGIP-IU,
  volume =       "55",
  number =       "1",
  pages =        "36--54",
  month =        jan,
  year =         "1992",
  CODEN =        "CIUNEJ",
  ISSN =         "1049-9660 (print), 1557-7635 (electronic)",
  ISSN-L =       "1049-9660",
  bibdate =      "Sat Sep 14 09:22:46 MDT 1996",
  bibsource =    "Ai/cmubib.bib;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Center for Imaging Sci., Rochester Inst. of Technol.,
                 NY, USA",
  classification = "B0260 (Optimisation techniques); B1270F (Digital
                 filters); B6140C (Optical information and image
                 processing); C1180 (Optimisation techniques); C1250
                 (Pattern recognition); C5240 (Digital filters)",
  fjournal =     "Computer Vision, Graphics, and Image Processing. Image
                 Understanding",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10499660",
  keywords =     "Matheron representation; Numerical functionals;
                 Optimal mean square N-observation digital morphological
                 filters; Optimization; Random variables; Single-erosion
                 filters; Statistical estimation; Structuring element",
  location =     "CMU Engineering \& Science Library",
  thesaurus =    "Digital filters; Optimisation; Picture processing;
                 Statistical analysis",
}

@Article{Dougherty:1992:OMSb,
  author =       "Edward R. Dougherty",
  title =        "Optimal mean-square {$N$}-observation digital
                 morphological filters. {II}. {Optimal} gray-scale
                 filters",
  journal =      j-CVGIP-IU,
  volume =       "55",
  number =       "1",
  pages =        "55--72",
  month =        jan,
  year =         "1992",
  CODEN =        "CIUNEJ",
  ISSN =         "1049-9660 (print), 1557-7635 (electronic)",
  ISSN-L =       "1049-9660",
  bibdate =      "Sat Sep 14 09:22:46 MDT 1996",
  bibsource =    "Ai/cmubib.bib;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Center for Imaging Sci., Rochester Inst. of Technol.,
                 NY, USA",
  classification = "B0260 (Optimisation techniques); B1270F (Digital
                 filters); B6140C (Optical information and image
                 processing); C1180 (Optimisation techniques); C1250
                 (Pattern recognition); C5240 (Digital filters)",
  fjournal =     "Computer Vision, Graphics, and Image Processing. Image
                 Understanding",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10499660",
  keywords =     "Digital gray-scale morphological operations; Dilation
                 optimization; Gray-scale filters; Integer-valued
                 vectors; Mean-square optimization; Morphological
                 statistical estimation; Multiple-erosion filters; N
                 observation random variables; Numerical functionals;
                 Single-erosion filters",
  location =     "CMU Engineering \& Science Library",
  thesaurus =    "Digital filters; Optimisation; Picture processing;
                 Statistical analysis",
}

@Article{Ehrenfeucht:1992:PSH,
  author =       "Andrzej Ehrenfeucht and Jan Mycielski",
  title =        "A Pseudorandom Sequence--How Random Is It?",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "99",
  number =       "4",
  pages =        "373--375",
  month =        apr,
  year =         "1992",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2324917.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Article{Eichenauer-Herrmann:1992:ASI,
  author =       "J. Eichenauer-Herrmann",
  title =        "On the autocorrelation structure of inversive
                 congruential pseudorandom number sequences",
  journal =      j-STATIST-PAPERS,
  volume =       "33",
  number =       "1",
  pages =        "261--268",
  month =        dec,
  year =         "1992",
  CODEN =        "STPAE4",
  DOI =          "https://doi.org/10.1007/BF02925329",
  ISSN =         "0932-5026 (print), 1613-9798 (electronic)",
  ISSN-L =       "0932-5026",
  MRclass =      "65C10",
  MRnumber =     "1186171 (94b:65016)",
  MRreviewer =   "Renata Rotondi",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The inversive congruential method for generating
                 uniform pseudorandom numbers is a particularly
                 attractive alternative to linear congruential
                 generators with their well known deficiencies. In the
                 present paper inversive congruential generators with
                 power of two modulus are considered. Known favourable
                 results on the period length and the statistical
                 independence properties of the generated sequences are
                 summarized. Besides that the autocorrelation structure
                 of inversive congruential sequences is studied. The
                 main result reveals a remarkable autocorrelation
                 property of the inversive congruential method.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Papers = Statistische Hefte",
  journal-URL =  "http://link.springer.com/journal/362",
  remark =       "For an inversive congruential generator $ x = (A * y +
                 C) \bmod P $, where $ x y \mod P = 1 $, the paper
                 states the period for power-of-two values of $P$ like
                 this (in our notation): ``Theorem 1: An inversive
                 congruential sequence ($ y_n $, $ n \geq 0 $ ) with $ P
                 = 2^\omega $ for $ \omega \geq 3 $ has maximal period
                 length $ 2^{\omega - 1} $, i.e., $ \{ y_0, y_1, \ldots
                 {}, y_{(m / 2) 1} = G_m \} $, if and only if $ A \equiv
                 1 \pmod 4 $ and $ C \equiv 2 \pmod 4 $''.",
}

@Article{Eichenauer-Herrmann:1992:CIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Construction of inversive congruential pseudorandom
                 number generators with maximal period length",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "40",
  number =       "3",
  pages =        "345--349",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(92)90190-9",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  MRclass =      "65C10",
  MRnumber =     "1170913 (93d:65010)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042792901909",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Eichenauer-Herrmann:1992:ICP,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Inversive Congruential Pseudorandom Numbers: a
                 Tutorial",
  journal =      j-INT-STAT-REV,
  volume =       "60",
  number =       "2",
  pages =        "167--176",
  month =        aug,
  year =         "1992",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Tue Dec 20 08:54:06 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1403647",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@Article{Eichenauer-Herrmann:1992:LBD,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "Lower bounds for the discrepancy of inversive
                 congruential pseudorandom numbers with power of two
                 modulus",
  journal =      j-MATH-COMPUT,
  volume =       "58",
  number =       "198",
  pages =        "775--779",
  month =        apr,
  year =         "1992",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153216",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "92i:65018",
  MRreviewer =   "Peter Schatte",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2153216.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Tech. Hochschule Darmstadt, Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "consecutive pseudorandom numbers; discrepancy;
                 generators; independence properties; inversive
                 congruential; inversive congruential method; number
                 theory; pseudorandom numbers; random number generation;
                 serial test; statistical",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eichenauer-Herrmann:1992:NIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Holger Grothe",
  title =        "A new inversive congruential pseudorandom number
                 generator with power of two modulus",
  journal =      j-TOMACS,
  volume =       "2",
  number =       "1",
  pages =        "1--11",
  month =        jan,
  year =         "1992",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:24 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Eichenauer-Herrmann:1992:RDQ,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "A remark on the discrepancy of quadratic congruential
                 pseudorandom numbers",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "43",
  number =       "3",
  pages =        "383--387",
  day =          "2",
  month =        dec,
  year =         "1992",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(92)90023-Q",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279290023Q",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Book{Engel:1992:RRP,
  author =       "Eduardo Engel",
  title =        "A road to randomness in physical systems",
  volume =       "71",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 155",
  year =         "1992",
  ISBN =         "0-387-97740-6 (New York), 3-540-97740-6 (Berlin)",
  ISBN-13 =      "978-0-387-97740-9 (New York), 978-3-540-97740-7
                 (Berlin)",
  LCCN =         "QC20.7.P7 E54 1992",
  bibdate =      "Mon Feb 27 18:29:59 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Lecture notes in statistics",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Functional analysis; Convergence;
                 Mathematical physics",
}

@Article{Faure:1992:GPE,
  author =       "Henri Faure",
  title =        "Good Permutations for Extreme Discrepancy",
  journal =      j-J-NUMBER-THEORY,
  volume =       "42",
  number =       "1",
  pages =        "47--56",
  month =        sep,
  year =         "1992",
  CODEN =        "JNUTA9",
  DOI =          "https://doi.org/10.1016/0022-314X(92)90107-Z",
  ISSN =         "0022-314X (print), 1096-1658 (electronic)",
  ISSN-L =       "0022-314X",
  bibdate =      "Mon Feb 27 18:33:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Number Theory",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0022314X",
}

@Article{Ferrenberg:1992:MCS,
  author =       "Alan M. Ferrenberg and D. P. Landau and Y. Joanna
                 Wong",
  title =        "{Monte Carlo} simulations: Hidden errors from `good'
                 random number generators",
  journal =      j-PHYS-REV-LET,
  volume =       "69",
  number =       "23",
  pages =        "3382--3384",
  day =          "7",
  month =        dec,
  year =         "1992",
  CODEN =        "PRLTAO",
  DOI =          "https://doi.org/10.1103/PhysRevLett.69.3382",
  ISSN =         "0031-9007 (print), 1079-7114 (electronic), 1092-0145",
  ISSN-L =       "0031-9007",
  bibdate =      "Sun Dec 18 09:16:59 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Grassberger:1993:CGR}.",
  URL =          "http://prl.aps.org/abstract/PRL/v69/i23/p3382_1",
  abstract =     "The Wolff algorithm is now accepted as the best
                 cluster-flipping Monte Carlo algorithm for beating
                 ``critical slowing down.'' We show how this method can
                 yield incorrect answers due to subtle correlations in
                 ``high quality'' random number generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review Letters",
  journal-URL =  "http://prl.aps.org/browse",
  remark =       "This paper is cited for its revelations about the
                 sensitivity of Monte Carlo simulations to the
                 underlying random-number generator. From the paper:\par
                 Page 3383: ``Surprisingly, we find that the use of the
                 `high quality' generators together with the Wolff
                 algorithm produces systematically incorrect results.
                 \ldots{} Runs made using the SWC generator gave better
                 results, but even these data showed noticeable
                 systematic errors which had the opposite sign from
                 those produced using R250. In contrast, data obtained
                 using the simple 32-bit congruential generator CONG
                 produced answers which were correct to within the error
                 bars. Even use of the mixed generator SWCW did not
                 yield results which were free of bais, although the
                 systematic errors were much smaller.''\par From page
                 3384: ``extensive Monte Carlo simulations on an Ising
                 model for which the exact answers are known have shown
                 that ostensibly high quality random number generators
                 may lead to subtle, but dramatic, systematic errors for
                 some algorithms, but not others. Since there is no
                 reason to believe that the model which we have
                 investigated has any special idiosyncrasies, these
                 results offer another stern warning about the need to
                 very carefully test the implementation of new
                 algorithms. In particular, this means that a specific
                 algorithm must be tested together with the random
                 number generator being used {\em regardless} of the
                 tests which the generator has passed.''",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Gavelek:1992:SII,
  author =       "D. Gavelek and T. Erber",
  title =        "Shadowing and iterative interpolation for
                 {{\v{C}}eby{\v{s}}ev} mixing transformations",
  journal =      j-J-COMPUT-PHYS,
  volume =       "101",
  number =       "1",
  pages =        "25--50",
  month =        jul,
  year =         "1992",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1016/0021-9991(92)90040-6",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:54:42 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0021999192900406",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Book{Gibbons:1992:NSI,
  author =       "Jean Dickinson Gibbons and Subhabrata Chakraborti",
  title =        "Nonparametric Statistical Inference",
  volume =       "131",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Third",
  pages =        "xix + 544",
  year =         "1992",
  ISBN =         "0-8247-8661-0",
  ISBN-13 =      "978-0-8247-8661-8",
  LCCN =         "QA278.8 .G5 1992",
  bibdate =      "Tue Jan 31 14:50:08 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  acknowledgement = ack-nhfb,
  subject =      "Nonparametric statistics",
}

@Article{Glasserman:1992:SGG,
  author =       "Paul Glasserman and David D. Yao",
  title =        "Some Guidelines and Guarantees for {Common Random
                 Numbers}",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "38",
  number =       "6",
  pages =        "884--908",
  month =        jun,
  year =         "1992",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.38.6.884",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Graham:1992:CFP,
  author =       "W. N. Graham",
  title =        "A comparison of four pseudo random number generators
                 implemented in {Ada}",
  journal =      j-SIMULETTER,
  volume =       "22",
  number =       "2",
  pages =        "3--18",
  month =        "Fall",
  year =         "1992",
  CODEN =        "SIMUD5",
  DOI =          "https://doi.org/10.1145/142103.142105",
  ISSN =         "0163-6103",
  bibdate =      "Thu Mar 08 21:17:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Simuletter",
}

@Article{Guha:1992:RCB,
  author =       "A. Guha and L. L. Kinney",
  title =        "Relating the cyclic behavior of linear and
                 intrainverted feedback shift registers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "41",
  number =       "9",
  pages =        "1088--1100",
  month =        sep,
  year =         "1992",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.165391",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jul 7 10:49:19 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=165391",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Heringa:1992:NPT,
  author =       "J. R. Heringa and H. W. J. Bl{\"o}te and A.
                 Compagner",
  title =        "New Primitive Trinomials of {Mersenne}-Exponent
                 Degrees for Random-Number Generation",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "3",
  number =       "3",
  pages =        "561--564",
  year =         "1992",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183192000361",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Mon Feb 27 18:35:09 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@PhdThesis{Impagliazzo:1992:PGP,
  author =       "Russell Graham Impagliazzo",
  title =        "Pseudo-random generators for probabilistic algorithms
                 and for cryptography",
  type =         "Thesis ({Ph.D.} in Mathematics)",
  school =       "Department of Mathematics, University of California,
                 Berkeley",
  address =      "Berkeley, CA, USA",
  pages =        "105",
  month =        dec,
  year =         "1992",
  LCCN =         "????",
  bibdate =      "Sat Oct 17 16:25:07 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "dissertations, academic --- UCB --- mathematics ---
                 1991--2000; University of California, Berkeley. Dept.
                 of Mathematics --- dissertations",
}

@Article{Ishikawa:1992:MHS,
  author =       "T. Ishikawa and P. Y. Wang and K. Wakui and T. Yabe",
  title =        "A method for the high-speed generation of random
                 numbers with arbitrary distributions",
  journal =      j-COMP-PHYS-COMM,
  volume =       "70",
  number =       "3",
  pages =        "501--509",
  month =        jul,
  year =         "1992",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(92)90112-C",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559290112C",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Kleijnen:1992:PNG,
  author =       "J. P. C. Kleijnen and B. Annink",
  title =        "Pseudorandom number generators for supercomputers and
                 classical computers: a practical introduction",
  journal =      j-EUR-J-OPER-RES,
  volume =       "63",
  number =       "1",
  pages =        "76--85",
  day =          "25",
  month =        nov,
  year =         "1992",
  CODEN =        "EJORDT",
  DOI =          "https://doi.org/10.1016/0377-2217(92)90056-F",
  ISSN =         "0377-2217 (print), 1872-6860 (electronic)",
  ISSN-L =       "0377-2217",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "When the cycle of a multiplicative congruential
                 generator with a modulus that is a power of two is
                 split into two parts, then the pseudorandom numbers
                 across parts turn out to lie on only two parallel
                 lines. These `long range' correlations have
                 consequences for computers with a traditional or a new
                 architecture. For vector computers, simple alternative
                 computer implementations are presented. These
                 implementations are faster \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "European Journal of Operational Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03772217",
  keywords =     "Monte Carlo simulation; parallel algorithm; random
                 number; simulation; software",
}

@Article{Kleijnen:1992:RMS,
  author =       "Jack P. C. Kleijnen",
  title =        "Regression Metamodels for Simulation with Common
                 Random Numbers: Comparison of Validation Tests and
                 Confidence Intervals",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "38",
  number =       "8",
  pages =        "1164--1185",
  month =        aug,
  year =         "1992",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.38.8.1164",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:53:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{Ko:1992:GPB,
  author =       "Chun Wa Ko and Frank Ruskey",
  title =        "Generating permutations of a bag by interchanges",
  journal =      j-INFO-PROC-LETT,
  volume =       "41",
  number =       "5",
  pages =        "263--269",
  day =          "3",
  month =        apr,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Centrum voor Wiskunde en Informatica",
  affiliationaddress = "Amsterdam, Netherlands",
  classification = "723; 921; C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Centrum voor Wiskunde en Inf., Amsterdam,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "bag by interchanges; Bag Permutations; Combinatorial
                 Mathematics; Computer Programming --- Algorithms;
                 Mathematical Techniques; permutations generation;
                 random number generation; successive permutations; time
                 linear",
  treatment =    "P Practical",
}

@Article{Kolonko:1992:GUD,
  author =       "M. Kolonko",
  title =        "Generating Uniformly Distributed Random Numbers
                 without Floating Point Operations",
  journal =      j-PROBAB-ENGRG-INFORM-SCI,
  volume =       "6",
  number =       "1",
  pages =        "139--145",
  month =        jan,
  year =         "1992",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1017/S0269964800002382",
  ISSN =         "0269-9648 (print), 1469-8951 (electronic)",
  ISSN-L =       "0269-9648",
  bibdate =      "Thu Aug 24 08:18:36 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib",
  URL =          "https://www.cambridge.org/core/product/4C1B47A0C509ECB109FC6000F69F7D18",
  acknowledgement = ack-nhfb,
  ajournal =     "Probab. Engrg. Inform. Sci.",
  fjournal =     "Probability in the Engineering and Informational
                 Sciences",
  journal-URL =  "http://www.journals.cambridge.org/jid_PES",
  onlinedate =   "01 July 2009",
}

@Article{Krawczyk:1992:HPC,
  author =       "Hugo Krawczyk",
  title =        "How to predict congruential generators",
  journal =      j-J-ALG,
  volume =       "13",
  number =       "4",
  pages =        "527--545",
  month =        dec,
  year =         "1992",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1016/0196-6774(92)90054-G",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Wed Dec 21 07:49:52 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/019667749290054G",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
}

@InCollection{Lagarias:1992:PN,
  author =       "Jeffrey C. Lagarias",
  title =        "Pseudorandom Numbers",
  crossref =     "Steele:1992:PA",
  chapter =      "6",
  pages =        "65--86",
  year =         "1992",
  bibdate =      "Wed Jan 09 18:13:14 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lawrance:1992:UDF,
  author =       "A. J. Lawrance",
  title =        "Uniformly Distributed First-Order Autoregressive Time
                 Series Models and Multiplicative Congruential Random
                 Number Generators",
  journal =      j-J-APPL-PROBAB,
  volume =       "29",
  number =       "4",
  pages =        "896--903",
  month =        dec,
  year =         "1992",
  CODEN =        "JPRBAM",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Sat Dec 31 10:36:03 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/3214722.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html;
                 http://projecteuclid.org/euclid.jap/",
}

@InProceedings{LEcuyer:1992:TRN,
  author =       "Pierre L'Ecuyer",
  title =        "Testing Random Number Generators",
  crossref =     "Swain:1992:PWS",
  pages =        "305--313",
  year =         "1992",
  bibdate =      "Mon Dec 26 10:32:19 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lehn:1992:PNG,
  author =       "J. Lehn",
  title =        "Pseudorandom number generators",
  crossref =     "Gritzmann:1992:ORE",
  pages =        "9--13",
  year =         "1992",
  bibdate =      "Tue Dec 27 11:18:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Leva:1992:ANR,
  author =       "Joseph L. Leva",
  title =        "{Algorithm 712}: a Normal Random Number Generator",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "454--455",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Fri Sep 30 00:53:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/138351.138367;
                 http://www.acm.org/pubs/citations/journals/toms/1992-18-4/p454-leva/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical software.",
}

@Article{Leva:1992:FNR,
  author =       "Joseph L. Leva",
  title =        "A Fast Normal Random Number Generator",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "449--453",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Fri Sep 30 00:53:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/138351.138364;
                 http://www.acm.org/pubs/citations/journals/toms/1992-18-4/p449-leva/",
  abstract =     "A method is presented for generating pseudorandom
                 numbers with a normal distribution. The technique uses
                 the ratio of uniform deviates method discovered by
                 Kinderman and Monahan with an improved set of bounding
                 curves. An optimized quadratic fit reduces the expected
                 number of logarithm evaluations to 0.012 per normal
                 deviate. The method gives a theoretically correct
                 distribution and can be implemented in 15 lines of
                 FORTRAN. Timing and source size comparisons are made
                 with other methods for generating normal deviates. The
                 proposed algorithm compares favorably with some of the
                 better algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@Article{Lloyd:1992:CBF,
  author =       "Sheelagh Lloyd",
  title =        "Counting binary functions with certain cryptographic
                 properties",
  journal =      j-J-CRYPTOLOGY,
  volume =       "5",
  number =       "2",
  pages =        "107--131",
  month =        "????",
  year =         "1992",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60",
  MRnumber =     "93e:94010",
  MRreviewer =   "Thomas W. Cusick",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hewlett Packard Lab",
  affiliationaddress = "Bristol, Engl",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Balance Property; Binary Functions; Correlation
                 Immunity; Cryptographic Properties; Cryptography;
                 Information Theory --- Correlation Theory; Mathematical
                 Statistics --- Random Number Generation; Strict
                 Avalanche Criterion; Theory",
}

@Article{Lo:1992:FCA,
  author =       "K. C. Lo and A. Purvis",
  title =        "Fast computational algorithm in parallel random
                 sampling",
  journal =      j-ELECT-LETTERS,
  volume =       "28",
  number =       "12",
  pages =        "1115--1117",
  month =        jun,
  year =         "1992",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19920704",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:32 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=141150",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Louchard:1992:DAD,
  author =       "G. Louchard and B. Randrianarimanana and R. Schott",
  title =        "Dynamic algorithms in {D. E. Knuth}'s model: a
                 probabilistic analysis",
  journal =      j-THEOR-COMP-SCI,
  volume =       "93",
  number =       "2",
  pages =        "201--225",
  day =          "17",
  month =        feb,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Lab. d'Inf. Theor. Univ. Libre de Bruxelles, Brussels,
                 Belgium",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "algorithm theory; average costs; binary search trees;
                 binary tournaments; binomial queues; Brownian excursion
                 functionals; data organizations; data structures;
                 deletions; dictionaries; dynamic algorithms;
                 dynamically varying data structures; Gaussian;
                 insertions; Knuth model; limiting processes; linear
                 lists; pagodas; priority queues; probabilistic
                 analysis; queries; random variables; sorted lists;
                 space costs; time costs; unsorted lists; variance
                 estimates",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maclaren:1992:LUL,
  author =       "N. M. Maclaren",
  title =        "A limit on the usable length of a pseudorandom
                 sequence",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "42",
  number =       "1--2",
  pages =        "47--54",
  month =        "????",
  year =         "1992",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659208811409",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Thu Jan 05 15:50:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659208811409",
  abstract =     "There is a very old, but apparently unpublished and
                 possibly unjustified, rule that a single simulation
                 should never use more pseudorandom numbers than the
                 square root of the generator's period. This paper
                 demonstrates that using more than the 2/3 power of the
                 period leads to excessive uniformity compared to a true
                 random sequence.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Makino:1992:GSR,
  author =       "Jun Makino and Tetsuya Takaishi and Osamu Miyamura",
  title =        "Generation of shift register random numbers on
                 distributed memory multiprocessors",
  journal =      j-COMP-PHYS-COMM,
  volume =       "70",
  number =       "3",
  pages =        "495--500",
  month =        jul,
  year =         "1992",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(92)90111-B",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559290111B",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InCollection{Marsaglia:1992:MRN,
  author =       "George Marsaglia",
  title =        "The mathematics of random number generators",
  crossref =     "Burr:1992:UEN",
  pages =        "73--90",
  year =         "1992",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "94a:11119",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  series =       "Proc. Sympos. Appl. Math.",
  ZMnumber =     "0776.65005",
  abstract =     "[For the entire collection see Zbl 0759.00006.]\par
                 This paper first describes the role of number theory
                 for the three most common classes of random number
                 generators such as congruential, shift- register, and
                 lagged-Fibonacci generators. A condition characterizing
                 full-period sequences for shift-register generators is
                 given its proof sketched, which also plays a role
                 establishing the periods of lagged- Fibonacci
                 generators. Then, more details are given for the
                 mathematics of a new class of random number generators
                 with quite long periods, called `add-with-carry' and
                 `subtract-with-borrow' generators [the author and {\it
                 A. Zaman}, Ann. Appl. Probab., 1, No. 3, 462--480
                 (1991; Zbl 0733.65005)]. A table listing examples of
                 some of the most common random number generators
                 including the classes mentioned above is given at the
                 end of this paper.",
  acknowledgement = ack-nhfb,
  keywords =     "add-with-carry generator; congruential generators;
                 lagged-Fibonacci generators; number theory; random
                 number generators; shift-register generators;
                 subtract-with-borrow generator",
  ZMclass =      "65C10 Random number generation 11K45 Pseudo-random
                 numbers, etc. 11A07 Congruences, etc. 11A63 Radix
                 representation",
  ZMreviewer =   "K. Uosaki (Tottori)",
}

@Article{Mason:1992:ACA,
  author =       "William K. Mason",
  title =        "Art from cellular automata and symmetrized
                 dot-patterns",
  journal =      j-COMPUTERS-AND-GRAPHICS,
  volume =       "16",
  number =       "4",
  pages =        "439--441",
  month =        "Winter",
  year =         "1992",
  CODEN =        "COGRD2",
  ISSN =         "0097-8493 (print), 1873-7684 (electronic)",
  ISSN-L =       "0097-8493",
  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "721.1; 723.1; 723.2; 922",
  fjournal =     "Computers and Graphics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00978493",
  journalabr =   "Comput Graphics (Pergamon)",
  keywords =     "Algorithms; Cellular automata; Computer graphics;
                 Finite automata; Image processing; Random number
                 generation; Symmetrized dot patterns",
}

@Article{Matsumoto:1992:TGG,
  author =       "Makoto Matsumoto and Yoshiharu Kurita",
  title =        "Twisted {GFSR} generators",
  journal =      j-TOMACS,
  volume =       "2",
  number =       "3",
  pages =        "179--194",
  month =        jul,
  year =         "1992",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:25 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Maurer:1992:UST,
  author =       "Ueli M. Maurer",
  title =        "A universal statistical test for random bit
                 generators",
  journal =      j-J-CRYPTOLOGY,
  volume =       "5",
  number =       "2",
  pages =        "89--105",
  month =        "????",
  year =         "1992",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "65C10 (68U20 94A60)",
  MRnumber =     "93e:65011",
  MRreviewer =   "I. V{\u{a}}duva",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETH Zuerich",
  affiliationaddress = "Zuerich, Switz",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Cryptographic Badness; Cryptography; Ergodic
                 Stationary Source; Exhaustive Key Search; Mathematical
                 Statistics; Random Bit Generator; Random Number
                 Generation; Randomness; State Transition Probabilities;
                 Statistical Methods --- Statistical Tests",
}

@Article{Meier:1992:CPC,
  author =       "Willi Meier and Othmar Staffelbach",
  title =        "Correlation properties of combiners with memory in
                 stream ciphers",
  journal =      j-J-CRYPTOLOGY,
  volume =       "5",
  number =       "1",
  pages =        "67--86",
  month =        "????",
  year =         "1992",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60",
  MRnumber =     "1 171 359",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "HTL Brugg-Windisch",
  affiliationaddress = "Windisch, Switz",
  classification = "723; 922",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Binary Sequences; Combiners; Computer Metatheory;
                 Computer Programming --- Algorithms; Cryptanalysis;
                 Cryptography --- Analysis; Information Theory ---
                 Correlation Theory; Linear Feedback Shift Registers
                 (lfsrs); Mathematical Statistics --- Random Number
                 Generation; Stream Cipher",
}

@Book{Mertsch:1992:MBB,
  author =       "Michael Mertsch",
  title =        "{Methoden zur Bestimmung und Begrenzung des Einflusses
                 algorithmischer Zufallszahlengeneratoren auf simulative
                 Untersuchungen}. ({German}) [{Methods} for determining
                 and limiting the influence of algorithmic random number
                 generators on experimental investigations]",
  volume =       "199",
  publisher =    "VDI-Verlag",
  address =      "D{\"u}sseldorf, Germany",
  pages =        "x + 206",
  year =         "1992",
  ISBN =         "3-18-149910-2",
  ISBN-13 =      "978-3-18-149910-8",
  LCCN =         "????",
  bibdate =      "Thu Mar 08 21:50:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Fortschritt-Berichte VDI: Reihe 10",
  URL =          "http://www.ub.tu-dortmund.de/katalog/titel/477670",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Article{Mode:1992:BRB,
  author =       "Charles J. Mode",
  title =        "Book Review: {{\booktitle{Random Number Generators and
                 Simulation}}, by Istv{\'a}n De{\'a}k}",
  journal =      j-SIAM-REVIEW,
  volume =       "34",
  number =       "2",
  pages =        "338--341",
  month =        jun,
  year =         "1992",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1034074",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Mon Jan 20 09:29:37 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  note =         "See \cite{Deak:1990:RNG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
}

@Article{Morii:1992:PSP,
  author =       "Masakatu Morii and Masao Kasahara",
  title =        "Perfect staircase profile of linear complexity for
                 finite sequences",
  journal =      j-INFO-PROC-LETT,
  volume =       "44",
  number =       "2",
  pages =        "85--89",
  day =          "19",
  month =        nov,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q30 (68P05 68P25 94A60)",
  MRnumber =     "93j:68081",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Ehime Univ., Matsuyama, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "computational complexity; cryptology; linear
                 complexity; pseudo-random sequences; random number
                 generation; staircase profile; unpredictability",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Mulmuley:1992:RGA,
  author =       "K. Mulmuley",
  title =        "Randomized geometric algorithms and pseudo-random
                 generators",
  crossref =     "IEEE:1992:ASF",
  pages =        "90--100",
  year =         "1992",
  bibdate =      "Thu Apr 5 06:13:50 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "This paper shows that a generalization of the familiar
                 linear congruential pseudo-random generator that uses $
                 O(\log {n}) $ bits can be substituted for the random
                 source in many randomized incremental algorithms used
                 in computational geometry without affecting the order
                 of complexity of the expected running time, thereby
                 reducing the number of truly random bits needed.",
}

@InProceedings{Nelson:1992:CRN,
  author =       "B. L. Nelson",
  editor =       "G. Klutke and D. A. Mitta and B. O. Nnaji and L. M.
                 Seiford",
  booktitle =    "Proceedings of the 1st Industrial Engineering Research
                 Conference",
  title =        "Common random numbers and multiple comparisons in
                 simulation analysis",
  publisher =    "????",
  address =      "????",
  pages =        "463--466",
  year =         "1992",
  bibdate =      "Fri Jan 6 11:02:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Niederreiter:1992:CLD,
  author =       "H. Niederreiter",
  booktitle =    "Colloquia Mathematica Societatis J{\'a}nos Bolyai, 60.
                 Sets, Graphs and Numbers, Budapest, 1991",
  title =        "Constructions of low-discrepancy point sets and
                 sequences",
  volume =       "60",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "529--559",
  year =         "1992",
  MRclass =      "11K38",
  MRnumber =     "1218217 (94b:11072)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Thu Feb 23 09:48:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Colloq. Math. Soc. J\'anos Bolyai",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1992:LDP,
  author =       "Harald Niederreiter",
  title =        "Low-discrepancy point sets obtained by digital
                 constructions over finite fields",
  journal =      j-CZECH-MATH-J,
  volume =       "42(117)",
  number =       "1",
  pages =        "143--166",
  year =         "1992",
  CODEN =        "CZMJAE",
  ISSN =         "0011-4642",
  MRclass =      "11K45 (11K38 11Y99)",
  MRnumber =     "1152177 (93c:11055)",
  MRreviewer =   "Gary L. Mullen",
  bibdate =      "Thu Feb 23 09:48:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Czechoslovak mathematical journal = Chekhoslovatskii
                 matematicheskii zhurnal",
}

@InProceedings{Niederreiter:1992:NMPa,
  author =       "Harald Niederreiter",
  title =        "New methods for pseudorandom number and pseudorandom
                 vector generation",
  crossref =     "Swain:1992:PWS",
  pages =        "264--269",
  year =         "1992",
  bibdate =      "Fri Dec 23 22:15:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Niederreiter:1992:NMPb,
  author =       "Harald Niederreiter",
  title =        "Nonlinear methods for pseudorandom number and vector
                 generation",
  crossref =     "Pflug:1992:SOP",
  pages =        "145--153",
  year =         "1992",
  bibdate =      "Mon Dec 26 11:34:28 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Niederreiter:1992:RNG,
  author =       "Harald Niederreiter",
  title =        "Random Number Generation and Quasi-{Monte Carlo}
                 Methods",
  volume =       "63",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "vi + 241",
  year =         "1992",
  ISBN =         "0-89871-295-5",
  ISBN-13 =      "978-0-89871-295-7",
  LCCN =         "QA298 .N54 1992",
  bibdate =      "Sat Mar 8 11:02:12 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Author's expanded lecture notes from his talks at the
                 NSF-CBMS Regional Research Conference on Random Number
                 Generation and Quasi-Monte Carlo Methods held at the
                 University of Alaska at Fairbanks, August 13--17,
                 1990.",
  subject =      "Monte Carlo method; congresses; random number
                 generators",
  xxseries =     "CBMS-NSF regional conference series in applied
                 mathematics",
  xxURL =        "http://www.loc.gov/catdir/enhancements/fy0726/92012567-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/92012567-t.html",
}

@Article{Nisan:1992:PGS,
  author =       "N. Nisan",
  title =        "Pseudorandom generators for space-bounded
                 computation",
  journal =      j-COMBINATORICA,
  volume =       "12",
  number =       "4",
  pages =        "449--461",
  month =        dec,
  year =         "1992",
  CODEN =        "COMBDI",
  DOI =          "https://doi.org/10.1007/BF01305237",
  ISSN =         "0209-9683 (print), 1439-6912 (electronic)",
  ISSN-L =       "0209-9683",
  bibdate =      "Sat Feb 04 09:52:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments \cite{David:2011:HSN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Combinatorica",
  journal-URL =  "http://link.springer.com/journal/volumesAndIssues/493",
  remark =       "Also appears in STOC'90 proceedings.",
}

@Book{Nisan:1992:UHP,
  author =       "Noam Nisan",
  title =        "Using hard problems to create pseudorandom
                 generators",
  volume =       "1990",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "vi + 43",
  year =         "1992",
  ISBN =         "0-262-14051-9",
  ISBN-13 =      "978-0-262-14051-5",
  LCCN =         "QA298 .N57 1992",
  bibdate =      "Mon Feb 27 18:37:30 MST 2012",
  bibsource =    "clas.caltech.edu:210/INNOPAC;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "ACM distinguished dissertations",
  acknowledgement = ack-nhfb,
  remark =       "Based on the author's 1988 Ph.D. dissertation,
                 University of California, Berkeley.",
  subject =      "Random number generators; Computational complexity",
}

@Article{Novak:1992:DMR,
  author =       "S. Yu. Novak",
  title =        "On the Distribution of the Maximum of a Random Number
                 of Random Variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "36",
  number =       "4",
  pages =        "714--721",
  month =        dec,
  year =         "1992",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1136087",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:40:55 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/36/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1992",
}

@Article{Percus:1992:ESC,
  author =       "Ora Engelberg Percus and Jerome K. Percus",
  title =        "An expanded set of correlation tests for linear
                 congruential random number generators",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "1",
  number =       "2",
  pages =        "161--168",
  month =        jun,
  year =         "1992",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548300000171",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "MR1179246 (93g:65014)",
  MRreviewer =   "Salvatore Ingrassia",
  bibdate =      "Sat Nov 26 17:00:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Percus:1992:IRS,
  author =       "Ora E. Percus and J. K. Percus",
  title =        "Intrinsic relations in the structure of linear
                 congruential generators modulo $ 2^\beta $",
  journal =      j-STAT-PROB-LETT,
  volume =       "15",
  number =       "5",
  pages =        "381--383",
  year =         "1992",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(92)90158-2",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "65C10",
  MRnumber =     "1193897 (93i:65011)",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
}

@Article{Peres:1992:INP,
  author =       "Yuval Peres",
  title =        "Iterating {von Neumann}'s Procedure for Extracting
                 Random Bits",
  journal =      j-ANN-STAT,
  volume =       "20",
  number =       "1",
  pages =        "590--197",
  month =        mar,
  year =         "1992",
  CODEN =        "ASTSC7",
  ISSN =         "0090-5364 (print), 2168-8966 (electronic)",
  ISSN-L =       "0090-5364",
  bibdate =      "Sat Sep 17 09:56:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2242181",
  abstract =     "Given a sequence of independent, identically
                 distributed random biased bits, von Neumann's simple
                 procedure extracts independent unbiased bits. In this
                 note we show that the number of unbiased bits produced
                 by iterating this procedure is arbitrarily close to the
                 entropy bound.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aos/",
}

@Article{Peterson:1992:MCP,
  author =       "I. Peterson",
  title =        "{Monte Carlo} Physics: a Cautionary Lesson",
  journal =      j-SCIENCE-NEWS,
  volume =       "142",
  number =       "25--26",
  pages =        "422--422",
  day =          "19",
  month =        dec,
  year =         "1992",
  CODEN =        "SCNEBK",
  ISSN =         "0036-8423 (print), 1943-0930 (electronic)",
  ISSN-L =       "0036-8423",
  bibdate =      "Sat Mar 03 07:52:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Comment on negative experience with the
                 Marsaglia--Zaman generator reported in
                 \cite{Ferrenberg:1992:MCS}. See response
                 \cite{Marsaglia:1993:LHR}.",
  URL =          "http://www.jstor.org/stable/4018020",
  acknowledgement = ack-nhfb,
  ajournal =     "Sci. News (Washington, DC)",
  fjournal =     "Science News (Washington, DC)",
  journal-URL =  "http://www.jstor.org/journals/00368423.html;
                 http://www.sciencenews.org/view/archives;
                 http://www3.interscience.wiley.com/journal/122396840/home",
}

@Article{Plimpton:1992:PSE,
  author =       "S. J. Plimpton and J. R. Michael and A. D. {Romig,
                 Jr.}",
  title =        "Parallel Simulation of Electron-Solid Interactions for
                 Electron Microscopy Modeling",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "6",
  number =       "2",
  pages =        "139--151",
  month =        jun,
  year =         "1992",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/BF00129775",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Wed Jul 6 11:13:04 MDT 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/Parallel/JOURNAL.SUPER.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=6&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=6&issue=2&spage=139",
  acknowledgement = ack-nhfb,
  affiliation =  "Sandia Nat. Lab., Albuquerque, NM, USA",
  classification = "B0240G (Monte Carlo methods); C7410D (Electronic
                 engineering)C1140G (Monte Carlo methods)",
  corpsource =   "Sandia Nat. Lab., Albuquerque, NM, USA",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  keywords =     "digital simulation; electron microscopes; electron
                 microscopy modeling; electron-solid interactions;
                 electronic engineering computing; load-balancing; Monte
                 Carlo algorithm; Monte Carlo methods; parallel
                 algorithms; parallel implementation; random number
                 generation",
  treatment =    "A Application; P Practical",
}

@Book{Press:1992:NRF,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes in {FORTRAN}: {The} Art of
                 Scientific Computing",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xxvi + 963",
  year =         "1992",
  ISBN =         "0-521-43064-X (book), 0-521-43721-0 (example book)
                 0-521-43717-2 (diskette), 0-521-43719-9 (diskette),
                 0-521-43716-4 (diskette)",
  ISBN-13 =      "978-0-521-43064-7 (book), 978-0-521-43721-9 (example
                 book) 978-0-521-43717-2 (diskette), 978-0-521-43719-6
                 (diskette), 978-0-521-43716-5 (diskette)",
  LCCN =         "QA76.73.C15 N865 1992",
  MRclass =      "65-00 (62-04 65-04)",
  MRnumber =     "93i:65001a",
  bibdate =      "Wed Apr 11 06:18:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "FORTRAN (Computer program language); Fortran (computer
                 program language); numerical analysis -- computer
                 programs; Numerical analysis --- Computer programs;
                 science -- mathematics -- computer programs; Science
                 --- Mathematics --- Computer programs",
}

@Article{Press:1992:PRN,
  author =       "William H. Press and Saul A. Teukolsky",
  title =        "Portable Random Number Generators",
  journal =      j-COMPUT-PHYS,
  volume =       "6",
  number =       "5",
  pages =        "522--524",
  month =        sep # "\slash " # oct,
  year =         "1992",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.4823101",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Mon Aug 02 17:57:05 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://aip.scitation.org/doi/10.1063/1.4823101",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Phys",
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
  remark =       "ran2() range is [1,2147483562], with period about
                 2.3e+18.",
}

@Article{Ressler:1992:RLP,
  author =       "Eugene K. Ressler",
  title =        "Random list permutations in place",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "5",
  pages =        "271--275",
  day =          "5",
  month =        oct,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (68Q25)",
  MRnumber =     "93g:68016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "721.1; 723.1; 723.1.1; 723.2; 922.1; C4240
                 (Programming and algorithm theory); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Common Lisp; computational complexity;
                 Computational methods; constant-time random bit
                 generator; Data handling; Data structures; expected
                 time; Linked lists; Lisp (programming language); lisp
                 (programming language); list processing; List
                 processing languages; Permutations; Probabilistic
                 logics; Probability; Programming language Common Lisp;
                 Programming language {Common Lisp}; RAM; Random bit
                 generator; Random list permutations; random list
                 permutations; Random number generation; Random
                 processes; Recursive functions; singly linked list;
                 stack space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Savir:1992:MSL,
  author =       "J. Savir and W. H. McAnney",
  title =        "A multiple seed linear feedback shift register",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "41",
  number =       "2",
  pages =        "250--252",
  month =        feb,
  year =         "1992",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.123404",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jul 7 10:49:15 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=123404",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Schneier:1992:PRS,
  author =       "Bruce Schneier",
  title =        "Pseudo-random sequence generator for 32-bit {CPUs}",
  journal =      j-DDJ,
  volume =       "17",
  number =       "2",
  pages =        "34, 37--38, 40",
  month =        feb,
  year =         "1992",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 10 10:06:23 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6150C (Compilers,
                 interpreters and other processors)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  keywords =     "32 Bit/s; Compiler; Machine-independent generator;
                 Microprocessors; Random sequence generator",
  thesaurus =    "Program compilers; Random number generation",
}

@Book{Sedgewick:1992:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1992",
  ISBN =         "0-201-36118-3, 0-201-51059-6",
  ISBN-13 =      "978-0-201-36118-6, 978-0-201-51059-1",
  LCCN =         "QA76.73.C153 S38 1992",
  MRclass =      "68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  ZMnumber =     "0826.68025",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Fundamentals \\
                 1: Introduction \\
                 Algorithms \\
                 Outline of Topics \\
                 2: C++ (and C) \\
                 Example: Euclid's Algorithm \\
                 Types of Data \\
                 Input/Output \\
                 Concluding Remarks \\
                 3: Elementary Data Structures \\
                 Arrays \\
                 Linked Lists \\
                 Storage Allocation \\
                 Pushdown Stacks \\
                 Queues \\
                 Linked List Implementation of Stacks \\
                 Abstract and Concrete Data Types \\
                 4: Trees \\
                 Glossary \\
                 Properties \\
                 Representing Binary Trees \\
                 Representing Forests \\
                 Traversing Trees \\
                 5: Recursion \\
                 Recurrences \\
                 Divide-and-Conquer \\
                 Recursive Tree Traversal \\
                 Removing Recursion \\
                 Perspective \\
                 6: Analysis of Algorithms \\
                 Framework \\
                 Classification of Algorithms \\
                 Computational Complexity \\
                 Average-Case Analysis \\
                 Approximate and Asymptotic Results \\
                 Basic Recurrences \\
                 Perspective \\
                 7: Implementation of Algorithms \\
                 Selecting an Algorithm \\
                 Empirical Analysis \\
                 Program Optimization \\
                 Algorithms and Systems \\
                 Sorting Algorithms \\
                 8: Elementary Sorting Methods \\
                 Rules of the Game \\
                 Selection Sort \\
                 Insertion Sort \\
                 Digression: Bubble Sort \\
                 Performance Characteristics of Elementary Sorts \\
                 Sorting Files with Large Records \\
                 Shellsort \\
                 Distribution Counting \\
                 9: Quicksort \\
                 The Basic Algorithm \\
                 Performance Characteristics of Quicksort \\
                 Removing Recursion \\
                 Small Subfiles \\
                 Median-of-Three Partitioning \\
                 Selection \\
                 10: Radix Sorting \\
                 Bits \\
                 Radix Exchange Sort \\
                 Straight Radix Sort \\
                 Performance Characteristics of Radix Sorts \\
                 A Linear Sort \\
                 11: Priority Queues \\
                 Elementary Implementations \\
                 Heap Data Structure \\
                 Algorithms on Heaps \\
                 Heapsort \\
                 Indirect Heaps \\
                 Advanced Implementations \\
                 12: Mergesort \\
                 Merging \\
                 Mergesort \\
                 List Mergesort \\
                 Bottom-Up Mergesort \\
                 Performance Characteristics \\
                 Optimized Implementations \\
                 Recursion Revisited \\
                 13: External Sorting \\
                 Sort-Merge \\
                 Balanced Multiway Merging \\
                 Replacement Selection \\
                 Practical Considerations \\
                 Polyphase Merging \\
                 An Easier Way \\
                 Searching Algorithms \\
                 14: Elementary Searching Methods \\
                 Sequential Searching \\
                 Binary Search \\
                 Binary Tree Search \\
                 Deletion \\
                 Indirect Binary Search Trees \\
                 15: Balanced Trees \\
                 Top-Down 2-3-4 Trees \\
                 Red-Black Trees \\
                 Other Algorithms \\
                 16: Hashing \\
                 Hash Functions \\
                 Separate Chaining \\
                 Linear Probing \\
                 Double Hashing \\
                 Perspective \\
                 17: Radix Searching \\
                 Digital Search Trees \\
                 Radix Search Tries \\
                 Multiway Radix Searching \\
                 Patricia \\
                 18: External Searching \\
                 Indexed Sequential Access \\
                 B-Trees \\
                 Extendible Hashing \\
                 Virtual Memory \\
                 String Processing \\
                 19: String Searching \\
                 A Short History \\
                 Brute-Force Algorithm \\
                 Knuth--Morris--Pratt Algorithm \\
                 Boyer--Moore Algorithm \\
                 Rabin--Karp Algorithm \\
                 Multiple Searches \\
                 20: Pattern Matching \\
                 Describing Patterns \\
                 Pattern Matching Machines \\
                 Representing the Machine \\
                 Simulating the Machine \\
                 21: Parsing \\
                 Context-Free Grammars \\
                 Top-Down Parsing \\
                 Bottom-Up Parsing \\
                 Compilers \\
                 Compiler-Compilers \\
                 22: File Compression \\
                 Run-Length Encoding \\
                 Variable-Length Encoding \\
                 Building the Huffman Code \\
                 Implementation \\
                 23: Cryptology \\
                 Rules of the Game \\
                 Simple Methods \\
                 Encryption/Decryption Machines \\
                 Public-Key Cryptosystems \\
                 Geometric Algorithms \\
                 24: Elementary Geometric Methods \\
                 Points, Lines, and Polygons \\
                 Line Segment Intersection \\
                 Simple Closed Path \\
                 Inclusion in a Polygon \\
                 Perspective \\
                 25: Finding the Convex Hull \\
                 Rules of the Game \\
                 Package-Wrapping \\
                 The Graham Scan \\
                 Interior Elimination \\
                 Performance Issues \\
                 26: Range Searching \\
                 Elementary Methods \\
                 Grid Method \\
                 Two-Dimensional Trees \\
                 Multidimensional Range Searching \\
                 27: Geometric Intersection \\
                 Horizontal and Vertical Lines \\
                 Implementation \\
                 General Line Intersection \\
                 28: Closest-Point Problems \\
                 Closest-Pair Problem \\
                 Voronoi Diagrams \\
                 Graph Algorithms \\
                 29: Elementary Graph Algorithms \\
                 Glossary \\
                 Representation \\
                 Depth-First Search \\
                 Nonrecursive Depth-First Search \\
                 Breadth-First Search \\
                 Mazes \\
                 Perspective \\
                 30: Connectivity \\
                 Connected Components \\
                 Biconnectivity \\
                 Union-Find Algorithms \\
                 31: Weighted Graphs \\
                 Minimum Spanning Tree \\
                 Priority-First Search \\
                 Kruskal's Method \\
                 Shortest Path \\
                 Minimum Spanning Tree and Shortest Paths in Dense
                 Graphs \\
                 Geometric Problems \\
                 32: Directed Graphs \\
                 Depth-First Search \\
                 Transitive Closure \\
                 All Shortest Paths \\
                 Topological Sorting \\
                 Strongly Connected Components \\
                 33: Network Flow \\
                 The Network Flow Problem \\
                 Ford--Fulkerson Method \\
                 Network Searching \\
                 34: Matching \\
                 Bipartite Graphs \\
                 Stable Marriage Problem \\
                 Advanced Algorithms \\
                 Mathematical Algorithms \\
                 35: Random Numbers \\
                 Applications \\
                 Linear Congruential Method \\
                 Additive Congruential Method \\
                 Testing Randomness \\
                 Implementation Notes \\
                 36: Arithmetic \\
                 Polynomial Arithmetic \\
                 Polynomial Evaluation and Interpolation \\
                 Polynomial Multiplication \\
                 Arithmetic Operations with Large Integers \\
                 Matrix Arithmetic \\
                 37: Gaussian Elimination \\
                 A Simple Example \\
                 Outline of the Method \\
                 Variations and Extensions \\
                 38: Curve Fitting \\
                 Polynomial Interpolation \\
                 Spline Interpolation \\
                 Method of Least Squares \\
                 39: Integration \\
                 Symbolic Integration \\
                 Simple Quadrature Methods \\
                 Compound Methods \\
                 Adaptive Quadrature \\
                 Advanced Topics \\
                 40: Parallel Algorithms \\
                 General Approaches \\
                 Perfect Shuffles \\
                 Systolic Arrays \\
                 Perspective \\
                 41: The Fast Fourier Transform \\
                 Evaluate, Multiply, Interpolate \\
                 Complex Roots of Unity \\
                 Evaluation at the Roots of Unity \\
                 Interpolation at the Roots of Unity \\
                 Implementation \\
                 42: Dynamic Programming \\
                 Knapsack Problem \\
                 Matrix Chain Product \\
                 Optimal Binary Search Trees \\
                 Time and Space Requirements \\
                 43: Linear Programming \\
                 Linear Programs \\
                 Geometric Interpretation \\
                 The Simplex Method \\
                 Implementation \\
                 44: Exhaustive Search \\
                 Exhaustive Search in Graphs \\
                 Backtracking \\
                 Digression: Permutation Generation \\
                 Approximation Algorithms \\
                 45: NP-Complete Problems \\
                 Deterministic and Nondeterministic Polynomial-Time
                 Algorithms \\
                 NP-Completeness \\
                 Cook's Theorem \\
                 Some NP-Complete Problems",
}

@Article{Sezgin:1992:SCC,
  author =       "Fatin Sezgin",
  title =        "Some comments on computer implementation of random
                 number generators",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "39",
  number =       "3",
  pages =        "383--386",
  day =          "8",
  month =        may,
  year =         "1992",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(92)90212-G",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Carta:1990:TFI,Gentle:1990:CIR}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/037704279290212G",
  abstract =     "Several workers in simulation studies are concerned
                 with the correct and portable computer implementation
                 of random number generators. Since approximate
                 calculations may lead to accumulated errors in various
                 machines, all implementations must be exact. In a
                 previous work Gentle (this journal, 1990) presented
                 several implementations for multiplicative congruential
                 generators. The aim of this paper is to describe some
                 more methods. Especially the implementation using the
                 decomposition of the modulus is very efficient.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Special issue on random numbers and simulation, guest
                 editors: J. Lehn and H. Neunzert.",
}

@Article{Sharp:1992:RPR,
  author =       "W. E. Sharp and Carter Bays",
  title =        "A review of portable random number generators",
  journal =      j-COMP-GEOSCI,
  volume =       "18",
  number =       "1",
  pages =        "79--87",
  month =        jan,
  year =         "1992",
  CODEN =        "CGEODT, CGOSDN",
  DOI =          "https://doi.org/10.1016/0098-3004(92)90060-5",
  ISSN =         "0098-3004 (print), 1873-7803 (electronic)",
  ISSN-L =       "0098-3004",
  bibdate =      "Tue Feb 7 07:17:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Portable random number generators for personal
                 computers can be evaluated quickly and effectively by
                 plotting their two- and three-dimensional serial
                 patterns. An examination of about 40 published
                 generators yielded only a few that had acceptable
                 serial patterns.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Geosciences",
}

@Article{Sobol:1992:QSG,
  author =       "I. M. Sobol' and V. I. Turchaninov and Yu. L. Levitan
                 and B. V. Shukhinan",
  title =        "Quasirandom sequence generators",
  journal =      "Keldysh Inst. Appl. Math., Rus. Acad. Sci.",
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1992",
  bibdate =      "Mon Feb 27 17:07:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{Sprugnoli:1992:GBT,
  author =       "Renzo Sprugnoli",
  title =        "The Generation of Binary Trees as a Numerical
                 Problem",
  journal =      j-J-ACM,
  volume =       "39",
  number =       "2",
  pages =        "317--327",
  month =        apr,
  year =         "1992",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/128749.128753",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128753.html",
  abstract =     "The problem of generating random, uniformly
                 distributed, binary trees is considered. A closed
                 formula that counts the number of trees having a left
                 subtree with $ k - 1 $ nodes $ (k = 1, 2, \ldots {}, n)
                 $ is found. By inverting the formula, random trees with
                 $n$ nodes are generated according to the appropriate
                 probability distribution, determining the number of
                 nodes in the left and right subtrees that can be
                 generated recursively. The procedure is shown to run in
                 time $ O(n) $, occupying an extra space in the order of
                 $ O(\sqrt {n}) $",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "Algorithms; binary trees; Data Structures and
                 Algorithms; generation of binary trees; performance;
                 theory",
  subject =      "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures. {\bf
                 G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS,
                 Combinatorics, Combinatorial algorithms.",
}

@Article{Szyszkowicz:1992:GRP,
  author =       "Mieczyslaw Szyszkowicz",
  title =        "Graphical representation of pseudorandom numbers",
  journal =      j-COMPUTERS-AND-GRAPHICS,
  volume =       "16",
  number =       "2",
  pages =        "237--??",
  month =        "Summer",
  year =         "1992",
  CODEN =        "COGRD2",
  ISSN =         "0097-8493 (print), 1873-7684 (electronic)",
  ISSN-L =       "0097-8493",
  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "723; 921; 922; 931",
  fjournal =     "Computers and Graphics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00978493",
  journalabr =   "Comput Graphics (Pergamon)",
  keywords =     "Chaos Theory --- Applications; Computer Graphics ---
                 Mathematical Models; Computer Metatheory --- Binary
                 Sequences; Linear; Linear Congruential Sequence;
                 Mathematical Programming; Mathematical Statistics;
                 Mathematical Transformations; Pseudorandom Numbers;
                 Random Number Generation",
}

@Article{Tang:1992:SDA,
  author =       "Hui-Chin Tang",
  title =        "Simulated division with approximate factoring for the
                 multiple recursive generator with both unrestricted
                 multiplier and non-{Mersenne} prime modulus",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "40",
  number =       "3",
  pages =        "1173--1181",
  day =          "24",
  month =        jul,
  year =         "1992",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(03)90209-4",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122103902094",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@InProceedings{Tezuka:1992:AAC,
  author =       "S. Tezuka and P. L'Ecuyer",
  title =        "An Analysis of Add-with-Carry and Subtract-with-Borrow
                 Generators",
  crossref =     "Swain:1992:PWS",
  pages =        "443--447",
  year =         "1992",
  bibdate =      "Mon Feb 27 18:40:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tezuka:1992:FGL,
  author =       "S. Tezuka and M. Fushimi",
  title =        "Fast Generation of Low Discrepancy Points Based on
                 {Fibonacci} Polynomials",
  crossref =     "Swain:1992:PWS",
  pages =        "433--437",
  year =         "1992",
  bibdate =      "Mon Feb 27 18:50:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Traub:1992:MCA,
  author =       "J. F. Traub and H. Wo{\'z}niakowski",
  title =        "The {Monte Carlo} algorithm with a pseudorandom
                 generator",
  journal =      j-MATH-COMPUT,
  volume =       "58",
  number =       "197",
  pages =        "323--339",
  month =        jan,
  year =         "1992",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C05 (65C10)",
  MRnumber =     "92e:65007",
  MRreviewer =   "J. Spanier",
  bibdate =      "Tue Oct 13 08:06:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2153037.pdf",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C1140G (Monte Carlo methods)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "generator; integration; linear congruential generator;
                 Monte Carlo algorithm; Monte Carlo methods;
                 multivariate integrals; pseudorandom; random number
                 generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tsai:1992:AFT,
  author =       "Li-Hui Tsai",
  title =        "An algorithm for flow time minimization and its
                 asymptotic makespan properties",
  journal =      j-INFO-PROC-LETT,
  volume =       "43",
  number =       "1",
  pages =        "41--46",
  day =          "10",
  month =        aug,
  year =         "1992",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68M20 (68Q25 90B35)",
  MRnumber =     "93i:68030",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "723.1; 912.3; 921.5; 922.1; C1180 (Optimisation
                 techniques); C1290F (Industry); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Decision and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "absolute difference; Algorithms; asymptotic makespan
                 properties; asymptotic minimisation; computational
                 complexity; finite mean; flow time minimisation
                 algorithm; Flow time minimization; heuristic makespan;
                 identical machines; identically distributed random
                 variables; independent random variables; job
                 assignment; job processing times; Makespan properties;
                 mean flow time; minimisation; Operations research;
                 optimal makespan; Optimization; production control;
                 Random processes; scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonHanxleden:1992:CDP,
  author =       "R. {von Hanxleden} and L. R. Scott",
  title =        "Correctness and determinism of {Parallel Monte Carlo
                 Processes}",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "18",
  number =       "2",
  pages =        "121--132",
  month =        feb,
  year =         "1992",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Mon Apr 14 12:05:41 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4240P (Parallel
                 programming and algorithm theory); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "behavior; code correctness; decision dependent random
                 seeds; deterministic; dynamic algorithms; hypercube
                 based algorithm; iPSC/2 implementation; load balancing;
                 Monte Carlo methods; parallel algorithms; parallel
                 Monte Carlo; population evolution; processes; WaTor",
  treatment =    "X Experimental",
}

@Article{Warford:1992:GPR,
  author =       "J. S. Warford",
  title =        "Good pedagogical random number generators",
  journal =      j-SIGCSE,
  volume =       "24",
  number =       "1",
  pages =        "142--146",
  month =        mar,
  year =         "1992",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/135250.134539",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:17 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "A CACM by Park and Miller [6] advocated a standard for
                 random number generators based on the Lehmer generator
                 [5] and criticised a number of computer science
                 textbooks for presenting bad random number generators.
                 This paper advocates the proposed standard and presents
                 a set of generators based on theoretically sound
                 principles that are also useful for microcomputer
                 implementation and classroom presentations at the
                 introductory level.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

@TechReport{Wikramaratna:1992:TBA,
  author =       "Roy S. Wikramaratna",
  title =        "Theoretical Background for the {ACORN} Random Number
                 Generator",
  type =         "Report",
  number =       "AEA-APS-0244",
  institution =  "AEA Technology",
  address =      "Winfrith, Dorset, UK",
  year =         "1992",
  bibdate =      "Fri Dec 30 22:31:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Wollan:1992:PRN,
  author =       "Peter C. Wollan",
  title =        "A portable random number generator for parallel
                 computers",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "21",
  number =       "4",
  pages =        "1247--1254",
  month =        "????",
  year =         "1992",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919208813075",
  ISSN =         "0361-0918",
  bibdate =      "Tue Feb 7 07:20:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Simulations on parallel computers require distinct
                 streams of pseudo-random deviates for each processor. A
                 combination generator is proposed which achieves
                 distinct streams through a congruential component, and
                 long period through a Fibonacci component. The
                 algorithm has been coded in Fortran 77, and is suitable
                 for fairly long simulations on machines of up to a
                 thousand processors.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
  onlinedate =   "27 Jun 2007",
}

@Article{Won:1992:USN,
  author =       "Chee Sun Won and Haluk Derin",
  title =        "Unsupervised Segmentation of Noisy and Textured Images
                 Using {Markov} Random Fields",
  journal =      j-CVGIP-GMIP,
  volume =       "54",
  number =       "4",
  pages =        "308--328",
  month =        jul,
  year =         "1992",
  CODEN =        "CGMPE5",
  ISSN =         "1049-9652 (print), 1557-7643 (electronic)",
  ISSN-L =       "1049-9652",
  bibdate =      "Sat Sep 14 09:22:46 MDT 1996",
  bibsource =    "/usr/local/src/bib/siggraph/92.bib;
                 Graphics/siggraph/92.bib;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Electr. and Comput. Eng., Massachusetts
                 Univ., Amherst, MA, USA",
  classification = "C1140Z (Other and miscellaneous); C1250 (Pattern
                 recognition); C5260B (Computer vision and picture
                 processing)",
  fjournal =     "Computer Vision, Graphics, and Image Processing.
                 Graphical models and Image Processing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10499652",
  keywords =     "Closed-form ML estimates; Image segmentation; MAP
                 criterion; Markov random fields; Noisy images; Number
                 of regions; Parameter estimation; Partial optimal
                 solution; Recursive segmentation-parameter estimation
                 algorithm; Textured images; Unsupervised segmentation
                 algorithm",
  thesaurus =    "Markov processes; Parameter estimation; Picture
                 processing",
}

@Article{Anderson:1993:CCB,
  author =       "N. H. Anderson and D. M. Titterington",
  title =        "Cross-correlation between simultaneously generated
                 sequences of pseudo-random uniform deviates",
  journal =      j-STAT-COMPUT,
  volume =       "3",
  number =       "2",
  pages =        "61--65",
  month =        jun,
  year =         "1993",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00153064",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:08 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00153064",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@Article{Atkinson:1993:UGR,
  author =       "M. D. Atkinson",
  title =        "Uniform generation of rooted ordered trees with
                 prescribed degrees",
  journal =      j-COMP-J,
  volume =       "36",
  number =       "6",
  pages =        "593--594",
  month =        dec,
  year =         "1993",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Wed Jul 21 09:53:53 MDT 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.index.html;
                 https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.body.html#AbstractAtkinson",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  author-1-adr = "School of Computer Science, Carleton University,
                 Ottawa KIS SB6, Canada",
  classcodes =   "C1160 (Combinatorial mathematics); C7310
                 (Mathematics)",
  classification = "C1160 (Combinatorial mathematics); C7310
                 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "Auxiliary storage; auxiliary storage; binary tree
                 generator; linear; Linear time; Prescribed degrees;
                 prescribed degrees; random; Random binary tree
                 generator; Random number generation; random number
                 generation; Rooted ordered tree generation; rooted
                 ordered tree generation; time; trees (mathematics)",
  thesaurus =    "Random number generation; Trees [mathematics]",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Belisle:1993:HRA,
  author =       "Claude J. P. B{\'e}lisle and H. Edwin Romeijn and
                 Robert L. Smith",
  title =        "Hit-and-Run Algorithms for Generating Multivariate
                 Distributions",
  journal =      j-MATH-OP-RES,
  volume =       "18",
  number =       "2",
  pages =        "255--266",
  year =         "1993",
  CODEN =        "MOREDQ",
  DOI =          "https://doi.org/10.1287/moor.18.2.255",
  ISSN =         "0364-765X (print), 1526-5471 (electronic)",
  ISSN-L =       "0364-765X",
  bibdate =      "Wed Nov 12 14:28:44 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/moor",
}

@TechReport{Brickell:1993:SRI,
  author =       "Ernest F. Brickell and Dorothy E. Denning and Stephen
                 T. Kent and David P. Maher and Walter Tuchman",
  title =        "{SKIPJACK} Review: Interim Report: The {SKIPJACK}
                 Algorithm",
  type =         "Technical report",
  institution =  "Georgetown University",
  address =      "Washington, DC, USA",
  day =          "28",
  month =        jul,
  year =         "1993",
  bibdate =      "Mon Dec 08 09:48:02 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.georgetown.edu/~denning/crypto/clipper/SKIPJACK.txt",
  acknowledgement = ack-nhfb,
}

@Article{Browne:1993:CTC,
  author =       "Malcolm W. Browne",
  title =        "Coin-Tossing Computers Found to Show Subtle Bias",
  journal =      j-NY-TIMES,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "12",
  month =        jan,
  year =         "1993",
  CODEN =        "NYTIAO",
  ISSN =         "0362-4331 (print), 1542-667X, 1553-8095",
  ISSN-L =       "0362-4331",
  bibdate =      "Wed Mar 07 10:56:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Section C; Page 1; Column 4; Science Desk",
  acknowledgement = ack-nhfb,
  fjournal =     "New York Times",
  journal-URL =  "http://www.nytimes.com/",
  remark =       "Refers to \cite{Ferrenberg:1992:MCS}.",
}

@Article{Bshouty:1993:CFR,
  author =       "Nader H. Bshouty",
  title =        "On the Complexity of Functions for Random Access
                 Machines",
  journal =      j-J-ACM,
  volume =       "40",
  number =       "2",
  pages =        "211--223",
  month =        apr,
  year =         "1993",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/151261.151262",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151262.html",
  abstract =     "Tight bounds are proved for Sort, Merge, Insert, Gcd
                 of integers, Gcd of polynomials, and Rational functions
                 over a {\em finite\/} inputs domain, in a random access
                 machine with arithmetic operations, direct and indirect
                 addressing, unlimited power for answering YES/NO
                 questions, branching, and tables with bounded size.
                 These bounds are also true even if additions,
                 subtractions, multiplications, and divisions of
                 elements by elements of the field are not
                 counted.\par

                 In a random access machine with finitely many constants
                 and a bounded number of types of instructions, it is
                 proved that the complexity of a function over a
                 countable infinite domain is equal to the complexity of
                 the function in a sufficiently large {\em finite\/}
                 subdomain.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "Algorithms; Analysis of Algorithms; greatest common
                 divisor; indirect addressing; random access machine;
                 sorting; Theory; Verification",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf F.1.1}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Models of Computation,
                 Bounded-action devices. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching.",
}

@Article{Bundschuh:1993:MEC,
  author =       "Peter Bundschuh and Yaochen Zhu",
  title =        "A method for exact calculation of the discrepancy of
                 low-dimensional finite point sets {I}",
  journal =      j-ABH-MATH-SEMIN-UNIV-HAMBG,
  volume =       "63",
  number =       "??",
  pages =        "115--133",
  month =        "????",
  year =         "1993",
  CODEN =        "AMHAAJ",
  DOI =          "https://doi.org/10.1007/BF02941337",
  ISSN =         "0025-5858 (print), 1865-8784 (electronic)",
  ISSN-L =       "0025-5858",
  MRclass =      "11K38",
  MRnumber =     "1227869 (94h:11070)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Fri Mar 2 18:23:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Abhandlungen aus dem Mathematischen Seminar der
                 Universit{\"a}t Hamburg",
}

@Article{Cerecedo:1993:NIG,
  author =       "M. Cerecedo and T. Matsumoto and H. Imai",
  title =        "Non-interactive generation of shared pseudorandom
                 sequences",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "718",
  pages =        "385--??",
  year =         "1993",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:49:00 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Chen:1993:PGH,
  author =       "Ming-Hui Chen and Bruce Schmeiser",
  title =        "Performance of the {Gibbs}, hit-and-run, and
                 {Metropolis} samplers",
  journal =      j-J-COMPUT-GRAPH-STAT,
  volume =       "2",
  number =       "3",
  pages =        "251--272",
  month =        sep,
  year =         "1993",
  CODEN =        "????",
  ISSN =         "1061-8600 (print), 1537-2715 (electronic)",
  ISSN-L =       "1061-8600",
  MRclass =      "65C05",
  MRnumber =     "95a:65011",
  MRreviewer =   "Petru P. Blaga",
  bibdate =      "Mon May 5 08:43:28 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputgraphstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Graphical Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/ucgs20",
}

@Article{Couture:1993:DDV,
  author =       "Raymond Couture and Pierre L'Ecuyer and Shu Tezuka",
  title =        "On the distribution of $k$-dimensional vectors for
                 simple and combined {Tausworthe} sequences",
  journal =      j-MATH-COMPUT,
  volume =       "60",
  number =       "202",
  pages =        "749--761, S11--S16",
  month =        apr,
  year =         "1993",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153113",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45",
  MRnumber =     "93h:11085",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Damgaard:1993:ACE,
  author =       "Ivan Damg{\aa}rd and Peter Landrock and Carl
                 Pomerance",
  title =        "Average case error estimates for the strong probable
                 prime test",
  journal =      j-MATH-COMPUT,
  volume =       "61",
  number =       "203",
  pages =        "177--194",
  month =        jul,
  year =         "1993",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11Y11 (11A51)",
  MRnumber =     "94b:11124",
  MRreviewer =   "Herman J. J. te Riele",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{DeMatteis:1993:LRC,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Long-range correlation analysis of the
                 {Wichmann--Hill} random number generator",
  journal =      j-STAT-COMPUT,
  volume =       "3",
  number =       "2",
  pages =        "67--70",
  month =        jun,
  year =         "1993",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00153065",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:08 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00153065",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@Article{Devroye:1993:GRI,
  author =       "Luc Devroye and Peter Epstein and J{\"o}rg-R{\"u}diger
                 Sack",
  title =        "On Generating Random Intervals and Hyperrectangles",
  journal =      j-J-COMPUT-GRAPH-STAT,
  volume =       "2",
  number =       "3",
  pages =        "291--307",
  month =        sep,
  year =         "1993",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/10618600.1993.10474613",
  ISSN =         "1061-8600 (print), 1537-2715 (electronic)",
  ISSN-L =       "1061-8600",
  MRclass =      "65C10",
  MRnumber =     "95a:65017",
  bibdate =      "Thu Aug 13 10:27:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputgraphstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/10618600.1993.10474613",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Graphical Statistics",
  journal-URL =  "http://www.amstat.org/publications/jcgs/;
                 http://www.tandfonline.com/loi/ucgs20",
  onlinedate =   "21 Feb 2012",
}

@Article{Devroye:1993:RVG,
  author =       "Luc Devroye",
  title =        "On random variate generation for the generalized
                 hyperbolic secant distributions",
  journal =      j-STAT-COMPUT,
  volume =       "3",
  number =       "3",
  pages =        "125--134",
  month =        sep,
  year =         "1993",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00147775",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:07 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00147775",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@InProceedings{Dobkin:1993:CD,
  author =       "David P. Dobkin and David Eppstein",
  editor =       "{ACM}",
  booktitle =    "{SCG '93: Proceedings of the ninth annual Symposium on
                 Computational Geometry, San Diego, California, May
                 19--21, 1993}",
  title =        "Computing the Discrepancy",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "vii + 406",
  pages =        "47--52",
  year =         "1993",
  DOI =          "https://doi.org/10.1145/160985.160997",
  ISBN =         "0-89791-582-8, 0-89791-583-6",
  ISBN-13 =      "978-0-89791-582-3, 978-0-89791-583-0",
  LCCN =         "QA448.D38 S96 1993",
  bibdate =      "Fri Mar 2 18:30:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Dufour:1993:IEB,
  author =       "Jean-Marie Dufour and Marc Hallin",
  title =        "Improved {Eaton} bounds for linear combinations of
                 bounded random variables, with statistical
                 applications",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "88",
  number =       "423",
  pages =        "1026--1033",
  month =        sep,
  year =         "1993",
  CODEN =        "JSTNAL",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  MRclass =      "60E15 (62G10)",
  MRnumber =     "95a:60018",
  MRreviewer =   "Iosif Pinelis",
  bibdate =      "Mon May 5 12:36:01 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jamstatassoc.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2290795",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Article{Eichenauer-Herrmann:1993:DIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "On the discrepancy of inversive congruential
                 pseudorandom numbers with prime power modulus. {II}",
  journal =      j-MANUSCR-MATH,
  volume =       "79",
  number =       "3--4",
  pages =        "239--246",
  year =         "1993",
  CODEN =        "MSMHB2",
  DOI =          "https://doi.org/10.1007/BF02568342",
  ISSN =         "0025-2611 (print), 1432-1785 (electronic)",
  ISSN-L =       "0025-2611",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1223019 (94g:11057)",
  MRreviewer =   "G. Turnwald",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Manuscripta Mathematica",
}

@Article{Eichenauer-Herrmann:1993:EIC,
  author =       "J. Eichenauer-Herrmann",
  title =        "Explicit inversive congruential pseudorandom numbers:
                 the compound approach",
  journal =      j-COMPUTING,
  volume =       "51",
  number =       "2",
  pages =        "175--182",
  month =        jun,
  year =         "1993",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/BF02243851",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "94k:65011",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Eichenauer-Herrmann:1993:EPN,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Equidistribution properties of nonlinear congruential
                 pseudorandom numbers",
  journal =      j-METRIKA,
  volume =       "40",
  number =       "??",
  pages =        "333--338",
  month =        "????",
  year =         "1993",
  CODEN =        "MTRKA8",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Tue Dec 27 09:37:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika. International Journal for Theoretical and
                 Applied Statistics.",
  journal-URL =  "http://link.springer.com/journal/184",
}

@Article{Eichenauer-Herrmann:1993:ICP,
  author =       "J. Eichenauer-Herrmann",
  title =        "Inversive congruential pseudorandom numbers",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "73",
  number =       "7--8",
  pages =        "T644--T647",
  year =         "1993",
  CODEN =        "ZAMMAX",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  MRclass =      "65C10",
  MRnumber =     "1237851",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Bericht {\"u}ber die Wissenschaftliche Jahrestagung
                 der GAMM (Leipzig, 1992)",
  acknowledgement = ack-nhfb,
  fjournal =     "Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
}

@Article{Eichenauer-Herrmann:1993:KTS,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "{Kloosterman}-type sums and the discrepancy of
                 nonoverlapping pairs of inversive congruential
                 pseudorandom numbers",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "65",
  number =       "2",
  pages =        "185--194",
  year =         "1993",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  MRclass =      "11K45 (11L05)",
  MRnumber =     "1240124 (94f:11071)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Eichenauer-Herrmann:1993:LSN,
  author =       "J. Eichenauer-Herrmann",
  title =        "The lattice structure of nonlinear congruential
                 pseudorandom numbers",
  journal =      j-METRIKA,
  volume =       "40",
  number =       "??",
  pages =        "115--120",
  month =        "????",
  year =         "1993",
  CODEN =        "MTRKA8",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Tue Dec 27 09:34:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika. International Journal for Theoretical and
                 Applied Statistics.",
  journal-URL =  "http://link.springer.com/journal/184",
}

@Article{Eichenauer-Herrmann:1993:SIN,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Statistical independence of a new class of inversive
                 congruential pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "60",
  number =       "201",
  pages =        "375--384",
  month =        jan,
  year =         "1993",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153174",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1159168 (93d:65011)",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Tue Mar 25 15:38:13 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2153174",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1140Z (Other and miscellaneous);
                 C5230 (Digital arithmetic methods)",
  corpsource =   "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "inversive congruential pseudorandom numbers; random
                 number generation; rational exponential sums;
                 simulations; statistical analysis; stochastic;
                 Weil-Stepanov beads",
  treatment =    "T Theoretical or Mathematical",
}

@PhdThesis{Erdmann:1993:CMT,
  author =       "Eva Diane Erdmann",
  title =        "Complexity measures for testing binary keystreams",
  type =         "{Ph.D.} thesis",
  school =       "Department of Operations Research, Stanford
                 University",
  address =      "Stanford, CA, USA",
  pages =        "xi + 105",
  month =        jun,
  year =         "1993",
  bibdate =      "Sat Mar 3 07:21:35 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://search.proquest.com/docview/304081057",
  acknowledgement = ack-nhfb,
  advisor =      "Peter W. Glynn",
}

@Article{Fisher:1993:OOR,
  author =       "Joseph A. Fisher",
  title =        "Object oriented random number generators",
  journal =      j-COMPUT-IND-ENG,
  volume =       "25",
  number =       "1--4",
  pages =        "561--563",
  month =        sep,
  year =         "1993",
  CODEN =        "CINDDL",
  DOI =          "https://doi.org/10.1016/0360-8352(93)90344-W",
  ISSN =         "0360-8352 (print), 1879-0550 (electronic)",
  ISSN-L =       "0360-8352",
  bibdate =      "Fri Dec 23 22:22:49 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/036083529390344W",
  abstract =     "An object oriented variate generator class was
                 developed using the Prime Modulus Multiplicative
                 Congruential Generator (PMMCG). The class provides the
                 18 most popular distributions and should prove useful
                 to the simulationist.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& industrial engineering",
}

@InProceedings{Flahive:1993:ICG,
  author =       "Mary Flahive and Harald Niederreiter",
  title =        "On inversive congruential generators for pseudorandom
                 numbers",
  crossref =     "Mullen:1993:FFC",
  pages =        "75--80",
  year =         "1993",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1199823 (94a:11117)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Galway:1993:ESCb,
  author =       "Lionel Galway",
  title =        "On the Edge: Statistics and Computing: {John von
                 Neumann} and the Origin of Pseudo-Random Number
                 Generators",
  journal =      j-CHANCE,
  volume =       "6",
  number =       "3",
  pages =        "57--59",
  year =         "1993",
  CODEN =        "CNDCE4",
  DOI =          "https://doi.org/10.1080/09332480.1993.10542380",
  ISSN =         "0933-2480 (print), 1867-2280 (electronic)",
  ISSN-L =       "0933-2480",
  bibdate =      "Tue Feb 3 09:42:06 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/chance.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Chance: a magazine for people interested in the
                 analysis of data",
  journal-URL =  "http://chance.amstat.org/;
                 http://link.springer.com/journal/144;
                 http://www.tandfonline.com/loi/ucha20",
}

@InProceedings{Ganzha:1993:PSM,
  author =       "V. G. Ganzha and E. V. Vorozhtsov",
  title =        "A Probabilistic Symbolic-Numerical Method for the
                 Stability Analyses of Difference Schemes for {PDEs}",
  crossref =     "Bronstein:1993:IPI",
  pages =        "9--13",
  year =         "1993",
  bibdate =      "Thu Mar 12 08:40:26 MST 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/issac/164081/p9-ganzha/",
  abstract =     "We present a new symbolic numerical method for an
                 automatic stability analysis of difference schemes
                 approximating scalar linear of nonlinear partial
                 differential equations (PDEs) of hyperbolic or
                 parabolic type. In this method the grid values of the
                 numerical solution for any fixed moment of time are
                 considered as random correlated variables obeying the
                 normal distribution law. Therefore, one can apply the
                 notion of the C. E. Shannon's (1948) entropy to
                 characterize the stability of a difference scheme. The
                 reduction of this entropy, or uncertainty, is taken as
                 a stability criterion. It is shown at a number of
                 examples that this criterion yields the same stability
                 regions in the cases of linear difference initial value
                 problems, as the Fourier method. In the case of two
                 spatial variables the present probabilistic method is
                 computationally faster than the Fourier method by two
                 orders of magnitude.",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst. of Theor. and Appl. Mech., Acad. of Sci.,
                 Novosibirsk, Russia",
  classification = "C1140Z (Other topics in statistics); C4170
                 (Differential equations); C6130 (Data handling
                 techniques); C7310 (Mathematics computing)",
  keywords =     "ACM; algebraic computation; algorithms; Automatic
                 stability analysis; Difference schemes; Fixed moment;
                 Fourier method; Grid values; Linear difference initial
                 value problems; Nonlinear partial differential
                 equations; Normal distribution law; Parabolic type;
                 PDEs; Probabilistic symbolic-numerical method; Random
                 correlated variables; SIGSAM; Spatial variables, ISSAC;
                 Stability analyses; Stability criterion; symbolic
                 computation; Symbolic numerical method; theory",
  subject =      "{\bf G.1.8} Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations. {\bf I.1.0}
                 Computing Methodologies, SYMBOLIC AND ALGEBRAIC
                 MANIPULATION, General. {\bf G.1.4} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation, Finite difference methods.",
  thesaurus =    "Difference equations; Nonlinear differential
                 equations; Normal distribution; Numerical stability;
                 Partial differential equations; Symbol manipulation",
}

@TechReport{Gokhale:1993:DBC,
  author =       "Maya B. Gokhale and Judith D. Schlesinger",
  title =        "A data-parallel bit-serial {C} ({dbC})",
  type =         "Technical report",
  number =       "SRC-TR-93-096",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "14",
  month =        may,
  year =         "1993",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We describe Data-parallel Bit-serial C (dbC), a data
                 parallel extension to ANSI C which currently runs on
                 the CM-2, Cray-2 and YMP, Sun workstation, and Terasys,
                 an experimental SIMD machine. dbC's contribution is
                 two-fold. First, it provides to the programmer an
                 abstraction of the data parallel programming model,
                 hiding implementation-dependent features, so that the
                 high level dbC program can be ported without change
                 among several diverse architectures. Second, dbC
                 exposes in the high level language the full bit-serial
                 processing capabilities of many SIMD arrays, making
                 possible the efficient implementation of both
                 bit-oriented applications (such as pattern matching and
                 image processing) and applications requiring large
                 integers (such as generating large random numbers).
                 Preliminary performance results indicate that dbC
                 programs run approximately a factor of two slower than
                 hand-written assembly code. On a representative problem
                 using small integers, a DNA pattern matching benchmark,
                 the dbC version runs a factor of two faster than C*.",
  acknowledgement = ack-nhfb,
  keywords =     "Parallel programming (Computer science)",
}

@Article{Goldreich:1993:EPG,
  author =       "Oded Goldreich and Hugo Krawczyk and Michael Luby",
  title =        "On the Existence of Pseudorandom Generators",
  journal =      j-SIAM-J-COMPUT,
  volume =       "22",
  number =       "6",
  pages =        "1163--1175",
  month =        dec,
  year =         "1993",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "11K45 (11T71 65C10)",
  MRnumber =     "95f:11054",
  bibdate =      "Mon Nov 29 11:02:20 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/22/6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  abstract =     "Pseudorandom generators (suggested and developed by
                 Blum and Micali and Yao) are efficient deterministic
                 programs that expand a randomly selected $k$-bit seed
                 into a much longer pseudorandom bit sequence that is
                 indistinguishable in polynomial time from an (equally
                 long) sequence of unbiased coin tosses. A fundamental
                 question is to find simple conditions, as the existence
                 of one-way functions, which suffice for constructing
                 pseudorandom generators. This paper considers regular
                 functions, in which every image of a $k$-bit string has
                 the same number of preimages of length $k$. This paper
                 shows how to construct pseudorandom generators from any
                 regular one-way function.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Grassberger:1993:CGR,
  author =       "Peter Grassberger",
  title =        "On correlations in ``good'' random number generators",
  journal =      j-PHYS-LET-A,
  volume =       "181",
  number =       "1",
  pages =        "43--46",
  day =          "27",
  month =        sep,
  year =         "1993",
  CODEN =        "PYLAAG",
  DOI =          "https://doi.org/10.1016/0375-9601(93)91122-L",
  ISSN =         "0375-9601 (print), 1873-2429 (electronic)",
  ISSN-L =       "0375-9601",
  bibdate =      "Wed Feb 22 09:13:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Ferrenberg:1992:MCS}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/037596019391122L",
  abstract =     "By studying a different system, we verify the
                 correlations found recently in a popular random number
                 generator by Ferrenberg et al. We find indeed that the
                 dominant correlations are too long ranged to be seen by
                 them, and we check a number of further RNGs.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physics Letters A",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03759601",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Grassberger:1993:MCS,
  author =       "Peter Grassberger",
  title =        "{Monte Carlo} simulations of {$3$D} self-avoiding
                 walks",
  journal =      j-J-PHYS-A,
  volume =       "26",
  number =       "12",
  pages =        "2769--2776",
  day =          "21",
  month =        jun,
  year =         "1993",
  CODEN =        "JPHAC5",
  DOI =          "https://doi.org/10.1088/0305-4470/26/12/017",
  ISSN =         "0305-4470 (print), 1361-6447 (electronic)",
  ISSN-L =       "0305-4470",
  bibdate =      "Sat Sep 17 13:56:55 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Physics A (Mathematical and General)",
  journal-URL =  "http://iopscience.iop.org/0305-4470",
}

@Article{Hamilton:1993:PNGa,
  author =       "Kenneth G. Hamilton",
  title =        "Pseudorandom number generators for personal
                 computers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "75",
  number =       "1--2",
  pages =        "105--117",
  month =        apr,
  year =         "1993",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(93)90168-C",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559390168C",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hamilton:1993:PNGb,
  author =       "Kenneth G. Hamilton",
  title =        "Pseudorandom number generators for personal computers
                 {II}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "78",
  number =       "1--2",
  pages =        "172--180",
  month =        dec,
  year =         "1993",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(93)90152-3",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465593901523",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hansen:1993:GPC,
  author =       "Tom Hansen and Gary L. Mullen and Harald
                 Niederreiter",
  title =        "Good parameters for a class of node sets in
                 quasi-{Monte Carlo} integration",
  journal =      j-MATH-COMPUT,
  volume =       "61",
  number =       "203",
  pages =        "225--234",
  month =        jul,
  year =         "1993",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65D32)",
  MRnumber =     "94e:11088",
  MRreviewer =   "Gerhard Larcher",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Hayes:1993:WF,
  author =       "Brian Hayes",
  title =        "The wheel of fortune",
  journal =      j-AM-SCI,
  volume =       "81",
  number =       "2",
  pages =        "114--118",
  month =        mar # "\slash " # apr,
  year =         "1993",
  CODEN =        "AMSCAC",
  ISSN =         "0003-0996 (print), 1545-2786 (electronic)",
  ISSN-L =       "0003-0996",
  bibdate =      "Sat Sep 17 13:58:12 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Scientist",
  journal-URL =  "http://www.americanscientist.org/issues/past.aspx",
  remark =       "This journal is available in the JSTOR archive, but
                 this year is missing.",
}

@Article{Hildebrand:1993:RPF,
  author =       "Martin Hildebrand",
  title =        "Random Processes of the Form {$ X_{n + 1} = a_n X_n +
                 b_n \pmod p $}",
  journal =      j-ANN-PROBAB,
  volume =       "21",
  number =       "2",
  pages =        "710--720",
  month =        apr,
  year =         "1993",
  CODEN =        "APBYAE",
  ISSN =         "0091-1798 (print), 2168-894X (electronic)",
  ISSN-L =       "0091-1798",
  bibdate =      "Sun Apr 20 10:44:17 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annprobab1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aop/1176989264;
                 http://www.jstor.org/stable/2244672",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Probability",
  journal-URL =  "http://projecteuclid.org/all/euclid.aop",
  remark =       "The author proposes a congruential generator whose
                 multiplier and constant come from two separate
                 independent random number streams. There is no
                 discussion of the period of such a generator, but if
                 $p$ is prime, the period should be the product of the
                 periods of the three generators, and based on the
                 effect of shuffling \cite{Bays:1976:IPR,Bays:1990:CIR},
                 any lattice structure should be well hidden. Hildebrand
                 shows that convergence to a uniformly distributed
                 sequence is rapid: under mild, and easily satisfied,
                 restrictions on $ a_n $ and $ b_n $ only $ O((\log
                 p)^2) $ steps are required. A test implementation of
                 such a generator using two 16-bit generators from
                 \cite{Kao:1996:EAP} with different prime moduli for the
                 $ a_n $ and $ b_n $, and $ p = 2^{32} - 5 $, passes the
                 Diehard Battery Test Suite.",
}

@Article{Hormann:1993:GBR,
  author =       "Wolfgang H{\"o}rmann",
  title =        "The generation of binomial random variates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "46",
  number =       "1--2",
  pages =        "101--110",
  month =        "????",
  year =         "1993",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659308811496",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:42:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659308811496",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Hormann:1993:PRN,
  author =       "Wolfgang H{\"o}rmann and G. Deflinger",
  title =        "A Portable Random Number Generator Well Suited for the
                 Rejection Method",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "489--495",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/168173.168414;
                 http://www.acm.org/pubs/citations/journals/toms/1993-19-4/p489-hormann/",
  abstract =     "Up to now, all known efficient portable
                 implementations of linear congruential random number
                 generators with modulus $ 2^{31} - 1 $ have worked only
                 with multipliers that are small compared with the
                 modulus. We show that for nonuniform distributions, the
                 rejection method may generate random numbers of bad
                 qualify if combined with a linear congruential
                 generator with small multiplier. A method is described
                 that works for any multiplier smaller than $ 2^{30} $.
                 It uses the decomposition of multiplier and seed in
                 high-order and low-order bits to compute the upper and
                 lower half of the product. The sum of the two halves
                 gives the product of multiplier and seed modulo $
                 2^{21} - 1 $. Coded in ANSI-C and FORTRAN77 the method
                 results in a portable implementation of the linear
                 congruential generator that is as fast or faster than
                 other portable methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; linear congruential generator;
                 portability; quality of nonuniform random numbers;
                 rejection method; uniform random number generator",
  subject =      "G.3 [Mathematics of Computation]: Probability and
                 Statistics -- random number generation",
}

@TechReport{Hormann:1993:QNU,
  author =       "Wolfgang H{\"o}rmann",
  title =        "The Quality of Non-uniform Random Numbers",
  type =         "Preprint Series",
  number =       "7",
  institution =  "Department of Applied Statistics and Data Processing,
                 Wirtschaftsuniversit{\"a}t Wien",
  publisher =    "http://statistik.wu-wien.ac.at/;
                 http://epub.wu.ac.at/1080/1/document.pdf",
  address =      "Vienna, Austria",
  pages =        "8",
  month =        sep,
  year =         "1993",
  bibdate =      "Thu Jan 05 16:02:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hormann:1993:TRM,
  author =       "W. H{\"o}rmann",
  title =        "The transformed rejection method for generating
                 {Poisson} random variables",
  journal =      j-INSUR-MATH-ECON,
  volume =       "12",
  number =       "1",
  pages =        "39--45",
  month =        feb,
  year =         "1993",
  CODEN =        "IMECDX",
  DOI =          "https://doi.org/10.1016/0167-6687(93)90997-4",
  ISSN =         "0167-6687 (print), 1873-5959 (electronic)",
  ISSN-L =       "0167-6687",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167668793909974",
  acknowledgement = ack-nhfb,
  fjournal =     "Insurance, Mathematics and Economics",
}

@InProceedings{Jebelean:1993:CSG,
  author =       "T. Jebelean",
  title =        "Comparing Several {GCD} Algorithms",
  crossref =     "Swartzlander:1993:PSC",
  pages =        "180--185",
  month =        jun,
  year =         "1993",
  bibdate =      "Wed Nov 14 18:46:15 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acsel-lab.com/arithmetic/arith11/papers/ARITH11_Jebelean.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-11",
}

@Article{Kalkuhl:1993:PDC,
  author =       "Christoph Kalkuhl",
  title =        "Pulse\slash Data Channel Extends Programmable Pulse
                 Generator Applications",
  journal =      j-HEWLETT-PACKARD-J,
  volume =       "44",
  number =       "2",
  pages =        "56--59",
  month =        apr,
  year =         "1993",
  CODEN =        "HPJOAX",
  ISSN =         "0018-1153",
  bibdate =      "Tue Mar 25 14:12:15 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The HP 8133A 3-GHz pulse generator is available in
                 single-channel and two-channel configurations. Two
                 options are available for channel 2: a second pulse
                 channel like channel 1 or a pulse/data channel. The
                 pulse/data channel is designed to offer some additional
                 features: a square wave that can be divided by 1, 2, 4,
                 8, 16, or 32; a 32-bit data pattern that can be edited;
                 and a pseudorandom binary sequence (PRBS) with a length
                 of 2/sup 23/-1 bits, according to CCITT recommendation
                 0.151. This optional second channel's major components
                 are a data gate array, a multiplexer, a phase-locked
                 loop, and an output section. Most circuits are ECL.",
  acknowledgement = ack-nhfb,
  classcodes =   "B7250E (Signal generators); B1230J (Pulse
                 generators)",
  classification = "713.4; 713.5; 721.3; 723.5; B1230J (Pulse
                 generators); B7250E (Signal generators)",
  fjournal =     "Hewlett-Packard Journal: technical information from
                 the laboratories of Hewlett-Packard Company",
  journalabr =   "Hewlett Packard J",
  keywords =     "3; 3 GHz; 32-Bit data pattern; 32-bit data pattern;
                 Binary sequences; Computer programming; Data gate
                 array; data gate array; Emitter coupled logic circuits;
                 GHz; HP 8133A; Multiplexer; multiplexer; Multiplexing
                 equipment; Phase locked loops; Phase-locked loop;
                 phase-locked loop; Programmable pulse generator;
                 programmable pulse generator; Programmable pulse
                 generators; pseudorandom binary; Pseudorandom binary
                 sequence; Pseudorandom binary sequences; Pulse
                 generators; pulse generators; Pulse/data channel;
                 pulse/data channel; Pulse/data channels; sequence;
                 Square wave; square wave; test equipment",
  numericalindex = "Frequency 3.0E+09 Hz",
  thesaurus =    "Pulse generators; Test equipment",
  treatment =    "P Practical; R Product Review",
}

@InProceedings{Kanellakis:1993:IDM,
  author =       "Paris C. Kanellakis and Sridhar Ramaswamy and Darren
                 E. Vengroff and Jeffrey S. Vitter",
  title =        "Indexing for data models with constraints and classes
                 (extended abstract)",
  crossref =     "ACM:1993:PPT",
  pages =        "233--243",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p233-kanellakis/p233-kanellakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p233-kanellakis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p233-kanellakis/",
  abstract =     "We examine I/O-efficient data structures that provide
                 indexing support for new data models. The database
                 languages of these models include concepts from
                 constraint programming (e.g., relational tuples are
                 generalized to conjunctions of constraints) and from
                 object-oriented programming (e.g., objects are
                 organized in class hierarchies). Let $n$ be the size of
                 the database, $c$ the number of classes, {$B$} the
                 secondary storage page size, and {$t$} the size of the
                 output of a query. Indexing by one attribute in the
                 constraint data model (for a fairly general type of
                 constraints) is equivalent to external dynamic interval
                 management, which is a special case of external dynamic
                 2-dimensional range searching. We present a
                 semi-dynamic data structure for this problem which has
                 optimal worst-case space {$ O(n / B) $} pages and
                 optimal query I/O time {$ O(\log_B n + t / B) $} and
                 has {$ O(\log_B n + (\log_2 B n) / B) $} amortized
                 insert I/O time. If the order of the insertions is
                 random then the expected number of I/O operations
                 needed to perform insertions is reduced to {$ O(\log_B
                 n) $}. Indexing by one attribute and by class name in
                 an object-oriented model, where objects are organized
                 as a forest hierarchy of classes, is also a special
                 case of external dynamic 2-dimensional range searching.
                 Based on this observation we first identify a simple
                 algorithm with good worst-case performance for the
                 class indexing problem. Using the forest structure of
                 the class hierarchy and techniques from the constraint
                 indexing problem, we improve its query I/O time from {$
                 O(\log_2 c \log_B n + t / B) $} to {$ O(l o g B +
                 \log_2 B) $}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Data
                 description languages (DDL). {\bf H.3.1} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Content
                 Analysis and Indexing, Indexing methods.",
}

@Article{Kankaala:1993:BLC,
  author =       "K. Kankaala and T. Ala-Nissila and I. Vattulainen",
  title =        "Bit-level correlations in some pseudorandom number
                 generators",
  journal =      j-PHYS-REV-E,
  volume =       "48",
  number =       "6",
  pages =        "R4211--R4214",
  month =        dec,
  year =         "1993",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.48.R4211",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Dec 29 09:49:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.48.R4211",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  keywords =     "systematic errors in Monte Carlo simulations",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Karloff:1993:FAA,
  author =       "Howard Karloff",
  title =        "Fast algorithms for approximately counting
                 mismatches",
  journal =      j-INFO-PROC-LETT,
  volume =       "48",
  number =       "2",
  pages =        "53--60",
  day =          "8",
  month =        nov,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25 68U15)",
  MRnumber =     "94i:68110",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Institute of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "721; 901.3; 921; C1250 (Pattern recognition); C4240
                 (Programming and algorithm theory); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
                 GA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; approximately counting mismatches;
                 Approximation Theory; computational complexity;
                 Deterministic algorithms; deterministic algorithms;
                 Fast algorithms; fast algorithms; mismatches; Pattern
                 recognition; pattern recognition; pattern string;
                 Random number generation; randomized algorithms; text
                 string; worst-case time",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Karloff:1993:RAP,
  author =       "Howard J. Karloff and Prabhakar Raghavan",
  title =        "Randomized Algorithms and Pseudorandom Numbers",
  journal =      j-J-ACM,
  volume =       "40",
  number =       "3",
  pages =        "454--476",
  month =        jul,
  year =         "1993",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/174130.174132",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 20 23:05:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174132.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Routing and layout. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Random number generation. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching.",
}

@Article{Keppler:1993:RVM,
  author =       "Karl Keppler",
  title =        "Random Variables Made Simply",
  journal =      j-COMP-LANG-MAG,
  volume =       "10",
  number =       "6",
  pages =        "67--??",
  month =        jun,
  year =         "1993",
  CODEN =        "COMLEF",
  ISSN =         "0749-2839",
  bibdate =      "Tue Jan 23 08:04:25 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Language Magazine",
}

@Article{Korsh:1993:CRG,
  author =       "James F. Korsh",
  title =        "Counting and randomly generating binary trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "6",
  pages =        "291--294",
  day =          "16",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10",
  MRnumber =     "1 216 938",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. and Info. Sci., Temple Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "counting; random number generation; randomly
                 generating binary trees; recurrence relations; tree
                 data structures",
  treatment =    "P Practical",
}

@Article{Kumar:1993:PAS,
  author =       "Anurag Kumar and Rajeev Shorey",
  title =        "Performance analysis and scheduling of stochastic
                 fork-join jobs in a multicomputer system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "4",
  number =       "10",
  pages =        "1147--1164",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/71.246075",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "703.1; 722.3; 722.4; 723.1; 921.6; 922.1; C1140Z
                 (Other and miscellaneous); C5440 (Multiprocessor
                 systems and techniques); C5470 (Performance evaluation
                 and testing); C6185 (Simulation techniques)",
  corpsource =   "Dept. of Electr. Commun. Eng., Indian Inst. of Sci.,
                 Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "http://www.computer.org/tpds/archives.htm",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analysis; Approximation theory; associated random
                 variables; Computer networks; Data communication
                 systems; delays; diffusion limits; digital simulation;
                 Electric network topology; evaluation; exact; Fork join
                 parallelism; Join the Shortest Queue (jsq) allocation
                 policy; lower bounds; Mathematical models;
                 multicomputer system; parallel processing; parallel
                 processing system; Parallel processing systems;
                 performance; performance analysis; probabilistic
                 allocation of tasks; processes; Program processors;
                 queueing delays; queueing theory; Queueing theory;
                 Scheduling; scheduling; simulations; stochastic;
                 stochastic fork-join jobs; Stochastic scheduling; Task
                 allocation policies; upper bounds",
  treatment =    "P Practical",
}

@Article{Lagarias:1993:PN,
  author =       "J. Lagarias",
  title =        "Pseudorandom numbers",
  journal =      j-STAT-SCI,
  volume =       "8",
  number =       "1",
  pages =        "31--39",
  month =        feb,
  year =         "1993",
  CODEN =        "STSCEP",
  ISSN =         "0883-4237 (print), 2168-8745 (electronic)",
  ISSN-L =       "0883-4237",
  bibdate =      "Fri Dec 30 14:36:16 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2246038.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistical Science",
  journal-URL =  "http://projecteuclid.org/all/euclid.ss",
}

@Article{Laud:1993:RVG,
  author =       "Purushottam W. Laud and Paul Ramgopal and Adrian F. M.
                 Smith",
  title =        "Random variate generation from {$D$}-distributions",
  journal =      j-STAT-COMPUT,
  volume =       "3",
  number =       "3",
  pages =        "109--112",
  month =        sep,
  year =         "1993",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00147773",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:07 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00147773",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@Article{LEcuyer:1993:SGM,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Blouin and Raymond
                 Couture",
  title =        "A search for good multiple recursive random number
                 generators",
  journal =      j-TOMACS,
  volume =       "3",
  number =       "2",
  pages =        "87--98",
  month =        apr,
  year =         "1993",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/169702.169698",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:26 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We report the results of an extensive computer search
                 for good multiple recursive generators, in terms of
                 their lattice structure and implementation speed. Those
                 generators are a little slower than the usual linear
                 congruential generators, but have much longer periods
                 and much better statistical properties. We provide
                 specific parameter sets for 32-bit, 48-bit, and 64-bit
                 computers. We also explain how to build efficient
                 portable implementations and give examples of computer
                 codes in PASCAL and C.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Lee:1993:GRB,
  author =       "A. J. Lee",
  title =        "Generating Random Binary Deviates Having Fixed
                 Marginal Distributions and Specified Degrees of
                 Association",
  journal =      j-AMER-STAT,
  volume =       "47",
  number =       "3",
  pages =        "209--215",
  month =        aug,
  year =         "1993",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 14:51:21 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326461;
                 https://www.math.utah.edu/pub/tex/bib/amstat1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2684980",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Book{Li:1993:IKC,
  author =       "Ming Li and P. M. B. (Paul Michael B{\'e}la)
                 Vit{\'a}nyi",
  title =        "An Introduction to {Kolmogorov} Complexity and Its
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 546",
  year =         "1993",
  ISBN =         "0-387-94053-7 (New York), 3-540-94053-7 (Berlin)",
  ISBN-13 =      "978-0-387-94053-3 (New York), 978-3-540-94053-1
                 (Berlin)",
  LCCN =         "QA267.7 .L5 1993",
  MRclass =      "68Q30, 03B48, 60A05, 68-02, 82B03, 94A17, 68Q30",
  bibdate =      "Mon Apr 29 06:15:18 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Texts and monographs in computer science",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780387940533.pdf;
                 http://www.zentralblatt-math.org/zmath/en/search/?an=0805.68063",
  acknowledgement = ack-nhfb,
  author-dates = "1955 July 16",
  remark =       "See also second \cite{Li:1997:IKC} and third
                 \cite{Li:2008:IKC} editions.",
  subject =      "Kolmogorov complexity; Kolmogorov, Complexit{\'e} de;
                 Kolmogorov complexity; Complexiteit; Informatietheorie;
                 Algoritmen; Logica Matematica; Computabilidade E
                 Modelos De Computacao; Complexit{\'e} de calcul
                 (informatique); inform{\'a}ci{\'o}elm{\'e}let;
                 algoritmikus;
                 val{\'o}sz{\'i}n{\H{u}}s{\'e}gelm{\'e}let",
  tableofcontents = "1. Preliminaries \\
                 2. Algorithmic Complexity \\
                 3. Algorithmic Prefix Complexity \\
                 4. Algorithmic Probability \\
                 5. Inductive Reasoning \\
                 6. The Incompressibility Method \\
                 7. Resource-Bounded Complexity \\
                 8. Physics and Computation",
}

@Article{Lin:1993:NCP,
  author =       "T. Lin and L. O. Chua",
  title =        "A new class of pseudo-random number generator based on
                 chaos in digital filters",
  journal =      j-INT-J-CIRCUIT-THEORY-APPL,
  volume =       "21",
  number =       "5",
  pages =        "473--480",
  month =        sep # "\slash " # oct,
  year =         "1993",
  CODEN =        "ICTACV",
  DOI =          "https://doi.org/10.1002/cta.4490210506",
  ISSN =         "0098-9886 (print), 1097-007X (electronic)",
  ISSN-L =       "0098-9886",
  bibdate =      "Mon Jan 16 11:56:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Circuit Theory and
                 Applications",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-007X",
  keywords =     "true random numbers from physical sources",
}

@Article{Loparo:1993:LER,
  author =       "Kenneth A. Loparo and Xiangbo Feng",
  title =        "{Lyapunov} Exponent and Rotation Number of
                 Two-Dimensional Linear Stochastic Systems with
                 Telegraphic Noise",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "53",
  number =       "1",
  pages =        "283--300",
  month =        feb,
  year =         "1993",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "60H10 (34D08 34F05)",
  MRnumber =     "93m:60120",
  MRreviewer =   "Wolfgang Kliemann",
  bibdate =      "Wed Dec 10 09:59:46 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Case Western Reserve Univ",
  affiliationaddress = "Cleveland, OH, USA",
  classification = "711; 723.5; 731.1; 731.4; 921; 922.2",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  journalabr =   "SIAM J Appl Math",
  keywords =     "Computational methods; Harmonic analysis; Linear
                 control systems; Linear stochastic systems; Lyapunov
                 exponents; Lyapunov methods; Martingale; Random
                 harmonic oscillator; Random processes; Rotation number;
                 Spurious signal noise; Stochastic control systems;
                 System stability; Systems analysis; Systems science;
                 Telegraph interference; Telegraphic noise",
}

@Article{Makino:1993:SPR,
  author =       "Jun Makino",
  title =        "On the structure of parallelized random number
                 sources",
  journal =      j-COMP-PHYS-COMM,
  volume =       "78",
  number =       "1--2",
  pages =        "105--112",
  month =        dec,
  year =         "1993",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(93)90146-4",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465593901464",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Marsaglia:1993:LHR,
  author =       "George Marsaglia and Arif Zaman",
  title =        "Letter: How Random Is Random Enough?",
  journal =      j-SCIENCE-NEWS,
  volume =       "143",
  number =       "11",
  pages =        "163--163",
  day =          "13",
  month =        mar,
  year =         "1993",
  CODEN =        "SCNEBK",
  ISSN =         "0036-8423 (print), 1943-0930 (electronic)",
  ISSN-L =       "0036-8423",
  bibdate =      "Wed Jun 22 06:40:26 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Cautionary comment on \cite{Peterson:1992:MCP}.",
  URL =          "http://www.jstor.org/stable/10.2307/3977245",
  acknowledgement = ack-nhfb,
  ajournal =     "Sci. News (Washington, DC)",
  fjournal =     "Science News (Washington, DC)",
  journal-URL =  "http://www.jstor.org/journals/00368423.html;
                 http://www.sciencenews.org/view/archives;
                 http://www3.interscience.wiley.com/journal/122396840/home",
}

@Article{Marsaglia:1993:MTR,
  author =       "George Marsaglia and Arif Zaman",
  title =        "Monkey Tests for Random Number Generators",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "26",
  number =       "9",
  pages =        "1--10",
  month =        nov,
  year =         "1993",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(93)90001-C",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  MRclass =      "65C10",
  MRnumber =     "1 236 767",
  bibdate =      "Mon Aug 02 10:36:54 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0788.65007",
  abstract =     "This paper describes some simple but sophisticated
                 tests of suitability of certain random number
                 generators (RNG's). The generators are used to provide
                 the random keystrokes. The overlapping $m$-tuples of
                 successive elements in random sequences are used for
                 assessing both uniformity and independence in the
                 output of a random number generator.\par One is CAT
                 test: RNG has a typewriter with 26 upper-case letters
                 and how many keystrokes needed to spell CAT is tested.
                 The others are OPSO
                 (Overlapping-Pairs-Sparse-Occupancy), OTSO
                 (Overlapping-Triples-Sparse- Occupancy), OQSO
                 (Overlapping-Quadruples-Sparse-Occupancy) and DNA
                 tests: how many missing $k$-letter words in a long
                 string of $n$ random keystrokes from an alphabet of $
                 \alpha $ letters are tested.\par Examples of RNG's in
                 classes of congruential generators, shift register
                 generators, lagged Fibonacci generators, add-with-carry
                 and subtract-and- carry generators and combination
                 generators, passing these tests are presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Mathematics with Applications. An
                 International Journal",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  keywords =     "congruential generators; lagged Fibonacci generators;
                 monkey tests; Overlapping-Pairs-Sparse-Occupancy;
                 Overlapping-Quadruples-Sparse-Occupancy;
                 Overlapping-Triples-Sparse-Occupancy; random number
                 generators; shift register generators; sparse-occupancy
                 tests",
  ZMclass =      "65C10 Random number generation 11K45 Pseudo-random
                 numbers, etc.",
  ZMreviewer =   "K. Uosaki (Tottori)",
}

@InCollection{Marsaglia:1993:RNG,
  author =       "George Marsaglia",
  title =        "Random Number Generation",
  crossref =     "Ralston:1993:ECS",
  pages =        "1145--1148",
  year =         "1993",
  bibdate =      "Mon Aug 02 16:28:18 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "Text substantially rewritten from second edition
                 \cite{Marsaglia:1983:RNG}.",
}

@Article{Marsaglia:1993:TCR,
  author =       "George Marsaglia",
  title =        "Technical Correspondence: Remarks on Choosing and
                 Implementing Random Number Generators",
  journal =      j-CACM,
  volume =       "36",
  number =       "7",
  pages =        "105--108",
  month =        jul,
  year =         "1993",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/159544.376068",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Jan 28 14:57:13 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  remark =       "Marsaglia criticizes the `minimal-standard generator'
                 proposed in \cite{Park:1988:RNG} and discusses fast
                 ways to compute LCGs with particular multipliers. See
                 new test in \cite{Sullivan:1993:ATR} and responses in
                 \cite{Park:1993:ATR}.",
}

@InProceedings{Mascagni:1993:RDP,
  author =       "M. Mascagni and S. A. Cuccaro and D. V. Pryor and M.
                 L. Robinson",
  title =        "Recent developments in parallel pseudorandom number
                 generation",
  crossref =     "Sincovec:1993:PSS",
  pages =        "524--529",
  year =         "1993",
  bibdate =      "Tue Mar 18 11:29:18 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Matias:1993:DGD,
  author =       "Yossi Matias and Jeffrey Scott Vitter and Wen-Chun
                 Ni",
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Fourth Annual ACM-SIAM Symposium
                 on Discrete Algorithms: Austin, Texax January 25--27,
                 1993}",
  title =        "Dynamic generation of discrete random variates",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "506",
  pages =        "361--370",
  year =         "1993",
  ISBN =         "0-89871-313-7",
  ISBN-13 =      "978-0-89871-313-8",
  LCCN =         "QA76.9.A43 A34 1993",
  bibdate =      "Sat Mar 03 08:36:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Maurer:1993:SGT,
  author =       "Ueli M. Maurer",
  title =        "A simplified and generalized treatment of
                 {Luby--Rackoff} pseudorandom permutation generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "658",
  pages =        "239--??",
  year =         "1993",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:48:29 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0658.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0658/06580239.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0658/06580239.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Mitchell:1993:NRN,
  author =       "Douglas W. Mitchell",
  title =        "A Nonlinear Random Number Generator with Known, Long
                 Cycle Length",
  journal =      j-CRYPTOLOGIA,
  volume =       "17",
  number =       "1",
  pages =        "55--62",
  month =        jan,
  year =         "1993",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119391867764",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  MRclass =      "65C10 (94A60)",
  MRnumber =     "1 202 551",
  bibdate =      "Mon Jun 30 15:39:04 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "random number generator; cryptographic keystreams;
                 division algorithm; seed values; long cycle length;
                 keystream generation",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639214~db=all~order=page",
  ZMnumber =     "850.65005",
  abstract =     "A random number generator is presented for use in
                 generating cryptographic keystreams, which is based on
                 the division algorithm. This generator permits choice
                 of seed values giving a long cycle length which is
                 known a priori and/or costlessly inferred during
                 keystream generation. Advice is given for choosing seed
                 values",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "cryptography; random number generation",
  romanvolume =  "XVII",
}

@InProceedings{Monagan:1993:GPD,
  author =       "M. B. Monagan",
  title =        "{Gauss}: a parameterized domain of computation system
                 with support for signature functions",
  crossref =     "Miola:1993:DIS",
  pages =        "81--94",
  year =         "1993",
  bibdate =      "Fri Dec 29 12:46:02 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The fastest known algorithms in classical algebra make
                 use of signature functions. That is, reducing
                 computation with formulae to computing with the
                 integers modulo p, by substituting random numbers for
                 variables, and mapping constants modulo p. This idea is
                 exploited in specific algorithms in computer algebra
                 systems, e.g. algorithms for polynomial greatest common
                 divisors. It is also used as a heuristic to speed up
                 other calculations. But none exploit it in a systematic
                 manner. The author designs an AXIOM like system in
                 which these signature functions can be constructed
                 automatically, hence better exploited. He exploits them
                 in new ways. He reports on the design of such a system,
                 Gauss.",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst. fur Wissenschaftliches Rechnen, ETH, Zurich,
                 Switzerland",
  classification = "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics)",
  keywords =     "AXIOM like system; Classical algebra; Computation
                 system; Computer algebra systems; Gauss; Heuristic;
                 Integers modulo; Mapping constants modulo;
                 Parameterized domain; Polynomial greatest common
                 divisors; Random numbers; Signature functions",
  thesaurus =    "Polynomials; Symbol manipulation",
}

@TechReport{Morris:1993:NLM,
  author =       "Alfred H. {Morris, Jr.}",
  title =        "{NSWC} Library of Mathematics Subroutines",
  type =         "Report",
  number =       "NSWCDD/TR-92/425",
  institution =  "Naval Surface Warfare Center",
  address =      "Dahlgren, VA 22448-5000, USA; Silver Spring, MD
                 20903-5000, USA",
  pages =        "464",
  month =        jan,
  year =         "1993",
  bibdate =      "Tue Jun 13 08:47:19 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also earlier edition \cite{Morris:1990:NLM}.",
  URL =          "https://ntrl.ntis.gov/NTRL/dashboard/searchResults/titleDetail/ADA261511.xhtml",
  abstract =     "The NSWC library is a library of general purpose
                 Fortran subroutines that provide a basic computational
                 capability for a variety of mathematical activities.
                 Emphasis has been placed on the transportability of the
                 codes. Subroutines are available in the following
                 areas: elementary operations, geometry, special
                 functions, polynomials, vectors, matrices, large dense
                 systems of linear equations, banded matrices, sparse
                 matrices, eigenvalues and eigenvectors, l1 solution of
                 linear equations, least-squares solution of linear
                 equations, optimization, transforms, approximation of
                 functions, curve fitting, surface fitting, manifold
                 fitting, numerical integration, integral equations,
                 ordinary differential equations, partial differential
                 equations, and random number generation.",
  acknowledgement = ack-nhfb,
  remark =       "[13-Jun-2023] Despite several Web searches, a
                 machine-readable freely downloadable copy of this
                 report, and its associated software, has not yet been
                 located. The entry for the earlier edition
                 [Morris:1993:NLM] has links to a PDF file and the
                 Fortran 90 source code. Another entry [Miller:2004:AMF]
                 has links to some of the source code, without
                 indication of software version dates.",
}

@Article{N:1993:BRB,
  author =       "H. N.",
  title =        "Book Review: {{\booktitle{Random Number Generators and
                 Simulation}}, by Istv{\'a}n De{\'a}k}",
  journal =      j-MATH-COMPUT,
  volume =       "60",
  number =       "201",
  pages =        "442--442",
  month =        jan,
  year =         "1993",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Wed Dec 21 10:30:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Deak:1990:RNG}.",
  URL =          "http://www.jstor.org/stable/2153189",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Nelson:1993:CVM,
  author =       "Barry L. Nelson and J. C. Hsu",
  title =        "Control-variate Models of {Common Random Numbers} for
                 Multiple Comparisons with the Best",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "39",
  number =       "8",
  pages =        "989--1001",
  month =        aug,
  year =         "1993",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.39.8.989",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Nelson:1993:RMC,
  author =       "Barry L. Nelson",
  title =        "Robust multiple comparisons under common random
                 numbers",
  journal =      j-TOMACS,
  volume =       "3",
  number =       "3",
  pages =        "225--243",
  month =        jul,
  year =         "1993",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:27 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@InProceedings{Niederreiter:1993:FFP,
  author =       "Harald Niederreiter",
  title =        "Finite fields, pseudorandom numbers, and quasirandom
                 points",
  crossref =     "Mullen:1993:FFC",
  pages =        "375--394",
  year =         "1993",
  MRnumber =     "94a:11121",
  bibdate =      "Mon Dec 26 11:37:29 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1993:FPS,
  author =       "Harald Niederreiter",
  title =        "Factorization of Polynomials and Some Linear-Algebra
                 Problems Over Finite Fields",
  journal =      j-LINEAR-ALGEBRA-APPL,
  volume =       "192",
  pages =        "301--328",
  month =        oct,
  year =         "1993",
  CODEN =        "LAAPAW",
  ISSN =         "0024-3795 (print), 1873-1856 (electronic)",
  ISSN-L =       "0024-3795",
  MRclass =      "11T06 (11Y16 12E10)",
  MRnumber =     "95b:11114",
  bibdate =      "Wed Jan 22 17:57:24 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Computational linear algebra in algebraic and related
                 problems (Essen, 1992).",
  acknowledgement = ack-nhfb,
  fjournal =     "Linear Algebra and its Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00243795",
}

@Article{Niederreiter:1993:LRP,
  author =       "H. Niederreiter and C. P. Schnorr",
  title =        "Local Randomness in Polynomial Random Number and
                 Random Function Generators",
  journal =      j-SIAM-J-COMPUT,
  volume =       "22",
  number =       "4",
  pages =        "684--694",
  month =        aug,
  year =         "1993",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q99 (11K45 65C10 94A60)",
  MRnumber =     "94i:68229",
  bibdate =      "Mon Nov 29 11:02:16 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/22/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Niederreiter:1993:PNQ,
  author =       "Harald Niederreiter",
  title =        "Pseudorandom numbers and quasirandom points",
  journal =      j-Z-ANGE-MATH-MECH,
  volume =       "73",
  number =       "7--8",
  pages =        "T648--T652",
  month =        "????",
  year =         "1993",
  CODEN =        "ZAMMAX",
  ISSN =         "0044-2267 (print), 1521-4001 (electronic)",
  ISSN-L =       "0044-2267",
  MRclass =      "65C10",
  MRnumber =     "MR1237852",
  bibdate =      "Mon Dec 26 11:39:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Zeitschrift f{\"u}r Angewandte Mathematik und
                 Mechanik",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-4001",
}

@Book{NIST:1993:FPS,
  author =       "{National Institute of Standards and Technology}",
  title =        "{FIPS PUB 181}: Standard for {Automated Password
                 Generator (APG)}",
  publisher =    pub-NIST,
  address =      pub-NIST:adr,
  day =          "5",
  month =        oct,
  year =         "1993",
  LCCN =         "????",
  bibdate =      "Mon Nov 27 08:37:27 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.itl.nist.gov/fipspubs/fip181.htm",
  abstract =     "This publication specifies a standard to be used by
                 Federal organizations that require computer generated
                 pronounceable passwords to authenticate the personal
                 identity of an automated data processing (ADP) system
                 user, and to authorize access to system resources. The
                 standard describes an automated password generation
                 algorithm that randomly creates simple pronounceable
                 syllables as passwords. The password generator accepts
                 input from a random number generator based on the Data
                 Encryption Standard (DES) cryptographic algorithm
                 defined in Federal Information Processing Standard 46-1
                 (FIPS PUB 46-1).",
  acknowledgement = ack-nhfb,
  keywords =     "access control; Data Encryption Standard (DES);
                 Federal Information Processing Standard (FIPS);
                 identification; passwords; security",
}

@Article{Park:1993:ATR,
  author =       "Stephen K. Park and Keith W. Miller and Paul K.
                 Stockmeyer",
  title =        "Another Test for Randomness: Response",
  journal =      j-CACM,
  volume =       "36",
  number =       "7",
  pages =        "108--110",
  month =        jul,
  year =         "1993",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/159544.376068",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Mar 03 09:06:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See
                 \cite{Park:1988:RNG,Carta:1990:TFI,Marsaglia:1993:TCR,Sullivan:1993:ATR}.
                 The authors report that they would now recommend the
                 MCG $ x_{n + 1} = 48 \, 271 x_n \bmod (2^{31} - 1) $
                 over their original $ x_{n + 1} = 16 \, 807 x_n \bmod
                 (2^{31} - 1) $.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@InCollection{Pollard:1993:FCI,
  author =       "J. M. Pollard",
  title =        "Factoring with cubic integers",
  crossref =     "Lenstra:1993:DNF",
  pages =        "4--10",
  year =         "1993",
  bibdate =      "Wed Mar 14 22:05:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Rajasekaran:1993:FAG,
  author =       "Sanguthevar Rajasekaran and Keith W. Ross",
  title =        "Fast algorithms for generating discrete random
                 variates with changing distributions",
  journal =      j-TOMACS,
  volume =       "3",
  number =       "1",
  pages =        "1--19",
  month =        jan,
  year =         "1993",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:26 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@TechReport{Saarinen:1993:RNT,
  author =       "J. Saarinen and K. Kankaala and T. Ala-Nissila and I.
                 Vattulainen",
  title =        "On Random Numbers --- Test Methods and Results",
  number =       "HU-TFT-93-42",
  institution =  "Institute for Theoretical Physics, University of
                 Helsinki",
  address =      "Helsinki, Finland",
  month =        aug,
  year =         "1993",
  bibdate =      "Sat Mar 3 08:44:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Preprint Series in Theoretical Physics",
  acknowledgement = ack-nhfb,
}

@Article{Schrift:1993:UTN,
  author =       "A. W. Schrift and A. Shamir",
  title =        "Universal tests for nonuniform distributions",
  journal =      j-J-CRYPTOLOGY,
  volume =       "6",
  number =       "3",
  pages =        "119--133",
  month =        "Summer",
  year =         "1993",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60",
  MRnumber =     "94g:94028",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Weizmann Inst of Science",
  affiliationaddress = "Rehovot, Isr",
  classification = "721.1; 723.2; 922.1; 922.2",
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
  journalabr =   "J Cryptol",
  keywords =     "Binary sequences; Cryptography; Independent biased
                 source; Mathematical models; Next bit test; Nonuniform
                 distribution; Random number generation; Randomness;
                 Statistical tests; Universal test",
}

@Article{Selke:1993:CFM,
  author =       "W. Selke and A. L. Talapov and L. N. Shchur",
  title =        "Cluster-flipping {Monte Carlo} algorithm and
                 correlations in ``good'' random number generators",
  journal =      j-JETP-LETT,
  volume =       "58",
  number =       "??",
  pages =        "665--668",
  month =        "????",
  year =         "1993",
  CODEN =        "JTPLA2",
  ISSN =         "0021-3640 (print), 1090-6487 (electronic)",
  ISSN-L =       "0021-3640",
  bibdate =      "Mon Jan 16 16:16:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "JETP Letters",
  remark =       "English translation of Russian original in Pis'ma Zh.
                 Eksp. Teor. Fiz. {\bf 58} (1993), 684--686.",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Sharp:1993:PRN,
  author =       "W. E. Sharp and Carter Bays",
  title =        "A portable random number generator for
                 single-precision floating-point arithmetic",
  journal =      j-COMP-GEOSCI,
  volume =       "19",
  number =       "4",
  pages =        "593--??",
  month =        apr,
  year =         "1993",
  CODEN =        "CGEODT, CGOSDN",
  ISSN =         "0098-3004 (print), 1873-7803 (electronic)",
  ISSN-L =       "0098-3004",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Geosciences",
}

@Article{Sherif:1993:DTN,
  author =       "Yosef S. Sherif and Roger G. Dear",
  title =        "The development and testing of a new composite random
                 number generator",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "25",
  number =       "1",
  pages =        "3--16",
  month =        jan,
  year =         "1993",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(93)90207-C",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 19:11:10 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See remarks and improvements \cite{Sezgin:1995:SRN}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/089812219390207C",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Sloan:1993:BRB,
  author =       "Ian H. Sloan",
  title =        "Book Review: {{\booktitle{Random Number Generation and
                 Quasi-Monte Carlo Methods}} (H. Niederreiter)}",
  journal =      j-SIAM-REVIEW,
  volume =       "35",
  number =       "4",
  pages =        "680--681",
  month =        dec,
  year =         "1993",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1035170",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Sat Mar 29 09:55:16 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/35/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "December 1993",
}

@Article{Sobol:1993:RQS,
  author =       "I. M. Sobol' and B. V. Shukman",
  title =        "Random and quasirandom sequences: numerical estimates
                 of uniformity of distribution",
  journal =      j-MATH-COMP-MODELLING,
  volume =       "18",
  number =       "8",
  pages =        "39--45",
  month =        oct,
  year =         "1993",
  CODEN =        "MCMOEG",
  DOI =          "https://doi.org/10.1016/0895-7177(93)90160-Z",
  ISSN =         "0895-7177 (print), 1872-9479 (electronic)",
  ISSN-L =       "0895-7177",
  bibdate =      "Mon Feb 27 17:09:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/089571779390160Z",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical and computer modelling",
}

@Article{Sullivan:1993:ATR,
  author =       "Stephen J. Sullivan",
  title =        "Another Test for Randomness",
  journal =      j-CACM,
  volume =       "36",
  number =       "7",
  pages =        "108--108",
  month =        jul,
  year =         "1993",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/159544.376068",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Mar 03 09:06:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Sullivan reports a new test of generator uniformity
                 and reports serious failure in the `minimal-standard
                 generator' proposed in \cite{Park:1988:RNG}. See
                 response in \cite{Park:1993:ATR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Swain:1993:AA,
  author =       "Tom Swain",
  title =        "Algorithm Alley",
  journal =      j-DDJ,
  volume =       "18",
  number =       "13",
  pages =        "119--??",
  month =        dec,
  year =         "1993",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 03 09:15:46 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "Tom uses frequency distribution to explore just how
                 random pseudorandom numbers really are. In particular,
                 he examines a statistical method known as the
                 ``chi-square distribution''.",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}

@Article{Tezuka:1993:CFP,
  author =       "Shu Tezuka and Masanori Fushimi",
  title =        "Calculation of {Fibonacci} Polynomials for {GFSR}
                 Sequences with Low Discrepancies",
  journal =      j-MATH-COMPUT,
  volume =       "60",
  number =       "202",
  pages =        "763--770",
  month =        apr,
  year =         "1993",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11B39 11Y99)",
  MRnumber =     "93h:65009",
  MRreviewer =   "P{\'e}ter Kiss",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2153114.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Tezuka:1993:LSA,
  author =       "Shu Tezuka and Pierre L'Ecuyer and Raymond Couture",
  title =        "On the lattice structure of the add-with-carry and
                 subtract-with-borrow random number generators",
  journal =      j-TOMACS,
  volume =       "3",
  number =       "4",
  pages =        "315--331",
  month =        oct,
  year =         "1993",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/159737.159749",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  MRclass =      "65C10",
  MRnumber =     "1302042",
  bibdate =      "Thu Aug 7 12:05:27 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/annapplprobab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  note =         "See remark in \cite[page
                 248]{Eichenauer-Herrmann:1995:PNG}, and
                 \cite{Marsaglia:1991:NCR} for the original work
                 analyzed in this paper.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  remark =       "See",
}

@Article{Toral:1993:GGD,
  author =       "Ra{\'u}l Toral and Amitabha Chakrabarti",
  title =        "Generation of {Gaussian} distributed random numbers by
                 using a numerical inversion method",
  journal =      j-COMP-PHYS-COMM,
  volume =       "74",
  number =       "3",
  pages =        "327--334",
  month =        mar,
  year =         "1993",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(93)90016-6",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 21:29:36 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465593900166",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Vattulainen:1993:IIP,
  author =       "I. Vattulainen and K. Kankaala and J. Saarinen and T.
                 Ala-Nissila",
  title =        "Influence of Implementation on the Properties of
                 Pseudorandom Number Generators with a Carry Bit",
  journal =      "arxiv.org",
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "8",
  month =        jun,
  year =         "1993",
  bibdate =      "Thu Jan 19 17:55:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/hep-lat/9306008",
  abstract =     "We present results of extensive statistical and bit
                 level tests on three implementations of a pseudorandom
                 number generator algorithm using the lagged Fibonacci
                 method with an occasional addition of an extra bit.
                 First implementation is the RCARRY generator of James,
                 which uses subtraction. The second is a modified
                 version of it, where a suggested error present in the
                 original implementation has been corrected. The third
                 is our modification of RCARRY such that it utilizes
                 addition of the carry bit. Our results show that there
                 are no significant differences between the performance
                 of these three generators.",
  acknowledgement = ack-nhfb,
}

@Article{Wang:1993:URP,
  author =       "Da Kai Wang and Aaldert Compagner",
  title =        "On the use of reducible polynomials as random number
                 generators",
  journal =      j-MATH-COMPUT,
  volume =       "60",
  number =       "201",
  pages =        "363--374",
  month =        jan,
  year =         "1993",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K99)",
  MRnumber =     "93e:65012",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Tue Mar 25 15:38:13 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1140Z (Other and miscellaneous);
                 C5230 (Digital arithmetic methods)",
  corpsource =   "Lab. of Appl. Phys., Delft Univ. of Technol.,
                 Netherlands",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "approximate-maximum-length sequences; bit rates; Carlo
                 simulations; characteristic polynomial; coefficients;
                 correlation; large-scale Monte; Monte Carlo methods;
                 polynomials; random number generation; random number
                 generators; reducible polynomials",
  treatment =    "P Practical",
}

@TechReport{Weber:1993:AIG,
  author =       "K. Weber",
  title =        "The Accelerated Integer {GCD} Algorithm",
  type =         "Technical Report",
  number =       "ICM-9307-55",
  institution =  "Institute for Computational Mathematics, Kent State
                 University",
  address =      "Kent, OH, USA",
  month =        jul,
  year =         "1993",
  bibdate =      "Thu Dec 29 07:22:38 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Willemain:1993:MGA,
  author =       "R. Thomas Willemain and A. Philip Desautels",
  title =        "A method to generate autocorrelated uniform random
                 numbers",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "45",
  number =       "1--2",
  pages =        "23--31",
  month =        feb,
  year =         "1993",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659308811469",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 7 08:01:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659308811469",
  abstract =     "We present a simple, fast method to generate
                 autocorrelated uniform random numbers. The ``sum of
                 uniforms'' method adds a pair of $ U(0, 1) $ random
                 numbers, transforms the sum to a third $ U(0, 1) $
                 random number, and uses this third random number as one
                 member of the next pair. The method produces any
                 desired level of positive or negative correlation
                 between successive random numbers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Winkler:1993:SRP,
  author =       "Reinhard Winkler",
  title =        "Some Remarks on Pseudorandom Sequences",
  journal =      j-MATH-SLOVACA,
  volume =       "43",
  number =       "4",
  pages =        "493--512",
  month =        "????",
  year =         "1993",
  CODEN =        "MASLDM",
  ISSN =         "0139-9918 (print), 1337-2211 (electronic)",
  ISSN-L =       "0139-9918",
  MRclass =      "65C10 (60A05)",
  MRnumber =     "1248982 (94g:65009)",
  bibdate =      "Sat Mar 3 09:12:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0813.65001",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Slovaca",
}

@Article{Yang:1993:NBS,
  author =       "Yi Xian Yang",
  title =        "New binary sequences with perfect staircase profile of
                 linear complexity",
  journal =      j-INFO-PROC-LETT,
  volume =       "46",
  number =       "1",
  pages =        "27--29",
  day =          "29",
  month =        apr,
  year =         "1993",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "94A55 (68Q30)",
  MRnumber =     "94e:94011",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Inf. Eng., Beijing Univ. of Posts and
                 Telecommun., China",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "binary sequences; computational complexity; data
                 structures; linear complexity; perfect staircase
                 profile; random number generation",
  treatment =    "P Practical",
}

@Article{Zechner:1993:EBV,
  author =       "H. Zechner and E. Stadlober",
  title =        "{Erzeugung von beta-verteilten Zufallszahlen mittels
                 Patchwork-Verwerfung}. ({German}) [{Generating} Beta
                 Variates Via Patchwork Rejection]",
  journal =      j-COMPUTING,
  volume =       "50",
  number =       "1",
  pages =        "1--18",
  month =        mar,
  year =         "1993",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C20",
  MRnumber =     "94b:65018",
  bibdate =      "Mon Oct 11 20:38:38 MDT 1999",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  language =     "German",
}

@Article{Zurbenko:1993:WCR,
  author =       "I. G. Zurbenko",
  title =        "On weakly correlated random numbers generator",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "47",
  number =       "1--2",
  pages =        "79--88",
  month =        jun,
  year =         "1993",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659308811512",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:48:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659308811512",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  keywords =     "Bernoulli sequence",
  onlinedate =   "20 Mar 2007",
}

@InProceedings{Aiello:1994:PPP,
  author =       "William Aiello and S. Raj Rajagopalan and Ramarathnam
                 Venkatesan",
  title =        "Practical and provable pseudorandom generators",
  crossref =     "ACM-SIAM:1994:ASD",
  pages =        "1--8",
  year =         "1994",
  bibdate =      "Thu Dec 29 14:51:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Allison:1994:UHA,
  author =       "Lloyd Allison",
  title =        "Using {Hirschberg}'s algorithm to generate random
                 alignments of strings",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "5",
  pages =        "251--255",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q20 (68Q25)",
  MRnumber =     "95g:68039",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Monash Univ",
  affiliationaddress = "Clayton, Aust",
  classification = "721.1; 723.2; 922.1; 922.2; A0250 (Probability
                 theory, stochastic processes, and statistics); A0260
                 (Numerical approximation and analysis); A3620
                 (Macromolecules and polymer molecules); A8715B
                 (Structure, configuration, conformation, and active
                 sites at the biomolecular level); C1140Z (Other and
                 miscellaneous); C4240 (Programming and algorithm
                 theory); C7330 (Biology and medicine)",
  corpsource =   "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
                 Australia",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; biology computing;
                 Computational complexity; computational complexity;
                 Data structures; DNA; DNA strings; Edit distance;
                 evolutionary distances; family of strings; Hirschberg's
                 algorithm; Longest common subsequence (LCS); longest
                 common subsequence problem; molecular biophysics; Monte
                 Carlo methods; O(n) space; O(n/sup 2/) time;
                 Probability; probability; probability distribution;
                 random alignments; Random number generation; Random
                 processes; random processes; Sampling; space
                 complexity; statistical analysis; statistical
                 estimation; String alignments; strings; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Angus:1994:PIT,
  author =       "John E. Angus",
  title =        "The Probability Integral Transform and Related
                 Results",
  journal =      j-SIAM-REVIEW,
  volume =       "36",
  number =       "4",
  pages =        "652--654",
  month =        dec,
  year =         "1994",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1036146",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "62E15",
  MRnumber =     "95h:62018",
  bibdate =      "Sat Mar 29 09:55:26 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/36/4;
                 http://www.siam.org/journals/sirev/sirev364.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://epubs.siam.org/26453.htm",
  abstract =     "A simple proof of the probability integral transform
                 theorem in probability and statistics is given that
                 depends only on probabilistic concepts and elementary
                 properties of continuous functions. This proof yields
                 the theorem in its fullest generality. A similar
                 theorem that forms the basis for the inverse method of
                 random number generation is also discussed and
                 contrasted to the probability integral transform
                 theorem. Typical applications are discussed. Despite
                 their generality and far reaching consequences, these
                 theorems are remarkable in their simplicity and ease of
                 proof.",
  acknowledgement = ack-nhfb,
  affiliation =  "Claremont Graduate Sch",
  affiliationaddress = "Claremont, CA, USA",
  classification = "921.2; 921.3; 921.6; 922.1; 922.2",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Cumulative distribution function; Functions; Integral
                 equations; Inverse problems; Mathematical
                 transformations; Pivot functions; Probability;
                 Probability integral transform; Random number
                 generation; Statistical inference; Statistics",
  onlinedate =   "December 1994",
}

@Article{Annan:1994:RAA,
  author =       "J. D. Annan",
  title =        "A randomised approximation algorithm for counting the
                 number of forests in dense graphs",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "3",
  number =       "3",
  pages =        "273--283",
  month =        sep,
  year =         "1994",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548300001188",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "68Q20 (05C05 05C30 05C85 68Q25)",
  MRnumber =     "MR1300965 (95j:68064)",
  MRreviewer =   "Mark R. Jerrum",
  bibdate =      "Sat Nov 26 17:00:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@InProceedings{Anonymous:1994:IPR,
  author =       "Anonymous",
  title =        "Implementation of a Portable and Reproducible Parallel
                 and Pseudorandom Number Generator",
  crossref =     "IEEE:1994:PSW",
  pages =        "311--319",
  year =         "1994",
  bibdate =      "Mon Aug 26 10:38:41 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Bailey:1994:PGR,
  author =       "Ralph W. Bailey",
  title =        "Polar generation of random variates with the
                 $t$-distribution",
  journal =      j-MATH-COMPUT,
  volume =       "62",
  number =       "206",
  pages =        "779--781",
  month =        apr,
  year =         "1994",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (62E15)",
  MRnumber =     "94g:65006",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Barcucci:1994:RGD,
  author =       "E. Barcucci and R. Pinzani and R. Sprugnoli",
  title =        "The random generation of directed animals",
  journal =      j-THEOR-COMP-SCI,
  volume =       "127",
  number =       "2",
  pages =        "333--350",
  day =          "23",
  month =        may,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:08 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=127&issue=2&aid=1476",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Sistemi e Inf., Firenze Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "algorithm theory; combinatorial mathematics;
                 combinatorial objects; directed animals; empirical
                 evidence; percolation; random generation; random number
                 generation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@MastersThesis{Boucher:1994:GPA,
  author =       "M. Boucher",
  title =        "La g{\'e}n{\'e}ration pseudo-al{\'e}atoire
                 cryptographiquement s{\'e}curitaire et ses
                 consid{\'e}rations pratiques. ({French})
                 [{Cryptographically-secure} random-number generation
                 and its practical considerations]",
  type =         "Masters thesis",
  school =       "D{\'e}partement d'{I.R.O.}, Universit{\'e} de
                 Montr{\'e}al",
  address =      "Montr{\'e}al, QC, Canada",
  year =         "1994",
  bibdate =      "Sat Mar 3 09:14:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Bratley:1994:APG,
  author =       "Paul Bratley and Bennett L. Fox and Harald
                 Niederreiter",
  title =        "{Algorithm 738}: {Programs} to Generate
                 {Niederreiter}'s Low-discrepancy Sequences",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "494--495",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/198429.198436",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Mon Apr 10 15:51:40 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1994-20-4/p494-bratley/",
  acknowledgement = ack-rfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "low-discrepancy sequences; quasi-Monte Carlo;
                 quasirandom sequences",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation; I.6 [Computing Methodologies]:
                 Simulation and Modeling",
}

@Article{Brent:1994:PGF,
  author =       "Richard P. Brent",
  title =        "On the periods of generalized {Fibonacci}
                 recurrences",
  journal =      j-MATH-COMPUT,
  volume =       "63",
  number =       "207",
  pages =        "389--401",
  month =        jul,
  year =         "1994",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11B37 (11B39)",
  MRnumber =     "94i:11012",
  MRreviewer =   "A. Peth{\"o}",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Cain:1994:MGF,
  author =       "Michael Cain",
  title =        "The Moment-Generating Function of the Minimum of
                 Bivariate Normal Random Variables",
  journal =      j-AMER-STAT,
  volume =       "48",
  number =       "2",
  pages =        "124--125",
  month =        may,
  year =         "1994",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "60E10 (62G30)",
  MRnumber =     "1 292 528",
  bibdate =      "Mon May 5 09:19:29 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Calude:1994:RIN,
  author =       "C. Calude and H. Juergensen",
  title =        "Randomness as an Invariant for Number
                 Representations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "812",
  pages =        "44--66",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Sep 15 10:01:31 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "important results; TCS; theoretical computer science",
}

@Article{Calvert:1994:EDL,
  author =       "Ken Calvert",
  title =        "Eliminating disjunctions of leads-to properties
                 (temporal logic)",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "4",
  pages =        "189--194",
  day =          "25",
  month =        feb,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B45 03B70 68T27)",
  MRnumber =     "1 266 716",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "716.1; 721.1; 723.1.1; 723.2; C4210 (Formal logic);
                 C4250 (Database theory); C6110B (Software engineering
                 techniques)",
  conferenceyear = "1994",
  corpsource =   "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
                 GA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Binary sequences; Boolean connectives; Boolean
                 functions; Computational linguistics; Computer hardware
                 description languages; Concurrency; Data processing;
                 disjunctions; Formal logic; Formal semantics; formal
                 specification; Information theory; Linear temporal
                 logic; linear temporal logic; Natural number generator;
                 predicate; Propositional logic; propositional logic;
                 Random bit generator; specification formalisms; State
                 assignment; temporal logic; Temporal property; temporal
                 property; Theorem proving; unity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chang:1994:SGM,
  author =       "Pao-long Chang and Shiuh-nan Hwang and Chiang Kao",
  title =        "Some good multipliers for random number generator for
                 16-bit microcomputers",
  journal =      j-COMP-OP-RES,
  volume =       "21",
  number =       "2",
  pages =        "199--204",
  month =        feb,
  year =         "1994",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/0305-0548(94)90052-3",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comments and improvements
                 \cite{Sezgin:1996:RNG}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0305054894900523",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
}

@Article{Chen:1994:IPL,
  author =       "Wen Chin Chen and Wen Chun Ni",
  title =        "Internal path length of the binary representation of
                 heap-ordered trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "129--132",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P05 (05C05)",
  MRnumber =     "95e:68035",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Univ",
  affiliationaddress = "Taipei, Taiwan",
  classification = "721.1; 723.2; 723.5; 921.4; 921.6; 922.1; C1140
                 (Probability and statistics); C1160 (Combinatorial
                 mathematics); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; binary representation; Binary sequences;
                 combinatorial algorithms; Combinatorial enumeration;
                 Combinatorial mathematics; Computer applications;
                 Computer systems; data structure; Data structures;
                 Generating function; Heap ordered trees; heap-ordered
                 trees; HOT; internal path length; Internal path length;
                 minimum key; minimum spanning trees; network flows;
                 Numerical methods; priority queue; probability;
                 Probability; Queueing theory; random n-node
                 heap-ordered tree; Random number generation; Random
                 processes; rooted labeled tree; shortest paths; tree
                 data structures; trees (mathematics); Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1994:ECA,
  author =       "Pen Cheng and Shigeru Masuyama",
  title =        "On the equivalence in complexity among three
                 computation problems on maximum number of edge-disjoint
                 $s$-$t$ paths in a probabilistic graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "4",
  pages =        "195--199",
  day =          "24",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (05C80)",
  MRnumber =     "95h:68079",
  MRreviewer =   "Charles J. Colbourn",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Toyohashi Univ of Technology",
  affiliationaddress = "Toyohashi-shi, Jpn",
  classification = "721.1; 722.3; 921.1; 921.3; 921.4; 922.1; C1140Z
                 (Other and miscellaneous); C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Knowledge-Based Inf. Eng., Toyohashi Univ. of
                 Technol., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "complexity equivalence; computation problems;
                 Computational complexity; computational complexity;
                 Computer networks; Edge disjoint s t paths;
                 edge-disjoint s-t paths; Equivalence classes; expected
                 value; Failure analysis; Function evaluation; Graph
                 theory; graph theory; Mathematical transformations;
                 Maximum principle; Polynomials; Probabilistic graph;
                 probabilistic graph; Probability; probability;
                 Probability density function; probability density
                 function; Probability distribution function;
                 probability distribution function; random maximum
                 number; Random processes; Reliability; sink; specified
                 source",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chiang:1994:DSD,
  author =       "Kao Chiang",
  title =        "Decomposition with simulated division for efficiently
                 generating random numbers",
  journal =      j-COMP-OP-RES,
  volume =       "21",
  number =       "10",
  pages =        "1089--1093",
  month =        dec,
  year =         "1994",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/0305-0548(94)90039-6",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Fri Mar 09 09:01:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0305054894900396",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
  remark =       "The author proposes decomposition of the linear
                 congruential multiplier as $ A = a_0 + a_1 2^{b / 2 -
                 1} + a_2 2^{b - 2} $, where $b$ is the size of the
                 computer word, and uses simulated division to compute
                 random numbers when the modulus is $ 2^{31} - 1 $.",
}

@Article{Chiang:1994:SET,
  author =       "Kao Chiang and J. Y. Wong",
  title =        "Several extensively tested random number generators",
  journal =      j-COMP-OP-RES,
  volume =       "21",
  number =       "9",
  pages =        "1035--1039",
  month =        nov,
  year =         "1994",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/0305-0548(94)90074-4",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Fri Mar 09 08:57:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0305054894900744",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
  remark =       "The authors propose 62 multipliers for linear
                 congruential generators with moduli in the ten largest
                 primes below $ 2^{15} $.",
}

@Article{Coddington:1994:ARN,
  author =       "Paul D. Coddington",
  title =        "Analysis of random number generators using {Monte
                 Carlo} simulation",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "5",
  number =       "3",
  pages =        "547--560",
  month =        jun,
  year =         "1994",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183194000726",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Sat Sep 17 13:48:53 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Monte Carlo simulation is one of the main applications
                 involving the use of random number generators. It is
                 also one of the best methods of testing the randomness
                 properties of such generators, by comparing results of
                 simulations using different generators with each other,
                 or with analytic results. Here we compare the
                 performance of some popular random number generators by
                 high precision Monte Carlo simulation of the 2-D Ising
                 model, for which exact results are known, using the
                 Metropolis, Swendsen--Wang, and Wol Monte Carlo
                 algorithms. Many widely used generators that perform
                 well in standard statistical tests are shown to fail
                 these Monte Carlo tests.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Cooperman:1994:RBC,
  author =       "Gene Cooperman and Larry Finkelstein",
  title =        "A Random Base Change Algorithm for Permutation
                 Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "513--528",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20B07)",
  MRnumber =     "96a:68048",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C1140Z (Other and
                 miscellaneous); C7310 (Mathematics); C6130 (Data
                 handling techniques)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171",
  keywords =     "asymptotic running time; combinatorial mathematics;
                 computational complexity; data; data structure; domain;
                 generation; group membership; group theory;
                 permutation; permutation groups; point stabilizer;
                 probability; Rand(G); random base change algorithm;
                 random generator; random number; sequence; structures;
                 time bound; time complexity; worst case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Coppersmith:1994:SG,
  author =       "Don Coppersmith and Hugo Krawczyk and Yishay Mansour",
  booktitle =    "Advances in Cryptology--{CRYPTO 93}",
  title =        "The Shrinking Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "773",
  pages =        "22--39",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:49:00 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0773.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0773/07730022.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0773/07730022.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Corcoran:1994:MVC,
  author =       "William J. Corcoran",
  title =        "A Multiloop {Vigen{\`e}re} Cipher with Exceptionally
                 Long Component Series",
  journal =      j-CRYPTOLOGIA,
  volume =       "18",
  number =       "4",
  pages =        "356--371",
  month =        oct,
  year =         "1994",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119491882937",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:39:08 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  note =         "multiloop Vigen{\'e}re cipher; exceptionally long
                 component series; computer generation; polyalphabetic
                 cryptographic system; character set; linear
                 congruential generating function; component series;
                 cryptanalysis; multiloop system; computationally
                 secure; personal computers; Spectra Publishing; Power
                 Basic; BASIC",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639272~db=all~order=page",
  ZMnumber =     "950.08964",
  abstract =     "An algorithm is described for computer generation of a
                 very long series E of numbers suitable for use in a
                 polyalphabetic cryptographic system. Individual numbers
                 in the series range from 0 to C-1, where C is the
                 number of characters in a desired character set (e.g.,
                 C=128 for the ASCII characters 0--127; or C=26 for 26
                 letters of the alphabet). The enciphering series E is
                 formed as in a multiloop Vigen{\'e}re cipher system and
                 the linear congruential generating function is used to
                 generate component series (``loops'') with
                 exceptionally long periods, as long as 10/sup 12/.
                 While Vigen{\'e}re systems are usually considered to be
                 vulnerable to cryptanalysis, it is proposed that the
                 magnitude of the numbers available in the component
                 series can make a multiloop system ``computationally
                 secure''. Rates of series E generation, using widely
                 available personal computers and software, appear
                 reasonable. Examples given are based on Spectra
                 Publishing's Power Basic, but similar implementations
                 can be made in other versions of BASIC, or in other
                 languages",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "codes; cryptography; random number generation",
  romanvolume =  "XVIII",
}

@Article{Couture:1994:LSC,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "On the lattice structure of certain linear
                 congruential sequences related to {AWC\slash SWB}
                 generators",
  journal =      j-MATH-COMPUT,
  volume =       "62",
  number =       "206",
  pages =        "799--808",
  month =        apr,
  year =         "1994",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153540",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "94g:65007",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2153540.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "add-with-carry (AWC); subtract-with-borrow (SWB)",
}

@TechReport{Cuccaro:1994:TTQ,
  author =       "Steven A. Cuccaro and Michael Mascagni and Daniel V.
                 Pryor",
  title =        "Techniques for testing the quality of parallel
                 pseudorandom number generators",
  type =         "Technical report",
  number =       "SRC-TR-94-128",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "6",
  day =          "4",
  month =        oct,
  year =         "1994",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Ensuring that pseudorandom number generators have good
                 randomness properties is more complicated in a
                 multiprocessor implementation than in the uniprocessor
                 case. We discuss simple extensions of uniprocessor
                 testing for SIMD parallel streams, and develop in
                 detail a repeatability test for the SPMD paradigm.
                 Examples of the application of these tests to an
                 additive lagged-Fibonacci generator are also given.",
  acknowledgement = ack-nhfb,
  keywords =     "Random number generators",
}

@InProceedings{Davis:1994:CRA,
  author =       "Don Davis and Ross Ihaka and Philip Fenstermacher",
  title =        "Cryptographic Randomness from Air Turbulence in Disk
                 Drives",
  crossref =     "Desmedt:1994:ACC",
  pages =        "114--120",
  year =         "1994",
  bibdate =      "Tue Feb 5 11:49:18 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0839.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0839/08390114.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0839/08390114.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "CRYPTO '94; cryptology; IACR; IEEE",
}

@Article{DeArmon:1994:RLO,
  author =       "James S. DeArmon",
  title =        "Randomness of Low-Order Bits in Random Number
                 Generators",
  journal =      j-SIMULATION,
  volume =       "62",
  number =       "6",
  pages =        "373--377",
  month =        jul,
  year =         "1994",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979406200604",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:43:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/62/6/373.abstract",
  abstract =     "Pseudo-random numbers are widely used in Operations
                 Research and applied mathematics. With the growth in
                 power of computers and languages, there is some
                 tendency to use lower-significant bits within the
                 pseudo- random number. Theoretical and empirical tests
                 have not been sufficient to assess the randomness of
                 these low-order bits. We show here for two generators
                 that the low- order bits can be empirically tested,
                 after first undertaking a bit-level transformation of
                 the numbers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Deng:1994:DIR,
  author =       "L.-Y. Deng and K. H. Chan and Y. Yuan",
  title =        "Design and Implementation of Random Number Generators
                 for Multiprocessor Systems",
  journal =      j-INT-J-MODELLING-SIMUL,
  volume =       "14",
  number =       "4",
  pages =        "185--191",
  month =        "????",
  year =         "1994",
  CODEN =        "IMSIEK",
  ISSN =         "0228-6203 (print), 1925-7082 (electronic)",
  ISSN-L =       "0228-6203",
  bibdate =      "Sat Mar 3 09:20:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.actapress.com/Content_of_Journal.aspx?JournalID=118",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modelling and Simulation",
  remark =       "On 03 March 2012, the publisher does not have issues
                 online before volume 24 (2004), and I can find no other
                 online archive for this journal.",
}

@Article{Devroye:1994:NHS,
  author =       "Luc Devroye and Paul Kruszewski",
  title =        "A note on the {Horton--Strahler} number for random
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "155--159",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q25 (60C05 68M07 68R10)",
  MRnumber =     "95i:68059",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "McGill Univ",
  affiliationaddress = "Montreal, Que, Can",
  classification = "723.1; 723.2; 921.6; 922.1; 922.2; C4240C
                 (Computational complexity); C6120 (File organisation)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Binary sequences; binary trees;
                 computational complexity; Data processing; Horton
                 Strahler number; Horton--Strahler number; probabilistic
                 proof; Probability; Random equiprobable binary trees;
                 random equiprobable binary trees; Random number
                 generation; random trees; tree data structures; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Misc{Eastlake:1994:RRR,
  author =       "D. {Eastlake, 3rd} and S. Crocker and J. Schiller",
  title =        "{RFC 1750}: Randomness Recommendations for Security",
  month =        dec,
  year =         "1994",
  bibdate =      "Thu Mar 27 11:37:17 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Status: INFORMATIONAL. Obsoleted by RFC4086.",
  URL =          "ftp://ftp.internic.net/rfc/rfc1750.txt;
                 https://www.math.utah.edu/pub/rfc/rfc1750.txt",
  acknowledgement = ack-nhfb,
  format =       "TXT=73842 bytes",
  online =       "yes",
  status =       "INFORMATIONAL",
}

@Article{Eichenauer-Herrmann:1994:BES,
  author =       "J. Eichenauer-Herrmann and H. Niederreiter",
  title =        "Bounds for Exponential Sums and their Applications to
                 Pseudorandom Numbers",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "67",
  number =       "3",
  pages =        "269--281",
  month =        "????",
  year =         "1994",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Sat Mar 3 09:38:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://matwbn.icm.edu.pl/ksiazki/aa/aa67/aa6736.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Eichenauer-Herrmann:1994:CNC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Compound nonlinear congruential pseudorandom numbers",
  journal =      j-MONAT-MATH,
  volume =       "117",
  number =       "3--4",
  pages =        "213--222",
  month =        sep,
  year =         "1994",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01299703",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Fri Dec 23 22:09:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/n82h7044q514l33x/",
  abstract =     "The nonlinear congruential method for generating
                 uniform pseudorandom numbers has several very promising
                 properties. However, an implementation in
                 multiprecision of these pseudorandom number generators
                 is usually necessary. In the present paper a compound
                 version of the nonlinear congruential method is
                 introduced, which overcomes this disadvantage. It is
                 shown that the generated sequences have very attractive
                 statistical independence properties. The results that
                 are established are essentially best possible and show
                 that the generated pseudorandom numbers model true
                 random numbers very closely. The method of proof relies
                 heavily on a thorough analysis of exponential sums.",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Eichenauer-Herrmann:1994:DIP,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "Digital inversive pseudorandom numbers",
  journal =      j-TOMACS,
  volume =       "4",
  number =       "4",
  pages =        "339--349",
  month =        oct,
  year =         "1994",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Eichenauer-Herrmann:1994:DQC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "On the discrepancy of quadratic congruential
                 pseudorandom numbers with power of two modulus",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "53",
  number =       "3",
  pages =        "371--376",
  day =          "30",
  month =        aug,
  year =         "1994",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(94)90064-7",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042794900647",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Eichenauer-Herrmann:1994:EIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Katja Ickstadt",
  title =        "Explicit inversive congruential pseudorandom numbers
                 with power of two modulus",
  journal =      j-MATH-COMPUT,
  volume =       "62",
  number =       "206",
  pages =        "787--797",
  month =        apr,
  year =         "1994",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153539",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (11K38 65C10)",
  MRnumber =     "1212266 (94h:11071)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2153539",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "From the last paragraph of the paper: ``This behavior
                 of the explicit inversive congruential method with {\em
                 power of two modulus\/} is a serious disadvantage
                 compared to the situation for a {\em prime modulus},
                 where the discrepancy of $k$-tuples fits to the law of
                 the iterated logarithm for any dimension $ k \geq 2
                 $.''. Thus, prime moduli are much to be preferred for
                 inversive congruential generators.",
}

@Article{Eichenauer-Herrmann:1994:GIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "On generalized inversive congruential pseudorandom
                 numbers",
  journal =      j-MATH-COMPUT,
  volume =       "63",
  number =       "207",
  pages =        "293--299",
  month =        jul,
  year =         "1994",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153575",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (11L07 65C10)",
  MRnumber =     "1242056 (94k:11088)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Tue Mar 25 15:38:13 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2153575",
  acknowledgement = ack-nhfb,
  affiliation =  "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  classcodes =   "B0250 (Combinatorial mathematics); C5230 (Digital
                 arithmetic methods); C1160 (Combinatorial mathematics);
                 C7310 (Mathematics)",
  corpsource =   "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "composite moduli; generalized inversive congruential
                 pseudorandom numbers; number theory; random number
                 generation; statistical independence properties",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eichenauer-Herrmann:1994:ILB,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Improved lower bounds for the discrepancy of inversive
                 congruential pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "62",
  number =       "206",
  pages =        "783--786",
  month =        apr,
  year =         "1994",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.2307/2153538",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1216258 (94g:11058)",
  MRreviewer =   "R. G. Stoneham",
  bibdate =      "Sat Jan 11 13:29:06 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2153538.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Eichenauer-Herrmann:1994:SIN,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "On the statistical independence of nonlinear
                 congruential pseudorandom numbers",
  journal =      j-TOMACS,
  volume =       "4",
  number =       "1",
  pages =        "89--95",
  month =        jan,
  year =         "1994",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Endl:1994:CRG,
  author =       "R. Endl and M. Sommer",
  title =        "Classification of ray-generators in uniform
                 subdivisions and octrees for ray tracing",
  journal =      j-CGF,
  volume =       "13",
  number =       "1",
  pages =        "3--19",
  month =        mar,
  year =         "1994",
  CODEN =        "CGFODY",
  ISSN =         "0167-7055 (print), 1467-8659 (electronic)",
  ISSN-L =       "0167-7055",
  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130B (Graphics
                 techniques); C6180 (User interfaces)",
  corpsource =   "Fachgebiet Inf., Philipps-Univ., Marburg, Germany",
  fjournal =     "Com{\-}pu{\-}ter Graphics Forum",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
  keywords =     "computer graphics; determination; global time; Global
                 time measurements; measurements; octrees; Octrees;
                 octrees; Random rays; random rays; ray cell; Ray cell
                 determination; ray cell initialization; Ray cell
                 initialization; Ray tracing; ray tracing; ray-cell
                 sequence generation; Ray-cell sequence generation;
                 ray-cell sequence generation; Ray-generator
                 classification; ray-generator classification;
                 Ray-object intersections; ray-object intersections;
                 spatial subdivisions; Spatial subdivisions; spatial
                 subdivisions; tree data structures; uniform
                 subdivisions; Uniform subdivisions; uniform
                 subdivisions; X-ray-generators",
  thesaurus =    "Computer graphics; Ray tracing; Tree data structures",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Entacher:1994:CNP,
  author =       "K. Entacher",
  editor =       "M. Vajter{\v{s}}ic and P. Zinterhof",
  booktitle =    "Proceedings of the International Workshop Parallel
                 Numerics '94, Smolenice, September 19--21",
  title =        "Classical and new pseudorandom number generators in
                 the run test",
  publisher =    "Slovak Academy of Sciences, Institute for
                 Informatics",
  address =      "????, Slovakia",
  year =         "1994",
  bibdate =      "Fri Jan 6 11:08:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Gaines:1994:RGS,
  author =       "J. G. Gaines and T. J. Lyons",
  title =        "Random Generation of Stochastic Area Integrals",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "54",
  number =       "4",
  pages =        "1132--1146",
  month =        aug,
  year =         "1994",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "60H10 (93E30)",
  MRnumber =     "95f:60063",
  MRreviewer =   "Dominique L{\'e}pingle",
  bibdate =      "Wed Dec 10 09:59:46 MST 1997",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/sam-bin/dbq/toc/SIAP/54/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/23570",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Edinburgh",
  affiliationaddress = "Edinburgh, UK",
  classification = "721.1; 921.2; 921.6; 922.1",
  conferenceyear = "1994",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  journalabr =   "SIAM J Appl Math",
  keywords =     "Approximation theory; Computational complexity;
                 Convergence of numerical methods; Differential
                 equations; Integral equations; Marsaglia's rectangle
                 wedge tail method; Numerical methods; Random number
                 generation; Stochastic area integrals; Stochastic
                 differential equations; Two dimensional Brownian path",
}

@Article{Gemmell:1994:TBE,
  author =       "Peter Gemmell and Mor Harchol",
  title =        "Tight bounds on expected time to add correctly and add
                 mostly correctly",
  journal =      j-INFO-PROC-LETT,
  volume =       "49",
  number =       "2",
  pages =        "77--83",
  day =          "28",
  month =        jan,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "721.2; 721.3; 723.1; 731.1; C4240 (Programming and
                 algorithm theory); C5120 (Logic and switching
                 circuits)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., California-Berkeley Univ., CA,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "adder; Adders; adders; Addition; algorithm theory;
                 Algorithms; AND; Binary sequences; Computer simulation;
                 fan-in two; Fast adder; Logic gates; Near adder; NOT
                 gates; Optimal control systems; OR; Random processes;
                 Running time; Two n-bit numbers; worst-case adder",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Gray:1994:QGB,
  author =       "Jim Gray and Prakash Sundaresan and Susanne Englert
                 and Ken Baclawski and Peter J. Weinberger",
  title =        "Quickly generating billion-record synthetic
                 databases",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "243--252",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/191839/p243-gray/",
  abstract =     "Evaluating database system performance often requires
                 generating synthetic databases--ones having certain
                 statistical properties but filled with dummy
                 information. When evaluating different database
                 designs, it is often necessary to generate several
                 databases and evaluate each design. As database sizes
                 grow to terabytes, generation often takes longer than
                 evaluation. This paper presents several database
                 generation techniques. In particular it discusses: (1)
                 Parallelism to get generation speedup and scaleup. (2)
                 Congruential generators to get dense unique uniform
                 distributions. (3) Special-case discrete logarithms to
                 generate indices concurrent to the base table
                 generation. (4) Modification of (2) to get exponential,
                 normal, and self-similar distributions. \par

                 The discussion is in terms of generating billion-record
                 SQL databases using C programs running on a
                 shared-nothing computer system consisting of a hundred
                 processors, with a thousand discs. The ideas apply to
                 smaller databases, but large databases present the more
                 difficult problems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Physical Design (H.2.2);
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1); Mathematics of Computing --- Numerical
                 Analysis --- General (G.1.0): {\bf Parallel
                 algorithms}; Data --- Data Structures (E.1): {\bf
                 Trees}",
}

@Article{Gupta:1994:RSD,
  author =       "Rajiv Gupta and Scott A. Smolka and Shaji Bhaskar",
  title =        "On Randomization in Sequential and Distributed
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "1",
  pages =        "7--86",
  month =        mar,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/174666.174667",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/174667.html",
  abstract =     "Probabilistic, or randomized, algorithms are fast
                 becoming as commonplace as conventional deterministic
                 algorithms. This survey presents five techniques that
                 have been widely used in the design of randomized
                 algorithms. These techniques are illustrated using 12
                 randomized algorithms---both sequential and
                 distributed--- that span a wide range of applications,
                 including:{\em primality testing} (a classical problem
                 in number theory), {\em interactive probabilistic proof
                 systems} (a new method of program testing), {\em dining
                 philosophers} (a classical problem in distributed
                 computing), and {\em Byzantine agreement} (reaching
                 agreement in the presence of malicious processors).
                 Included with each algorithm is a discussion of its
                 correctness and its computational complexity. Several
                 related topics of interest are also addressed,
                 including the theory of probabilistic automata,
                 probabilistic analysis of conventional algorithms,
                 deterministic amplification, and derandomization of
                 randomized algorithms. Finally, a comprehensive
                 annotated bibliography is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms; Byzantine
                 agreement; computational complexity; CSP; dining
                 philosophers problem; distributed algorithms; graph
                 isomorphism; hashing; interactive probabilistic proof
                 systems; leader election; message routing;
                 nearest-neighbors problem; perfect hashing; primality
                 testing; probabilistic techniques; randomized or
                 probabilistic algorithms; randomized quicksort;
                 sequential algorithms; transitive tournaments;
                 universal hashing",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf F.1.2}: Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Modes of Computation,
                 Probabilistic computation. {\bf D.1.0}: Software,
                 PROGRAMMING TECHNIQUES, General.",
}

@Article{Hamilton:1994:PNG,
  author =       "Kenneth G. Hamilton",
  title =        "Pseudorandom number generators for {Salford FTN77}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "81",
  number =       "1--2",
  pages =        "237--247",
  month =        jun,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90122-8",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465594901228",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Hartel:1994:CRN,
  author =       "F. H{\"a}rtel",
  editor =       "????",
  booktitle =    "International Workshop on Mathematical Methods and
                 Tools in Computer Simulation",
  title =        "On combined random number generators",
  publisher =    "V. I. Smirnov Scientific Research Institute of
                 Mathematics and Mechanics",
  address =      "????",
  pages =        "7--8",
  year =         "1994",
  bibdate =      "Fri Jan 6 11:09:12 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hellekalek:1994:GDEa,
  author =       "Peter Hellekalek",
  title =        "General Discrepancy Estimates: the {Walsh} Function
                 System",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "67",
  number =       "3",
  pages =        "209--218",
  year =         "1994",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Sat Mar 3 09:42:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://matwbn.icm.edu.pl/ksiazki/aa/aa67/aa6732.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Hellekalek:1994:GDEb,
  author =       "P. Hellekalek",
  title =        "General Discrepancy Estimates {II}: The {Haar}
                 Function System",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "67",
  number =       "4",
  pages =        "313--322",
  year =         "1994",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Sat Mar 3 09:43:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://matwbn.icm.edu.pl/ksiazki/aa/aa67/aa6742.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Hennecke:1994:RER,
  author =       "Michael Hennecke",
  title =        "{RANEXP}: experimental random number generator
                 package",
  journal =      j-COMP-PHYS-COMM,
  volume =       "79",
  number =       "2",
  pages =        "261--267",
  month =        apr,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90072-8",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465594900728",
  abstract =     "A library containing highly portable implementations
                 of most algorithms for (pseudo) random number
                 generation has been developed, which might be used in
                 any area of simulation which requires random number
                 generators. Each generator is freely configurable by
                 the user, so the RANEXP library is particularly
                 well-suited for applications requiring different random
                 number generators. The algorithms are implemented in C,
                 but are callable from Fortran application program
                 also.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hildebrand:1994:RWS,
  author =       "Martin Hildebrand",
  title =        "Random walks supported on random points of {$ Z / n Z
                 $}",
  journal =      j-PROBAB-THEORY-RELAT-FIELDS,
  volume =       "100",
  number =       "2",
  pages =        "191--203",
  month =        "????",
  year =         "1994",
  CODEN =        "PTRFEU",
  DOI =          "https://doi.org/10.1007/BF01199265",
  ISSN =         "0178-8051 (print), 1432-2064 (electronic)",
  ISSN-L =       "0178-8051",
  bibdate =      "Sun Apr 27 11:18:42 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probab-theory-relat-fields.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01199265",
  acknowledgement = ack-nhfb,
  fjournal =     "Probability Theory and Related Fields",
  journal-URL =  "http://link.springer.com/journal/440",
}

@InProceedings{Hill:1994:CMR,
  author =       "R. R. Hill and C. H. Reilly",
  title =        "Composition for Multivariate Random Variables",
  crossref =     "Tew:1994:WSC",
  pages =        "332--339",
  year =         "1994",
  bibdate =      "Thu Jan 05 17:44:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Holian:1994:PNG,
  author =       "Brad Lee Holian and Ora E. Percus and Tony T. Warnock
                 and Paula A. Whitlock",
  title =        "Pseudorandom number generator for massively parallel
                 molecular-dynamics simulations",
  journal =      j-PHYS-REV-E,
  volume =       "50",
  number =       "2",
  pages =        "1607--1615",
  month =        aug,
  year =         "1994",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.50.1607",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Dec 29 09:46:12 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.50.1607",
  abstract =     "A class of uniform pseudorandom number generators is
                 proposed for modeling and simulations on massively
                 parallel computers. The algorithm is simple,
                 nonrecursive, and is easily transported to serial or
                 vector computers. We have tested the procedure for
                 uniformity, independence, and correlations by several
                 methods. Related, less complex sequences passed some of
                 these tests well enough; however, inadequacies were
                 revealed by tests for correlations and in an
                 interesting application, namely, annealing from an
                 initial lattice that is mechanically unstable. In the
                 latter case, initial velocities chosen by a random
                 number generator that is not sufficiently random lead
                 quickly to unphysical regularity in grain structure.
                 The new class of generators passes this dynamical
                 diagnostic for unwanted correlations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  keywords =     "nested Weyl sequence (NWS) generator; shuffled nested
                 Weyl sequence (SNWS) generator; Weyl sequence (WS)
                 generator",
  PACS =         "02.70.-c; 03.20.+i; 05.40.+j; 64.70.Dv",
  pagecount =    "8",
  remark =       "The SNWS generator is implemented by this short
                 pseudocode: \\
                 mult = 1234567 \\
                 seed = mod (sqrt (2.0), 1.0) \\
                 do n = 1, number \\
                 x(n) = mod(n * mod(n * seed, 1.0), 1.0) * mult + 0.5
                 \\
                 x(n) = mod(x(n) * mod(x(n) * seed, 1.0), 1.0) \\
                 end do \\
                 An implementation of the SNWS generator produces output
                 that passes all of the Diehard Battery Test Suite, and
                 can easily be extended for use with simultaneous
                 streams, with as many random bits per number as are
                 available in the floating-point significand. Its period
                 is unknown, however, and its use of floating-point
                 arithmetic means that the same sequence cannot be
                 guaranteed across platforms with different chip
                 architectures.",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Hoogland:1994:GPR,
  author =       "Jiri Hoogland and Ronald Kleiss",
  title =        "Generation of pseudo-random variates with fixed sum
                 and product",
  journal =      j-COMP-PHYS-COMM,
  volume =       "79",
  number =       "2",
  pages =        "179--189",
  month =        apr,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90066-3",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 21:29:43 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465594900663",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hormann:1994:NQR,
  author =       "Wolfgang H{\"o}rmann",
  title =        "A note on the quality of random variates generated by
                 the ratio of uniforms method",
  journal =      j-TOMACS,
  volume =       "4",
  number =       "1",
  pages =        "96--106",
  month =        jan,
  year =         "1994",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Hormann:1994:TRM,
  author =       "Wolfgang H{\"o}rmann and Gerhard Derflinger",
  title =        "The Transformed Rejection Method for Generating Random
                 Variables, an Alternative to the Ratio-of-Uniforms
                 Method",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "23",
  number =       "3",
  pages =        "847--860",
  month =        "????",
  year =         "1994",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919408813203",
  ISSN =         "0361-0918",
  bibdate =      "Sat Mar 3 09:47:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Article{Hormann:1994:UGD,
  author =       "W. H{\"o}rmann",
  title =        "A universal generator for discrete log-concave
                 distributions",
  journal =      j-COMPUTING,
  volume =       "52",
  number =       "1",
  pages =        "89--96",
  month =        mar,
  year =         "1994",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "94j:65014",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  classification = "921.4; 921.6; 922.1",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Algorithms; Discrete log concave distributions;
                 Geometric distribution; Geometry; Mathematical models;
                 Probability; Random number generation; Rejection
                 method",
}

@Article{Huber:1994:PLG,
  author =       "K. Huber",
  title =        "On the period length of generalized inversive
                 pseudorandom number generators",
  journal =      j-APPL-ALGEBRA-ENG-COMMUN-COMPUT,
  volume =       "5",
  number =       "??",
  pages =        "255--260",
  month =        "????",
  year =         "1994",
  CODEN =        "AAECEW",
  ISSN =         "0938-1279 (print), 1432-0622 (electronic)",
  ISSN-L =       "0938-1279",
  bibdate =      "Mon Dec 26 13:23:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applicable algebra in engineering, communication and
                 computing",
}

@Article{James:1994:RFI,
  author =       "F. James",
  title =        "{RANLUX}: a {Fortran} implementation of the
                 high-quality pseudorandom number generator of
                 {L{\"u}scher}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "79",
  number =       "1",
  pages =        "111--114",
  month =        feb,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90233-X",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu May 20 19:08:40 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{James:1996:ERF}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559490233X",
  abstract =     "Following some remarks on the quality of pseudorandom
                 number generators commonly used in Monte Carlo
                 calculations in computational physics, we offer a
                 portable Fortran 77 implementation of a high-quality
                 generator called RANLUX (for LUXury RANdom numbers),
                 using the algorithm of Martin L{\"u}scher described in
                 an accompanying article \cite{Luscher:1994:PHQ}. The
                 implementation allows the user to select different
                 quality or luxury levels, where higher quality requires
                 somewhat longer computing time for the generation.
                 There is a convenient way of initialization
                 (appropriate also for massively parallel Monte Carlo
                 computations) as well as two different methods of
                 restarting from a break point.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Jimbo:1994:RBB,
  author =       "Shuji Jimbo and Akira Maruoka",
  title =        "On the relationship between $ \epsilon $-biased random
                 variables and $ \epsilon $-dependent random variables",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "1",
  pages =        "17--23",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "60E05 (60G99)",
  MRnumber =     "95c:60016",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tohoku Univ",
  affiliationaddress = "Sendai, Jpn",
  classification = "723.1; 921.1; 922.1; C4240 (Programming and
                 algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Inf. Eng., Tohoku Univ., Sendai, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "algorithm theory; Algorithms; Distribution; Epsilon
                 biased random variables; Epsilon dependent random
                 variables; in-biased random variables; in-dependent
                 random variables; Independence; independent random
                 variables; Linear algebra; Mathematical models; maximum
                 norm; Parameter estimation; Probability; Random
                 processes; randomized algorithms; Randomized
                 algorithms; randomness; Sample space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jimbo:1994:RBD,
  author =       "Shuji Jimbo and Akira Maruoka",
  title =        "On the relationship between the diameter and the size
                 of a boundary of a directed graph",
  journal =      j-INFO-PROC-LETT,
  volume =       "50",
  number =       "5",
  pages =        "277--282",
  day =          "10",
  month =        jun,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (68R10)",
  MRnumber =     "95i:05066",
  MRreviewer =   "{\'A}kos Seress",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tohoku Univ",
  affiliationaddress = "Sendai, Jpn",
  classification = "721; 722; 723; 921; B0250 (Combinatorial
                 mathematics); C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Inf. Eng., Tohoku Univ., Sendai, Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Boundaries; Boundary value problems; Combinatorial
                 mathematics; computational complexity; Computer
                 networks; directed graph; directed graphs; Expanding
                 graphs; expanding graphs; Graph theory; Linear algebra;
                 Linear functions; one-dimensional linear functions;
                 random numbers; sorting; sorting networks",
  treatment =    "T Theoretical or Mathematical",
}

@Book{Johnson:1994:CUD,
  author =       "Norman Lloyd Johnson and Samuel Kotz and N.
                 Balakrishnan",
  title =        "Continuous univariate distributions",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xix + 756 (vol. 1), xix + 719 (vol. 2)",
  year =         "1994",
  ISBN =         "0-471-58495-9 (vol. 1), 0-471-58494-0 (vol. 2)",
  ISBN-13 =      "978-0-471-58495-7 (vol. 1), 978-0-471-58494-0 (vol.
                 2)",
  LCCN =         "QA273.6 .J6 1994",
  bibdate =      "Thu Mar 1 09:37:58 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Wiley series in probability and mathematical
                 statistics",
  URL =          "http://www.loc.gov/catdir/toc/onix03/93045348.html",
  ZMnumber =     "Zbl 0821.62001",
  acknowledgement = ack-nhfb,
  subject =      "Distribution (Probability theory)",
}

@Article{Kaigh:1994:SRS,
  author =       "W. D. Kaigh and E. F. Schuster",
  title =        "{SRS} runs and spacings tests to assess randomness",
  journal =      "American Statistical Association Proceedings of the
                 Statistical Computing Section",
  volume =       "??",
  number =       "??",
  bookpages =    "vi + 299",
  pages =        "272--277",
  month =        "????",
  year =         "1994",
  ISBN =         "1-883276-06-3",
  ISBN-13 =      "978-1-883276-06-5",
  ISSN =         "1543-3218",
  bibdate =      "Sat Mar 03 09:50:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kanatani:1994:SAG,
  author =       "Kenichi Kanatani",
  title =        "Statistical Analysis of Geometric Computation",
  journal =      j-CVGIP-IU,
  volume =       "59",
  number =       "3",
  pages =        "286--306",
  month =        may,
  year =         "1994",
  CODEN =        "CIUNEJ",
  DOI =          "https://doi.org/10.1006/ciun.1994.1020;
                 https://doi.org/10.1006/cviu.1994.1024",
  ISSN =         "1049-9660 (print), 1557-7635 (electronic)",
  ISSN-L =       "1049-9660",
  bibdate =      "Wed Mar 8 08:53:00 MST 2000",
  bibsource =    "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=ciun;
                 http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=cviu;
                 https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.idealibrary.com/links/artid/ciun.1994.1020/production;
                 http://www.idealibrary.com/links/artid/ciun.1994.1020/production/pdf;
                 http://www.idealibrary.com/links/artid/cviu.1994.1024/production;
                 http://www.idealibrary.com/links/artid/cviu.1994.1024/production/pdf",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Gunma Univ., Japan",
  classification = "C1140Z (Other and miscellaneous); C4140 (Linear
                 algebra); C4260 (Computational geometry); C5260B
                 (Computer vision and picture processing)",
  fjournal =     "Computer Vision, Graphics, and Image Processing. Image
                 Understanding",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10499660",
  keywords =     "Covariance matrix; Errors; Geometric computation;
                 Least-squares optimization; Line fitting; N-vector;
                 Noise; Noise characteristics; Optimal estimate; Optimal
                 weights; Random number simulations; Renormalization;
                 Statistical analysis; Statistical behavior; Statistical
                 biases; Statistical model; Vanishing points",
  thesaurus =    "Computational geometry; Computer vision; Matrix
                 algebra; Statistical analysis",
}

@Article{Kari:1994:GNS,
  author =       "H. H. Kari and J. Salinas and F. Lombardi",
  title =        "Generating non-standard random distributions for
                 discrete event simulation systems",
  journal =      j-SIM-PRACT-THEORY,
  volume =       "1",
  number =       "4",
  pages =        "173--193",
  day =          "15",
  month =        mar,
  year =         "1994",
  CODEN =        "SPTHEH",
  DOI =          "https://doi.org/10.1016/0928-4869(94)90005-1",
  ISSN =         "0928-4869 (print), 1879-1433 (electronic)",
  ISSN-L =       "0928-4869",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0928486994900051",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation Practice and Theory",
}

@Article{Karian:1994:RNG,
  author =       "Zaven A. Karian and Rohit Goyal",
  title =        "Random Number Generation and Testing",
  journal =      j-MAPLE-TECH-NEWS,
  volume =       "1",
  number =       "1",
  pages =        "32--37",
  month =        "Spring",
  year =         "1994",
  CODEN =        "????",
  ISSN =         "1061-5733",
  bibdate =      "Fri May 09 22:33:19 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This article describes the Maple-language
                 random-number generator, a multiplicative congruential
                 generator (xnew = (A x + C) mod P) with $ A = 427, 419,
                 669, 081 $, $ C = 0 $, $ P = 10^{12} - 11 $, and
                 initial seed 1. It was used up to Maple Version 9
                 (2003). Later versions of Maple instead use the
                 Mersenne Twister.",
  URL =          "http://www.can.nl/Systems_and_Packages/Per_Purpose/General/Maple/mtn/mtnv1n1.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Maple technical newsletter",
  remark =       "In Maple source code: mrinit:= proc() global A, C, P,
                 SEED: A:= 427419669081: C:= 0: P:= 10**12 - 11: SEED:=
                 1 end proc: mr:= proc() local x: global A, C, P, SEED:
                 x:= (A * SEED + C) mod P: SEED:= x: return x end proc:
                 Successive calls to mr() and the built-in rand()
                 produce identical output.",
}

@InProceedings{Karloff:1994:CWI,
  author =       "Howard Karloff and Yishay Mansour",
  title =        "On construction of $k$-wise independent random
                 variables",
  crossref =     "ACM:1994:PTS",
  pages =        "564--573",
  year =         "1994",
  bibdate =      "Wed Feb 20 18:34:01 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/195058/p564-karloff/p564-karloff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/195058/p564-karloff/",
  acknowledgement = ack-nhfb,
}

@Article{Kenney:1994:HTI,
  author =       "C. S. Kenney and A. J. Lamb",
  title =        "A hyperbolic tangent identity and the geometry of
                 {Pad{\'e}} sign function iterations",
  journal =      j-NUMER-ALGORITHMS,
  volume =       "7",
  number =       "2--4",
  pages =        "111--128",
  month =        jul,
  year =         "1994",
  CODEN =        "NUALEG",
  ISSN =         "1017-1398 (print), 1572-9265 (electronic)",
  ISSN-L =       "1017-1398",
  MRclass =      "65D15 (65C20 93B40)",
  MRnumber =     "1 283 092",
  bibdate =      "Fri Nov 6 18:06:29 MST 1998",
  bibsource =    "http://www.math.psu.edu/dna/contents/na.html;
                 https://www.math.utah.edu/pub/tex/bib/numeralgorithms.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0290F
                 (Interpolation and function approximation); B0290H
                 (Linear algebra); C1160 (Combinatorial mathematics);
                 C4130 (Interpolation and function approximation); C4140
                 (Linear algebra)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "Numerical Algorithms",
  journal-URL =  "http://link.springer.com/journal/11075",
  keywords =     "approximation theory; Cayley transform; chaotic
                 iteration; completely regular iteration; convergence of
                 numerical methods; geometry; global convergence;
                 hyperbolic tangent identity; iterative methods; matrix
                 algebra; multiplicative linear congruential random
                 number generator; Pade iterations; Pade sign function
                 iterations; random number generation; rational
                 iterations; semi-group property",
  pubcountry =   "Switzerland",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "C. S. Kenney and A. J. Laub",
}

@Book{Kreyszig:1994:MCM,
  author =       "E. Kreyszig and E. J. Normington",
  title =        "{Maple} Computer Manual for Seventh Edition Advanced
                 Engineering Mathematics: {Erwin Kreyszig}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 506",
  year =         "1994",
  ISBN =         "0-471-31126-X",
  ISBN-13 =      "978-0-471-31126-3",
  LCCN =         "QA401 K74 1993",
  bibdate =      "Thu Jul 7 07:55:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "There is a companion {\em Instructor's Maple Manual},
                 but I have not yet found an exact citation for it.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 General Commands / 3 \\
                 1 First Order Differential Equations / 10 \\
                 Ex. 1.1 Radioactivity, exponential decay / 12 \\
                 Ex. 1.2 Separation of variables. Plot of several curves
                 / 14 \\
                 Ex. 1.3 Checking solutions. Two ways of writing
                 derivatives / 15 \\
                 Ex. 1.4 Flow through an outlet. Torricelli's law / 16
                 \\
                 Ex. 1.5 Mixing problem / 16 \\
                 Ex. 1.6 Exact differential equation / 18 \\
                 Ex. 1.7 Integrating factors / 18 \\
                 Ex. 1.8 Linear differential equations / 19 \\
                 Ex. 1.9 Bernoulli equation. Verhulst equation / 20 \\
                 Ex. 1.10 RC-circuit / 21 \\
                 Ex. 1.11 RL-circuit. TRIGONOMETRIC TRICK / 22 \\
                 Ex. 1.12 Orthogonal trajectories / 23 \\
                 Ex. 1.13 Plotting trajectories by the command seq / 24
                 \\
                 Ex. 1.14 Direction field / 25 \\
                 Ex. 1.15 Picard iteration / 26 \\
                 Problems for Chapter 1 / 28 \\
                 2 Second Order Differential Equations / 34 \\
                 Ex. 2.1 General solution. Initial value problem / 35
                 \\
                 Ex. 2.2 Double root (cf. Sec. 2.2) / 35 \\
                 Ex. 2.3 Complex roots of the characteristic equation /
                 37 \\
                 Ex. 2.4 Boundary value problem / 38 \\
                 Ex. 2.5 Undamped free vibrations / 38 \\
                 Ex. 2.6 Overdamped free motions / 40 \\
                 Ex. 2.7 Critically damped free motion / 41 \\
                 Ex. 2.8 Underdamped oscillations / 42 \\
                 Ex. 2.9 Euler--Cauchy equation / 43 \\
                 Ex. 2.10 Wronskian / 44 \\
                 Ex. 2.11 Reduction of order / 45 \\
                 Ex. 2.12 Nonhomogeneous differential equation / 45 \\
                 Ex. 2.13 Solution by undetermined coefficients / 47 \\
                 Ex. 2.14 Variation of parameters / 48 \\
                 Ex. 2.15 Resonance in an undamped vibrating system / 49
                 \\
                 Ex. 2.16 Forced undamped oscillations. Beats. / 50 \\
                 Ex. 2.17 Forced damped oscillations in Sec. 2.11 / 51
                 \\
                 Ex. 2.18 RLC-circuit / 52 \\
                 Problems for Chapter 2 / 54 \\
                 3 Higher Order Linear Differential Equations / 57 \\
                 Ex. 3.1 Basis of solutions. Wronskian / 58 \\
                 Ex. 3.2 Initial value problem / 59 \\
                 Ex. 3.3 Verification of solutions / 60 \\
                 Ex. 3.4 Differential equation for a given basis / 60
                 \\
                 Ex. 3.5 Method of undetermined coefficients / 61 \\
                 Ex. 3.6 Initial value problems for nonhomogeneous
                 equations / 62 \\
                 Ex. 3.7 Variation of parameters / 62 \\
                 Problems for Chapter 3 / 65 \\
                 4 Systems of Differential Equations Phase Plane,
                 Stability / 67 \\
                 Ex. 4.1 Improper node / 70 \\
                 Ex. 4.2 Improper node. Use of matrices / 71 \\
                 Ex. 4.3 Direction field of vectors in the phase plane /
                 73 \\
                 Ex. 4.4 Saddle point / 74 \\
                 Ex. 4.5 Center / 75 \\
                 Ex. 4.6 Spiral point / 76 \\
                 Ex. 4.7 System without basis of eigenvectors / 78 \\
                 Ex. 4.8 Pendulum equation (Sec. 4.5) / 79 \\
                 Ex. 4.9 Van der Pol equation. Limit cycle (Sec. 4.5) /
                 81 \\
                 Ex. 4.10 Nonhomogeneous system / 82 \\
                 Ex. 4.11 Method of undetermined coefficients / 83 \\
                 Ex. 4.12 Variation of parameters / 84 \\
                 Ex. 4.13 Diagonalization of systems of differential
                 equations / 85 \\
                 Problems for Chapter 4 / 88 \\
                 5 Series Solutions of Differential Equations. Special
                 Functions / 92 \\
                 Ex. 5.1 Series solution. Plot from it / 94 \\
                 Ex. 5.2 Legendre polynomials. The orthopoly package /
                 95 \\
                 Ex. 5.3 Legendre polynomials. Simplification of results
                 / 97 \\
                 Ex. 5.4 Legendre polynomials from boundary value
                 problems / 98 \\
                 Ex. 5.5 Coefficient recursion for series solution / 98
                 \\
                 Ex. 5.6 Coefficient recursion for the Legendre equation
                 / 100 \\
                 Ex. 5.7 Frobenius method / 100 \\
                 Ex. 5.8 Bessel functions / 101 \\
                 Ex. 5.9 Bessel functions of the second kind / 103 \\
                 Ex. 5.10 Orthogonal expansions. Fourier--Legendre
                 series / 104 \\
                 Problems for Chapter 5 / 106 \\
                 6 Laplace Transforms / 108 \\
                 Ex. 6.1 Beginnings / 109 \\
                 Ex. 6.2 Inverse Laplace transform / 110 \\
                 Ex. 6.3 Differentiation and integration of functions /
                 111 \\
                 Ex. 6.4 Differential equation / 111 \\
                 Ex. 6.5 Initial value problem for a nonhomogeneous
                 equation / 112 \\
                 Ex. 6.6 Unit step function. Dirac's delta function /
                 113 \\
                 Ex. 6.7 Discontinuous periodic driving force / 115 \\
                 Ex. 6.8 General formulas / 116 \\
                 Ex. 6.9 Forced oscillations. Resonance / 117 \\
                 Ex. 6.10 System of differential equations. Spacecurve /
                 118 \\
                 Problems for Chapter 6 / 121 \\
                 7 Linear Algebra, Vector Calculus / 125 \\
                 Ex. 7.1 Matrices and vectors: Addition and
                 multiplication / 129 \\
                 Ex. 7.2 Further operations on matrices / 131 \\
                 Ex. 7.3 Special matrices / 133 \\
                 Ex. 7.4 Solution of a linear system / 134 \\
                 Ex. 7.5 Gauss elimination, further cases / 135 \\
                 Ex. 7.6 Determinants / 135 \\
                 Ex. 7.7 Inverse of a matrix / 136 \\
                 Ex. 7.8 Rank of a matrix / 137 \\
                 Ex. 7.9 Linear independence and dependence / 138 \\
                 Ex. 7.10 Eigenvalues, eigenvectors / 139 \\
                 Ex. 7.11 Complex eigenvalues / 140 \\
                 Ex. 7.12 Orthogonal transformations / 141 \\
                 Ex. 7.13 Complex matrices / 142 \\
                 Ex. 7.14 Diagonalization of a matrix / 143 \\
                 Ex. 7.15 Similar matrices / 144 \\
                 Problems for Chapter 7 / 146 \\
                 8 Vector Differential Calculus. Grad, Div, Curl / 149
                 \\
                 Ex. 8.1 Vector with given endpoints. Length / 151 \\
                 Ex. 8.2 Vector addition. Scalar multiplication / 152
                 \\
                 Ex. 8.3 Inner product (dot product) / 152 \\
                 Ex. 8.4 Vector product (cross product) / 154 \\
                 Ex. 8.5 Differentiation of vectors. Tangent. Spaceplots
                 / 155 \\
                 Ex. 8.6 Arc length, curvature, torsion of a curve / 156
                 \\
                 Ex. 8.7 Gradient, directional derivative / 157 \\
                 Ex. 8.8 Gradient as surface normal vector. Vector
                 substitution / 158 \\
                 Ex. 8.9 Potential of a vector field / 159 \\
                 Ex. 8.10 Divergence. Laplacian / 159 \\
                 Ex. 8.11 Curl / 160 \\
                 Problems for Chapter 8 / 162 \\
                 9 Vector Integral Calculus. Integral Theorems / 167 \\
                 Ex. 9.1 Line integral in the plane / 167 \\
                 Ex. 9.2 Line integral in space / 168 \\
                 Ex. 9.3 Dependence of integrals on path / 169 \\
                 Ex. 9.4 Line integral of the form (7), p. 505 / 169 \\
                 Ex. 9.5 Independence of path / 170 \\
                 Ex. 9.6 Path independence; Use of potential / 170 \\
                 Ex. 9.7 Exactness and independence of path / 171 \\
                 Ex. 9.8 Double integrals / 171 \\
                 Ex. 9.9 Green's theorem in the plane / 172 \\
                 Ex. 9.10 Surface plot. Normal vector / 172 \\
                 Ex. 9.11 Surface integral (flux) / 174 \\
                 Ex. 9.12 Triple integral / 174 \\
                 Ex. 9.13 Gauss's divergence theorem / 174 \\
                 Ex. 9.14 Verification of the divergence theorem / 175
                 \\
                 Ex. 9.15 Stokes's theorem / 176 \\
                 Problems for Chapter 9 / 178 \\
                 10 Fourier Series, Integrals, and Transforms / 181 \\
                 Ex. 10.1 Periodic square wave / 181 \\
                 Ex. 10.2 Piecewise linear function / 183 \\
                 Ex. 10.3 Series with cosine and sine terms / 184 \\
                 Ex. 10.4 Period different from 2?r / 184 \\
                 Ex. 10.5 Saw tooth waves. Gibbs phenomenon / 185 \\
                 Ex. 10.6 Even and odd functions / 186 \\
                 Ex. 10.7 Half-range expansions / 186 \\
                 Ex. 10.8 Rectifier / 187 \\
                 Ex. 10.9 Forced oscillations / 189 \\
                 Ex. 10.10 Square error / 191 \\
                 Ex. 10.11 Fourier integral / 191 \\
                 Ex. 10.12 Fourier transform / 192 \\
                 Problems for Chapter 10 / 193 \\
                 11 Partial Differential Equations / 198 \\
                 Ex. 11.1 Basic equations in this chapter / 198 \\
                 Ex. 11.2 Plot of level curves / 199 \\
                 Ex. 11.3 Surface plots of solutions / 200 \\
                 Ex. 11.4 Separation of variables / 200 \\
                 Ex. 11.5 D'Alembert's solution / 201 \\
                 Ex. 11.6 Vibrating beam / 202 \\
                 Ex. 11.7 Heat equation / 203 \\
                 Ex. 11.8 Heat flow: Adiabatic ends / 204 \\
                 Ex. 11.9 Two-dimensional heat flow / 204 \\
                 Ex. 11.10 Error function / 206 \\
                 Ex. 11.11 Rectangular membrane / 208 \\
                 Ex. 11.12 Square Membrane / 209 \\
                 Problems for Chapter 11 / 211 \\
                 12 Complex Numbers Complex Analytic Functions / 215 \\
                 Ex. 12.1 Complex numbers / 217 \\
                 Ex. 12.2 Polar form / 218 \\
                 Ex. 12.3 Plotting complex numbers / 219 \\
                 Ex. 12.4 Absolute value of a quotient / 221 \\
                 Ex. 12.5 De Moivre's formula / 221 \\
                 Ex. 12.6 Quadratic and cubic equations. Roots of
                 complex numbers / 222 \\
                 Ex. 12.7 Roots of unity and their plots / 222 \\
                 Ex. 12.8 Unit circle, annulus / 224 \\
                 Ex. 12.9 Circles. Completing squares / 224 \\
                 Ex. 12.10 Inequalities / 225 \\
                 Ex. 12.11 Function, derivative, surface plot / 225 \\
                 Ex. 12.12 Cauchy--Riemann equations / 227 \\
                 Ex. 12.13 Harmonic functions / 227 \\
                 Ex. 12.14 Exponential, trigonometric and hyperbolic
                 functions / 228 \\
                 Ex. 12.15 Complex logarithm In* (cf. Sec. 12.8) / 229
                 \\
                 Problems for Chapter 12 / 232 \\
                 13 Complex Integration / 236 \\
                 Ex. 13.1 Integration by using a formula for the path /
                 236 \\
                 Ex. 13.2 A most important integral (Sec. 13.2) / 237
                 \\
                 Ex. 13.3 Path consisting of two parts. Path dependence
                 / 238 \\
                 Ex. 13.4 Indefinite integration (Sec. 13.2) / 238 \\
                 Ex. 13.5 Linearity of integration / 239 \\
                 Ex. 13.6 WARNING: Contour integrals / 239 \\
                 Ex. 13.7 Partial fractions in integration / 240 \\
                 Ex. 13.8 Contour integral of integer powers / 241 \\
                 Ex. 13.9 Integration by Cauchy's integral formula / 241
                 \\
                 Ex. 13.10 Integration by derivative formulas (Sec.
                 13.6) / 242 \\
                 Problems for Chapter 13 / 243 \\
                 14 Power Series, Taylor Series, Laurent Series / 245
                 \\
                 Ex. 14.1 Complex sequences and their plots / 246 \\
                 Ex. 14.2 Ratio test for complex series / 248 \\
                 Ex. 14.3 Radius of convergence. Cauchy--Hadamard
                 formula / 249 \\
                 Ex. 14.4 Taylor series / 250 \\
                 Ex. 14.5 Differentiation and integration of Taylor
                 series / 251 \\
                 Ex. 14.6 Generating function / 252 \\
                 Ex. 14.7 Use of complex series for computing function
                 values / 254 \\
                 Ex. 14.8 Uniform convergence / 254 \\
                 Ex. 14.9 Laurent series / 255 \\
                 Ex. 14.10 Laurent series by partial fractions / 255 \\
                 Ex. 14.11 Zeros / 257 \\
                 Ex. 14.12 Singularities / 258 \\
                 Ex. 14.13 Analytic at infinity / 258 \\
                 Problems for Chapter 14 / 260 \\
                 15 Residue Integration Method / 262 \\
                 Ex. 15.1 Residue integration / 262 \\
                 Ex. 15.2 Location of singularities. Residues / 263 \\
                 Ex. 15.3 Higher order pole. Partial fractions / 264 \\
                 Ex. 15.4 Essential singularity / 264 \\
                 Ex. 15.5 Integration by the residue theorem / 265 \\
                 Ex. 15.6 The command residue / 266 \\
                 Ex. 15.7 Real integrals / 266 \\
                 Ex. 15.8 Complex transformation of real integrals / 267
                 \\
                 Ex. 15.9 Caution with improper real integrals on the
                 computer! / 268 \\
                 Ex. 15.10 Fourier integrals, Sec. 15.4 / 269 \\
                 Ex. 15.11 Cauchy principal value / 270 \\
                 Problems for Chapter 15 / 271 \\
                 16 Conformal Mapping / 273 \\
                 Ex. 16.1 Plotting images of straight lines under w = z2
                 / 273 \\
                 Conformal mapping / 274 \\
                 Mapping w = l/z / 276 \\
                 Mapping of the unit disk onto the unit disk / 277 \\
                 Linear fractional transformation / 278 \\
                 Linear fractional transformation for given points / 278
                 \\
                 Mapping w = l/z / 279 \\
                 Inverse linear fractional transformation / 280 \\
                 Mappings of half-planes onto half-planes / 280 \\
                 Ex. 16.10 Images of several rectangles on common axes /
                 281 \\
                 Ex. 16.11 Joukowski airfoil (Sec. 16.5) / 282 \\
                 Problems for Chapter 16 / 283 \\
                 17 Complex Analysis Applied to Potential Theory / 291
                 \\
                 Ex. 17.1 Finding and plotting equipotential lines / 291
                 \\
                 Ex. 17.2 Plotting equipotential lines and lines of
                 forces. / 293 \\
                 Ex. 17.3 Equipotential lines / 293 \\
                 Ex. 17.4 Equipotential surfaces of In z / 294 \\
                 Ex. 17.5 Noncoaxial cylinders (p. 891) / 295 \\
                 Ex. 17.6 Flow around a cylinder / 296 \\
                 Ex. 17.7 Increase of the density of streamlines / 298
                 \\
                 Ex. 17.8 Plotting equipotential lines by f i e l d p l
                 o t / 298 \\
                 Ex. 17.9 Series representation of potential (Sec. 17.5)
                 / 300 \\
                 Ex. 17.10 Mean value theorem for analytic functions /
                 301 \\
                 Problems for Chapter 17 / 302 \\
                 18 Numerical Methods in General / 305 \\
                 Ex. 18.1 Numerical Errors - Quadratic Equation / 306
                 \\
                 Ex. 18.2 Fixed-point iteration / 307 \\
                 Ex. 18.3 Fixed point iteration / 308 \\
                 Ex. 18.4 Fixed-point iteration (Sec. 18.2) / 309 \\
                 Ex. 18.5 Newton's method. Square root / 310 \\
                 Ex. 18.6 Iteration for a transcendental equation / 311
                 \\
                 Ex. 18.7 Newton's method / 311 \\
                 Ex. 18.8 Secant method / 313 \\
                 Ex. 18.9 Bisection method (AEM, p. 935) / 313 \\
                 Ex. 18.10 Lagrange interpolation (Sec. 18.3) / 314 \\
                 Ex. 18.11 Newton's divided difference interpolation /
                 316 \\
                 Ex. 18.12 Newton's forward difference interpolation /
                 318 \\
                 Ex. 18.13 High-degree interpolation polynomials / 318
                 \\
                 Ex. 18.14 Numerical integration / 319 \\
                 Ex. 18.15 Gauss integration / 320 \\
                 Problems for Chapter 18 / 322 \\
                 Procedures / 325 \\
                 19 Numerical Methods in Linear Algebra / 327 \\
                 Ex. 19.1 Gauss elimination. Pivoting / 327 \\
                 Ex. 19.2 Details of the Gauss elimination / 329 \\
                 Ex. 19.3 Doolittle's method (p. 982) / 332 \\
                 Ex. 19.4 Doolittle LU-factorization / 334 \\
                 Ex. 19.5 Cholesky's method (p. 983) / 334 \\
                 Ex. 19.6 Gauss--Jordan elimination / 336 \\
                 Ex. 19.7 Gauss--Seidel iteration / 337 \\
                 Ex. 19.8 Matrix norms, condition numbers (Sees. 19.3,
                 19.4) / 338 \\
                 Ex. 19.9 Gauss--Seidel iteration. Test for convergence
                 / 339 \\
                 Ex. 19.10 Procedure for the Gauss--Seidel iteration /
                 340 \\
                 Ex. 19.11 Least squares / 341 \\
                 Ex. 19.12 Least squares / 342 \\
                 Ex. 19.13 Example 19.12 revisited: Normal equations /
                 343 \\
                 Ex. 19.14 Least squares: Quadratic polynomial / 344 \\
                 Ex. 19.15 Eigenvalues, eigenvectors / 346 \\
                 Ex. 19.16 Collatz's theorem for eigenvalues / 346 \\
                 Ex. 19.17 Power method for eigenvalues (Sec. 19.8) /
                 348 \\
                 Ex. 19.18 Wielandt's deflation / 350 \\
                 Ex. 19.19 Householder tridiagonalization / 350 \\
                 Ex. 19.20 QR Factorization method / 352 \\
                 Ex. 19.21 Pivoting in Gaussian Elimination / 355 \\
                 Problems for Chapter 19 / 357 \\
                 20 Numerical Methods for Differential Equations / 360
                 \\
                 Ex. 20.1 Two ways of writing a differential equation /
                 360 \\
                 Ex. 20.2 Euler method (p. 1035) / 361 \\
                 Ex. 20.3 Improved Euler method / 362 \\
                 Ex. 20.4 Runge--Kutta method / 364 \\
                 Ex. 20.5 Procedure for the Runge--Kutta method / 365
                 \\
                 Ex. 20.6 Adams--Moulton two-step method / 366 \\
                 Ex. 20.7 Adams--Moulton two-step method, with built-in
                 Runge--Kutta / 367 \\
                 Ex. 20.8 Second order differential equations, simplest
                 method / 368 \\
                 Ex. 20.9 Runge--Kutta--Nystr{\"o}m method / 370 \\
                 Ex. 20.10 Laplace equation in Example 1, p. 1059 / 372
                 \\
                 Ex. 20.11 Program for the Laplace equation. Band
                 matrices / 373 \\
                 Ex. 20.12 Laplace equation: Refinement of grids / 375
                 \\
                 Ex. 20.13 Laplace equation: Procedure / 376 \\
                 Ex. 20.14 Poisson Equation: Mixed Boundary Values / 377
                 \\
                 Ex. 20.15 Parabolic Equations: Crank--Nicolson Method /
                 378 \\
                 Problems for Chapter 20 / 380 \\
                 21 Chapter / 22 \\
                 No examples, no problems. 23 Probability Theory / 385
                 \\
                 Ex. 23.1 Stirling formula / 385 \\
                 Ex. 23.2 Sum of binomial coefficients / 386 \\
                 Ex. 23.3 Plotting distribution functions / 387 \\
                 Ex. 23.4 Plotting distribution function and density /
                 387 \\
                 Ex. 23.5 Distribution function, density, critical value
                 / 387 \\
                 Ex. 23.6 Uniform distribution / 388 \\
                 Ex. 23.7 Binomial distribution / 389 \\
                 Ex. 23.8 Binomial distribution / 389 \\
                 Ex. 23.9 Poisson distribution with a large mean / 391
                 \\
                 Ex. 23.10 Hypergeometric distribution / 391 \\
                 Ex. 23.11 Normal distribution / 391 \\
                 Problems for Chapter 23 / 394 \\
                 24 Mathematical Statistics / 396 \\
                 Ex. 24.1 Random numbers / 397 \\
                 Ex. 24.2 Random numbers. Sample means / 398 \\
                 Ex. 24.3 Frequency polygon / 400 \\
                 Ex. 24.4, Sample mean, variance, and standard deviation
                 / 400 \\
                 Ex. 24.5 Confidence interval for the mean of the normal
                 distribution with known variance / 401 \\
                 Ex. 24.6 Confidence interval for the mean of the normal
                 distribution with unknown variance, $t$-distribution /
                 402 \\
                 Ex. 24.7 Confidence interval for the variance of the
                 normal distribution / 402 \\
                 Ex. 24.8 Test for the mean / 403 \\
                 Ex. 24.9 Power function for different sample sizes. OC
                 curves / 403 \\
                 Ex. 24.10 Tests for the mean of the normal distribution
                 with known variance / 404 \\
                 Ex. 24.11 $t$-test for the mean of the normal
                 distribution with unknown variance / 405 \\
                 Ex. 24.12 Test for the variance of the normal
                 distribution / 405 \\
                 Ex. 24.13 Comparison of means by independent samples /
                 406 \\
                 Ex. 24.14 Comparison of variances of normal
                 distributions / 406 \\
                 Ex. 24.15 Acceptance sampling / 407 \\
                 Ex. 24.16 Linear regression / 408 \\
                 Ex. 24.17 Nonlinear regression / 409 \\
                 Problems for Chapter 24 / 411 \\
                 Appendix 1 References / A1 \\
                 Appendix 2 Solutions to Odd-Numbered Problems / A2 \\
                 Index of Maple Commands and Keywords / J1 Index of
                 Maple Commands Arranged by Chapters / J11",
}

@Article{Lavastre:1994:SAS,
  author =       "H{\'e}l{\`e}ne Lavastre",
  title =        "On the stochastic acceleration of sequences of random
                 variables",
  journal =      j-APPL-NUM-MATH,
  volume =       "15",
  number =       "1",
  pages =        "77--98",
  day =          "1",
  month =        aug,
  year =         "1994",
  CODEN =        "ANMAEL",
  ISSN =         "0168-9274 (print), 1873-5460 (electronic)",
  ISSN-L =       "0168-9274",
  MRclass =      "60F99 (65B99 65C99 65U05)",
  MRnumber =     "96c:60048",
  MRreviewer =   "Bruno Betr{\`o}",
  bibdate =      "Wed Jul 28 14:35:46 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/apnum/cas_free/browse/browse.cgi?year=1994&volume=15&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/applnummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/apnum/cas_sub/browse/browse.cgi?year=1994&volume=15&issue=1&aid=502",
  acknowledgement = ack-nhfb,
  affiliation =  "Universit{\'e} des Sciences et Technologies de Lille",
  affiliationaddress = "Villeneuve d'Ascq, Fr",
  classification = "921.3; 921.6; 922.1; 922.2",
  fjournal =     "Applied Numerical Mathematics: Transactions of IMACS",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01689274",
  journalabr =   "Appl Numer Math",
  keywords =     "Aitkens process; Convergence of numerical methods;
                 Estimation; Mathematical transformations; Numerical
                 analysis; Numerical methods; Probability; Random
                 processes; Random variables; Sequence transformations;
                 Statistical methods; Stochastic acceleration; Summation
                 processes; Theorem proving",
}

@Article{Leader:1994:LOI,
  author =       "I. Leader and A. J. Radcliffe",
  title =        "{Littlewood--Offord} inequalities for random
                 variables",
  journal =      j-SIAM-J-DISCR-MATH,
  volume =       "7",
  number =       "1",
  pages =        "90--101",
  month =        feb,
  year =         "1994",
  CODEN =        "SJDMEC",
  ISSN =         "0895-4801 (print), 1095-7146 (electronic)",
  ISSN-L =       "0895-4801",
  MRclass =      "60G50",
  MRnumber =     "95b:60052",
  MRreviewer =   "Iosif Pinelis",
  bibdate =      "Thu Apr 9 15:20:35 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Discrete Mathematics",
  journal-URL =  "http://epubs.siam.org/sidma",
}

@Article{LEcuyer:1994:CRW,
  author =       "P. L'Ecuyer and G. Perron",
  title =        "On the Convergence Rates of {WA} and {FDC} Derivative
                 Estimators",
  journal =      j-OPER-RES,
  volume =       "42",
  number =       "??",
  pages =        "643--656",
  month =        "????",
  year =         "1994",
  CODEN =        "OPREAI",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{LEcuyer:1994:SOSa,
  author =       "P. L'Ecuyer and N. Giroux and P. W. Glynn",
  title =        "Stochastic Optimization by Simulation: Numerical
                 Experiments with the {M/M/1} Queue in Steady-state",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "40",
  number =       "??",
  pages =        "1245--1261",
  month =        "????",
  year =         "1994",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{LEcuyer:1994:SOSb,
  author =       "P. L'Ecuyer and P. W. Glynn",
  title =        "Stochastic Optimization by Simulation: Convergence
                 Proofs for the {GI/G/1} Queue in Steady-state",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "40",
  number =       "??",
  pages =        "1562--1578",
  month =        "????",
  year =         "1994",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 10:58:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{LEcuyer:1994:URN,
  author =       "Pierre L'Ecuyer",
  title =        "Uniform random number generation",
  journal =      j-ANN-OPER-RESEARCH,
  volume =       "53",
  number =       "1",
  pages =        "77--120",
  year =         "1994",
  CODEN =        "AOREEV",
  DOI =          "https://doi.org/10.1007/BF02136827",
  ISSN =         "0254-5330 (print), 1572-9338 (electronic)",
  ISSN-L =       "0254-5330",
  MRclass =      "65C10",
  MRnumber =     "1310607 (95k:65007)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Mon Jun 27 22:45:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In typical stochastic simulations, randomness is
                 produced by generating a sequence of independent
                 uniform variates (usually real-valued between 0 and 1,
                 or integer-valued in some interval) and transforming
                 them in an appropriate way. In this paper, we examine
                 practical ways of generating (deterministic
                 approximations to) such uniform variates on a computer.
                 We compare them in terms of ease of implementation,
                 efficiency, theoretical support, and statistical
                 robustness. We look in particular at several classes of
                 generators, such as linear congruential, multiple
                 recursive, digital multistep, Tausworthe,
                 lagged-Fibonacci, generalized feedback shift register,
                 matrix, linear congruential over fields of formal
                 series, and combined generators, and show how all of
                 them can be analyzed in terms of their lattice
                 structure. We also mention other classes of generators,
                 like non-linear generators, discuss other kinds of
                 theoretical and empirical statistical tests, and give a
                 bibliographic survey of recent papers on the subject.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Operations Research",
  journal-URL =  "http://link.springer.com/journal/10479",
  keywords =     "combined generators; discrepancy; lattice structure;
                 linear congruential; nonlinear generators;
                 pseudorandom; random number generation; Simulation;
                 uniform random numbers",
}

@InProceedings{Leeb:1994:PST,
  author =       "H. Leeb",
  editor =       "M. Vajter{\v{s}}ic and P. Zinterhof",
  booktitle =    "Proceedings of the International Workshop Parallel
                 Numerics '94, Smolenice, September 19--21",
  title =        "{{\sc pLab}} --- a system for testing random numbers",
  publisher =    "Slovak Academy of Sciences, Institute for
                 Informatics",
  address =      "????, Slovakia",
  pages =        "89--99",
  year =         "1994",
  bibdate =      "Fri Jan 6 11:10:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/leebSmol.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/leebSmol.txt",
  acknowledgement = ack-nhfb,
}

@Article{Li:1994:RSA,
  author =       "Kim-Hung Li",
  title =        "Reservoir Sampling Algorithms of Time Complexity {$
                 O(n(1 + \log (N / n))) $}",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "481--493",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Mar 14 16:16:57 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/198429.198435;
                 http://www.acm.org/pubs/citations/journals/toms/1994-20-4/p481-li/",
  acknowledgement = ack-rfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "analysis of algorithms; random sampling; reservoir",
  subject =      "G.3 [Mathematics of Computing]: Probability and
                 Statistics -- probabilistic algorithms; random number
                 generation; statistical software; G.4 [Mathematics of
                 Computing]: Mathematical Software -- algorithm
                 analysis",
}

@Book{Lidl:1994:IFF,
  author =       "Rudolph Lidl and Harald Niederreiter",
  title =        "Introduction to Finite Fields and Their Applications",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xi + 461",
  year =         "1994",
  DOI =          "https://doi.org/10.1017/CBO9781139172769",
  ISBN =         "0-521-46094-8 (hardcover), 1-139-17276-X (e-book)",
  ISBN-13 =      "978-0-521-46094-1 (hardcover), 978-1-139-17276-9
                 (e-book)",
  LCCN =         "QA247.3 .L54 1994",
  bibdate =      "Sat Apr 05 12:33:53 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The theory of finite fields is a branch of modern
                 algebra that has come to the fore in recent years
                 because of its diverse applications in such areas as
                 combinatorics, coding theory, cryptology and the
                 mathematical study of switching circuits. The first
                 part of this updated edition presents an introduction
                 to this theory, emphasizing those aspects that are
                 relevant for application. The second part is devoted to
                 a discussion of the most important applications of
                 finite fields, especially to information theory,
                 algebraic coding theory and cryptology. There is also a
                 chapter on applications within mathematics, such as
                 finite geometries, combinatorics and pseudo-random
                 sequences. The book is meant to be used as a textbook:
                 worked examples and copious exercises that range from
                 the routine, to those giving alternative proofs of key
                 theorems, to extensions of material covered in the
                 text, are provided throughout. It will appeal to
                 advanced undergraduates and graduate students taking
                 courses on topics in algebra, whether they have
                 backgrounds in mathematics, electrical engineering or
                 computer science. Non-specialists will also find this a
                 readily accessible introduction to an active and
                 increasingly important subject.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Algebraic Foundations \\
                 2: Structure of Finite Fields \\
                 3: Polynomials over Finite Fields \\
                 4: Factorization of Polynomials \\
                 5: Exponential Sums \\
                 6: Linear Recurring Sequences \\
                 7: Theoretical Applications of Finite Fields \\
                 8: Algebraic Coding Theory \\
                 9: Cryptology \\
                 10: Tables",
}

@Article{Luscher:1994:PHQ,
  author =       "Martin L{\"u}scher",
  title =        "A portable high-quality random number generator for
                 lattice field theory simulations",
  journal =      j-COMP-PHYS-COMM,
  volume =       "79",
  number =       "1",
  pages =        "100--110",
  month =        feb,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90232-1",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Dec 24 11:11:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465594902321",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "RANLUX generator",
}

@Article{Ma:1994:IMC,
  author =       "Chang-ming Ma",
  title =        "Implementation of a {Monte Carlo} code on a parallel
                 computer system",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "20",
  number =       "7",
  pages =        "991--1005",
  day =          "12",
  month =        jul,
  year =         "1994",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Fri Aug 6 10:14:07 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1994&volume=20&issue=7;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1994&volume=20&issue=7&aid=883",
  acknowledgement = ack-nhfb,
  classification = "A8760M (Radiation dosimetry); C1140G (Monte Carlo
                 methods); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C6110P
                 (Parallel programming); C6185 (Simulation techniques);
                 C7330 (Biology and medicine)",
  corpsource =   "Inst. for Nat. Meas. Stand., Nat. Res. Council of
                 Canada, Ottawa, Ont., Canada",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "absorbed dose; analysis process; Carlo methods;
                 computing speed; control process; cubic phantoms;
                 cylindrical dosimeters; digital simulation; DOSIMETER;
                 dosimetry; Edinburgh Concurrent Supercomputer; EGS4;
                 EGS4 usercode; Electron Gamma Shower version 4;
                 independent task farm topology; medical computing;
                 Monte; Monte Carlo code system; multiple-transputer
                 system; parallel computer system; parallel machines;
                 parallel programming; parallelised code; random number
                 seeds; sequential programmes; simulation processes;
                 transputer systems",
  treatment =    "P Practical",
}

@Article{MacLaren:1994:CPN,
  author =       "N. MacLaren",
  title =        "Cryptographic Pseudorandom Numbers in Simulation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "809",
  pages =        "185--??",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1994.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Makino:1994:LFR,
  author =       "Jun Makino",
  title =        "Lagged-{Fibonacci} random number generators on
                 parallel computers",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "20",
  number =       "9",
  pages =        "1357--1367",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10",
  MRnumber =     "1 293 257",
  bibdate =      "Fri Aug 6 10:14:11 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1994&volume=20&issue=9;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1994&volume=20&issue=9&aid=893",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5230 (Digital arithmetic methods); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Bus. Admin. and Inf. Sci., Fukuyama Univ.,
                 Japan",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "efficient algorithm; Fibonacci generators; GFSR
                 generators; Lagged-; parallel algorithms; parallel
                 computers; parallel implementation; random number
                 generation; random number generators; timing results",
  treatment =    "T Theoretical or Mathematical",
}

@Misc{Marsaglia:1994:MAR,
  author =       "George Marsaglia",
  title =        "The mother of all random generators",
  howpublished = "Web document",
  month =        oct,
  year =         "1994",
  bibdate =      "Tue Jun 21 18:41:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://ftp.taygeta.com/pub/c/mother.c",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:1994:REI,
  author =       "George Marsaglia and Arif Zaman and John C. W.
                 Marsaglia",
  title =        "Rapid evaluation of the inverse of the normal
                 distribution function",
  journal =      j-STAT-PROB-LETT,
  volume =       "19",
  number =       "4",
  pages =        "259--266",
  day =          "15",
  month =        mar,
  year =         "1994",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/0167-7152(94)90174-0",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "65U05",
  MRnumber =     "1 278 658",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0798.65132",
  abstract =     "This is an interesting article with direct application
                 in generating normal random variable by computer
                 programs. The suggested applications are related to
                 Monte Carlo simulation based on massively parallel
                 systems or supercomputers. The idea is to replace
                 larger programs with complicated computations and with
                 difficulties in accuracy controlling by simpler
                 arithmetic programs that use tabled constants. These
                 seem to be the normal evolution since memory becomes
                 cheaper and cheaper.\par

                 The authors compute the inverse of the cPhi function $$
                 c P h i(x) = (2 / \pi)^{1 / 2} \int^\infty_x \exp ( -
                 t^2 / 2) d t = u, $$ using a uniform random variable as
                 input and the truncated Taylor series development of
                 it. In order to increase the speed the coefficients of
                 the truncated Taylor series $$ x(u_0 + h) = x(u_0) +
                 x'(u_0) \cdot h + {1 \over 2} x''(u_0) \cdot h^2 + {1
                 \over 6} x'''(u_0) \cdot h^3, $$ are predetermined for
                 1024 points. And here comes another bright idea: the
                 1024 points are chosen based on the representation of
                 the uniform random variable in modern computers as
                 floating point variable of the form: $ u = 2^{-k} ((1 /
                 2) + (j / 64)) + 2^{-k} \cdot (m / 2^{24}) $ with $ 0
                 \le k & l t; 32 $, $ 0 \le j & l t; 32 $ and $ 0 \le m
                 & l t; 2^{18} $ and considering 32 bit
                 representation.\par

                 With this assumptions and the truncation to the third
                 power of $h$ of the Taylor series, the authors show
                 that the error does not exceed the limit of single
                 precision accuracy. Furthermore the calculations are
                 speeded up based on reducing multiplications. A number
                 of FORTRAN programs are also presented in order to
                 evaluate the complementary normal distribution function
                 cPhi (several versions) with great accuracy, create the
                 constant tables, and generate the normal distribution
                 variable. These simple programs give the user the
                 possibility to completely control the accuracy.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
  keywords =     "cPhi function; FORTRAN programs; massive parallel
                 systems; Monte Carlo simulation; normal distribution
                 function; normal random variable; supercomputers;
                 truncated Taylor series",
  ZMclass =      "65C99 Numerical simulation 65C05 Monte Carlo methods
                 60-04 Machine computation, programs (probability
                 theory) 60E05 General theory of probability
                 distributions 62E17 Approximations to statistical
                 distributions (nonasymptotic)",
  ZMreviewer =   "A. Pasculescu (Bucuresti)",
}

@Article{Marsaglia:1994:SPV,
  author =       "George Marsaglia and Arif Zaman",
  title =        "Some portable very-long-period random number
                 generators",
  journal =      j-COMPUT-PHYS,
  volume =       "8",
  number =       "1",
  pages =        "117--121",
  month =        jan # "\slash " # feb,
  year =         "1994",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168514",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Mon Aug 02 17:54:20 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
  remark =       "ran2() range is [1,2147483562], with period about
                 2.3e+18. mzran13() has range[0,2147483647] and period
                 about $ 2^{125} $ = 4.25e37.",
}

@TechReport{Mascagni:1994:FHQ,
  author =       "Michael Mascagni",
  title =        "A fast, high quality, and reproducible parallel
                 {lagged-Fibonacci} pseudorandom number generator",
  type =         "Technical report",
  number =       "SRC-TR-94-115",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "18",
  day =          "15",
  month =        mar,
  year =         "1994",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We study the suitability of the additive
                 lagged-Fibonacci pseudorandom number generator for
                 parallel computation. This generator has relatively
                 short period with respect to the size of its seed.
                 However, the short period is more than made up for with
                 the huge number of full-period cycles it contains.
                 These different full-period cycles are called
                 equivalence classes. We show how to enumerate the
                 equivalence classes and how to compute seeds to select
                 a given equivalence class. In addition, we present some
                 theoretical measures of quality for this generator when
                 used in parallel. Next, we conjecture on the size of
                 these measures of quality for this generator. Extensive
                 empirical evidence supports this conjecture. In
                 addition, a probabilistic interpretation of these
                 measures leads to another conjecture similarly
                 supported by empirical evidence. Finally we give an
                 explicit parallelization suitable for a fully
                 reproducible asynchronous MIMD implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "Parallel processing (Electronic computers)",
}

@TechReport{Mascagni:1994:PPN,
  author =       "Michael Mascagni",
  title =        "Parallel pseudorandom number generation using additive
                 lagged-{Fibonacci} recursions",
  type =         "Technical report",
  number =       "SRC-TR-94-133",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "15",
  day =          "1",
  month =        dec,
  year =         "1994",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We study the suitability of the additive
                 lagged-Fibonacci pseudorandom number generator for
                 parallel computation. This generator has a relatively
                 short period with respect to the size of its seed.
                 However, the short period is more than made up for with
                 the huge number of full-period cycles it contains. We
                 call these different full-period cycles equivalence
                 classes. We show how to enumerate the equivalence
                 classes and how to compute seeds to select a given
                 equivalence class. The use of these equivalence classes
                 gives an explicit parallelization suitable for a fully
                 reproducible asynchronous MIMD implementation. To
                 explore such an implementation we introduce an
                 exponential sum measure of quality for the additive
                 lagged-Fibonacci generators used in serial or parallel.
                 We then prove the first non-trivial results we are
                 aware of on the measure of quality.",
  acknowledgement = ack-nhfb,
  keywords =     "Random number generators",
}

@InProceedings{Matsui:1994:LCM,
  author =       "Mitsuru Matsui",
  editor =       "Tor Helleseth",
  booktitle =    "Advances in Cryptology --- {EUROCRYPT '93}",
  title =        "Linear Cryptanalysis Method for {DES} Cipher",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "386--397",
  year =         "1994",
  DOI =          "https://doi.org/10.1007/3-540-48285-7_33",
  bibdate =      "Sat Apr 05 12:40:25 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://link.springer.com/chapter/10.1007/3-540-48285-7_33",
  acknowledgement = ack-nhfb,
}

@Article{Matsumoto:1994:TGG,
  author =       "Makoto Matsumoto and Yoshiharu Kurita",
  title =        "Twisted {GFSR} generators {II}",
  journal =      j-TOMACS,
  volume =       "4",
  number =       "3",
  pages =        "254--266",
  month =        jul,
  year =         "1994",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{McGrath:1994:SAB,
  author =       "Gary McGrath",
  title =        "Signal Analysis Via The Bootstrap",
  journal =      j-DDJ,
  volume =       "19",
  number =       "2",
  pages =        "48, 50, 52, 54--57, 81--82",
  month =        feb,
  year =         "1994",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 03 09:15:46 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "Signal analysis requires that you minimize assumptions
                 --- and the Bootstrap is a resampling algorithm which
                 estimates the error on quantities by resampling the
                 data in random ways. Gary analyzes this algorithm and
                 describes how the astrophysics community has adapted it
                 to search for tenuous signals in multidimensional
                 data.",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other and miscellaneous); B6140 (Signal
                 processing and detection); C1140Z (Other and
                 miscellaneous); C1260 (Information theory)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  keywords =     "Background; Binning; Bootstrap resampling technique;
                 Complex transformations; Error estimation; Error
                 propagation; Local biases; Measured value probability
                 distribution; Monte Carlo calculation; Pseudorandom
                 number generator; Signal analysis; Signal detection;
                 Statistical significance",
  thesaurus =    "C listings; Error analysis; Error statistics;
                 Estimation theory; Probability; Signal detection",
}

@Article{Niederreiter:1994:NCP,
  author =       "Harald Niederreiter",
  title =        "On a new class of pseudorandom numbers for simulation
                 methods",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "56",
  number =       "1--2",
  pages =        "159--167",
  day =          "20",
  month =        dec,
  year =         "1994",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(94)90385-9",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Fri Dec 23 22:18:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042794903859",
  abstract =     "The deficiencies of classical methods for uniform
                 pseudorandom number generation have recently led to the
                 development of alternative methods, such as nonlinear
                 congruential methods. A particularly attractive
                 nonlinear congruential method is the explicit inversive
                 congruential method recently introduced by
                 Eichenauer-Herrmann. We establish several new results
                 on the structural and statistical properties of
                 pseudorandom numbers generated by this method. These
                 results demonstrate that this method is eminently
                 suitable for the generation of parallel streams of
                 pseudorandom numbers with desirable properties.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "inversive congruential method; random numbers for
                 parallel processors; uniform pseudorandom numbers",
}

@Article{Niederreiter:1994:PVG,
  author =       "Harald Niederreiter",
  title =        "Pseudorandom vector generation by the inversive
                 method",
  journal =      j-TOMACS,
  volume =       "4",
  number =       "2",
  pages =        "191--212",
  month =        apr,
  year =         "1994",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Odlyzko:1994:PKC,
  author =       "Andrew M. Odlyzko",
  title =        "Public key cryptography",
  journal =      j-ATT-TECH-J,
  volume =       "73",
  number =       "5",
  pages =        "17--23",
  month =        sep # "\slash " # oct,
  year =         "1994",
  CODEN =        "ATJOEM",
  ISSN =         "2376-676X (print), 8756-2324 (electronic)",
  ISSN-L =       "8756-2324",
  bibdate =      "Fri Nov 12 13:11:10 2010",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.research.att.com/~amo/doc/arch/public.key.crypto.pdf;
                 http://www.research.att.com/~amo/doc/arch/public.key.crypto.ps;
                 http://www.research.att.com/~amo/doc/arch/public.key.crypto.tex",
  abstract =     "The concern for secure communications has moved
                 cryptology from an arcane science, best known to the
                 military and diplomatic services, to an integral
                 component for business and personal communications.
                 Public key cryptography, developed within the last two
                 decades for commercial use, has become an exciting
                 technology for the communications industry, as wired
                 and wireless voice, data, and image networks continue
                 to proliferate and interconnect. Public key
                 cryptography helps provide secure communications, at
                 reasonable costs, for general communications. It solves
                 several important technical problems, especially those
                 of key management and digital signatures, that are
                 vital for information processing, but it also presents
                 some drawbacks. This article explains public key
                 cryptography, its benefits and limitations.",
  acknowledgement = ack-nhfb,
  fjournal =     "AT\&T Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
  keywords =     "computational complexity; data communication; data
                 communication systems; data privacy; decoding;
                 information management; personal communication
                 networks; public key cryptography; random number
                 generation; security of data; visual communication;
                 voice communication",
  subject =      "public key cryptography; secure communications;
                 business communications; personal communications;
                 communications industry; key management; digital
                 signature; information processing; wired networks;
                 wireless networks; voice networks; data networks; image
                 networks",
  topic =        "cryptography",
}

@Article{Ohta:1994:INP,
  author =       "Shigemi Ohta and Eiichi Goto and Weng Fai Wong and
                 Nobuaki Yoshida",
  title =        "Improvement and new proposal on fast evaluation of
                 elementary functions. ({Japanese})",
  journal =      j-TRANS-INFO-PROCESSING-SOC-JAPAN,
  volume =       "35",
  number =       "5",
  pages =        "926--933",
  month =        may,
  year =         "1994",
  CODEN =        "JSGRD5",
  ISSN =         "0387-5806",
  ISSN-L =       "0387-5806",
  MRclass =      "65D20",
  MRnumber =     "95f:65045",
  bibdate =      "Sat Jan 11 17:44:01 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Wong, Gore, and Yoshida (ibid., vol. 34, no. 7, pp.
                 1570-1579, 1993) introduced fast methods for numerical
                 evaluation of elementary functions based on table
                 lookup. They are called ATA (add/table-lookup/add) and
                 ATA-M (add/table-lookup/add and multiply) methods for
                 single- and double-precision calculations respectively.
                 In this paper, an improvement to these methods that
                 shrinks the size of the table by a factor of about 3/16
                 is presented. Another method called the `split parallel
                 multiplication method', which is characterized by
                 simpler table lookup than ATA-M and by split and
                 parallel use of double-precision floating point
                 circuitry, is also introduced, These new methods fit on
                 to integrated circuits of a size comparable with
                 commercially available floating-point accelerators.
                 Methods for accelerating double-precision division,
                 generating uniform pseudo-random numbers in
                 double-precision, and accelerating the multiplication
                 of single-precision complex numbers using the same
                 circuitry are proposed.",
  acknowledgement = ack-nhfb,
  affiliation =  "RIKEN, Inst. of Phys. and Chem. Res., Saitama, Japan",
  classification = "C4120 (Functional analysis); C5230 (Digital
                 arithmetic methods); C6130 (Data handling techniques)",
  fjournal =     "Transactions of the Information Processing Society of
                 Japan",
  keywords =     "Add/table-lookup/add method;
                 Add/table-lookup/add/multiply method; ATA method; ATA-M
                 method; Double-precision calculations; Double-precision
                 division; Double-precision floating point circuitry;
                 Elementary functions evaluation; Floating-point
                 accelerators; Integrated circuits; Numerical
                 evaluation; Single-precision calculations;
                 Single-precision complex number multiplication; Split
                 parallel multiplication method; Table size; Uniform
                 pseudo-random number generation",
  language =     "Japanese",
  pubcountry =   "Japan",
  thesaurus =    "Digital arithmetic; Function evaluation; Random number
                 generation; Table lookup",
}

@Article{Pedrotti:1994:ALU,
  author =       "A. Pedrotti",
  title =        "Analysis of a list-update strategy",
  journal =      j-INFO-PROC-LETT,
  volume =       "52",
  number =       "3",
  pages =        "115--121",
  day =          "11",
  month =        nov,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Scuola Normale Superiore",
  affiliationaddress = "Pisa, Italy",
  classification = "721.1; 723.2; 921.6; 922.1; 922.2; C4240C
                 (Computational complexity); C6130 (Data handling
                 techniques)",
  corpsource =   "Scuola Normale Superiore, Pisa, Italy",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; analysis of algorithms; average-case
                 complexity; BIT; competitive algorithms; Computational
                 complexity; computational complexity; convergence;
                 Convergence of numerical methods; Data handling;
                 Function evaluation; Heuristic methods; list
                 processing; list update; Markov chains; Move to front
                 algorithm; move-to-front; Probability; Random number
                 generation; searching; Theorem proving; transpose;
                 Zipf's law",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Petersen:1994:LFS,
  author =       "W. P. Petersen",
  title =        "Lagged {Fibonacci} Series Random Number Generators for
                 the {NEC SX-3}",
  journal =      j-INT-J-HIGH-SPEED-COMPUTING,
  volume =       "6",
  number =       "3",
  pages =        "387--??",
  year =         "1994",
  CODEN =        "IHSCEZ",
  ISSN =         "0129-0533",
  bibdate =      "Mon Feb 25 11:19:24 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of High Speed Computing
                 (IJHSC)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijhsc",
}

@Article{Petriu:1994:AMV,
  author =       "Dorina C. Petriu",
  title =        "Approximate mean value analysis of client-server
                 systems with multi-class requests",
  journal =      j-SIGMETRICS,
  volume =       "22",
  number =       "1",
  pages =        "77--86",
  month =        may,
  year =         "1994",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/183018.183027",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:16:44 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "Stochastic Rendezvous Networks (SRVNs) are performance
                 models for multitasking parallel software with
                 intertask communication via rendezvous introduced in
                 [1], which are very appropriate to model client-server
                 systems. SRVNs differ from Queueing Networks (QNs) in
                 two ways: nodes act as both clients and servers
                 (allowing for nested service), and servers have two
                 distinct phases of service --- the first one ``in RV''
                 with the client, and the second ``after RV'', executed
                 in parallel with the client. Early work on solving SRVN
                 models has used a kind of approximate Mean Value
                 Analysis based on heuristic ad hoc assumptions to
                 determine the task queue properties at the instant of
                 RV request arrivals. Approximation are necessary since
                 SRVN violates product form. Recently, a more rigorous
                 approach was proposed in [2] for the solution of SRVN
                 models, based on a special aggregation (named
                 ``Task-Directed Aggregation'' TDA) of the Markov chain
                 model describing the interference of different clients
                 that contend for a single server with FIFO queueing
                 discipline and different service times. The algorithm
                 derived in [2] has the limitation that each client may
                 require only a single class of service. In general, a
                 software server offers a range of services with
                 different workloads and functionalities, and a client
                 may need more than one service. The present paper uses
                 the TDA approach to derive an extended algorithm which
                 allows a client to require any number of services from
                 a server by changing randomly the request class. The
                 new algorithm is incorporated into a decomposition
                 method for models with any number of servers. The SRVN
                 modelling technique is applied to a large case study of
                 a distributed database system, giving insight into the
                 behaviour of the system and helping to identify
                 performance problems such as software bottle-neck.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Piccioni:1994:IMC,
  author =       "Mauro Piccioni and Sergio Scarlatti",
  title =        "An Iterative {Monte Carlo} Scheme for Generating {Lie}
                 Group-Valued Random Variables",
  journal =      j-ADV-APPL-PROB,
  volume =       "26",
  number =       "3",
  pages =        "616--628",
  month =        sep,
  year =         "1994",
  CODEN =        "AAPBBD",
  DOI =          "https://doi.org/10.2307/1427811",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Sat May 3 07:42:16 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i262303;
                 https://www.math.utah.edu/pub/tex/bib/advapplprob.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1427811",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00018678.html",
}

@Article{Plumb:1994:TRN,
  author =       "Colin Plumb",
  title =        "Truly Random Numbers",
  journal =      j-DDJ,
  volume =       "19",
  number =       "13",
  pages =        "113--??",
  month =        nov,
  year =         "1994",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Wed Sep 04 09:01:55 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  keywords =     "true random numbers from physical sources",
}

@InProceedings{Pryor:1994:IPR,
  author =       "D. V. Pryor and S. A. Cuccaro and M. Mascagni and M.
                 L. Robinson",
  title =        "Implementation of a Portable and Reproducible Parallel
                 Pseudorandom Number Generator",
  crossref =     "IEEE:1994:PSW",
  pages =        "311--319",
  year =         "1994",
  bibdate =      "Wed Apr 15 09:36:13 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sc94.ameslab.gov/AP/contents.html",
  acknowledgement = ack-nhfb,
}

@TechReport{Pryor:1994:IUP,
  author =       "Daniel V. Pryor",
  title =        "Implementation and usage of a portable and
                 reproducible parallel pseudorandom number generator",
  type =         "Technical report",
  number =       "SRC-TR-94-116",
  institution =  inst-SRC-IDA,
  address =      inst-SRC-IDA:adr,
  pages =        "16",
  day =          "15",
  month =        mar,
  year =         "1994",
  bibdate =      "Fri Aug 30 08:01:51 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We describe in detail the parallel implementation of
                 an additive lagged-Fibonacci pseudorandom number
                 generator. Elsewhere, [8], it was shown how important
                 properties of these generators lead to an obvious
                 parallel implementation based on deterministic seeding.
                 Seeds are calculated to select one of a large number of
                 full-period cycles, or equivalence classes. This
                 `naive' implementation is computationally efficient and
                 produces a high-quality, portable, and totally
                 reproducible parallel generator. A drawback of the
                 `naive' implementation is that it produces sequences
                 that have initial segments of poor quality. In
                 addition, the initial segments from the equivalence
                 classes of different parallel processes are similar.
                 The simplest solution to this problem is rejected due
                 to its computational cost. Instead, a different seeding
                 algorithm is described. The new algorithm can be viewed
                 as an alternative enumeration of the equivalence
                 classes. The new algorithm is computationally more
                 efficient and avoids the quality problems of the
                 `naive' implementation. We believe that this algorithm
                 solves the reproducibility problem for a far larger
                 class of parallel Monte Carlo applications than had
                 been previously possible. In fact, this generator
                 allows one to write code that is reproducible
                 independent both of the number of processors and the
                 execution order of the parallel processes. Finally, a
                 library of portable C routines is described that
                 implements these ideas. These routines are available
                 from the authors.",
  acknowledgement = ack-nhfb,
  keywords =     "Parallel processing (Electronic computers)",
}

@Article{Rajsbaum:1994:PSP,
  author =       "Sergio Rajsbaum and Moshe Sidi",
  title =        "On the performance of synchronized programs in
                 distributed networks with random processing times and
                 transmission delays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "5",
  number =       "9",
  pages =        "939--950",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/71.308532",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Instituto de Matematicas",
  affiliationaddress = "Mex",
  classification = "722.3; 722.4; 723.1; 921.4; 922.1; C1160
                 (Combinatorial mathematics); C5470 (Performance
                 evaluation and testing); C5670 (Network performance);
                 C6110P (Parallel programming); C6150C (Compilers,
                 interpreters and other processors); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Electr. Eng., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "http://www.computer.org/tpds/archives.htm",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous network; bottleneck processor; compiler;
                 computational; Computational methods; Computer
                 software; Data communication systems; delays;
                 Distributed computer systems; distributed computing;
                 Distributed networks; distributed networks; exponential
                 distribution; Graph theory; graph theory; Marked
                 graphs; marked graphs; message passing; message
                 transmission; parallel programming; performance
                 evaluation; performance measure; probability
                 distributions; processing times; Program compilers;
                 program compilers; random; Random processes; Random
                 processing times; random variables; steps; Stochastic
                 behavior; synchronisation; Synchronization;
                 synchronized programs; Synchronized programs;
                 synchronizer; synchronous network; Topology;
                 Transmission delays; transmission delays",
  treatment =    "P Practical",
}

@Article{Ramirez:1994:EUI,
  author =       "Octavio A. Ramirez and Charles B. Moss and William G.
                 Boggess",
  title =        "Estimation and use of the inverse hyperbolic sine
                 transformation to model non-normal correlated random
                 variables",
  journal =      j-J-APPL-STAT,
  volume =       "21",
  number =       "4",
  pages =        "289--304",
  month =        "????",
  year =         "1994",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/757583872",
  ISSN =         "0266-4763 (print), 1360-0532 (electronic)",
  ISSN-L =       "0266-4763",
  bibdate =      "Wed Jan 3 14:24:13 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/japplstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/cjas20",
}

@Article{Rarity:1994:QRN,
  author =       "J. G. Rarity and P. C. M. Owens and P. R. Tapster",
  title =        "Quantum Random-Number Generation and Key Sharing",
  journal =      j-J-MOD-OPT,
  volume =       "41",
  number =       "12",
  pages =        "2435--2444",
  month =        dec,
  year =         "1994",
  CODEN =        "JMOPEW",
  DOI =          "https://doi.org/10.1080/09500349414552281",
  ISSN =         "0950-0340 (print), 1362-3044 (electronic)",
  ISSN-L =       "0950-0340",
  bibdate =      "Sat Nov 29 13:58:33 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/full/10.1080/09500349414552281",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Modern Optics",
  journal-URL =  "http://www.tandfonline.com/loi/tmop20",
}

@Book{Riesel:1994:PNC,
  author =       "Hans Riesel",
  title =        "Prime numbers and computer methods for factorization",
  volume =       "126",
  publisher =    pub-BIRKHAUSER-BOSTON,
  address =      pub-BIRKHAUSER-BOSTON:adr,
  edition =      "Second",
  pages =        "xvi + 464",
  year =         "1994",
  ISBN =         "0-8176-3743-5",
  ISBN-13 =      "978-0-8176-3743-9",
  LCCN =         "QA246 .R54 1994",
  bibdate =      "Fri Mar 9 15:07:11 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0907/94027688-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0907/94027688-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Numbers, Prime; Data processing; Factorization
                 (Mathematics)",
}

@Article{Ritter:1994:EPR,
  author =       "Terry Ritter",
  title =        "Estimating Population from Repetitions in Accumulated
                 Random Samples",
  journal =      j-CRYPTOLOGIA,
  volume =       "18",
  number =       "2",
  pages =        "155--190",
  month =        apr,
  year =         "1994",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119491882847",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Mon Jun 30 15:39:07 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  URL =          "http://www.informaworld.com/smpp/content~content=a748639261~db=all~order=page",
  abstract =     "It was desired to estimate the number of unique values
                 or codes produced by a physically-random number
                 generator of the sort used to form cryptographic
                 message keys; only the codes produced by the generator
                 were available for analysis. Subsequently, the
                 classical ``birthday paradox'' was reversed to estimate
                 statistical population from the average number of
                 repetitions found in trials containing a substantial
                 number of random samples. Although similar in premise
                 to previous work, a new relationship was found which
                 includes combinatorial contributions from higher
                 repetition levels. The resulting equations proved to be
                 simple, intuitive, exact, and novel in that they were
                 easily reversed to produce unique population estimates.
                 The distribution of repetitions in different size
                 trials was investigated experimentally and found not
                 inconsistent with a hypothesis of Poisson distribution.
                 In practice, multiple trials establish the mean number
                 of repetitions for a trial of a given size; the new
                 equations then estimate population directly",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
  keywords =     "codes; cryptography; probability; random number
                 generation",
  romanvolume =  "XVIII",
  subject =      "population; repetitions; accumulated random samples;
                 codes; physically-random number generator;
                 cryptographic message keys; birthday paradox;
                 statistical population; random samples; combinatorial
                 contribution; equations; population estimates; Poisson
                 distribution; cipher certification test; statistical
                 applications",
}

@Article{Rivest:1994:DBI,
  author =       "Ronald L. Rivest and Robert E. Schapire",
  title =        "Diversity-Based Inference of Finite Automata",
  journal =      j-J-ACM,
  volume =       "41",
  number =       "3",
  pages =        "555--589",
  month =        may,
  year =         "1994",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/176584.176589",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 23:22:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176589.html",
  abstract =     "We present new procedures for inferring the structure
                 of a finite-state automaton (FSA) from its input/output
                 behavior, using access to the automaton to perform
                 experiments.\par

                 Our procedures use a new representation for finite
                 automata, based on the notion of equivalence between
                 {\em tests}. We call the number of such equivalence
                 classes the {\em diversity\/} of the automaton; the
                 diversity may be as small as the logarithm of the
                 number of states of the automaton. For the special
                 class of {\em permutation automata}, we describe an
                 inference procedure that runs in time polynomial in the
                 diversity and $ \log (1 / \delta) $, where $ \delta $
                 is a given upper bound on the probability that our
                 procedure returns an incorrect result. (Since our
                 procedure uses randomization to perform experiments,
                 there is a certain controllable chance that it will
                 return an erroneous result.) We also discuss techniques
                 for handling more general automata.\par

                 We present evidence for the practical efficiency of our
                 approach. For example, our procedure is able to infer
                 the structure of an automaton based on Rubik's Cube
                 (which has approximately $ 10^{19} $ states) in about 2
                 minutes on a DEC MicroVax. This automaton is many
                 orders of magnitude larger than possible with previous
                 techniques, which would require time proportional at
                 least to the number of global states. (Note that in
                 this example, only a small fraction ($ 10^{-14} $ ) of
                 the global states were even visited.)\par

                 Finally, we present a new procedure for inferring
                 automata of a special type in which the global state is
                 composed of a vector of binary local state variables,
                 all of which are observable (or {\em visible\/}) to the
                 experimenter. Our inference procedure runs provably in
                 time polynomial in the size of this vector (which
                 happens to be the diversity of the automaton), even
                 though the global state space may be exponentially
                 larger. The procedure plans and executes experiments on
                 the unknown automaton; we show that the number of input
                 symbols given to the automaton during this process is
                 (to within a constant factor) the best possible.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "algorithms; experimentation; theory",
  subject =      "{\bf F.1.1}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Models of Computation, Automata. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures. {\bf
                 I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Learning, Induction. {\bf I.2.9}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Robotics.",
}

@Article{Schneier:1994:AAd,
  author =       "Bruce Schneier",
  title =        "Algorithm Alley",
  journal =      j-DDJ,
  volume =       "19",
  number =       "13",
  pages =        "113--??",
  month =        nov,
  year =         "1994",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Wed Sep 04 09:01:55 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/dr-dobbs.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "Random numbers are essential in cryptography. This
                 month, Colin Plumb discusses the random-number
                 generator he helped devise for the Pretty Good Privacy
                 (PGP) e-mail security program.",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}

@Article{Shallit:1994:ALS,
  author =       "Jeffrey Shallit and Jonathan Sorenson",
  title =        "Analysis of a Left-Shift Binary {GCD} Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "473--486",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95g:68057",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C5230
                 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171",
  keywords =     "computational complexity; digital arithmetic; greatest
                 common divisor; left-shift binary GCD algorithm;
                 polynomials; Ramharter theorem; symbol manipulation;
                 worst-case behavior",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shukhman:1994:GQR,
  author =       "B. Shukhman",
  title =        "Generation of quasi-random ({LP$_\tau $}) vectors for
                 parallel computation",
  journal =      j-COMP-PHYS-COMM,
  volume =       "78",
  number =       "3",
  pages =        "279--286",
  month =        jan,
  year =         "1994",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)90006-X",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 21:29:42 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559490006X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Sitharam:1994:PGL,
  author =       "Meera Sitharam",
  title =        "Pseudorandom generators and learning algorithms for
                 {AC}",
  crossref =     "ACM:1994:PTS",
  pages =        "478--486",
  year =         "1994",
  bibdate =      "Wed Feb 20 18:34:01 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/195058/p478-sitharam/p478-sitharam.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/195058/p478-sitharam/",
  acknowledgement = ack-nhfb,
}

@Article{Sorenson:1994:TFG,
  author =       "J. Sorenson",
  title =        "Two fast {GCD} algorithms",
  journal =      j-J-ALG,
  volume =       "16",
  number =       "1",
  pages =        "110--144",
  month =        jan,
  year =         "1994",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1006/jagm.1994.1006",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Wed Dec 28 17:51:35 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
  keywords =     "greatest common denominator (GCD)",
  remark =       "From the abstract: ``We present two new algorithms for
                 computing greatest common divisors: the right- and
                 left-shift $k$-ary GCD algorithms. These algorithms are
                 generalizations of the binary and left-shift binary
                 algorithms. Interestingly, both new algorithms have
                 sequential versions that are practical and efficient
                 and parallel versions that rival the best previous
                 parallel GCD algorithms.''",
}

@Article{Spanier:1994:QRM,
  author =       "Jerome Spanier and Earl H. Maize",
  title =        "Quasi-Random Methods for Estimating Integrals Using
                 Relatively Small Samples",
  journal =      j-SIAM-REVIEW,
  volume =       "36",
  number =       "1",
  pages =        "18--44",
  month =        mar,
  year =         "1994",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1036002",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "65C05 (65C20 65D30)",
  MRnumber =     "95b:65013",
  MRreviewer =   "Michael J. Evans",
  bibdate =      "Sat Mar 29 09:55:19 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/36/1;
                 http://www.siam.org/journals/sirev/sirev361.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://epubs.siam.org/22673.htm",
  abstract =     "Much of the recent work dealing with quasi-random
                 methods has been aimed at establishing the best
                 possible asymptotic rates of convergence to zero of the
                 error resulting when a finite-dimensional integral is
                 replaced by a finite sum of integrand values. In
                 contrast with this perspective to concentrate on
                 asymptotic convergence rates, this paper emphasizes
                 quasi-random methods that are effective for all sample
                 sizes. Throughout the paper, the problem of estimating
                 finite-dimensional integrals is used to illustrate the
                 major ideas, although much of what is done applies
                 equally to the problem of solving certain Fredholm
                 integral equations. Some new techniques, based on
                 error-reducing transformations of the integrand, are
                 described that have been shown to be useful both in
                 estimating high-dimensional integrals and in solving
                 integral equations. These techniques illustrate the
                 utility of carrying over to the quasi-Monte Carlo
                 method certain devices that have proven to be very
                 valuable in statistical (pseudorandom) Monte Carlo
                 applications.",
  acknowledgement = ack-nhfb,
  affiliation =  "Claremont Graduate Sch",
  affiliationaddress = "Claremont, CA, USA",
  classification = "921; 922.1",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Asymptotic rate of convergence; Fredholm integral
                 equations; Integral equations; Integral estimation
                 quasi-random methods; Monte Carlo methods; Statistical
                 methods",
  onlinedate =   "March 1994",
}

@Article{Strauch:1994:D,
  author =       "Oto Strauch",
  title =        "{$ L^2 $} Discrepancy",
  journal =      j-MATH-SLOVACA,
  volume =       "44",
  number =       "5",
  pages =        "601--632",
  month =        "????",
  year =         "1994",
  CODEN =        "MASLDM",
  ISSN =         "0139-9918 (print), 1337-2211 (electronic)",
  ISSN-L =       "0139-9918",
  MRclass =      "11K06 (60E05)",
  MRnumber =     "MR1338433 (96c:11085)",
  bibdate =      "Sat Mar 03 09:54:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Slovaca",
}

@Article{Swan:1994:AAa,
  author =       "Tom R. Swan",
  title =        "Algorithm Alley",
  journal =      j-DDJ,
  volume =       "19",
  number =       "1",
  pages =        "111--??",
  month =        jan,
  year =         "1994",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Tue Sep 03 09:15:46 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  abstract =     "Tom explores three different methods of generating
                 random numbers --- middle-square, linear-congruential,
                 and Fibonacci --- and shows how you can mix two of them
                 to create a combination generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "Dr. Dobb's Journal of Software Tools",
}

@Article{Szwarcfiter:1994:EKD,
  author =       "Jayme L. Szwarcfiter and Guy Chaty",
  title =        "Enumerating the kernels of a directed graph with no
                 odd circuits",
  journal =      j-INFO-PROC-LETT,
  volume =       "51",
  number =       "3",
  pages =        "149--153",
  day =          "10",
  month =        aug,
  year =         "1994",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C20 (68Q25)",
  MRnumber =     "95m:05117",
  MRreviewer =   "Hortensia Galeana-S{\'a}nchez",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidade Federal do Rio de Janeiro",
  affiliationaddress = "Rio de Janeiro, Braz",
  classification = "721.1; 721.3; 723.2; 921.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240 (Programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Inst. de Matematica, Univ. Federal de Rio de Janeiro,
                 Brazil",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Arbitrary graphs; Computational
                 complexity; computational complexity; computational
                 geometry; counting problem; Data acquisition; Data
                 structures; Digital arithmetic; Digital circuits;
                 directed graph; Directed graphs; directed graphs;
                 edges; Graph theory; kernel enumeration; Kernels;
                 kernels; No odd circuits; Number theory; odd circuits;
                 P- complete; Polynomial time; polynomial time;
                 Polynomials; Random number generation; Set theory;
                 vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Takashima:1994:STT,
  author =       "K. Takashima",
  title =        "Sojourn time test for maximum-length linearly
                 recurring sequences with characteristic primitive
                 trinomials",
  journal =      j-J-JAPAN-SOC-COMPUT-STAT,
  volume =       "7",
  number =       "??",
  pages =        "77--87",
  month =        "??",
  year =         "1994",
  CODEN =        "????",
  ISSN =         "0915-2350 (print), 1881-1337 (electronic)",
  ISSN-L =       "0915-2350",
  bibdate =      "Thu Mar 01 07:53:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Japanese Society of Computational
                 Statistics",
}

@Article{Tezuka:1994:DDC,
  author =       "Shu Tezuka",
  title =        "The $k$-Dimensional Distribution of Combined {GFSR}
                 Sequences",
  journal =      j-MATH-COMPUT,
  volume =       "62",
  number =       "206",
  pages =        "809--817",
  month =        apr,
  year =         "1994",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.jstor.org/stable/pdfplus/2153541.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Tezuka:1994:MDC,
  author =       "Shu Tezuka and Masanori Fushimi",
  title =        "A method of designing cellular automata as
                 pseudorandom number generators for built-in self-test
                 for {VLSI}",
  journal =      j-CONTEMP-MATH,
  volume =       "168",
  number =       "??",
  pages =        "363--367",
  month =        "????",
  year =         "1994",
  ISSN =         "0271-4132 (print), 1098-3627 (electronic)",
  ISSN-L =       "0271-4132",
  MRclass =      "11B37 (11T71 68Q80)",
  MRnumber =     "1291442 (95m:11021)",
  MRreviewer =   "Jau-Shyong Shiue",
  bibdate =      "Sat Mar 3 09:56:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Contemporary mathematics (American Mathematical
                 Society)",
}

@Article{Tezuka:1994:UVL,
  author =       "Shu Tezuka",
  title =        "A Unified View of Long-Period Random Number
                 Generators",
  journal =      j-J-OPER-RES-SOC-JPN,
  volume =       "37",
  number =       "3",
  pages =        "211--227",
  month =        "????",
  year =         "1994",
  CODEN =        "JORJA5",
  ISSN =         "0453-4514 (print), 1878-6871 (electronic)",
  ISSN-L =       "0453-4514",
  MRclass =      "65C10",
  MRnumber =     "1316097 (95m:65009)",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Mon Feb 27 18:43:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Oper. Res. Soc. Jpn.",
  fjournal =     "Journal of the Operations Research Society of Japan",
  journal-URL =  "https://www.jstage.jst.go.jp/browse/jorsj/list/-char/en",
}

@Article{Tierney:1994:MCE,
  author =       "Luke Tierney",
  title =        "{Markov} Chains for Exploring Posterior
                 Distributions",
  journal =      j-ANN-STAT,
  volume =       "22",
  number =       "4",
  pages =        "1701--1728",
  month =        dec,
  year =         "1994",
  CODEN =        "ASTSC7",
  DOI =          "https://doi.org/10.1214/aos/1176325750",
  ISSN =         "0090-5364 (print), 2168-8966 (electronic)",
  ISSN-L =       "0090-5364",
  bibdate =      "Wed Jun 4 06:40:27 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/annstat1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aos/1176325750;
                 http://www.jstor.org/stable/2242477",
  abstract =     "Several Markov chain methods are available for
                 sampling from a posterior distribution. Two important
                 examples are the Gibbs sampler and the Metropolis
                 algorithm. In addition, several strategies are
                 available for constructing hybrid algorithms. This
                 paper outlines some of the basic methods and strategies
                 and discusses some related theoretical and practical
                 issues. On the theoretical side, results from the
                 theory of general state space Markov chains can be used
                 to obtain convergence rates, laws of large numbers and
                 central limit theorems for estimates obtained from
                 Markov chain methods. These theoretical results can be
                 used to guide the construction of more efficient
                 algorithms. For the practical use of Markov chain
                 methods, standard simulation methodology provides
                 several variance reduction techniques and also give
                 guidance on the choice of sample size and allocation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aos/",
  remark =       "According to \cite{Hitchcock:2003:HMH}, this paper is
                 the origin of the MCMC (Markov Chain Monte Carlo)
                 method.",
}

@Article{vanderMeer:1994:RBG,
  author =       "Hans van der Meer",
  title =        "{Random bit generator in {\TeX}}",
  journal =      j-TUGboat,
  volume =       "15",
  number =       "1",
  pages =        "57--58",
  month =        mar,
  year =         "1994",
  CODEN =        "????",
  ISSN =         "0896-3207",
  bibdate =      "Fri Jul 13 10:24:20 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/index-table-t.html#tugboat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tugboat.bib",
  acknowledgement = ack-bnb # " and " # ack-nhfb,
  journal-URL =  "http://www.tug.org/TUGboat/",
}

@Article{Vattulainen:1994:NTR,
  author =       "Ilpo Vattulainen",
  title =        "New tests of random numbers for simulations in
                 physical systems",
  journal =      "arxiv.org",
  pages =        "x + 88 + 2",
  year =         "1994",
  ISBN =         "951-45-6879-6",
  ISBN-13 =      "978-951-45-6879-4",
  ISSN =         "0786-2547",
  bibdate =      "Fri Feb 24 12:05:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Also issued as report HU-TFT-IR-94-4, Research
                 Institute for Theoretical Physics, University of
                 Helsinki, Helsinki, Finland.",
  series =       "Report series in theoretical physics",
  URL =          "http://arxiv.org/abs/cond-mat/9411062;
                 https://helka.linneanet.fi/cgi-bin/Pwebrecon.cgi?BBID=750921&LANGUAGE=English",
  acknowledgement = ack-nhfb,
  remark =       "Based on the author's Licentiate in Technology thesis,
                 Tampere University of Technology, 1994.",
}

@Article{Vattulainen:1994:PTR,
  author =       "I. Vattulainen and T. Ala-Nissila and K. Kankaala",
  title =        "Physical tests for random numbers in simulations",
  journal =      j-PHYS-REV-LET,
  volume =       "73",
  number =       "19",
  pages =        "2513--2516",
  day =          "7",
  month =        nov,
  year =         "1994",
  CODEN =        "PRLTAO",
  DOI =          "https://doi.org/10.1103/PhysRevLett.73.2513",
  ISSN =         "0031-9007 (print), 1079-7114 (electronic), 1092-0145",
  ISSN-L =       "0031-9007",
  bibdate =      "Sat Sep 17 14:07:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevLett.73.2513",
  abstract =     "We propose three physical tests to measure
                 correlations in random numbers used in Monte Carlo
                 simulations. The first test uses autocorrelation times
                 of certain physical quantities when the Ising model is
                 simulated with the Wolff algorithm. The second test is
                 based on random walks and the third on blocks of n
                 successive numbers. We apply the tests to show that
                 recent errors in high precision Ising simulations using
                 generalized feedback shift register algorithms are due
                 to short range correlations in random number
                 sequences.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review Letters",
  journal-URL =  "http://prl.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@MastersThesis{Weingartner:1994:NCP,
  author =       "A. Weingartner",
  title =        "Nonlinear congruential pseudorandom number
                 generators",
  school =       "University of Salzburg",
  address =      "Salzburg, Austria",
  year =         "1994",
  bibdate =      "Fri Jan 6 11:11:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/weingaThesis.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/weingaThesis.txt",
  acknowledgement = ack-nhfb,
}

@Book{Wolfram:1994:CAC,
  author =       "Stephen Wolfram",
  title =        "Cellular automata and complexity: collected papers",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "596",
  year =         "1994",
  ISBN =         "0-201-62716-7, 0-201-62664-0 (paperback)",
  ISBN-13 =      "978-0-201-62716-9, 978-0-201-62664-3 (paperback)",
  LCCN =         "QA267.5.C45 W65 1994",
  bibdate =      "Thu Feb 23 21:45:27 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0831/93040786-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0831/93040786-d.html",
  acknowledgement = ack-nhfb,
  remark =       "Papers previously published in various journals.",
  subject =      "Cellular automata; Computational complexity",
}

@Article{Zhang:1994:PEE,
  author =       "Hui Zhang and Edward W. Knightly",
  title =        "Providing end-to-end statistical performance
                 guarantees with bounding interval dependent stochastic
                 models",
  journal =      j-SIGMETRICS,
  volume =       "22",
  number =       "1",
  pages =        "211--220",
  month =        may,
  year =         "1994",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/183019.183042",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:16:44 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "This paper demonstrates a new, efficient, and general
                 approach for providing end-to-end performance
                 guarantees in integrated services networks. This is
                 achieved by modeling a traffic source with a family of
                 bounding interval-dependent (BIND) random variables and
                 by using a rate-controlled service discipline inside
                 the network. The traffic model stochastically bounds
                 the number of bits sent over time intervals of
                 different length. The model captures different source
                 behavior over different time scales by making the
                 bounding distribution an explicit function of the
                 interval length. The service discipline, RCSP, has the
                 priority queueing mechanisms necessary to provide
                 performance guarantees in integrated services networks.
                 In addition, RCSP provides the means for efficiently
                 extending the results from a single switch to a network
                 of arbitrary topology. These techniques are derived
                 analytically and then demonstrated with numerical
                 examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Zijp:1994:UTC,
  author =       "J. R. Zijp and J. J. Bosch",
  title =        "Use of tabulated cumulative density functions to
                 generate pseudorandom numbers obeying specific
                 distributions for {Monte Carlo} simulations",
  journal =      j-APPL-OPTICS,
  volume =       "33",
  number =       "3",
  pages =        "533--534",
  day =          "20",
  month =        jan,
  year =         "1994",
  CODEN =        "APOPAI",
  DOI =          "https://doi.org/10.1364/AO.33.000533",
  ISSN =         "0003-6935",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Optics",
  journal-URL =  "http://www.osapublishing.org/ao/browse.cfm",
}

@Article{Ahrens:1995:OTM,
  author =       "J. H. Ahrens",
  title =        "A One-Table Method for Sampling from Continuous and
                 Discrete Distributions",
  journal =      j-COMPUTING,
  volume =       "54",
  number =       "2",
  pages =        "127--146",
  month =        jun,
  year =         "1995",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (65U05)",
  MRnumber =     "96a:65011",
  MRreviewer =   "Sotiris Loukas",
  bibdate =      "Fri Oct 15 15:40:43 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=245&id_volume=18&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "721.1; 723.1; 922.1; 922.2",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Acceptable rejection procedure; Computational methods;
                 Computer programming; Continuous distribution; Discrete
                 distribution; Efficiency; One table method;
                 Probability; Probability density function; Random
                 number generation; Sampling",
}

@Article{Al-Hussaini:1995:UPT,
  author =       "A. N. Al-Hussaini",
  title =        "A Unified Proof of Two Theorems in Statistics",
  journal =      j-SIAM-REVIEW,
  volume =       "37",
  number =       "4",
  pages =        "596--597",
  month =        dec,
  year =         "1995",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1037128",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "60E05",
  MRnumber =     "96j:60016",
  bibdate =      "Sat Mar 29 09:55:35 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/37/4;
                 http://www.siam.org/journals/sirev/sirev374.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://epubs.siam.org/27305.htm",
  abstract =     "The probability integral transformation theorem and a
                 related theorem are proved using the right continuous
                 inverse function of a given monotone nondecreasing
                 function and the simple fact that random variables with
                 the same distribution will have the same distribution
                 under transformation by Borel functions.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Alberta",
  affiliationaddress = "Edmonton, Alberta, Can",
  classification = "721.1; 921.2; 921.3; 921.6; 922.1; 922.2",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Borel functions; Distribution function; Functions;
                 Integral equations; Inverse problems; Lebesgue measure;
                 Mathematical transformations; Probability; Probability
                 integral transformation theorem; Random processes;
                 Random variables; Right continuous inverse; Statistical
                 methods; Theorem proving",
  onlinedate =   "December 1995",
}

@Article{Anguita:1995:CDP,
  author =       "D. Anguita and S. Rovetta and R. Zunino",
  title =        "Compact digital pseudorandom number generator",
  journal =      j-ELECT-LETTERS,
  volume =       "31",
  number =       "12",
  pages =        "956--958",
  day =          "8",
  month =        jun,
  year =         "1995",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19950695",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=391003",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Antipov:1995:COP,
  author =       "M. V. Antipov",
  title =        "Congruence operator of the pseudo-random numbers
                 generator and a modification of {Euclidean}
                 decomposition",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "1",
  number =       "3",
  pages =        "203--219",
  month =        "????",
  year =         "1995",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1995.1.3.203",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1368803 (97e:65012)",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Mon Feb 27 10:56:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1995.1.issue-3/mcma.1995.1.3.203/mcma.1995.1.3.203.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Barnes:1995:APE,
  author =       "John Barnes",
  title =        "The {Ada 95} Predefined Environment",
  journal =      j-ADA-USER-J,
  volume =       "16",
  number =       "4",
  pages =        "215--219",
  month =        dec,
  year =         "1995",
  CODEN =        "AUJOET",
  ISSN =         "0268-652X",
  bibdate =      "Fri Dec 26 08:17:21 1997",
  bibsource =    "Compendex database;
                 http://snowwhite.it.bton.ac.uk/ada/adauser/dec95.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.adauk.org.uk/pubs/jbpredef.htm",
  abstract =     "A standard language may be necessary for the writing
                 of portable programs, however this language alone is
                 insufficient and still needs to be accompanied by
                 standard for frequently used operations and for
                 interfacing to the operating system. Thus, the Ada 95
                 predefined standard library was introduced. Ada 95 is a
                 part of the core language and provided by all
                 implementations of Ada 95. The topics covered include
                 input-output, string and character handling,
                 mathematical functions, the generation of random
                 numbers, and the interface to the commands invoking the
                 program.",
  acknowledgement = ack-nhfb,
  affiliation =  "John Barnes Informatics",
  affiliationaddress = "Reading, Engl",
  classification = "723.1; 723.1.1; 723.2; 902.2; 922.2; C6110B
                 (Software engineering techniques); C6140D (High level
                 languages)",
  corpsource =   "Barnes Informatics, Reading, UK",
  fjournal =     "Ada User Journal",
  journal-URL =  "http://www.ada-europe.org/auj/archive",
  journalabr =   "Ada User J",
  keywords =     "Ada; Ada (programming language); Ada 83; Ada 95;
                 Character handling; character handling; Character sets;
                 Command line interface; Computer software; Data
                 handling; Data structures; Input output programs;
                 Mathematical functions; operating system; portability;
                 portable programs; Predefined library; Random number
                 generation; random number generation; software
                 libraries; Software Package Ada 95; software
                 portability; software standards; standard library;
                 Standards; standards; String handling; string handling;
                 User interfaces",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Baum:1995:CCP,
  author =       "U. Baum and S. Blackburn",
  title =        "Clock-controlled pseudorandom generators on finite
                 groups",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1008",
  pages =        "6--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Bellare:1995:XMN,
  author =       "Mihir Bellare and Roch Gu{\'e}rin and Phillip
                 Rogaway",
  title =        "{XOR MACs}: New Methods for Message Authentication
                 Using Finite Pseudorandom Functions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "963",
  pages =        "15--35",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:02:21 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0963.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0963/09630015.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0963/09630015.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Bowman:1995:EPR,
  author =       "Richard L. Bowman",
  title =        "Evaluating pseudo-random number generators",
  journal =      j-COMPUTERS-AND-GRAPHICS,
  volume =       "19",
  number =       "2",
  pages =        "315--324",
  month =        mar # "--" # apr,
  year =         "1995",
  CODEN =        "COGRD2",
  ISSN =         "0097-8493 (print), 1873-7684 (electronic)",
  ISSN-L =       "0097-8493",
  bibdate =      "Tue Oct 5 22:24:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_free/browse/browse.cgi?year=1995&volume=19&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_sub/browse/browse.cgi?year=1995&volume=19&issue=2&aid=9400158",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Graphics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00978493",
  keywords =     "Mathematica",
}

@Article{Carrasco:1995:RRT,
  author =       "Juan A. Carrasco and Angel Calder{\'o}n",
  title =        "Regenerative randomization: theory and application
                 examples",
  journal =      j-SIGMETRICS,
  volume =       "23",
  number =       "1",
  pages =        "241--252",
  month =        may,
  year =         "1995",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/223587.223613",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:18:56 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "Randomization is a popular method for the transient
                 solution of continuous-time Markov models. Its primary
                 advantages over other methods (i.e., ODE solvers) are
                 robustness and ease of implementation. It is however
                 well-known that the performance of the method
                 deteriorates with the `stiffness' of the model: the
                 number of required steps to solve the model up to time
                 $t$ tends to {\Lambda} $t$ for {\Lambda} $t$
                 {\rightarrow} {\infty}. In this paper we present a new
                 method called regenerative randomization and apply it
                 to the computation of two transient measures for
                 rewarded irreducible Markov models. Regarding the
                 number of steps required in regenerative randomization
                 we prove that: (1) it is smaller than the number of
                 steps required in standard randomization when the
                 initial distribution is concentrated in a single state,
                 (2) for $ \Lambda t \rightarrow \infty $, it is upper
                 bounded by a function $ O(\log (\Lambda t / \epsilon))
                 $, where $ \epsilon $ is the desired relative
                 approximation error bound. Using dependability and
                 performability examples we analyze the performance of
                 the method.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@InProceedings{Chen:1995:IDP,
  author =       "Jian Chen and Paula Whitlock",
  title =        "Implementation of a Distributed Pseudorandom Number
                 Generator",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "168--185",
  year =         "1995",
  bibdate =      "Tue Dec 20 15:39:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Book{Childs:1995:CIH,
  author =       "Lindsay N. Childs",
  title =        "A Concrete Introduction to Higher Algebra",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xv + 522",
  year =         "1995",
  DOI =          "https://doi.org/10.1007/978-1-4419-8702-0",
  ISBN =         "0-387-94484-2 (hardcover), 1-4419-8702-9 (e-book)",
  ISBN-13 =      "978-0-387-94484-5 (hardcover), 978-1-4419-8702-0
                 (e-book)",
  LCCN =         "QA155 .C53 1995",
  bibdate =      "Fri Nov 21 14:16:31 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/matrix-analysis-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Algebra",
  tableofcontents = "Introduction / vii \\
                 1: Numbers / 1 \\
                 2: Induction / 8 \\
                 A. Induction / 8 \\
                 B. Another Form of Induction / 13 \\
                 C. Well-Ordering / 16 \\
                 D. Division Theorem / 18 \\
                 E. Bases / 20 \\
                 F. Operations in Base $a$ / 23 \\
                 3: Euclid's Algorithm / 25 \\
                 A. Greatest Common Divisors / 25 \\
                 B. Euclid's Algorithm / 27 \\
                 C. B{\'e}zout's Identity / 29 \\
                 D. The Efficiency of Euclid's Algorithm / 36 \\
                 E. Euclid's Algorithm and Incommensurability / 40 \\
                 4: Unique Factorization / 47 \\
                 A. The Fundamental Theorem of Arithmetic / 47 \\
                 B. Exponential Notation / 50 \\
                 C. Primes / 55 \\
                 D. Primes in an Interval / 59 \\
                 5: Congruences / 63 \\
                 A. Congruence Modulo $m$ / 63 \\
                 B. Basic Properties / 65 \\
                 C. Divisibility Tricks / 68 \\
                 D. More Properties of Congruence / 71 \\
                 E. Linear Congruences and B{\'e}zout's Identity / 72
                 \\
                 6: Congruence Classes / 76 \\
                 A. Congruence Classes (mod $m$): Examples / 76 \\
                 B. Congruence Classes and $\mathbb{Z}/m\mathbb{Z}$ / 80
                 \\
                 C. Arithmetic Modulo $m$ / 82 \\
                 D. Complete Sets of Representatives / 86 \\
                 E. Units / 88 \\
                 7: Applications of Congruences / 91 \\
                 A. Round Robin Tournaments / 91 \\
                 B. Pseudorandom Numbers / 92 \\
                 C. Factoring Large Numbers by Trial Division / 100 \\
                 D. Sieves / 103 \\
                 E. Factoring by the Pollard Rho Method / 105 \\
                 F. Knapsack Cryptosystems / 111 \\
                 8: Rings and Fields / 118 \\
                 A. Axioms / 118 \\
                 B. $\mathbb{Z}/m\mathbb{Z}$ / 124 \\
                 C. Homomorphisms / 127 \\
                 9: Fermat's and Euler's Theorems / 134 \\
                 A. Orders of Elements / 134 \\
                 B. Fermat's Theorem / 138 \\
                 C. Euler's Theorem / 141 \\
                 D. Finding High Powers Modulo $m$ / 145 \\
                 E. Groups of Units and Euler's Theorem / 147 \\
                 F. The Exponent of an Abelian Group / 152 \\
                 10: Applications of Fermat's and Euler's Theorems / 155
                 \\
                 A. Fractions in Base $a$ / 155 \\
                 B. RSA Codes / 164 \\
                 C. 2-Pseudoprimes / 169 \\
                 D. Trial $a$-Pseudoprime Testing / 175 \\
                 E. The Pollard $p - 1$ Algorithm / 177 \\
                 11: On Groups / 180 \\
                 A. Subgroups / 180 \\
                 B. Lagrange's Theorem / 182 \\
                 C. A Probabilistic Primality Test / 185 \\
                 D. Homomorphisms / 186 \\
                 E. Some Nonabelian Groups / 189 \\
                 12: The Chinese Remainder Theorem / 194 \\
                 A. The Theorem / 194 \\
                 B. Products of Rings and Euler's $\phi$-Function / 202
                 \\
                 C. Square Roots of $1$ Modulo $m$ / 205 \\
                 13: Matrices and Codes / 208 \\
                 A. Matrix Multiplication / 209 \\
                 B. Linear Equations / 212 \\
                 C. Determinants and Inverses / 214 \\
                 D. $M_n(R)$ / 215 \\
                 E. Error-Correcting Codes, $I$ / 217 \\
                 F. Hill Codes / 224 \\
                 14: Polynomials / 231 \\
                 15: Unique Factorization / 239 \\
                 A. Division Theorem / 239 \\
                 B. Primitive Roots / 243 \\
                 C. Greatest Common Divisors / 245 \\
                 D. Factorization into Irreducible Polynomials / 249 \\
                 16: The Fundamental Theorem of Algebra / 253 \\
                 A. Rational Functions / 254 \\
                 B. Partial Fractions / 255 \\
                 C. Irreducible Polynomials over $\mathbb{R}$ / 258 \\
                 D. The Complex Numbers / 260 \\
                 E. Root Formulas / 263 \\
                 F. The Fundamental Theorem / 269 \\
                 G. Integrating / 273 \\
                 17: Derivatives / 277 \\
                 A. The Derivative of a Polynomial / 277 \\
                 B. Sturm's Algorithm / 280 \\
                 18: Factoring in $\mathbb{Q}[x], I$ / 286 \\
                 A. Gauss's Lemma / 286 \\
                 B. Finding Roots / 289 \\
                 C. Testing for Irreducibility / 291 \\
                 19: The Binomial Theorem in Characteristic $p$ / 293
                 \\
                 A. The Binomial Theorem / 293 \\
                 B. Fermat's Theorem Revisited / 297 \\
                 C. Multiple Roots / 300 \\
                 20: Congruences and the Chinese Remainder Theorem / 302
                 \\
                 A. Congruences Modulo a Polynomial / 302 \\
                 B. The Chinese Remainder Theorem / 308 \\
                 21: Applications of the Chinese Remainder Theorem / 310
                 \\
                 A. The Method of Lagrange Interpolation / 310 \\
                 B. Fast Polynomial Multiplication / 313 \\
                 22: Factoring in $\mathbb{F}_p[x]$ and in
                 $\mathbb{Z}[x]$ / 323 \\
                 A. Berlekamp's Algorithm / 323 \\
                 B. Factoring in $\mathbb{Z}[x]$ by Factoring mod $M$ /
                 333 \\
                 C. Bounding the Coefficients of Factors of a Polynomial
                 / 334 \\
                 D. Factoring Modulo High Powers of Primes / 338 \\
                 23: Primitive Roots / 346 \\
                 A. Primitive Roots Modulo $m$ / 346 \\
                 B. Polynomials Which Factor Modulo Every Prime / 351
                 \\
                 24: Cyclic Groups and Primitive Roots / 353 \\
                 A. Cyclic Groups / 353 \\
                 B. Primitive Roots Modulo $p^e$ / 356 \\
                 25: Pseudoprimes / 363 \\
                 A. Lots of Carmichael Numbers / 363 \\
                 B. Strong $a$-Pseudoprimes / 368 \\
                 C. Rabin's Theorem / 372 \\
                 26: Roots of Unity in $\mathbb{Z}/m\mathbb{Z}$ / 378
                 \\
                 A. For Which a Is $m$ an $a$-Pseudoprime? / 378 \\
                 B. Square Roots of $- 1$ in $\mathbb{Z}/p\mathbb{Z}$ /
                 381 \\
                 C. Roots of $- 1$ in $\mathbb{Z}/m\mathbb{Z}$ / 382 \\
                 D. False Witnesses / 385 \\
                 E. Proof of Rabin's Theorem / 388 \\
                 F. RSA Codes and Carmichael Numbers / 392 \\
                 27: Quadratic Residues / 397 \\
                 A. Reduction to the Odd Prime Case / 397 \\
                 B. The Legendre Symbol / 399 \\
                 C. Proof of Quadratic Reciprocity / 405 \\
                 D. Applications of Quadratic Reciprocity / 407 \\
                 28: Congruence Classes Modulo a Polynomial / 414 \\
                 A. The Ring $\mathbb{F}[x]/m(x)$ / 414 \\
                 B. Representing Congruence Classes mod $m(x)$ / 418 \\
                 C. Orders of Elements / 422 \\
                 D. Inventing Roots of Polynomials / 426 \\
                 E. Finding Polynomials with Given Roots / 428 \\
                 29: Some Applications of Finite Fields / 432 \\
                 A. Latin Squares / 432 \\
                 B. Error Correcting Codes / 438 \\
                 C. Reed-Solomon Codes / 450 \\
                 30: Classifying Finite Fields / 464 \\
                 A. More Homomorphisms / 464 \\
                 B. On Berlekamp's Algorithm / 468 \\
                 C. Finite Fields Are Simple / 469 \\
                 D. Factoring $x^{p^*} - x$ in $F_p[x]$ / 471 \\
                 E. Counting Irreducible Polynomials / 474 \\
                 F. Finite Fields / 477 \\
                 G. Most Polynomials in $\mathbb{Z}[x]$ Are Irreducible
                 / 479 \\
                 Hints to Selected Exercises / 483 \\
                 References / 509 \\
                 Index / 513",
}

@InProceedings{Chou:1995:LTI,
  author =       "Wun-Seng Chou and Harald Niederreiter",
  title =        "On the Lattice Test for Inversive Congruential
                 Pseudorandom Numbers",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "186--197",
  year =         "1995",
  MRclass =      "65C10",
  MRnumber =     "1445786 (97k:65017)",
  bibdate =      "Tue Dec 20 15:39:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Chou:1995:PLI,
  author =       "Wun-Seng Chou",
  title =        "The period lengths of inversive congruential
                 recursions",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "73",
  number =       "4",
  pages =        "325--341",
  year =         "1995",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  MRclass =      "11K45 (11B50)",
  MRnumber =     "1366038 (97d:11118)",
  MRreviewer =   "Mary E. Flahive",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@InProceedings{Chow:1995:NRP,
  author =       "Chee-Seng Chow and Amir Herzberg",
  title =        "Network Randomization Protocol: a Proactive
                 Pseudo-Random Generator",
  crossref =     "USENIX:1995:PFUa",
  pages =        "55--64 (or 55--63??)",
  year =         "1995",
  bibdate =      "Tue Oct 22 06:57:35 2002",
  bibsource =    "ftp://ftp.uu.net/library/bibliography;
                 http://www.usenix.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.usenix.org/publications/library/proceedings/security95/chow.html",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM, Thomas J. Watson Research Center",
  keywords =     "security; unix; usenix",
  searchkey =    "su:usenix",
}

@Article{Compagner:1995:OCR,
  author =       "A. Compagner",
  title =        "Operational conditions for random-number generation",
  journal =      j-PHYS-REV-E,
  volume =       "52",
  number =       "5",
  pages =        "5634--5645",
  month =        nov,
  year =         "1995",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.52.5634",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Sun Nov 07 10:56:16 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://pre.aps.org/abstract/PRE/v52/i5/p5634_1",
  abstract =     "Ensemble theory is used to describe arbitrary
                 sequences of integers, whether formed by the decimals
                 of $ \pi $ or produced by a roulette or by any other
                 means. Correlation coefficients of any range and order
                 are defined as Fourier transforms of the ensemble
                 weights. Competing definitions of random sequences are
                 considered. Special attention is given to sequences of
                 random numbers needed for Monte Carlo calculations.
                 Different recipes for those sequences lead to
                 correlations that vary in range and order, but the
                 total amount of correlation is the same for all
                 sequences of a given length (without internal
                 periodicities). For maximum-length sequences produced
                 by linear algorithms, most correlation coefficients are
                 zero, but the remaining ones are of absolute value 1.
                 In well-tempered sequences, these complete correlations
                 are of high order or of very long range. General
                 conditions to be obeyed by random-number generators are
                 discussed and a qualitative method for comparing
                 different recipes is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@InProceedings{Couture:1995:LRC,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "Linear recurrences with carry as random number
                 generators",
  crossref =     "Alexopoulos:1995:WSC",
  pages =        "263--267",
  year =         "1995",
  bibdate =      "Fri Jan 06 16:10:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Cusick:1995:PPN,
  author =       "T. W. Cusick",
  title =        "Properties of the {$ x^2 \bmod N $} pseudorandom
                 number generator",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "41",
  number =       "4",
  pages =        "1155--1159",
  month =        "????",
  year =         "1995",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/18.391261",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Thu Jan 19 16:37:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@Article{Damien:1995:ARV,
  author =       "Paul Damien and Purushottam W. Laud and Adrian F. M.
                 Smith",
  title =        "Approximate Random Variate Generation from Infinitely
                 Divisible Distributions with Applications to {Bayesian}
                 Inference",
  journal =      j-J-R-STAT-SOC-SER-B-METHODOL,
  volume =       "57",
  number =       "3",
  pages =        "547--563",
  month =        "????",
  year =         "1995",
  CODEN =        "JSTBAJ",
  DOI =          "https://doi.org/10.2307/2346156",
  ISSN =         "0035-9246",
  ISSN-L =       "0035-9246",
  bibdate =      "Fri Jan 23 11:53:25 MST 2015",
  bibsource =    "http://www.jstor.org/stable/i316034;
                 https://www.math.utah.edu/pub/tex/bib/jrss-b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2346156",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Royal Statistical Society. Series B
                 (Methodological)",
  journal-URL =  "http://www.jstor.org/journals/00359246.html",
}

@Article{Dan:1995:CDA,
  author =       "Asit Dan and Philip S. Yu and Jen Yao Chung",
  title =        "Characterization of Database Access Pattern for
                 Analytic Prediction of Buffer Hit Probability",
  journal =      j-VLDB-J,
  volume =       "4",
  number =       "1",
  pages =        "127--154",
  month =        jan,
  year =         "1995",
  CODEN =        "VLDBFR",
  ISSN =         "1066-8888 (print), 0949-877X (electronic)",
  ISSN-L =       "1066-8888",
  bibdate =      "Mon Jun 23 10:50:32 MDT 2008",
  bibsource =    "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb4.html;
                 http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
  note =         "Electronic edition.",
  URL =          "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Chung:Jen=Yao.html;
                 http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/d/Dan:Asit.html;
                 http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/y/Yu:Philip_S=.html",
  abstract =     "The analytic prediction of buffer hit probability,
                 based on the characterization of database accesses from
                 real reference traces, is extremely useful for workload
                 management and system capacity planning. The knowledge
                 can be helpful for proper allocation of buffer space to
                 various database relations, as well as for the
                 management of buffer space for a mixed transaction and
                 query environment. Access characterization can also be
                 used to predict the buffer invalidation effect in a
                 multi-node environment which, in turn, can influence
                 transaction routing strategies. However, it is a
                 challenge to characterize the database access pattern
                 of a real workload reference trace in a simple manner
                 that can easily be used to compute buffer hit
                 probability. In this article, we use a characterization
                 method that distinguishes three types of access
                 patterns from a trace: (1) locality within a
                 transaction, (2) random accesses by transactions, and
                 (3) sequential accesses by long queries. We then
                 propose a concise way to characterize the access skew
                 across randomly accessed pages by logically grouping
                 the large number of data pages into a small number of
                 partitions such that the frequency of accessing each
                 page within a partition can be treated as equal. Based
                 on this approach, we present a recursive binary
                 partitioning algorithm that can infer the access skew
                 characterization from the buffer hit probabilities for
                 a subset of the buffer sizes. We validate the buffer
                 hit predictions for single and multiple node systems
                 using production database traces. We further show that
                 the proposed approach can predict the buffer hit
                 probability of a composite workload from those of its
                 component files.",
  acknowledgement = ack-nhfb,
  fjournal =     "VLDB Journal: Very Large Data Bases",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J869",
  keywords =     "access skew; analytic prediction; database access
                 characterization; reference trace; sequential access;
                 workload management",
}

@Article{Dellaportas:1995:RVT,
  author =       "Petros Dellaportas",
  title =        "Random variate transformations in the {Gibbs} sampler:
                 issues of efficiency and convergence",
  journal =      j-STAT-COMPUT,
  volume =       "5",
  number =       "2",
  pages =        "133--140",
  month =        jun,
  year =         "1995",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00143944",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:09 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00143944",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@Article{DeMatteis:1995:CCP,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Controlling correlations in parallel {Monte Carlo}",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "21",
  number =       "1",
  pages =        "73--84",
  day =          "10",
  month =        jan,
  year =         "1995",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C05 (65Y05)",
  MRnumber =     "1 314 379",
  bibdate =      "Fri Aug 6 10:14:13 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1995&volume=21&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1995&volume=21&issue=1&aid=939",
  acknowledgement = ack-nhfb,
  classification = "B0240G (Monte Carlo methods); C1140G (Monte Carlo
                 methods); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Divisione Calcolo, ENEA, Bologna, Italy",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "computation velocity; control estimator; correlations
                 control; Monte Carlo methods; numbers; parallel
                 algorithms; parallel Monte Carlo; processes;
                 sensitivity; stochastic; truly random",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dudewicz:1995:EBR,
  author =       "E. J. Dudewicz and E. C. van der Meulen and M. G.
                 SriRam and N. K. W. Teoh",
  title =        "Entropy-Based Random Number Evaluation",
  journal =      j-AM-J-MATH-MANAGE-SCI,
  volume =       "15",
  number =       "1--2",
  pages =        "115--153",
  month =        "????",
  year =         "1995",
  CODEN =        "AMMSDX",
  ISSN =         "0196-6324",
  bibdate =      "Sat Mar 3 10:00:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Journal of Mathematical and Management
                 Sciences",
}

@Article{Dwyer:1995:QPR,
  author =       "Jerry Dwyer",
  title =        "Quick and Portable Random Number Generators",
  journal =      j-CCCUJ,
  volume =       "13",
  number =       "6",
  pages =        "33--??",
  month =        jun,
  year =         "1995",
  CODEN =        "CCUJEX",
  ISSN =         "1075-2838",
  bibdate =      "Fri Aug 30 16:52:23 MDT 1996",
  bibsource =    "http://www.cuj.com/cbklist.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "C/C++ Users Journal",
}

@Book{Edgington:1995:RT,
  author =       "Eugene S. Edgington",
  title =        "Randomization tests",
  volume =       "147",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Third",
  pages =        "xxii + 409",
  year =         "1995",
  ISBN =         "0-8247-9669-1",
  ISBN-13 =      "978-0-8247-9669-3",
  LCCN =         "QA277 .E32 1995",
  bibdate =      "Thu Jan 26 12:03:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0647/95021003-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Statistical hypothesis testing",
}

@Article{Eichenauer-Herrmann:1995:DBN,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Discrepancy Bounds for Nonoverlapping Pairs of
                 Quadratic Congruential Pseudorandom Numbers",
  journal =      j-ARCH-MATH,
  volume =       "65",
  number =       "4",
  pages =        "362--368",
  month =        "????",
  year =         "1995",
  CODEN =        "ACVMAL",
  ISSN =         "0003-889X (print), 1420-8938 (electronic)",
  ISSN-L =       "0003-889X",
  bibdate =      "Sat Mar 3 10:11:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Archiv der Mathematik",
  journal-URL =  "http://link.springer.com/journal/volumesAndIssues/13",
}

@Article{Eichenauer-Herrmann:1995:IUB,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "An improved upper bound for the discrepancy of
                 quadratic congruential pseudorandom numbers",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "LXIX",
  number =       "2",
  pages =        "193--198",
  month =        "????",
  year =         "1995",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Eichenauer-Herrmann:1995:NPE,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Nonoverlapping pairs of explicit inversive
                 congruential pseudorandom numbers",
  journal =      j-MONAT-MATH,
  volume =       "119",
  number =       "1--2",
  pages =        "49--61",
  month =        mar,
  year =         "1995",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01292768",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1315683 (95m:11082)",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Eichenauer-Herrmann:1995:PNG,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Pseudorandom Number Generation by Nonlinear Methods",
  journal =      j-INT-STAT-REV,
  volume =       "63",
  number =       "2",
  pages =        "247--255",
  month =        aug,
  year =         "1995",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Tue Dec 20 08:36:22 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annapplprobab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1403620",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
  remark-1 =     "From the middle of page 248: ``Recently, Marsaglia \&
                 Zaman \cite{Marsaglia:1991:NCR} introduced the class of
                 add-with-carry and subtract-with- borrow pseudorandom
                 number generators which can produce very long periods.
                 However, it is shown in \cite{Tezuka:1993:LSA} that up
                 to a small truncation error these generators are
                 equivalent to certain linear congruential generators
                 with extremely bad lattice structure in high
                 dimensions.''",
  remark-2 =     "From page 250: ``This behaviour of the discrepancy
                 $D(s)$ in dimensions $s \geq (d + 1)$ is a severe
                 drawback of the nonlinear congruential method, at least
                 if the degree $d$ of the underlying permutation
                 polynomial $g$ is small.'' [Here, $s$ is the length of
                 a sequence of consecutive pseudorandom numbers from the
                 inversive congruential generator; thus, such generators
                 are undesirable unless parameters are chosen such that
                 $d$ is larger that $s$.]",
}

@Article{Eichenauer-Herrmann:1995:QCP,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Quadratic congruential pseudorandom numbers:
                 distribution of triples",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "62",
  number =       "2",
  pages =        "239--253",
  day =          "20",
  month =        sep,
  year =         "1995",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(94)00105-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042794001056",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@InProceedings{Eichenauer-Herrmann:1995:RCM,
  author =       "J. Eichenauer-Herrmann and F. Emmerich",
  editor =       "P. Hellekalek and G. Larcher and P. Zinterhof",
  booktitle =    "{Proceedings of the 1st Salzburg Minisymposium on
                 Pseudorandom Number Generation and Quasi-Monte Carlo
                 Methods, Salzburg, November 18, 1994}",
  title =        "A review of compound methods for pseudorandom number
                 generation",
  volume =       "ACPC/TR 95-4",
  publisher =    "ACPC -- Austrian Center for Parallel Computation,
                 University of Vienna",
  address =      "Vienna, Austria",
  pages =        "5--14",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:13:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Technical Report Series",
  acknowledgement = ack-nhfb,
}

@Article{Eichenauer-Herrmann:1995:UAA,
  author =       "J. Eichenauer-Herrmann",
  title =        "A Unified Approach to the Analysis of Compound
                 Pseudorandom Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "1",
  number =       "1",
  pages =        "102--114",
  month =        jan,
  year =         "1995",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1995.1007",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579785710076",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Entacher:1995:IPN,
  author =       "K. Entacher and H. Leeb",
  title =        "Inversive pseudorandom number generators: empirical
                 results",
  crossref =     "DePietro:1995:PNP",
  pages =        "??--??",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:14:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/leebSor.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/leebSor.txt",
  acknowledgement = ack-nhfb,
}

@InProceedings{Entacher:1995:PSS,
  author =       "K. Entacher and P. Hellekalek",
  title =        "Parallel Stochastic Simulation: Inversive Pseudorandom
                 Number Generators",
  crossref =     "DePietro:1995:PNP",
  pages =        "1--14",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:15:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Feige:1995:RGP,
  author =       "Uriel Feige",
  title =        "Randomized graph products, chromatic numbers, and
                 {Lovasz} $j$-function",
  crossref =     "ACM:1995:PTS",
  pages =        "635--640",
  year =         "1995",
  bibdate =      "Wed Feb 20 18:34:02 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/225058/p635-feige/p635-feige.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/225058/p635-feige/",
  acknowledgement = ack-nhfb,
}

@Article{Fleischer:1995:TTP,
  author =       "Karlheinz Fleischer",
  title =        "Two tests of pseudo random number generators for
                 independence and uniform distribution",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "52",
  number =       "4",
  pages =        "311--322",
  month =        jul,
  year =         "1995",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659508811682",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:39:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659508811682",
  abstract =     "Pseudo random number generators are compared through
                 tests of uniformity and independence of tuples
                 consecutively-generated random numbers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Gardy:1995:DAS,
  author =       "Dani{\`e}le Gardy and Guy Louchard",
  title =        "Dynamic analysis of some relational databases
                 parameters",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "125--159",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=144&issue=1-2&aid=1939",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C6160D
                 (Relational databases)",
  corpsource =   "Lab. PRISM, Versailles Univ., Saint-Quentin, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "covariance; deletions; dynamic analysis; Gaussian
                 processes; insertions; probability distribution;
                 queries; query optimization; query processing; random
                 variable; relational databases; relational databases
                 parameters; relational operator; updates",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Gilks:1995:ARM,
  author =       "W. R. Gilks and N. G. Best and K. K. C. Tan",
  title =        "Adaptive rejection {Metropolis} sampling within
                 {Gibbs} sampling",
  journal =      j-APPL-STAT,
  volume =       "44",
  number =       "4",
  pages =        "455--472",
  year =         "1995",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Apr 21 10:27:28 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/as1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  note =         "See corrigendum \cite{Gilks:1997:CAR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Gutbrod:1995:FRN,
  author =       "F. Gutbrod",
  title =        "A fast random number generator for the {Intel Paragon}
                 supercomputer",
  journal =      j-COMP-PHYS-COMM,
  volume =       "87",
  number =       "3",
  pages =        "291--306",
  month =        jun,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(95)00005-Z",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Wed Mar 18 12:33:29 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 library database",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559500005Z",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@TechReport{Hallgren:1995:LCG,
  author =       "Sean Hallgren",
  title =        "Linear Congruential Generators Over Elliptic Curves",
  type =         "Technical Report",
  number =       "CS-94-143",
  institution =  "School of Computer Science, Carnegie Mellon
                 University",
  address =      "Pittsburgh, PA, USA",
  pages =        "12",
  year =         "1995",
  bibdate =      "Tue Mar 06 20:45:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Random numbers are useful in many applications such as
                 Monte Carlo simulation, randomized algorithms, games,
                 and password generation. It is important to be able to
                 prove facts about pseudo-random number generators, both
                 about the distribution and the predictability of the
                 pseudo-random numbers. I discuss a pseudo-random number
                 generator based on elliptic curves taken over finite
                 fields. This class of generators can produce provably
                 good pseudo-number generators. Also, I prove that the
                 analog of a faster pseudo-random number generator
                 embedded in an elliptic curve fails to produce good
                 pseudo-random numbers.",
  acknowledgement = ack-nhfb,
  keywords =     "cryptography; elliptic curves; linear congruential
                 generators; pseudo-random number generation",
}

@Article{Hamilton:1995:EBU,
  author =       "Kenneth G. Hamilton",
  title =        "Erratum: {{\booktitle{A universal GFSR random number
                 generator for personal computers}} [Comput. Phys.
                 Commun. {\bf 85} (1995) 127--152]}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "86",
  number =       "1--2",
  pages =        "208--208",
  month =        apr,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(95)00024-A",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 21:29:52 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Hamilton:1995:UGR}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559500024A",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hamilton:1995:UGR,
  author =       "Kenneth G. Hamilton",
  title =        "A universal {GFSR} random number generator for
                 personal computers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "85",
  number =       "1",
  pages =        "127--152",
  month =        jan,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(94)00114-H",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{Hamilton:1995:EBU}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559400114H",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Han:1995:PGF,
  author =       "Y. Han and L. A. Hemaspaandra",
  title =        "Pseudorandom Generators and the Frequency of
                 Simplicity",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "900",
  pages =        "50--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Hellekalek:1995:CBP,
  author =       "P. Hellekalek",
  editor =       "P. Hellekalek and G. Larcher and P. Zinterhof",
  booktitle =    "{Proceedings of the 1st Salzburg Minisymposium on
                 Pseudorandom Number Generation and Quasi-Monte Carlo
                 Methods, Salzburg, November 18, 1994}",
  title =        "Correlations between pseudorandom numbers: theory and
                 numerical practice",
  volume =       "ACPC/TR 95-4",
  publisher =    "ACPC -- Austrian Center for Parallel Computation,
                 University of Vienna",
  address =      "Vienna, Austria",
  pages =        "43--73",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:16:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Technical Report Series",
  acknowledgement = ack-nhfb,
}

@Article{Hellekalek:1995:GDE,
  author =       "P. Hellekalek",
  title =        "General Discrepancy Estimates {III}: the
                 {Erd{\H{o}}s--Tur{\'a}n--Koksma} Inequality for the
                 {Haar} Function System",
  journal =      j-MONAT-MATH,
  volume =       "120",
  number =       "1",
  pages =        "25--45",
  month =        "????",
  year =         "1995",
  CODEN =        "MNMTA2",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Sat Mar 3 10:14:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 0827.11047",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@InProceedings{Hellekalek:1995:IPN,
  author =       "P. Hellekalek",
  title =        "Inversive pseudorandom number generators: concepts,
                 results, and links",
  crossref =     "Alexopoulos:1995:WSC",
  pages =        "255--262",
  year =         "1995",
  DOI =          "https://doi.org/10.1109/WSC.1995.478732",
  bibdate =      "Fri Dec 23 22:13:39 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://random.mat.sbg.ac.at",
  acknowledgement = ack-nhfb,
  remark =       "The paper says that a C implementation of inversive
                 congruential generators is available at the URL in this
                 entry. It also reports on page 260 that if ICG(p, a, 1)
                 is a maximal-period generator with $ P = p $, $ A = a
                 $, and $ C = 1 $, then every other generator of the
                 form ICG(p, a $ c^2 $, c) also has maximal period, but
                 produces a different sequence of random numbers. That
                 theorem provides an easy way to produce families of
                 generators for use in parallel computations.",
}

@Article{Hennecke:1995:FIR,
  author =       "M. Hennecke",
  title =        "A {Fortran 90} interface to random number generation",
  journal =      j-COMP-PHYS-COMM,
  volume =       "90",
  number =       "1",
  pages =        "117--120",
  day =          "1",
  month =        sep,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(95)00065-N",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Jan 27 07:37:25 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559500065N",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hermanns:1995:FCI,
  author =       "Holger Hermanns and Michael Rettelbach and Thorsten
                 Weiss",
  title =        "Formal characterisation of immediate actions in {SPA}
                 with nondeterministic branching",
  journal =      j-COMP-J,
  volume =       "38",
  number =       "7",
  pages =        "530--541",
  month =        "????",
  year =         "1995",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Wed Jul 21 09:54:34 MDT 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/Volume_38/Issue_07/Vol38_07.index.html;
                 https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.oup.co.uk/computer_journal/Volume_38/Issue_07/Vol38_07.body.html#AbstractHermanns",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1140Z (Other topics in
                 statistics); C6110F (Formal methods)",
  corpsource =   "IMMD VII, Erlangen-Nurnberg Univ., Germany",
  email-1 =      "hrherman@immd7.informatik.uni-erlangen.de",
  email-2 =      "mlrettel@immd7.informatik.uni-erlangen.de",
  email-3 =      "tnweiss@immd7.informatik.uni-erlangen.de",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algebraic foundations; bisimulation; conservative
                 extension; enriched calculus; equational theory;
                 exponentially distributed durations; formal
                 characterisation; formal semantics; formal
                 specification; immediate actions; Markov processes;
                 Markovian bisimulation; Markovian observational
                 congruence; nondeterministic branching; observational
                 congruence; process algebra; random variable; SPA;
                 stochastic counterpart; stochastic notion; stochastic
                 process algebras; stochastic processes; strong",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herring:1995:TCR,
  author =       "Charles Herring and Julian I. Palmore",
  title =        "Technical Correspondence: Random Number Generators are
                 Chaotic",
  journal =      j-CACM,
  volume =       "38",
  number =       "1",
  pages =        "121--122",
  month =        jan,
  year =         "1995",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu May 30 09:41:10 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/204895.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@Article{Hormann:1995:RTS,
  author =       "Wolfgang H{\"o}rmann",
  title =        "A Rejection Technique for Sampling from {T}-Concave
                 Distributions",
  journal =      j-TOMS,
  volume =       "21",
  number =       "2",
  pages =        "182--193",
  month =        jun,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65D20",
  MRnumber =     "96b:65018",
  bibdate =      "Tue Oct 10 15:50:31 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/203082.203089;
                 http://www.acm.org/pubs/citations/journals/toms/1995-21-2/p182-hormann/",
  acknowledgement = ack-rfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "Log-concave distributions; rejection method; universal
                 method",
  subject =      "G.3 [Probability and Statistics]: Random Number
                 Generation",
}

@Article{Kaliski:1995:MIA,
  author =       "Burton S. {Kaliski, Jr.}",
  title =        "The {Montgomery} inverse and its applications",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "44",
  number =       "8",
  pages =        "1064--1065",
  month =        aug,
  year =         "1995",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.403725",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 6 08:01:29 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See improvements
                 \cite{Savas:2000:MMI,McIvor:2004:IMM}.",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=403725",
  abstract =     "The Montgomery inverse of $b$ modulo $a$ is $ b^{-1}
                 2^n \bmod a $, where $n$ is the number of bits in $a$.
                 The right-shifting binary algorithm for modular
                 inversion is shown naturally to compute the new inverse
                 in fewer operations than the ordinary modular inverse.
                 The new inverse facilitates recent work by Ko{\c{c}} on
                 modular exponentiation and has other applications in
                 cryptography",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  remark =       "From Theorem 1 of the paper, with $ a > b > 0 $, the
                 Montgomery modular inverse of $b$ with respect to $a$
                 can be computed via algorithm MontInverse requires
                 intermediate values between $0$ and $ 2 a - 1 $. Thus,
                 in the common case where $b$ is the largest signed
                 integer, the intermediates may be representable as
                 unsigned integers.",
}

@Article{Kessler:1995:GOC,
  author =       "Christoph W. Kessler and Thomas Rauber",
  title =        "Generating optimal contiguous evaluations for
                 expression {DAGs}",
  journal =      j-COMP-LANGS,
  volume =       "21",
  number =       "2",
  pages =        "113--127",
  month =        jul,
  year =         "1995",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universit{\"a}t des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C1160 (Combinatorial mathematics); C6120 (File
                 organisation); C6115 (Programming support); C4240C
                 (Computational complexity)",
  classification = "721.1; 723.1; 723.2; 921.4; 921.5; 922.2",
  corpsource =   "Comput. Sci. Dept., Saarlandes Univ., Saarbrucken,
                 Germany",
  fjournal =     "Computer Languages",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "Algorithms; application programs; automatic
                 programming; basic block; Basic blocks; Block codes;
                 code generation; complete search algorithm;
                 Computational complexity; computational complexity;
                 Computer software; Computer software selection and
                 evaluation; directed; Directed acyclic graph; directed
                 acyclic graphs; evaluations; export nodes; expression
                 DAG; graphs; import nodes; labeling scheme; Linear
                 programming; minimal; modified; NP-complete; optimal
                 contiguous evaluations generation; optimising
                 compilers; Optimization; problem; Program compilers;
                 Program optimization; program optimization; Random
                 number generation; redundant; register allocation;
                 Register allocation; register number; searching;
                 storage allocation; tree; trees; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical; X
                 Experimental",
}

@Article{Koc:1995:RCS,
  author =       "Cemal Ko{\c{c}}",
  title =        "Recurring-with-carry sequences",
  journal =      j-J-APPL-PROBAB,
  volume =       "32",
  number =       "4",
  pages =        "966--971",
  month =        dec,
  year =         "1995",
  CODEN =        "JPRBAM",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/3215210",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html;
                 http://projecteuclid.org/euclid.jap/",
}

@Article{Kubota:1995:DRE,
  author =       "K. Kubota",
  title =        "On distribution of rounding errors generated in
                 additions and subtractions of floating-point numbers",
  journal =      "Transactions of the Japan Society for Industrial and
                 Applied Mathematics",
  volume =       "5",
  number =       "1",
  pages =        "37--46",
  month =        "????",
  year =         "1995",
  CODEN =        "????",
  ISSN =         "0917-2246",
  bibdate =      "Thu Dec 14 11:25:18 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Analyzing the behaviour of rounding errors generated
                 in additions and subtractions of floating-point numbers
                 and regarding them as random variables, we propose a
                 slightly strange model for their distribution. The
                 model gives distributions which approximate the
                 observed generated relative errors more precisely than
                 the uniform distribution which is usually adopted in
                 probabilistic analysis of rounding errors.",
  acknowledgement = ack-nhfb,
  affiliation =  "Fac. of Sci. and Eng., Chuo Univ., Tokyo, Japan",
  classification = "C1140 (Probability and statistics); C4110 (Error
                 analysis in numerical methods); C5230 (Digital
                 arithmetic methods)",
  keywords =     "Additions; Distribution; Floating-point numbers;
                 Probabilistic analysis; Random variables; Relative
                 errors; Rounding errors; Subtractions; Uniform
                 distribution",
  language =     "Japanese",
  pubcountry =   "Japan",
  thesaurus =    "Error analysis; Floating point arithmetic;
                 Probability; Random processes",
}

@Article{Kurita:1995:DWD,
  author =       "Yoshiharu Kurita and Makoto Matsumoto",
  title =        "Deviation of the weight distribution of sequences
                 generated by generalized feedback shift registers",
  journal =      "S{\=u}rikaisekikenky{\=u}sho K\=oky{\=u}roku",
  volume =       "932",
  pages =        "82--102",
  year =         "1995",
  CODEN =        "????",
  ISSN =         "????",
  MRclass =      "94A55 (68Q99)",
  MRnumber =     "1403179",
  bibdate =      "Thu Dec 22 06:32:18 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Various problems in stochastic numerical analysis, II
                 (Japanese) (Kyoto, 1995)",
  acknowledgement = ack-nhfb,
  fjournal =     "S{\=u}rikaisekikenky{\=u}sho K\=oky{\=u}roku",
}

@Article{Lee:1995:CSS,
  author =       "E.-Y Lee and K. J. Kim and U. J. Choi",
  title =        "A construction of the simplest super pseudorandom
                 permutation generator",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "29",
  number =       "8",
  pages =        "19--25",
  month =        apr,
  year =         "1995",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 19:11:28 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/089812219500026U",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@InProceedings{Leeb:1995:DT,
  author =       "H. Leeb",
  editor =       "P. Hellekalek and G. Larcher and P. Zinterhof",
  booktitle =    "{Proceedings of the 1st Salzburg Minisymposium on
                 Pseudorandom Number Generation and Quasi-Monte Carlo
                 Methods, Salzburg, November 18, 1994}",
  title =        "On the digit test",
  volume =       "ACPC/TR 95-4",
  publisher =    "ACPC -- Austrian Center for Parallel Computation,
                 University of Vienna, Austria",
  address =      "Vienna, Austria",
  pages =        "109--121",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Technical Report Series",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/dtest.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/dtest.txt",
  acknowledgement = ack-nhfb,
}

@MastersThesis{Leeb:1995:RNC,
  author =       "Hannes Leeb",
  title =        "Random numbers for computer simulation",
  type =         "{Diplomarbeit zur Erlangung des Magistergrades an der
                 Naturwissenschaftlichen Fakult{\"a}t}",
  school =       "University of Salzburg",
  address =      "Salzburg, Austria",
  pages =        "137",
  month =        jan,
  year =         "1995",
  bibdate =      "Thu Dec 29 15:53:55 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.inf.utfsm.cl/~hallende/download/Simul-2-2002/leebThesis.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Lev:1995:TVD,
  author =       "V. F. Lev",
  title =        "On two versions of {$ L^2 $}-discrepancy and
                 geometrical interpretation of diaphony",
  journal =      j-ACTA-MATH-HUNG,
  volume =       "69",
  number =       "4",
  pages =        "281--300",
  month =        "????",
  year =         "1995",
  CODEN =        "ACMTAV",
  ISSN =         "0001-5954, 0236-5294, 1588-2632",
  ISSN-L =       "0001-5954",
  bibdate =      "Sat Mar 3 10:18:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Acta Math. Hungar.",
  fjournal =     "Acta mathematica Academiae Scientiarum Hungaricae",
}

@Article{Mahlooji:1995:GAR,
  author =       "Hashem Mahlooji",
  title =        "Generating Antithetic Random Variates in Simulation of
                 a Replacement Process by Rejection Method",
  journal =      j-SIMULATION,
  volume =       "65",
  number =       "2",
  pages =        "94--100",
  month =        aug,
  year =         "1995",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979506500202",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 11:22:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/65/2/94.abstract",
  abstract =     "Analysis of a replacement process provides the needed
                 insight into prediction of the replacement requirements
                 of a system. Accurate prediction of such requirements
                 can lead to cost savings as well as improved system
                 performance. When the component lives are not
                 exponentially distributed, simulation becomes a
                 potentially suitable method of analysis. This paper
                 deals with Gamma distributed component lives whose
                 deviates are generated through the so-called Rejection
                 Method. It will be shown that antithetic random
                 deviates can be generated through the rejection method
                 to estimate the renewal function in a single component
                 replacement process. A theorem proved by George is
                 modified and extended to the case at hand. Finally, an
                 algorithm is developed, and along with the experimental
                 results, will be presented. A replacement process is
                 chosen as an example through which to verify the merits
                 of the proposed algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Makino:1995:PFS,
  author =       "Jun Makino and Osamu Miyamura",
  title =        "Parallelized feedback shift register generators of
                 pseudorandom numbers",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "21",
  number =       "6",
  pages =        "1015--1028",
  day =          "12",
  month =        jun,
  year =         "1995",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10 (94A55)",
  MRnumber =     "1 336 096",
  bibdate =      "Fri Aug 6 10:14:30 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1995&volume=21&issue=6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1995&volume=21&issue=6&aid=987",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C5230 (Digital
                 arithmetic methods); C6130 (Data handling techniques);
                 C6150N (Distributed systems software)",
  corpsource =   "Dept. of Bus. Adm., Fukuyama Univ., Japan",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  keywords =     "binary sequences; bit; correlation properties;
                 feedback; feedback shift register; generators; Monte
                 Carlo methods; parallel; parallel random number
                 generators; parallelized feedback shift register;
                 processing; pseudorandom number; random number
                 generation; sequence; structure",
  treatment =    "P Practical",
}

@Misc{Marsaglia:1995:MRN,
  author =       "George Marsaglia",
  title =        "The {Marsaglia} Random Number {CDROM} including the
                 {Diehard Battery of Tests} of Randomness",
  howpublished = "Web site at the Department of Statistics, Florida
                 State University, Tallahassee, FL, USA.",
  year =         "1995",
  bibdate =      "Sat Mar 03 07:40:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://stat.fsu.edu/pub/diehard/",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:1995:RVI,
  author =       "G. Marsaglia",
  title =        "Random variables with independent integer and
                 fractional parts",
  journal =      j-STAT-NEERLANDICA,
  volume =       "49",
  number =       "2",
  pages =        "133--137",
  month =        jul,
  year =         "1995",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1111/j.1467-9574.1995.tb01460.x",
  ISSN =         "0039-0402 (print), 1467-9574 (electronic)",
  ISSN-L =       "0039-0402",
  MRclass =      "62E10",
  MRnumber =     "96d:62013",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  ZMnumber =     "0831.62015",
  abstract =     "For random variables with independent integer and
                 fractional parts a canonical form is given for those
                 with positive differentiable densities, and a condition
                 ensuring exponentiality is made less restrictive.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistica Neerlandica. Journal of the Netherlands
                 Society for Statistics and Operations Research",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9574",
  keywords =     "canonical form; characterizations; exponential
                 distribution; independent digits; independent integer
                 and fractional parts; positive differentiable
                 densities",
  onlinedate =   "29 April 2008",
  ZMclass =      "62E10 Structure theory of statistical distributions
                 60E05 General theory of probability distributions",
}

@Article{Mascagni:1995:FHQ,
  author =       "Michael Mascagni and Steven A. Cuccaro and Daniel V.
                 Pryor and M. L. Robinson",
  title =        "A Fast, High Quality, and Reproducible Parallel
                 Lagged-{Fibonacci} Pseudorandom Number Generator",
  journal =      j-J-COMPUT-PHYS,
  volume =       "119",
  number =       "2",
  pages =        "211--219",
  month =        jul,
  year =         "1995",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1006/jcph.1995.1130",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:03 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0021999185711308",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@TechReport{Mascagni:1995:PPNa,
  author =       "Michael Mascagni and M. L. Robinson and Daniel V.
                 Pryor and Steven A. Cuccaro",
  title =        "Parallel Pseudorandom Number Generation Using Additive
                 Lagged-{Fibonacci} Recursions",
  type =         "Report",
  number =       "????",
  institution =  "Supercomputing Research Center, IDA",
  address =      "????",
  pages =        "15",
  month =        "????",
  year =         "1995",
  bibdate =      "Thu Jan 19 17:49:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.fsu.edu/~mascagni/papers/RIJP1995_1.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mascagni:1995:PPNb,
  author =       "Michael Mascagni and M. L. Robinson and Daniel V.
                 Pryor and Steven A. Cuccaro",
  title =        "Parallel Pseudorandom Number Generation Using Additive
                 Lagged-{Fibonacci} Recursions",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "263--277",
  year =         "1995",
  bibdate =      "Tue Dec 20 15:39:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Matus:1995:CIAa,
  author =       "F. Mat{\'u}{\v{s}} and M. Studen{\'y}",
  title =        "Conditional independences among four random variables.
                 {I}",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "4",
  number =       "3",
  pages =        "269--278",
  month =        sep,
  year =         "1995",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548300001644",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "68T30 (05B35 60A99)",
  MRnumber =     "MR1356579 (97g:68219)",
  MRreviewer =   "Ram Shanmugam",
  bibdate =      "Sat Nov 26 17:00:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Matus:1995:CIAb,
  author =       "F. Mat{\'u}{\v{s}}",
  title =        "Conditional independences among four random variables.
                 {II}",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "4",
  number =       "4",
  pages =        "407--417",
  month =        dec,
  year =         "1995",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548300001747",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "68T30 (05B35 60A99)",
  MRnumber =     "MR1377558 (97g:68220)",
  MRreviewer =   "Ram Shanmugam",
  bibdate =      "Sat Nov 26 17:00:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Micali:1995:SMG,
  author =       "Silvio Micali and Ray Sidney",
  title =        "A Simple Method for Generating and Sharing
                 Pseudo-Random Functions, with Applications to
                 {Clipper}-like Key Escrow Systems",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "963",
  pages =        "185--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:02:21 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t0963.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/0963/09630185.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/0963/09630185.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Miller:1995:RAC,
  author =       "John W. Miller",
  title =        "Random access from compressed datasets with perfect
                 value hashing",
  journal =      j-IEEE-INT-SYMP-INF-THEORY,
  pages =        "454--454",
  year =         "1995",
  CODEN =        "PISTFZ",
  DOI =          "https://doi.org/10.1109/ISIT.1995.550441",
  ISSN =         "0271-4655 (print), 2157-8125 (electronic)",
  ISSN-L =       "0271-4655",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib",
  note =         "IEEE catalog number 95CB35738.",
  abstract =     "A representation technique is presented allowing for
                 quick access of individual records from a static
                 compressed dataset. Given a collection of key-record
                 pairs, the representation allows the appropriate short
                 record to be returned for any given key. The approach
                 is a generalization of Perfect Address Hashing. The new
                 approach, called Perfect Value Hashing, uses a
                 carefully chosen pseudo-random number generator to
                 directly produce the correct record for any key in the
                 dataset. This contrasts with Address Hashing where the
                 random number provides an address which is then used to
                 recover the record from a separate table. Value Hashing
                 doesn't have the theoretical limitations of Address
                 Hashing, and in practice is more space efficient for
                 records of size less than 36 bits. Value Hashing has
                 the added benefit (important when the records are
                 encoded for compression) that variable length records
                 can be represented without an increase in the size of
                 the encoded records. This new technique was used to
                 provide random access from a highly compressed spelling
                 dictionary.",
  acknowledgement = ack-nhfb,
  affiliation =  "One Microsoft Way",
  affiliationaddress = "Redmond, WA, USA",
  classification = "723.2; 921.6; 922.2",
  conference =   "Proceedings of the 1995 IEEE International Symposium
                 on Information Theory",
  fjournal =     "IEEE International Symposium on Information Theory",
  journalabr =   "IEEE Int Symp Inf Theor Proc",
  keywords =     "Algorithms; Data compression; Data processing; Data
                 sets; Data structures; Encoding (symbols); File
                 organization; Perfect address hashing; Perfect value
                 hashing; Random number generation; Spelling
                 dictionary",
  meetingaddress = "Whistler, BC, Can",
  meetingdate =  "Sep 17--22 1995",
  meetingdate2 = "09/17--22/95",
  sponsor =      "IEEE",
}

@TechReport{Moler:1995:CCR,
  author =       "Cleve B. Moler",
  title =        "{Cleve}'s Corner: Random thoughts: $ 10^{435} $ years
                 is a very long time",
  type =         "Technical note",
  institution =  inst-MATHWORKS,
  address =      inst-MATHWORKS:adr,
  pages =        "2",
  month =        "Fall",
  year =         "1995",
  bibdate =      "Thu Oct 24 07:16:21 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.mathworks.com/company/newsletter/pdf/Cleve.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "Matlab",
}

@Article{Montanari:1995:CRG,
  author =       "Gian Carlo Montanari and Andrea Cavallini and Laura
                 Tommasini and Mario Cacciari and Alfredo Contin",
  title =        "Comparison of random generators for {Monte Carlo}
                 estimates of {Weibull} parameters",
  journal =      j-METRON,
  volume =       "53",
  number =       "1--2",
  pages =        "55--77",
  month =        "????",
  year =         "1995",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  MRclass =      "65C05 65C10 62N05",
  bibdate =      "Sun Jul 5 08:55:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0862.62018; 00954899",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  keywords =     "confidence intervals; maximum likelihood estimator;
                 pseudo-random number generators; two-parameter Weibull
                 distribution",
}

@Article{Morokoff:1995:QMC,
  author =       "William J. Morokoff and Russel E. Caflisch",
  title =        "Quasi-{Monte Carlo} Integration",
  journal =      j-J-COMPUT-PHYS,
  volume =       "122",
  number =       "2",
  pages =        "218--230",
  month =        dec,
  year =         "1995",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1006/jcph.1995.1209",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:06 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0021999185712090",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@InCollection{Mullen:1995:TNS,
  author =       "Gary L. Mullen and Arijit Mahalanabis and Harald
                 Niederreiter",
  title =        "Tables of $ (t, m, s) $-net and $ (t, s) $-sequence
                 parameters",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "58--86",
  year =         "1995",
  bibdate =      "Sat Mar 3 10:21:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Nelson:1995:UCR,
  author =       "B. L. Nelson and F. J. Matejcik",
  title =        "Using {Common Random Numbers} for Indifference-Zone
                 Selection and Multiple Comparisons in Simulation",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "41",
  number =       "??",
  pages =        "1935--1945",
  month =        "????",
  year =         "1995",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Niederreiter:1995:MRM,
  author =       "Harald Niederreiter",
  title =        "The multiple-recursive matrix method for pseudorandom
                 number generation",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "1",
  number =       "1",
  pages =        "3--30",
  month =        jan,
  year =         "1995",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1995.1002",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:24:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We carry out an in-depth analysis of the
                 multiple-recursive matrix method for uniform
                 pseudorandom number generation which was introduced in
                 an earlier paper of the author. This method yields much
                 larger period lengths than the GFSR method with the
                 same order of the recursion and the same precision.
                 Besides periodicity properties, we establish also
                 uniformity properties of $s$-tuples of successive
                 pseudorandom numbers generated by the
                 multiple-recursive matrix method and we study the
                 performance under the $s$-dimensional serial test. The
                 uniformity properties and the behavior under the serial
                 test depend on an appropriate figure of merit in the
                 case where the dimension $s$ exceeds the order of the
                 recursion.",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Niederreiter:1995:NDU,
  author =       "Harald Niederreiter",
  title =        "New Developments in Uniform Pseudorandom Number and
                 Vector Generation",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "87--120",
  year =         "1995",
  bibdate =      "Tue Dec 20 15:38:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1995:PVG,
  author =       "Harald Niederreiter",
  title =        "Pseudorandom vector generation by the
                 multiple-recursive matrix method",
  journal =      j-MATH-COMPUT,
  volume =       "64",
  number =       "209",
  pages =        "279--294",
  month =        jan,
  year =         "1995",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "95j:65006",
  MRreviewer =   "Gerhard Larcher",
  bibdate =      "Tue Mar 25 15:38:13 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2153334.pdf",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst. for Inf. Processing, Austrian Acad. of Sci.,
                 Vienna, Austria",
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Inst. for Inf. Processing, Austrian Acad. of Sci.,
                 Vienna, Austria",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "behavior; deterministic algorithm; deterministic
                 algorithms; generation; lattice structure; matrix
                 algebra; method; multiple-recursive matrix;
                 parallelized simulation methods; periodicity;
                 properties; pseudorandom vector; pseudorandom vector
                 generation; random number; sequences; vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ong:1995:CBG,
  author =       "S. H. Ong",
  title =        "Computation of bivariate gamma and inverted beta
                 distribution functions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "51",
  number =       "2-4",
  pages =        "153--163",
  year =         "1995",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659508811629",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:11:38 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@InProceedings{Owen:1995:RPN,
  author =       "A. B. Owen",
  title =        "Randomly Permuted $ (t, m, s) $-Nets and $ (t, s)
                 $-Sequences",
  crossref =     "Niederreiter:1995:MCQ",
  pages =        "299--317",
  year =         "1995",
  bibdate =      "Sat Mar 3 10:23:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Palubeckis:1995:HBB,
  author =       "G. Palubeckis",
  title =        "A Heuristic-Based Branch and Bound Algorithm for
                 Unconstrained Quadratic Zero-One Programming",
  journal =      j-COMPUTING,
  volume =       "54",
  number =       "4",
  pages =        "283--301",
  month =        dec,
  year =         "1995",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "90C09 (90C90)",
  MRnumber =     "96b:90049",
  MRreviewer =   "Klaus Hofstedt",
  bibdate =      "Fri Oct 15 15:40:47 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=255&id_volume=20&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "723.1; 921.3; 921.4; 921.5; 922.2",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Algorithms; Boundary conditions; Calculations;
                 Combinatorial mathematics; Combinatorial optimization
                 problems; Computer software selection and evaluation;
                 Design automation; Graph theory; Heuristic methods;
                 Heuristic programming; Heuristic-based branch/bound
                 algorithms; Integer programming; Mathematical
                 transformations; Optimization; Problem solving; Random
                 number generation; Randomly generated problems;
                 Unconstrained quadratic zero-one programming",
}

@Article{Pattanaik:1995:AER,
  author =       "S. N. Pattanaik and S. P. Mudur",
  title =        "Adjoint Equations and Random Walks for Illumination
                 Computation",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "77--102",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200985.html",
  abstract =     "In this paper we introduce the potential equation that
                 along with the rendering equation forms an adjoint
                 system of equations and provides a mathematical frame
                 work for all known approaches to illumination
                 computation based on geometric optics. The potential
                 equation is more natural for illumination computations
                 that simulate light propagation starting from the light
                 sources, such as progressive radiosity and particle
                 tracing. Using the mathematical handles provided by
                 this framework and the random-walk solution model, we
                 present a number of importance sampling schemes for
                 improving the computation of flux estimation. Of
                 particular significance is the use of approximately
                 computed potential for directing a majority of the
                 random walks through regions of importance in the
                 environment, thus reducing the variance in the
                 estimates of luminous flux in these regions. Finally,
                 results from a simple implementation are presented to
                 demonstrate the high-efficiency improvements made
                 possible by the use of these techniques.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J778",
  keywords =     "algorithms; design; experimentation",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation.",
}

@Article{Penrice:1995:AEP,
  author =       "Stephen G. Penrice",
  title =        "Applying Elementary Probability Theory to the {NBA}
                 Draft Lottery",
  journal =      j-SIAM-REVIEW,
  volume =       "37",
  number =       "4",
  pages =        "598--602",
  month =        dec,
  year =         "1995",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1037129",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  MRclass =      "60-01",
  MRnumber =     "1 368 390",
  bibdate =      "Sat Mar 29 09:55:35 MDT 2014",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/toc/siread/37/4;
                 http://www.siam.org/journals/sirev/sirev374.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  URL =          "http://epubs.siam.org/27302.htm",
  abstract =     "This note applies several ideas from elementary
                 probability theory to the National Basketball
                 Association draft lottery. Linearity of expectation,
                 variance, and independence are among the topics
                 discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York Coll at Cortland",
  affiliationaddress = "Cortland, NY, USA",
  classification = "921.6; 922.1; 922.2",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  journalabr =   "SIAM Rev",
  keywords =     "Draft lottery; Elementary probability theory;
                 Linearity of expectation; Probability; Problem solving;
                 Random number generation; Random processes; Random
                 variable; Sports; Statistical methods; Variance",
  onlinedate =   "December 1995",
}

@Article{Percus:1995:TAM,
  author =       "Ora E. Percus and Paula A. Whitlock",
  title =        "Theory and application of {Marsaglia}'s monkey test
                 for pseudorandom number generators",
  journal =      j-TOMACS,
  volume =       "5",
  number =       "2",
  pages =        "87--100",
  month =        apr,
  year =         "1995",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/210330.210331",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:30 MDT 2003",
  bibsource =    "http://dblp.uni-trier.de/db/journals/tomacs/tomacs5.html#PercusW95;
                 http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  note =         "See \cite{Marsaglia:1993:MTR}.",
  ZMnumber =     "0853.65009",
  abstract-1 =   "A theoretical analysis is given for a new test, the
                 ``Monkey'' test, for pseudorandom number sequences,
                 which was proposed by Marsaglia. Selected results,
                 using the test on several pseudorandom number
                 generators in the literature, are also presented.",
  abstract-2 =   "The authors give a survey on theory and application of
                 Marsaglia's monkey test for pseudo-random number
                 generators. The aim of the test is to find out
                 correlations between small subsequences of the full
                 sequence of a pseudorandom number generator. For
                 illustration, the test is used to investigate five
                 known pseudorandom number generators.",
  acknowledgement = ack-nhfb,
  classmath =    "*65C10 Random number generation 11K45 Pseudo-random
                 numbers, etc.",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  keywords =     "empirical tests; Marsaglia's monkey test; pseudorandom
                 number generators",
  oldlabel =     "PercusW95",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/tomacs/PercusW95",
  ZMreviewer =   "B. Mathiszik (Halle)",
}

@Article{Phatak:1995:LMP,
  author =       "S. C. Phatak and S. Suresh Rao",
  title =        "Logistic map: a possible random-number generator",
  journal =      j-PHYS-REV-E,
  volume =       "51",
  number =       "4",
  pages =        "3670--3678",
  month =        apr,
  year =         "1995",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.51.3670",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Mon Jan 16 15:31:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.51.3670",
  abstract =     "The logistic map is one of the simple systems
                 exhibiting order to chaos transition. In this work we
                 have investigated the possibility of using the logistic
                 map in the chaotic regime (logmap) for a
                 pseudorandom-number generator. To this end we have
                 performed certain statistical tests on the series of
                 numbers obtained from the logmap. We find that the
                 logmap passes these tests satisfactorily and therefore
                 it possesses many properties required of a
                 pseudorandom-number generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  keywords =     "logical map (LOGMAP)",
}

@Article{Pickover:1995:GET,
  author =       "Clifford A. Pickover",
  title =        "Generating Extraterrestrial Terrain",
  journal =      j-IEEE-CGA,
  volume =       "15",
  number =       "2",
  pages =        "18--21",
  month =        mar,
  year =         "1995",
  CODEN =        "ICGADZ",
  DOI =          "https://doi.org/10.1109/38.365000",
  ISSN =         "0272-1716 (print), 1558-1756 (electronic)",
  ISSN-L =       "0272-1716",
  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeecga.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "716.1; 723.5; 921.3; 921.4; 922.1",
  fjournal =     "IEEE Computer Graphics and Applications",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/cga",
  journalabr =   "IEEE Comput Graphics Appl",
  keywords =     "Computer graphics; Extraterrestrial terrain; Fractals;
                 Graphic methods; Image processing; Logistic formulas;
                 Logit transform; Mathematical models; Mathematical
                 transformations; Nonperiodic near Gaussian random
                 number generator; Random number generation; Random
                 processes; Signal filtering and prediction; Special
                 effects",
}

@Article{Pickover:1995:RNG,
  author =       "C. A. Pickover",
  title =        "Random number generators: pretty good ones are easy to
                 find",
  journal =      j-VISUAL-COMPUTER,
  volume =       "11",
  pages =        "369--377",
  year =         "1995",
  CODEN =        "VICOE5",
  ISSN =         "0178-2789 (print), 1432-2315 (electronic)",
  ISSN-L =       "0178-2789",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Visual Computer",
}

@InProceedings{Powell:1995:LEP,
  author =       "Patrick Powell and Justin Mason",
  title =        "{LPRng} --- An Enhanced Printer Spooler System",
  crossref =     "USENIX:1995:PNS",
  pages =        "13--24",
  day =          "17--22",
  month =        sep,
  year =         "1995",
  bibdate =      "Tue Oct 22 06:34:31 2002",
  bibsource =    "ftp://ftp.uu.net/library/bibliography;
                 http://www.usenix.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.usenix.org/publications/library/proceedings/lisa95/papowell.html",
  acknowledgement = ack-nhfb,
  affiliation =  "San Diego State University, San Diego, CA; Iona
                 Industries, Ireland",
  annote =       "Also known as LISA IX",
  keywords =     "LISA; systems administration; USENIX",
  searchkey =    "su:usenix",
}

@Article{Ramon:1995:PKV,
  author =       "J. Ramon and P. Pena",
  title =        "Parallelization of {KENO-Va Monte Carlo} code",
  journal =      j-COMP-PHYS-COMM,
  volume =       "88",
  number =       "1",
  pages =        "76--82",
  month =        jul,
  year =         "1995",
  CODEN =        "CPHCBZ",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sun Dec 22 10:19:23 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Consejo de Seguridad Nucl., Madrid, Spain",
  classification = "A2820H (Neutron diffusion); A2846E (Nuclear
                 criticality safety); A2846G (Packaging and
                 transportation of nuclear materials); C6110P (Parallel
                 programming); C7470 (Nuclear engineering computing)",
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "CONVEX C3440; Criticality; Distributed memory systems;
                 FDDI network; Fuel storage pools; HP9000/735; KENO-Va
                 code; Message-passing interface; Monte Carlo code;
                 Parallelization; PVM; Random numbers; SCALE system;
                 Shared memory machines; Shipping casks; Transport
                 equation",
  pubcountry =   "Netherlands",
  thesaurus =    "Monte Carlo methods; Neutron transport theory; Nuclear
                 criticality safety; Nuclear engineering computing;
                 Nuclear materials packaging; Parallel programming",
}

@InProceedings{Regan:1995:PGM,
  author =       "K. W. Regan and D. Sivakumar and Jin-Yi Cai",
  title =        "Pseudorandom generators, measure theory, and natural
                 proofs",
  crossref =     "IEEE:1995:ASF",
  pages =        "26--35",
  year =         "1995",
  bibdate =      "Thu Apr 5 06:13:51 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Roos:1995:CWK,
  author =       "Andrew Roos",
  title =        "A Class of Weak Keys in the {RC4} Stream Cipher",
  institution =  "Vironix Software Laboratories",
  address =      "????",
  pages =        "1--8",
  day =          "22",
  month =        sep,
  year =         "1995",
  bibdate =      "Sat Apr 05 12:48:42 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://isn.dnsalias.org/Luminy/WeakKeys-report.pdf;
                 https://marcel.wanda.ch/Archive/WeakKeys",
  acknowledgement = ack-nhfb,
}

@Article{Ross:1995:TCP,
  author =       "D. E. Ross",
  title =        "Technical Correspondence: Pseudo-Random Number
                 Generators for a Calculator",
  journal =      j-CACM,
  volume =       "38",
  number =       "1",
  pages =        "122--124",
  month =        jan,
  year =         "1995",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu May 30 09:41:10 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/204896.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@InProceedings{Sakamoto:1995:CMC,
  author =       "Munetaka Sakamoto and Susumu Morito",
  title =        "Combination of Multiplicative Congruential
                 Random-Number Generators with Safe Prime Modulus",
  crossref =     "Alexopoulos:1995:WSC",
  pages =        "309--315",
  year =         "1995",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/wsc/wsc1995.html#SakamotoM95;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/224401.224623",
  acknowledgement = ack-nhfb,
}

@InProceedings{Savory:1995:UMA,
  author =       "Paul A. Savory",
  title =        "Using {Mathematica} to aid simulation analysis",
  crossref =     "Alexopoulos:1995:WSC",
  pages =        "1324--1328",
  year =         "1995",
  DOI =          "https://doi.org/10.1109/WSC.1995.479042",
  bibdate =      "Sun Jan 5 08:48:44 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "As computer power has increased, so has the capability
                 of software developers to write programs that assist
                 people with time-consuming tasks. Mathematica is such a
                 program. The objective of this paper is to demonstrate
                 how Mathematica, a symbolic programming environment,
                 can be used to aid simulation analysis. In addition to
                 a general discussion of Mathematica's uses, advantages,
                 and disadvantages, several examples will be presented.
                 The examples include using Mathematica for distribution
                 fitting, queueing analysis, random number generation,
                 and creating a surface plot for optimization.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nebraska",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "723.2; 723.5; 921.5; 922.1; 922.2",
  conference =   "Proceedings of the 1995 Winter Simulation Conference,
                 WSC'95",
  journalabr =   "Winter Simul Conf Proc",
  keywords =     "Computer aided analysis; Computer graphics; Computer
                 simulation; Computer software; Data structures;
                 Discrete event simulation; Distribution fitting;
                 Optimization; Queueing theory; Random number
                 generation; Software Package Mathematica",
  meetingaddress = "Arlington, VA, USA",
  meetingdate =  "Dec 3--6 1995",
  meetingdate2 = "12/03--06/95",
  remark =       "The paper shows short Mathematica code for producing
                 3-D point plots that exhibit the hyperplanes of an
                 infamous bad linear congruential generator, {\tt
                 randu()}.",
}

@Article{Schmid:1995:EMC,
  author =       "F. Schmid and N. B. Wilding",
  title =        "Errors in {Monte Carlo} simulations using shift
                 register random number generators",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "6",
  number =       "6",
  pages =        "781--787",
  month =        dec,
  year =         "1995",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183195000642",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Sat Sep 17 14:06:04 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We report large systematic errors in Monte Carlo
                 simulations of the tricritical Blume--Capel model using
                 single spin Metropolis updating. The error, manifest as
                 a 20\% asymmetry in the magnetization distribution, is
                 traced to the interplay between strong triplet
                 correlations in the shift register random number
                 generator and the large tricritical clusters. The
                 effect of these correlations is visible only when the
                 system volume is a multiple of the random number
                 generator lag parameter. No such effects are observed
                 in related models.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
  keywords =     "Blume--Capel model; Metropolis updating; random number
                 generators",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Sezgin:1995:SRN,
  author =       "F. Sezgin",
  title =        "Some remarks on a new composite random number
                 generator",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "30",
  number =       "11",
  pages =        "125--130",
  month =        dec,
  year =         "1995",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(95)00169-Y",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:48:19 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Sherif:1993:DTN}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/089812219500169Y",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  remark =       "I (NHFB) prepared a Fortran test program for the
                 generator given in Fortran code on page 129 (warning:
                 the article PDF file has numerous OCR errors!), and
                 used that program to test the range of the two
                 floating-point outputs, r1 and r2, which should lie in
                 $ [0, 1] $. r1 does, but r2 does not: it can be
                 slightly larger than 1.0. I repaired that by the
                 addition of a final check ``if (r2 .gt. 1.0) r2 = r2 -
                 1.0''.\par

                 The test program took successive quadruples of 24-bit
                 significands and converted them to triples of 32-bit
                 integer words of random bits, output to separate files
                 for each of r1 and r2 that are then input to the
                 Diehard Battery test suite.\par

                 The r1 values pass all 16 Diehard tests, but the r2
                 values fail these tests: (1) BIRTHDAY SPACINGS; (2)
                 BINARY RANK TEST (6 x 8); (3) OVERLAPPING 20-TUPLES
                 BITSTREAM; (4) OPSO (Overlapping Pairs Sparse
                 Occupancy); (5) OQSO (Overlapping Quadruples Sparse
                 Occupancy); (6) DNA test; (7) COUNT THE 1's.\par

                 The r1 values cycle through multiple, and relatively
                 short, periods of 1350473, 3334537, and
                 5301990.\par

                 Compared to modern generators, like Marsaglia's
                 xorshift family, this generator is slow because it has
                 far too much arithmetic, and it is not portable or
                 reproducible because of the several fractional
                 floating-point constants that appear repeatedly in the
                 code, and because of floating-point rounding
                 differences across CPUs.",
}

@Article{Sherif:1995:UWF,
  author =       "Yosef S. Sherif and Roger G. Dear",
  title =        "Using {Walsh} Functions to Test a New Composite
                 {Sherif--Dear} ({CSD}) Random Number Generator",
  journal =      j-SIMULATION,
  volume =       "65",
  number =       "5",
  pages =        "338--342",
  month =        nov,
  year =         "1995",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979506500506",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 10:36:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A test using Walsh functions is performed to test the
                 quality of the output of a new Composite Sherif-Dear
                 (CSD) random number generator. The Walsh functions
                 based test shows that the output of the (CSD) generator
                 satisfies the criteria of good random number
                 generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Sobol:1995:IQS,
  author =       "Ilya M. Sobol' and Boris V. Shukhman",
  title =        "Integration with quasirandom sequences: numerical
                 experience",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "6",
  number =       "2",
  pages =        "263--275",
  month =        apr,
  year =         "1995",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183195000204",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Fri Dec 30 08:59:34 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@InProceedings{Sorenson:1995:ALE,
  author =       "Jonathan Sorenson",
  title =        "An analysis of {Lehmer}'s {Euclidean} {GCD}
                 algorithm",
  crossref =     "Levelt:1995:IPI",
  pages =        "254--258",
  year =         "1995",
  bibdate =      "Thu Mar 12 08:42:30 MST 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/issac/220346/p254-sorenson/",
  abstract =     "Let $u$ and $v$ be positive integers. We show that a
                 slightly modified version of D. H. Lehmer's greatest
                 common divisor algorithm will compute $ \gcd (u, v) $
                 (with $ u > v $ ) using at most $ O((\log {}u \log {}v)
                 / k + k \log {}v + \log {}u + k^2) $ bit operations and
                 $ O(\log {}u + k2^{2k}) $ space, where $k$ is the
                 number of bits in the multiprecision base of the
                 algorithm. This is faster than Euclid's algorithm by a
                 factor that is roughly proportional to $k$. Letting $n$
                 be the number of bits in $u$ and $v$, and setting $ k =
                 ((\log {}n) / 4) $, we obtain a subquadratic running
                 time of $ O(n^2 / \log {}n) $ in linear space.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math. and Comput. Sci., Butler Univ.,
                 Indianapolis, IN, USA",
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  keywords =     "algebraic computation, Lehmer's Euclidean GCD
                 algorithm; algorithms; Greatest common divisor
                 algorithm; ISSAC; Linear space; Multiprecision base;
                 Positive integers; Subquadratic running time; symbolic
                 computation; theory; verification",
  subject =      "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
                 ALGEBRAIC MANIPULATION, Algorithms, Algebraic
                 algorithms. {\bf F.2.1} Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
                 Algorithms and Problems, Number-theoretic
                 computations.",
  thesaurus =    "Computational geometry",
}

@Article{Storn:1995:CO,
  author =       "Rainer Storn",
  title =        "Constrained Optimization",
  journal =      j-DDJ,
  volume =       "20",
  number =       "5",
  pages =        "119--123",
  month =        may,
  year =         "1995",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Thu Jan 9 09:35:43 MST 1997",
  bibsource =    "Compendex database;
                 http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  acknowledgement = ack-nhfb,
  affiliation =  "Int Computer Science Inst",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "721.1; 921.1; 921.5; 921.6; 922.2",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  journalabr =   "Dr Dobb's J Software Tools Prof Program",
  keywords =     "Algorithms; Approximation theory; Calculations;
                 Computational methods; Computer networks; Constrained
                 optimization; Constraint theory; Functions; Iterative
                 methods; Mathematical formulation; Monte Carlo methods;
                 Objective functions; Optimization; Polynomials; Random
                 number generation; Region of acceptability; Vectors",
}

@Article{Struckmeier:1995:FGL,
  author =       "J. Struckmeier",
  title =        "Fast generation of low-discrepancy sequences",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "61",
  number =       "1",
  pages =        "29--41",
  day =          "20",
  month =        jul,
  year =         "1995",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/0377-0427(94)00054-5",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 08:09:06 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0377042794000545",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "pseudorandom numbers",
}

@Article{Sugita:1995:PRN,
  author =       "Hiroshi Sugita",
  title =        "Pseudo-random Number Generator by Means of Irrational
                 Rotation",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "1",
  number =       "1",
  pages =        "35--57",
  month =        "????",
  year =         "1995",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1995.1.1.35",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1368798 (96k:65007)",
  MRreviewer =   "Joseph Kreimer",
  bibdate =      "Mon Feb 27 10:56:29 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1995.1.issue-1/issue-files/mcma.1995.1.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1995.1.issue-1/mcma.1995.1.1.35/mcma.1995.1.1.35.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
  remark =       "The $m$-sequence generator described, and coded, in
                 this article may be infinite period: there is a
                 reference \cite{Burton:1987:CLT} to aperiodic
                 sequences. The generator produces a bit at a time, so
                 it may be rather slow compared to other methods. Its
                 core function compiles (with high optimization) into 56
                 x86-64 (95 Alpha, 43 IA-64 1--3 instruction bundles
                 (132 instructions, 38 of them filler nop instructions),
                 59 x86, 101 MIPS, 59 PowerPC, 108 SPARC) instructions
                 to generate 1 random bit.",
}

@Article{Takashima:1995:STT,
  author =       "K. Takashima",
  title =        "Sojourn time test for $m$-sequences with
                 characteristic pentanomials",
  journal =      j-J-JAPAN-SOC-COMPUT-STAT,
  volume =       "8",
  number =       "??",
  pages =        "37--46",
  month =        "????",
  year =         "1995",
  ISSN =         "0915-2350 (print), 1881-1337 (electronic)",
  ISSN-L =       "0915-2350",
  bibdate =      "Thu Mar 01 07:59:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Japanese Society of Computational
                 Statistics",
}

@Book{Tezuka:1995:URN,
  author =       "Shu Tezuka",
  title =        "Uniform random numbers: theory and practice",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xii + 209",
  year =         "1995",
  ISBN =         "0-7923-9572-7",
  ISBN-13 =      "978-0-7923-9572-0",
  LCCN =         "QA298 .T49 1995",
  bibdate =      "Tue Dec 20 15:43:26 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The Kluwer international series in engineering and
                 computer science. Discrete event dynamic systems",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0813/95010562-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0813/95010562-t.html",
  acknowledgement = ack-nhfb,
  remark =       "Foreword by Yu-Chi Ho.",
  subject =      "Monte Carlo method; Data processing; Random number
                 generators",
}

@Article{Varhol:1995:ANS,
  author =       "Peter D. Varhol",
  title =        "An Architecture for Network Simulation",
  journal =      j-DDJ,
  volume =       "20",
  number =       "7",
  pages =        "70, 72, 74, 76, 78",
  month =        jul,
  year =         "1995",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "Compendex database;
                 http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; UnCover
                 database",
  acknowledgement = ack-nhfb,
  affiliation =  "Rivier Coll",
  classification = "716.1; 722.3; 723.1; 723.1.1; 723.5; 922.1; C5620
                 (Computer networks and techniques); C6185 (Simulation
                 techniques); C7410F (Communications computing)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  journalabr =   "Dr Dobb's J Software Tools Prof Program",
  keywords =     "Blocks language; Commercial network-simulation
                 software; Computer network simulation; Computer
                 networks; Computer simulation; Computer simulation
                 languages; Computer software; Expert systems; Fuzzy
                 sets; Intelligent architectures; Large-scale computer
                 network; Network protocols; Network simulation; Network
                 traffic; Neural networks; Packet networks; Packet
                 routing; Packet switching; Prototype; Queueing theory;
                 Random number generation; Simulation package;
                 Telecommunication traffic; Testing; Visual blocks
                 language",
  pagecount =    "5",
  thesaurus =    "Computer networks; Digital simulation; Packet
                 switching; Telecommunication computing;
                 Telecommunication traffic",
}

@Article{Vattulainen:1995:CSS,
  author =       "I. Vattulainen and K. Kankaala and J. Saarinen and T.
                 Ala-Nissila",
  title =        "A comparative study of some pseudorandom number
                 generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "86",
  number =       "3",
  pages =        "209--226",
  day =          "1",
  month =        may,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(95)00015-8",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:45:35 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465595000158",
  abstract =     "We present results of a test program of a group of
                 pseudorandom number generators which are commonly used
                 in the applications of physics, in particular in Monte
                 Carlo simulations. The generators include public domain
                 programs, manufacturer installed routines and a random
                 number sequence produced from physical noise. We start
                 by traditional standard tests, followed by detailed bit
                 level and visual tests. The computational speed of
                 various algorithms is also scrutinized. Our results
                 allow direct comparisons between the properties of
                 different generators, as well as an assessment of the
                 efficiency of various test methods. Together with
                 recently developed application specific tests, this
                 information provides a good criterion to choose the
                 best generator among the tested ones for a given
                 problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Vattulainen:1995:MIF,
  author =       "I. Vattulainen and T. Ala-Nissila",
  title =        "Mission Impossible: Find a Random Pseudorandom Number
                 Generator",
  journal =      j-COMPUT-PHYS,
  volume =       "9",
  number =       "5",
  pages =        "500--504",
  month =        sep,
  year =         "1995",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168548",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Tue Jan 17 22:08:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?CIP/9/500/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
  keywords =     "algorithms; autocorrelations; Ising model; Monte Carlo
                 method; random number generators; random walk",
}

@Article{Vattulainen:1995:PMT,
  author =       "I. Vattulainen and T. Ala-Nissila and K. Kankaala",
  title =        "Physical models as tests of randomness",
  journal =      j-PHYS-REV-E,
  volume =       "52",
  number =       "3",
  pages =        "3205--3214",
  month =        sep,
  year =         "1995",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.52.3205",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Sat Sep 17 15:09:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.52.3205",
  abstract =     "We present and analyze in detail a test bench for
                 random number sequences based on the use of physical
                 models. The first two tests, namely the cluster test
                 and the autocorrelation test, are based on exactly
                 known properties of the two-dimensional Ising model.
                 The other two, the random walk test and the n-block
                 test, are based on random walks on lattices. We have
                 applied these tests to a number of commonly used
                 pseudorandom number generators. The cluster test is
                 shown to be particularly efficient in detecting
                 periodic correlations on bit level, while the
                 autocorrelation, the random walk, and the n-block tests
                 are very well suited for studies of weak correlations
                 in random number sequences. Based on the test results,
                 we demonstrate the reasons behind errors in recent high
                 precision Monte Carlo simulations, and discuss how
                 these could be avoided.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Misc{Wagner:1995:MRW,
  author =       "D. Wagner",
  title =        "My {RC4} Weak Keys",
  howpublished = "Post in sci.crypt, message--id
                 447o1l\$cbj@cnn.princeton.EDU",
  year =         "1995",
  bibdate =      "Sat Apr 05 12:57:30 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Walker:1995:GRV,
  author =       "Stephen Walker",
  title =        "Generating random variates from {$D$}-distributions
                 via substitution sampling",
  journal =      j-STAT-COMPUT,
  volume =       "5",
  number =       "4",
  pages =        "311--315",
  month =        dec,
  year =         "1995",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00162504",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:08 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00162504",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@MastersThesis{Wegenkittl:1995:ETPa,
  author =       "S. Wegenkittl",
  title =        "Empirical Testing of Pseudorandom Number Generators",
  school =       "University of Salzburg",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at//pub/publications/ste/masters_thesis/dipl.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/steThesis.txt;
                 http://random.mat.sbg.ac.at/~ste/dipl/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wegenkittl:1995:ETPb,
  author =       "S. Wegenkittl",
  title =        "On empirical testing of pseudorandom number
                 generators",
  crossref =     "DePietro:1995:PNP",
  pages =        "??--??",
  year =         "1995",
  bibdate =      "Fri Jan 6 11:42:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/steSor.ps;
                 http://random.mat.sbg.ac.at/ftp/pub/data/steSor.txt",
  acknowledgement = ack-nhfb,
}

@Article{Wegenkittl:1995:THS,
  author =       "Stefan Wegenkittl",
  title =        "Are there hyperbolas in the scatter plots of inversive
                 congruential pseudorandom numbers?",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "62",
  number =       "2",
  pages =        "117--125",
  day =          "20",
  month =        sep,
  year =         "1995",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(98)00077-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042798000776",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Wheeler:1995:TTE,
  author =       "David J. Wheeler and Roger M. Needham",
  title =        "{TEA}, a tiny encryption algorithm",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1008",
  pages =        "363--366",
  year =         "1995",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-60590-8_29",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1996a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also extensions XTEA \cite{Needham:1997:TE} and
                 XXTEA \cite{Wheeler:1998:CX}.",
  URL =          "http://www.springerlink.com/content/p16916lx735m2562/",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "TEA; Tiny Encryption Algorithm",
  remark =       "Proceedings of the Second International Workshop on
                 Fast Software Encryption.",
}

@Article{Wong:1995:EHS,
  author =       "W. F. Wong and Yoshio Oyanagi and Eiichi Goto",
  title =        "Evaluation of the {Hitachi S-3800} Supercomputer Using
                 Six Benchmarks",
  journal =      j-IJSAHPC,
  volume =       "9",
  number =       "1",
  pages =        "58--70",
  month =        "Spring",
  year =         "1995",
  CODEN =        "IJSAE9",
  ISSN =         "0890-2720",
  bibdate =      "Tue Feb 18 09:07:32 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The S-3000 series is the third generation of Hitachi's
                 supercomputers. It is claimed to be currently the
                 fastest single processor supercomputer. In this paper,
                 we introduce the S-3000 and, using six benchmarks we
                 designed, evaluate a member of this series of
                 supercomputer, the top of the range S-3800, against its
                 predecessor, the Hitachi HITAC S-820. Our purpose is to
                 determine in what areas the S-3800 is an improvement
                 over its predecessor. The suite of benchmarks include
                 kernels for random number generation, elementary
                 function computation, FFT, dense matrix operations,
                 SOR, and list vector (scatter\slash gather) operations.
                 The use of small-to medium-sized kernels, as opposed to
                 large application benchmarks, help to better understand
                 the behavior of the machine. Our findings support the
                 claim that the S-3000 series is at least twice as fast
                 as the previous generation of Hitachi supercomputers.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore",
  affiliationaddress = "Singapore",
  classification = "722.4; 921.3; 921.6; 922.2",
  fjournal =     "International Journal of Supercomputer Applications
                 and High Performance Computing",
  journal-URL =  "http://hpc.sagepub.com/content/by/year",
  journalabr =   "Int J Supercomput Appl High Perform Comput",
  keywords =     "Benchmarks; Computer selection and evaluation;
                 Computer testing; Fast Fourier transforms; Fastest
                 single processor; Hitachi supercomputer; Matrix
                 algebra; Medium sized kernels; Performance; Random
                 number generation; Supercomputers; Vectors",
}

@Article{Zhu:1995:MEC,
  author =       "Yaochen Zhu",
  title =        "A method for exact calculation of the discrepancy of
                 low-dimensional finite points sets. {II}",
  journal =      j-ACTA-MATH-SINICA,
  volume =       "11",
  number =       "4",
  pages =        "422--434",
  year =         "1995",
  ISSN =         "1000-9574",
  MRclass =      "11K38",
  MRnumber =     "1434838 (98d:11095)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Sat Mar 3 12:16:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "A Chinese summary appears in Acta Math. Sinica
                 {{\bf{3}}9} (1996), no. 5, 720",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Mathematica Sinica (New Series)",
}

@InProceedings{Aluru:1996:PAL,
  author =       "S. Aluru",
  title =        "Parallel Additive Lagged {Fibonacci} Random Number
                 Generators",
  crossref =     "ACM:1996:FCP",
  pages =        "102--108",
  year =         "1996",
  bibdate =      "Wed Mar 18 12:33:18 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as ICS'96. Held as part of the Federated
                 computing research conference (FCRC'96)",
  keywords =     "ACM; architecture; computer; FCRC; ICS; SIGARCH;
                 supercomputing",
  searchkey =    "su:supercomputing or su:supercomputer",
}

@Article{Anderson:1996:GPR,
  author =       "Jon E. Anderson and Thomas A. Louis",
  title =        "Generating pseudo-random variables from mixture models
                 by exemplary sampling",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "54",
  number =       "1-3",
  pages =        "45--53",
  year =         "1996",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659608811719",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:11:42 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Anonymous:1996:BRPe,
  author =       "Anonymous",
  title =        "Book Review: {{\booktitle{Pseudorandomness and
                 cryptographic applications}}: By Michael Luby.
                 Princeton University Press, Princeton, NJ. (1996). 234
                 pages. \$24.95, \pounds 20}",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "31",
  number =       "11",
  pages =        "139--139",
  month =        jun,
  year =         "1996",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:48:23 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122196873482",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Antipov:1996:IRN,
  author =       "M. V. Antipov and G. A. Mihailov",
  title =        "On the improvement in random number generators by
                 using a modulo 1 sum",
  journal =      j-RUSS-J-NUM-ANAL-MATH-MODEL,
  volume =       "11",
  number =       "2",
  pages =        "93--111",
  month =        jan,
  year =         "1996",
  CODEN =        "RJNMEH",
  DOI =          "https://doi.org/10.1515/rnam.1996.11.2.93",
  ISSN =         "0927-6467 (print), 1569-3988 (electronic)",
  ISSN-L =       "0927-6467",
  bibdate =      "Thu Mar 01 07:36:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Russian Journal of Numerical Analysis and Mathematical
                 Modelling",
}

@Article{Antipov:1996:SNM,
  author =       "M. V. Antipov",
  title =        "Sequences of Numbers for {Monte Carlo} Methods",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "2",
  number =       "3",
  pages =        "219--235",
  month =        "????",
  year =         "1996",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1996.2.3.219",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C05",
  MRnumber =     "1414865 (98f:65007)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/issue-files/mcma.1996.2.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/mcma.1996.2.3.219/mcma.1996.2.3.219.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@InProceedings{Armoni:1996:DSP,
  author =       "R. Armoni and M. Saks and A. Wigderson and Shiyu
                 Zhou",
  title =        "Discrepancy sets and pseudorandom generators for
                 combinatorial rectangles",
  crossref =     "IEEE:1996:ASF",
  pages =        "412--421",
  year =         "1996",
  bibdate =      "Thu Apr 5 06:13:52 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Baldwin:1996:PIB,
  author =       "Robert W. Baldwin",
  title =        "Proper Initialization for the {BSAFE} Random Number
                 Generator",
  journal =      "{RSA Laboratories' Bulletin}",
  volume =       "3",
  pages =        "1--2",
  day =          "25",
  month =        jan,
  year =         "1996",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Dec 08 09:44:52 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://ftp.rsasecurity.com/pub/pdfs/bull-3.pdf",
  acknowledgement = ack-nhfb,
}

@Book{Banks:1996:DES,
  author =       "Jerry Banks and John S. {Carson II} and Barry L.
                 Nelson",
  title =        "Discrete-Event System Simulation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 548",
  year =         "1996",
  ISBN =         "0-13-217449-9",
  ISBN-13 =      "978-0-13-217449-7",
  LCCN =         "T57.62 .B35 1996",
  bibdate =      "Thu Jan 5 15:15:48 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Prentice-Hall international series in industrial and
                 systems engineering",
  acknowledgement = ack-nhfb,
  subject =      "Simulation methods",
}

@Article{Barcucci:1996:DPP,
  author =       "Elena Barcucci and Alberto {Del Lungo} and Renzo
                 Pinzani",
  title =        "``{Deco}'' polyominoes, permutations and random
                 generation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "29--42",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=159&issue=1&aid=2140",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C5230 (Digital arithmetic
                 methods)",
  corpsource =   "Dept. of Syst. and Inf., Florence Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "combinatorial mathematics; deco polyominoes; hexagonal
                 lattices; linear algorithm; permutations; random
                 generation; random number generation; triangular
                 lattices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Manual{Barron:1996:RTR,
  author =       "Nick Barron",
  title =        "{RSAEuro} Technical Reference",
  organization = "Compulink",
  address =      "????",
  edition =      "Third",
  pages =        "v + 75",
  month =        nov,
  year =         "1996",
  bibdate =      "Mon Sep 16 09:34:20 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.rsaeuro.com/products/RSAEuro/rsadown.shtml;
                 mailto:nikb@cix.compulink.co.uk",
  abstract =     "RSAEURO is a cryptographic toolkit providing various
                 functions for the use of digital signatures, data
                 encryption and supporting areas (PEM encoding, random
                 number generation etc.). To aid compatibility with
                 existing software, RSAEURO is call-compatible with
                 RSADSI's RSAREF toolkit. RSAEURO allows non-US
                 residents to make use of much of the cryptographic
                 software previously only (legally) available in the
                 US.\par

                 IMPORTANT NOTICE: Please do not distribute or use this
                 software in the US --- it is illegal to use this
                 toolkit in the US, as public-key cryptography is
                 covered by US patents (see the Patents and Trademarks
                 section below for details). If you are a US resident,
                 please use the RSAREF toolkit instead.",
  acknowledgement = ack-nhfb,
}

@Article{Barry:1996:RTU,
  author =       "Timothy M. Barry",
  title =        "Recommendations on the Testing and Use of
                 Pseudo-Random Number Generators Used in {Monte Carlo}
                 Analysis for Risk Assessment",
  journal =      j-RISK-ANAL,
  volume =       "16",
  number =       "1",
  pages =        "93--105",
  month =        feb,
  year =         "1996",
  CODEN =        "RIANDF",
  DOI =          "https://doi.org/10.1111/j.1539-6924.1996.tb01439.x",
  ISSN =         "1539-6924",
  ISSN-L =       "0272-4332",
  bibdate =      "Mon Jan 16 12:04:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Risk Analysis",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1539-6924",
}

@InProceedings{Beaver:1996:CPC,
  author =       "Donald Beaver",
  title =        "Correlated pseudorandomness and the complexity of
                 private computations",
  crossref =     "ACM:1996:PTE",
  pages =        "479--488",
  year =         "1996",
  bibdate =      "Wed Feb 20 18:34:02 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/237814/p479-beaver/p479-beaver.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/237814/p479-beaver/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bellare:1996:PFR,
  author =       "M. Bellare and R. Canetti and H. Krawczyk",
  title =        "Pseudorandom functions revisited: the cascade
                 construction and its concrete security",
  crossref =     "IEEE:1996:ASF",
  pages =        "514--523",
  year =         "1996",
  bibdate =      "Thu Apr 5 06:13:52 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Berdnikov:1996:NMP,
  author =       "A. S. Berdnikov and S. B. Trutia and A. Compagner",
  title =        "Notebook: a {MathLink} Program for High-Quality Random
                 Numbers",
  journal =      j-MATHEMATICA-J,
  volume =       "6",
  number =       "3",
  pages =        "65--69",
  month =        "Summer",
  year =         "1996",
  CODEN =        "????",
  ISSN =         "1047-5974 (print), 1097-1610 (electronic)",
  ISSN-L =       "1047-5974",
  bibdate =      "Sat Nov 6 13:34:12 MDT 2010",
  bibsource =    "http://www.mathematica-journal.com/issue/v6i3/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.mathematica-journal.com/issue/v6i3/article/berdnikov/contents/63berdnikov.nb;
                 http://www.mathematica-journal.com/issue/v6i3/article/berdnikov/contents/63berdnikov.pdf;
                 http://www.mathematica-journal.com/issue/v6i3/article/berdnikov/index.html",
  abstract =     "We present a MathLink program that generates
                 pseudorandom sequences of integers with extremely long
                 periods (approximately $ 10^{16736} $ ) and with
                 excellent correlation properties: it is guaranteed that
                 samples of 1700 subsequent numbers of 32 bits are
                 independent, while the unavoidable remaining
                 correlations are of very high order. Many different
                 versions of these sequences can be realized by simple
                 changes of the constants in the source code. The
                 program is especially suitable for reliable large-scale
                 Monte Carlo simulations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematica Journal",
  journal-URL =  "http://www.mathematica-journal.com/",
  remark =       "Sadly, the software described in this article seems to
                 have been lost; the hostnames in the URLs no longer
                 exists, and Web searches have not found the software.
                 At http://www.archive.org, I found the HTML file that
                 refers to the packages, but the packages themselves
                 have not been preserved.",
}

@Article{Bernhofen:1996:RBR,
  author =       "L. T. Bernhofen and E. J. Dudewicz and E. C. van der
                 Meulen",
  title =        "Ranking the Best Random Number Generators via
                 Entropy-Uniformity Theory",
  journal =      j-AM-J-MATH-MANAGE-SCI,
  volume =       "16",
  number =       "1--2",
  pages =        "49--88",
  month =        "????",
  year =         "1996",
  CODEN =        "AMMSDX",
  ISSN =         "0196-6324",
  bibdate =      "Sat Mar 3 10:00:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Journal of Mathematical and Management
                 Sciences",
}

@Article{Beyer:1996:CLS,
  author =       "W. A. Beyer and W. W. Wood",
  title =        "Corrigenda: {``The lattice structure of multiplicative
                 congruential pseudo-random vectors''} {[Math. Comp.
                 {\bf 25} (1971), 345--363, MR {\bf 46} \#8373] by W. A.
                 Beyerm, R. B. Roof, and Dorothy Williamson}",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "445--446",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "1 325 862",
  bibdate =      "Wed Jan 15 08:57:18 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Beyer:1971:LSM}.",
  URL =          "http://www.jstor.org/stable/pdfplus/2153872.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Bland:1996:SRN,
  author =       "I. M. Bland and G. M. Megson",
  title =        "Systolic random number generation for genetic
                 algorithms",
  journal =      j-ELECT-LETTERS,
  volume =       "32",
  number =       "12",
  pages =        "1069--1070",
  day =          "6",
  month =        jun,
  year =         "1996",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19960709",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:32 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=502856",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Boppana:1996:BCP,
  author =       "Ravi B. Boppana and Babu O. Narayanan",
  title =        "The Biased Coin Problem",
  journal =      j-SIAM-J-DISCR-MATH,
  volume =       "9",
  number =       "1",
  pages =        "29--36",
  month =        feb,
  year =         "1996",
  CODEN =        "SJDMEC",
  ISSN =         "0895-4801 (print), 1095-7146 (electronic)",
  ISSN-L =       "0895-4801",
  MRclass =      "68Q25 (60C05 68Q10 94A60)",
  MRnumber =     "97a:68074",
  bibdate =      "Thu Apr 9 15:20:35 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240Z (Other topics in statistics); B6120B (Codes);
                 C1140Z (Other topics in statistics); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., New York Univ., NY, USA",
  fjournal =     "SIAM Journal on Discrete Mathematics",
  journal-URL =  "http://epubs.siam.org/sidma",
  keywords =     "biased coin problem; biased probability; conditional
                 probability; cryptography; probability;
                 pseudo-randomness; random bit sequence; random
                 processes; randomised algorithms; randomized
                 algorithms; sequence; slightly random source",
  pubcountry =   "USA",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bromley:1996:QNG,
  author =       "B. C. Bromley",
  title =        "Quasirandom Number Generators for Parallel {Monte
                 Carlo} Algorithms",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "38",
  number =       "1",
  pages =        "101--104",
  day =          "10",
  month =        oct,
  year =         "1996",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1006/jpdc.1996.0132",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Mar 9 09:19:01 MST 2000",
  bibsource =    "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0132/production;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0132/production/pdf;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0133/production;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0133/production/pdf",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4240P (Parallel
                 programming and algorithm theory); C5230 (Digital
                 arithmetic methods); C7310 (Mathematics computing)",
  corpsource =   "Theor. Astrophys., Los Alamos Nat. Lab., NM, USA",
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
  keywords =     "algorithms; convergence properties; generation;
                 interleaved subsets; leapfrog scheme; Monte Carlo
                 methods; parallel algorithms; parallel Monte Carlo;
                 parallel supercomputers; pseudorandom algorithms;
                 quasirandom number generators; random number; rapid",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
  treatment =    "A Application; P Practical",
}

@Article{Brunner:1996:PCO,
  author =       "D. Brunner and A. Uhl",
  title =        "Parallel Computation of Optimal Parameters for Pseudo
                 Random Number Generation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1127",
  pages =        "78--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Dec 21 09:47:26 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Bryc:1996:BRB,
  author =       "Wlodzimierz Bryc",
  title =        "Book Review: {{\booktitle{Limit Theorems of
                 Probability Theory: Sequences of Independent Random
                 Variables}} (Valentin V. Petrov)}",
  journal =      j-SIAM-REVIEW,
  volume =       "38",
  number =       "3",
  pages =        "527--527",
  month =        "????",
  year =         "1996",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1038089",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Sat Mar 29 09:55:42 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/38/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "September 1996",
}

@Article{Burthe:1996:FIS,
  author =       "Ronald Joseph {Burthe, Jr.}",
  title =        "Further investigations with the strong probable prime
                 test",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "373--381",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11Y11 (11A51)",
  MRnumber =     "96d:11137",
  MRreviewer =   "Samuel S. Wagstaff, Jr.",
  bibdate =      "Fri Jul 16 10:38:30 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-213;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00695-3&u=/mcom/1996-65-213/",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); B0240Z (Other
                 topics in statistics); C1160 (Combinatorial
                 mathematics); C1140Z (Other topics in statistics)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "composite number; number theory; probability; random
                 k-bit odd number; random processes; random strong
                 probable prime tests; testing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chandwani:1996:FAP,
  author =       "M. Chandwani and N. S. Chaudhari",
  title =        "Formulation and analysis of parallel context-free
                 recognition and parsing on a {PRAM} model",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "22",
  number =       "6",
  pages =        "845--868",
  day =          "20",
  month =        sep,
  year =         "1996",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Fri Aug 6 10:15:01 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1996&volume=22&issue=6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1996&volume=22&issue=6&aid=1067",
  acknowledgement = ack-nhfb,
  affiliation =  "Shri G S Inst of Technology and Science",
  affiliationaddress = "Indore, India",
  classification = "721.1; 722.1; 722.4; 723.1.1; 723.2; 723.5; C4210L
                 (Formal languages and computational linguistics);
                 C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessing systems)",
  corpsource =   "Dept. of Comput. Eng., Shri GS Inst. of Technol. and
                 Sci., Indore, India",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  journalabr =   "Parallel Comput",
  keywords =     "access machine; Character recognition; Chomsky normal
                 form; cky algorithm; complexity; computation time;
                 Computational complexity; computational complexity;
                 Computational complexity; context free language;
                 Context free languages; context-free grammars;
                 context-free languages; Mathematical models; multiple
                 entries; Parallel algorithms; parallel algorithms;
                 Parallel algorithms; parallel CKY algorithm; parallel
                 context-free; parallel context-free recognition;
                 parallel machines; Parallel processing systems;
                 parallel random; Parallel recognition; parsing; PRAM
                 model; pram model; quadratic number of processors;
                 Random access storage; random-access storage;
                 recognition table; time; WRAM model",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Coddington:1996:TRN,
  author =       "P. D. Coddington",
  title =        "Tests of random number generators using {Ising} model
                 simulations",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "3",
  number =       "3",
  pages =        "295--303",
  month =        jun,
  year =         "1996",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183196000235",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Wed Feb 08 14:42:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/07/0703/S0129183196000235.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@Article{Couture:1996:OLL,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "Orbits and lattices for linear random number
                 generators with composite moduli",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "189--201",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-96-00673-4",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "96d:65015",
  MRreviewer =   "Ivan K{\u{r}}iv{\'y}",
  bibdate =      "Fri Jul 16 10:38:30 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-213;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00673-4&u=/mcom/1996-65-213/;
                 http://www.jstor.org/stable/2153839",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310 (Mathematics
                 computing)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "composite moduli; multiple; procedure; random number
                 generation; random number generators; recursive;
                 recursive linear congruential generators",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Devroye:1996:RVG,
  author =       "Luc Devroye",
  title =        "Random Variate Generation in One Line of Code",
  crossref =     "Charnes:1996:WSC",
  pages =        "265--272",
  year =         "1996",
  DOI =          "https://doi.org/10.1145/256562.256623",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://cgm.cs.mcgill.ca/~luc/wsc96.pdf;
                 http://cgm.cs.mcgill.ca/~luc/wsc96.ps",
  abstract =     "A random variate with a given non-uniform distribution
                 can often by generated in one assignment statement if a
                 uniform source and some simple functions are available.
                 We review such one-line methods for most of the key
                 distributions.",
  acknowledgement = ack-nhfb,
}

@Article{Dietzfelbinger:1996:UHW,
  author =       "Martin Dietzfelbinger",
  title =        "Universal Hashing and $k$-wise Independent Random
                 Variables via Integer Arithmetic without Primes",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1046",
  pages =        "567--580",
  year =         "1996",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-60922-9_46",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Dodge:1996:NRN,
  author =       "Yadolah Dodge",
  title =        "A Natural Random Number Generator",
  journal =      j-INT-STAT-REV,
  volume =       "64",
  number =       "3",
  pages =        "329--344",
  month =        dec,
  year =         "1996",
  CODEN =        "ISTRDP",
  ISSN =         "0306-7734 (print), 1751-5823 (electronic)",
  ISSN-L =       "0306-7734",
  bibdate =      "Fri Jul 01 06:59:57 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/1403789",
  abstract =     "Since the introduction of ``middle square'' method by
                 John von Neumann for the production of
                 ``pseudo-random'' numbers in about 1949, hundreds of
                 other methods have been introduced. While each may have
                 some virtue a single uniformly superior method has not
                 emerged. The problems of cyclical repetition and the
                 need to pass statistical tests for randomness still
                 leave the issue unresolved. The aim of this article is
                 to suggest the most natural random number generator of
                 all, the decimals of $ \pi $, as a unique source of
                 random numbers. There is no cyclic behaviour, all
                 finite dimensional distributions of the sequence are
                 uniform, so that it satisfies all the properties of
                 today's generation of statistical tests; because of the
                 manner in which the numbers are generated it is
                 conjectured that it will satisfy any further test with
                 probability one. In addition, the history of $ \pi $,
                 its discovery and elucidation, is co-extensive with the
                 entire history of mankind.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Statistical Review / Revue
                 Internationale de Statistique",
  journal-URL =  "http://www.jstor.org/journals/03067734.html",
}

@Article{Dorfman:1996:PSR,
  author =       "Jeffrey H. Dorfman",
  title =        "Pseudorandom Sampling Has a Real Effect on Test Size",
  journal =      j-AMER-STAT,
  volume =       "50",
  number =       "2",
  pages =        "151--??",
  month =        "????",
  year =         "1996",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Mon May 5 07:48:12 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2684427.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Dwyer:1996:TRNa,
  author =       "Jerry Dwyer and K. B. Williams",
  title =        "Testing Random Number Generators",
  journal =      j-CCCUJ,
  volume =       "14",
  number =       "6",
  pages =        "39--??",
  month =        jun,
  year =         "1996",
  CODEN =        "CCUJEX",
  ISSN =         "1075-2838",
  bibdate =      "Fri Aug 30 16:52:23 MDT 1996",
  bibsource =    "http://www.cuj.com/cbklist.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "C/C++ Users Journal",
}

@Article{Dwyer:1996:TRNb,
  author =       "Jerry Dwyer and K. B. Williams",
  title =        "Testing Random Number Generators, Part 2",
  journal =      j-CCCUJ,
  volume =       "14",
  number =       "8",
  pages =        "57--??",
  month =        aug,
  year =         "1996",
  CODEN =        "CCUJEX",
  ISSN =         "1075-2838",
  bibdate =      "Fri Aug 30 16:52:23 MDT 1996",
  bibsource =    "http://www.cuj.com/cbklist.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "C/C++ Users Journal",
}

@Article{Eichenauer-Herrmann:1996:ABC,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Gerhard Larcher",
  title =        "Average Behaviour of Compound Nonlinear Congruential
                 Pseudorandom Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "2",
  number =       "1",
  pages =        "111--123",
  month =        jan,
  year =         "1996",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1996.0008",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579796900088",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Eichenauer-Herrmann:1996:CIC,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Frank Emmerich",
  title =        "Compound inversive congruential pseudorandom numbers:
                 an average-case analysis",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "215--225",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-96-00675-8",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1322889 (96i:65005)",
  bibdate =      "Fri Jul 16 10:38:30 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-213;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00675-8&u=/mcom/1996-65-213/;
                 http://www.jstor.org/stable/2153841",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310 (Mathematics
                 computing); C1140 (Probability and statistics)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "average-case analysis; congruential pseudorandom
                 numbers; equidistribution; inversive congruential
                 method; random number generation; statistical analysis;
                 statistical independence; uniform pseudorandom
                 numbers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eichenauer-Herrmann:1996:EPI,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Equidistribution properties of inversive congruential
                 pseudorandom numbers with power of two modulus",
  journal =      j-METRIKA,
  volume =       "44",
  number =       "3",
  pages =        "199--205",
  year =         "1996",
  CODEN =        "MTRKA8",
  DOI =          "https://doi.org/10.1007/BF02614066",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1421968 (98a:11102)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika. International Journal for Theoretical and
                 Applied Statistics",
  journal-URL =  "http://link.springer.com/journal/184",
}

@Article{Eichenauer-Herrmann:1996:MEI,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Modified explicit inversive congruential pseudorandom
                 numbers with power of $2$ modulus",
  journal =      j-STAT-COMPUT,
  volume =       "6",
  number =       "1",
  pages =        "31--36",
  month =        mar,
  year =         "1996",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1007/BF00161571",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:07 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00161571",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
  xxtitle =      "Modified Explicit Inversive Congruential Pseudorandom
                 Numbers with Power-of-Two Modulus",
}

@Article{Emmerich:1996:PVG,
  author =       "Frank Emmerich",
  title =        "Pseudorandom vector generation by the compound
                 inversive method",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "214",
  pages =        "749--760",
  month =        apr,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "96m:11064",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Fri Jul 16 10:38:32 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-214;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00706-5&u=/mcom/1996-65-214/;
                 http://www.jstor.org/stable/2153611",
  acknowledgement = ack-nhfb,
  affiliation =  "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  classcodes =   "C5230 (Digital arithmetic methods); C6185 (Simulation
                 techniques)",
  corpsource =   "Fachbereich Math., Tech. Hochschule Darmstadt,
                 Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "compound inversive method; digital simulation;
                 k-dimensional uniform; parallelized simulation methods;
                 periodicity properties; pseudorandom number generation;
                 pseudorandom vector generation; pseudorandom vectors;
                 random number generation; s-tuples; statistical
                 independence properties",
  treatment =    "P Practical",
}

@InProceedings{Entacher:1996:RSP,
  author =       "Karl Entacher and Stefan Wegenkittl",
  title =        "On the relevance of splitting properties and the
                 compound method in parallel applications of
                 pseudorandom number generators",
  crossref =     "Trobec:1996:PIW",
  pages =        "64--74",
  year =         "1996",
  bibdate =      "Fri Dec 23 22:11:06 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Fernandez:1996:FAR,
  author =       "J. F. Fern{\'a}ndez and J. Rivero",
  title =        "Fast algorithm for random numbers with exponential and
                 normal distributions",
  journal =      j-COMPUT-PHYS,
  volume =       "10",
  number =       "1",
  pages =        "83--88",
  month =        jan,
  year =         "1996",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168562",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Wed Feb 15 18:31:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Fernandez:1999:AER} for a proof of the
                 algorithm proposed here for exponential random
                 numbers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
  remark =       "From the abstract: ``Our normal random number
                 generator is an order of magnitude times faster than
                 Box--Muller's algorithm. Our exponential random number
                 generator is several times faster than taking the
                 logarithm of a uniform random deviate and than von
                 Neumann's algorithm.''",
}

@Article{Fischer:1996:EPR,
  author =       "Jean-Bernard Fischer and Jacques Stern",
  title =        "An Efficient Pseudo-random Generator Provably as
                 Secure as Syndrome Decoding",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1070",
  pages =        "245--255",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Feb 4 12:02:22 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1070.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "EUROCRYPT96 proceedings.",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1070/10700245.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1070/10700245.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Book{Fishman:1996:MCC,
  author =       "George S. Fishman",
  title =        "{Monte Carlo}: concepts, algorithms, and
                 applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxv + 698",
  year =         "1996",
  ISBN =         "0-387-94527-X",
  ISBN-13 =      "978-0-387-94527-9",
  LCCN =         "QA298 .F57 1996",
  bibdate =      "Tue Dec 27 06:26:33 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in operations research",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method",
}

@Article{Goldberg:1996:RNB,
  author =       "Ian Goldberg and David Wagner",
  title =        "Randomness and the {Netscape} Browser",
  journal =      j-DDJ,
  volume =       "21",
  number =       "1",
  pages =        "66, 68--70",
  month =        jan,
  year =         "1996",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Thu Jan 9 09:35:43 MST 1997",
  bibsource =    "Compendex database;
                 http://www.ddj.com/index/author/index.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/dr-dobbs.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., California Univ.",
  affiliationaddress = "Berkeley, CA, USA",
  classification = "722.3; 723.1; 723.2; 723.5; 922.2; B6120B (Codes);
                 B6150M (Protocols); B6210L (Computer communications);
                 C5620W (Other computer networks); C5640 (Protocols);
                 C6130S (Data security); C6150N (Distributed systems
                 software); C7210 (Information services and centres);
                 C7250 (Information storage and retrieval)",
  fjournal =     "Dr. Dobb's Journal of Software Tools",
  journalabr =   "Dr Dobb's J Software Tools Prof Program",
  keywords =     "Algorithms; Computer aided software engineering;
                 Computer software; Cryptographic protocol;
                 Cryptographic techniques; Cryptography; Data
                 communication systems; Decoding; Eavesdropper;
                 Encrypted communications; Internet; Internet
                 transaction security; Netscape 2.0 beta1; Netscape
                 browser; Netscape Navigator 1.22 Security Update;
                 Netscape Web browser; Network protocols; Random number;
                 Random number generation; Randomness; Secure Sockets
                 Layer; Security of data; UNIX; Web browsers; Web
                 servers; World Wide Web",
  pagecount =    "4",
  thesaurus =    "Cryptography; Information retrieval systems; Internet;
                 Protocols",
}

@Article{Gunther:1996:ZLE,
  author =       "R. G{\"u}nther and L. Levitin and B. Schapiro and P.
                 Wagner",
  title =        "{Zipf}'s law and the effect of ranking on probability
                 distributions",
  journal =      j-INT-J-THEOR-PHYS,
  volume =       "35",
  number =       "2",
  pages =        "395--417",
  year =         "1996",
  CODEN =        "IJTPBM",
  DOI =          "https://doi.org/10.1007/BF02083823",
  ISSN =         "0020-7748 (print), 1572-9575 (electronic)",
  ISSN-L =       "0020-7748",
  bibdate =      "Sat Nov 12 10:53:57 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0843.60002",
  abstract =     "Ranking procedures are widely used in the description
                 of many different types of complex systems. Zipf's law
                 is one of the most remarkable frequency-rank
                 relationships and has been observed independently in
                 physics, linguistics, biology, demography, etc. We show
                 that ranking plays a crucial role in making it possible
                 to detect empirical relationships in systems that exist
                 in one realization only, even when the statistical
                 ensemble to which the systems belong has a very broad
                 probability distribution. Analytical results and
                 numerical simulations are presented which clarify the
                 relations between the probability distributions and the
                 behavior of expected values for unranked and ranked
                 random variables. This analysis is performed, in
                 particular, for the evolutionary model presented in our
                 previous papers which leads to Zipf's law and reveals
                 the underlying mechanism of this phenomenon in terms of
                 a system with interdependent and interacting components
                 as opposed to the ``ideal gas'' models suggested by
                 previous researchers. The ranking procedure applied to
                 this model leads to a new, unexpected phenomenon: a
                 characteristic ``staircase'' behavior of the mean
                 values of the ranked variables (ranked occupation
                 numbers). This result is due to the broadness of the
                 probability distributions for the occupation numbers
                 and does not follow from the ``ideal gas'' model. Thus,
                 it provides an opportunity, by comparison with
                 empirical data, to obtain evidence as to which model
                 relates to reality.",
  acknowledgement = ack-nhfb,
  classmath =    "60A99 (Foundations of probability theory)",
  fjournal =     "International Journal of Theoretical Physics",
  journal-URL =  "http://link.springer.com/journal/10773",
  keywords =     "numerical simulations; ranking procedures; Zipf's
                 law",
}

@Article{Gutbrod:1996:PRR,
  author =       "F. Gutbrod",
  title =        "On the periods of the {{\tt ranshi}} random number
                 generator",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "7",
  number =       "6",
  pages =        "909--922",
  month =        dec,
  year =         "1996",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183196000764",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 22:18:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/07/0706/S0129183196000764.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@Article{Han:1996:PGF,
  author =       "Yenjo Han and Lane A. Hemaspaandra",
  title =        "Pseudorandom Generators and the Frequency of
                 Simplicity",
  journal =      j-J-CRYPTOLOGY,
  volume =       "9",
  number =       "4",
  pages =        "251--261",
  month =        "Fall",
  year =         "1996",
  CODEN =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  MRclass =      "94A60 (65C10)",
  MRnumber =     "98a:94021",
  MRreviewer =   "Robert M. Baer",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.de/link/service/journals/00145/bibs/9n4p251.html;
                 http://link.springer.de/link/service/journals/00145/bibs/9n4p251.pdf;
                 http://link.springer.de/link/service/journals/00145/bibs/9n4p251.tex;
                 http://link.springer.de/link/service/journals/00145/tocs/00904.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@Article{Heinrich:1996:EAC,
  author =       "S. Heinrich",
  title =        "Efficient algorithms for computing the $ {L}_2 $
                 discrepancy",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "216",
  pages =        "1621--1633",
  month =        oct,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65D30 (65C05 65Y20)",
  MRnumber =     "97a:65024",
  MRreviewer =   "J. Spanier",
  bibdate =      "Fri Jul 16 10:38:37 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-216;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00756-9&u=/mcom/1996-65-216/",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., Germany",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "algorithm theory; L/sub 2/-discrepancy; multivariate;
                 quadrature rules; quantitative measure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hofmeister:1996:ISG,
  author =       "Thomas Hofmeister and Hanno Lefmann",
  title =        "Independent sets in graphs with triangles",
  journal =      j-INFO-PROC-LETT,
  volume =       "58",
  number =       "5",
  pages =        "207--210",
  day =          "10",
  month =        jun,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "05C85",
  MRnumber =     "97g:05152",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lehrstuhl Inf. II, Dortmund Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  keywords =     "algorithm theory; derandomization; fast algorithm;
                 graph theory; graphs; graphs with triangles;
                 independence number; independent set; triangle-free
                 graphs; triangles",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hormann:1996:RIG,
  author =       "W. H{\"o}rmann and G. Derflinger",
  title =        "Rejection-inversion to generate variates from monotone
                 discrete distributions",
  journal =      j-TOMACS,
  volume =       "6",
  number =       "3",
  pages =        "169--184",
  month =        jul,
  year =         "1996",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:32 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Horstmann:1996:CCL,
  author =       "C. S. Horstmann",
  title =        "{C++} class libraries for numerical programming",
  journal =      j-C-PLUS-PLUS-REPORT,
  volume =       "8",
  number =       "1",
  pages =        "61--64, 66",
  month =        jan,
  year =         "1996",
  CODEN =        "CRPTE7",
  ISSN =         "1040-6042",
  bibdate =      "Tue Mar 25 13:34:48 MST 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C6110J (Object-oriented
                 programming); C4140 (Linear algebra); C4190 (Other
                 numerical methods); C6140D (High level languages)",
  corpsource =   "San Jose State Univ., CA, USA",
  fjournal =     "C++ Report",
  keywords =     "C language; C++ class libraries; computing; FORTRAN
                 LINPACK; Fourier transforms; IMSL Math Module; library;
                 linear algebra; M++; mathematical; mathematics; number
                 generators; numerical algorithms; numerical
                 programming; object-oriented; object-oriented
                 languages; probability distributions; problems;
                 programming; programming problems; random; random
                 number generation; software libraries; statistical
                 functions",
  treatment =    "P Practical",
}

@Article{James:1996:ERF,
  author =       "F. James",
  title =        "Erratum: {RANLUX: A Fortran implementation of the
                 high-quality pseudorandom number generator of
                 L{\"u}scher [Comput. Phys. Commun. {\bf 79} (1994)
                 111--114]}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "97",
  number =       "3",
  pages =        "357--357",
  month =        sep,
  year =         "1996",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(96)00065-3",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{James:1994:RFI}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465596000653",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  remark =       "The erratum supplies a missing initializer.",
}

@Article{Johnson:1996:RES,
  author =       "Brad C. Johnson",
  title =        "Radix-$b$ extensions to some common empirical tests
                 for pseudorandom number generators",
  journal =      j-TOMACS,
  volume =       "6",
  number =       "4",
  pages =        "261--273",
  month =        oct,
  year =         "1996",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:33 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Jones:1996:TRV,
  author =       "M. C. Jones and A. D. Lunn",
  title =        "Transformations and Random Variate Generation:
                 Generalised Ratio-of-Uniforms Methods",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "55",
  number =       "1--2",
  pages =        "49--55",
  month =        "????",
  year =         "1996",
  CODEN =        "JSCSAJ",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Mar 3 10:33:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Kamgar-Parsi:1996:DMW,
  author =       "Behzad Kamgar-Parsi and Behrooz Kamgar-Parsi and
                 Menashe Brosh",
  title =        "Distribution and moments of the weighted sum of
                 uniforms random variables, with applications in
                 reducing {Monte Carlo} simulations",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "52",
  number =       "4",
  pages =        "399--414",
  month =        "????",
  year =         "1996",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659508811688",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:48:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659508811688",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Kao:1996:EAP,
  author =       "Chiang Kao and J. Y. Wong",
  title =        "An exhaustive analysis of prime modulus multiplicative
                 congruential random number generators with modulus
                 smaller than $ 2^{15} $",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "54",
  number =       "1--3",
  pages =        "29--35",
  month =        "????",
  year =         "1996",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659608811717",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:22:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659608811717",
  abstract =     "This paper presents the results of an exhaustive
                 analysis of all of the prime modulus multiplicative
                 congruential random number (RN) generators with moduli
                 smaller than $ 2^{15} $. In an amount of around 20
                 million multipliers which are able to produce a full
                 period of RNs, 239 multipliers have a good lattice
                 structure. Among which 52 multipliers further pass a
                 comprehensive battery of empirical tests. These 52
                 multipliers thus possess good local and global
                 statistical properties. It is worthwhile to note that
                 some empirically tested multipliers recommended in some
                 previous studies are not on this list. The conclusion
                 is that both theoretical and empirical tests are
                 mandatory to sieve out good multipliers. To generate
                 RNs of very long period, many existing techniques can
                 be applied without further effort.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
  remark =       "Here are the 52 (multiplier, modulus, spectral test)
                 triples from Table 1 of the paper, sorted in order of
                 decreasing spectral test value (and thus, quality):
                 (21839, 30223, 0.7979), (22779, 30223, 0.7979), (01536,
                 30161, 0.7666), (28625, 30161, 0.7666), (24370, 31607,
                 0.7630), (29087, 31607, 0.7630), (08603, 31253,
                 0.7628), (11407, 31253, 0.7628), (05746, 30853,
                 0.7628), (06438, 30853, 0.7628), (24415, 30853,
                 0.7628), (25107, 30853, 0.7628), (16850, 30713,
                 0.7599), (21459, 30713, 0.7599), (06314, 31729,
                 0.7579), (07583, 31729, 0.7579), (06145, 29881,
                 0.7579), (02277, 32693, 0.7531), (09146, 32693,
                 0.7531), (23547, 32693, 0.7531), (30416, 32693,
                 0.7531), (27526, 31663, 0.7531), (01774, 30011,
                 0.7531), (08983, 30011, 0.7531), (03841, 29917,
                 0.7531), (27261, 29917, 0.7531), (08625, 32609,
                 0.7527), (12140, 32609, 0.7527), (20469, 32609,
                 0.7527), (23984, 32609, 0.7527), (11568, 29581,
                 0.7518), (14701, 29581, 0.7500), (14880, 29581,
                 0.7518), (18013, 29581, 0.7518), (12303, 32717,
                 0.7504), (23609, 32717, 0.7504), (08127, 32299,
                 0.7504), (09427, 32299, 0.7504), (09986, 32009,
                 0.7504), (22023, 32009, 0.7504), (07358, 31223,
                 0.7504), (20118, 31223, 0.7504), (13898, 31219,
                 0.7504), (20156, 31219, 0.7504), (17862, 30643,
                 0.7504), (26349, 30643, 0.7504), (04231, 30403,
                 0.7504), (28585, 30403, 0.7504), (06117, 29207,
                 0.7504), (28338, 29207, 0.7504), (02054, 32303,
                 0.7503), (28733, 32303, 0.7503)",
}

@Article{Kato:1996:NCP,
  author =       "Takashi Kato and Li-Ming Wu and Niro Yanagihara",
  title =        "On a nonlinear congruential pseudorandom number
                 generator",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "227--233",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "96d:65016",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Fri Jul 16 10:38:30 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-213;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kato:1996:STN} for a treatment of the
                 discrepancy of the inversive congruential generator,
                 \cite{Kato:1997:LSP} for an analysis of lattice
                 structure of inverse congruential generators.",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00694-1&u=/mcom/1996-65-213/;
                 http://www.jstor.org/stable/2153842",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C7310 (Mathematics
                 computing); C1160 (Combinatorial mathematics)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "inversive; linear; maximal period length; nonlinear
                 congruential; number theory; pseudorandom number
                 generator; random number generation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kato:1996:STN,
  author =       "Takashi Kato and Li-Ming Wu and Niro Yanagihara",
  title =        "The serial test for a nonlinear pseudorandom number
                 generator",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "214",
  pages =        "761--769",
  month =        apr,
  year =         "1996",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "96g:65007",
  MRreviewer =   "Henri Faure",
  bibdate =      "Fri Jul 16 10:38:32 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-214;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kato:1996:NCP} for the original work, and
                 \cite{Kato:1997:LSP} for a treatment of the lattice
                 structure of the inversive congruential generator.",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00712-0&u=/mcom/1996-65-214/;
                 http://www.jstor.org/stable/2153612",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Chiba Univ., Japan",
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Math., Chiba Univ., Japan",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "2-dimensional serial test; maximal period length;
                 nonlinear pseudorandom number generator; random number
                 generation; serial test",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kemp:1996:CFP,
  author =       "C. David Kemp",
  title =        "The Construction of Fast Portable Multiplicative
                 Congruential Random Number Generators",
  journal =      j-CACM,
  volume =       "39",
  number =       "12es",
  pages =        "163--166",
  year =         "1996",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 29 10:36:33 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm39.html#Kemp96;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/cacm/1996-39-12es/a163-kemp/a163-kemp.pdf;
                 http://www.acm.org/pubs/citations/journals/cacm/1996-39-12es/a163-kemp/",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  oldlabel =     "Kemp96",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kemp96",
}

@Article{Koc:1996:ACM,
  author =       "{\c{C}}etin Kaya Ko{\c{c}} and Tolga Acar and Burton
                 S. {Kaliski, Jr.}",
  title =        "Analyzing and Comparing {Montgomery} Multiplication
                 Algorithms --- Assessing five algorithms that speed up
                 modular exponentiation, the most popular method of
                 encrypting and signing digital data",
  journal =      j-IEEE-MICRO,
  volume =       "16",
  number =       "3",
  pages =        "26--33",
  month =        may # "\slash " # jun,
  year =         "1996",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/40.502403",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; Science
                 Citation Index database (1980--2000)",
  acknowledgement = ack-nhfb,
  affiliation =  "Oregon State Univ",
  affiliationaddress = "Corvallis, OR, USA",
  classcodes =   "B6120B (Codes); C5230 (Digital arithmetic methods);
                 C6130S (Data security); C4240C (Computational
                 complexity)",
  classification = "723; 921; 921.6",
  corpsource =   "Oregon State Univ., Corvallis, OR, USA",
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
  keywords =     "Algorithms; computational complexity; Cryptography;
                 cryptography; digital arithmetic; digital data;
                 Iterative methods; key cryptography; Mathematical
                 models; Mathematical operators; Modular exponentiation;
                 modular exponentiation; Montgomery multiplication;
                 Montgomery multiplication algorithms; Montgomery
                 product; public key; Public key cryptography; public-;
                 requirements; space; time requirements",
  treatment =    "T Theoretical or Mathematical",
}

@Article{LEcuyer:1996:CMR,
  author =       "Pierre L'Ecuyer",
  title =        "Combined multiple recursive random number generators",
  journal =      j-OPER-RES,
  volume =       "44",
  number =       "5",
  pages =        "816--822",
  month =        oct,
  year =         "1996",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.44.5.816",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Sun Dec 18 09:27:54 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "Student:1908:PEM",
  abstract =     "We analyze the random number generators obtained by
                 combining two or more multiple recursive generators. We
                 study the lattice structure of such combined generators
                 and argue that combination is a good way of obtaining
                 robust generators, based on a recurrence with many
                 nonzero coefficients, and which also possess a fast
                 implementation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@Article{LEcuyer:1996:CSA,
  author =       "Pierre L'Ecuyer",
  title =        "Commentary --- Simulation of Algorithms for
                 Performance Analysis",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "8",
  number =       "1",
  pages =        "16--20",
  month =        "Winter",
  year =         "1996",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.8.1.16",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  bibdate =      "Fri Jan 06 17:47:57 2012",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
  keywords =     "random number generation",
}

@TechReport{LEcuyer:1996:LUG,
  author =       "P. L'Ecuyer and R. Couture",
  title =        "{LatMRG} user's guide: a toolkit for theoretical
                 testing of simple and combined linear congruential and
                 multiple recursive generators",
  type =         "Technical Report",
  institution =  "Universit{\'e} de",
  address =      "Montr{\'e}al, QC, Canada",
  year =         "1996",
  bibdate =      "Sat Feb 18 21:31:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:1996:MEC,
  author =       "Pierre L'Ecuyer",
  title =        "Maximally equidistributed combined {Tausworthe}
                 generators",
  journal =      j-MATH-COMPUT,
  volume =       "65",
  number =       "213",
  pages =        "203--213",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-96-00696-5",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "96d:65017",
  MRreviewer =   "Henri Faure",
  bibdate =      "Fri Jul 16 10:38:30 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1996-65-213;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-96-00696-5&u=/mcom/1996-65-213/",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C1160
                 (Combinatorial mathematics); C7310 (Mathematics
                 computing)",
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  keywords =     "maximally equidistributed; number theory; primitive;
                 random number generation; random number generators;
                 statistical properties; Tausworthe generators;
                 trinomial",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{LEcuyer:1996:RNG,
  author =       "Pierre L'Ecuyer",
  editor =       "Saul Irving Gass and Carl M. Harris",
  booktitle =    "Encyclopedia of Operations Research and Management
                 Science",
  title =        "Random Number Generators",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  bookpages =    "xl + 753",
  pages =        "571--578",
  year =         "1996",
  ISBN =         "0-7923-9590-5",
  ISBN-13 =      "978-0-7923-9590-4",
  LCCN =         "T57.6 .E53 1996",
  bibdate =      "Sat Mar 3 12:04:37 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:1996:TPR,
  author =       "P. L'Ecuyer and J.-F. Cordeau",
  booktitle =    "Compte-Rendus de {ASU'96}: Les {XXVIII-i{\`e}mes}
                 Journ{\'e}es de Statistique",
  title =        "Tests sur les points rapproch{\'e}s pour les
                 {g}{\'e}n{\'e}rateurs de valeurs al{\'e}atoires.
                 ({French}) [{Tests} on nearby points for random-number
                 generators]",
  publisher =    "????",
  address =      "D{\'e}partement de Math{\'e}matiques, Universit{\'e}
                 Laval, QC, Canada",
  pages =        "479--482",
  year =         "1996",
  bibdate =      "Sat Mar 3 10:37:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Lu:1996:PPG,
  author =       "Tan-Chun Lu and Yu-Song Hou and Rong-Jaye Chen",
  title =        "A parallel {Poisson} generator using parallel prefix",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "31",
  number =       "3",
  pages =        "33--42",
  month =        feb,
  year =         "1996",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(95)00204-9",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0898122195002049",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Book{Luby:1996:PCA,
  author =       "Michael George Luby",
  title =        "Pseudorandomness and cryptographic applications",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 234",
  year =         "1996",
  ISBN =         "0-691-02546-0",
  ISBN-13 =      "978-0-691-02546-9",
  LCCN =         "QA298 .L83 1996",
  bibdate =      "Sat Nov 18 12:53:52 MST 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Princeton computer science notes",
  acknowledgement = ack-nhfb,
  keywords =     "computational complexity; data encryption (computer
                 science); numbers, random; random number generators",
}

@Article{Luo:1996:TDS,
  author =       "Ping Luo",
  title =        "The two-dimensional structure of the sequence of
                 random numbers generated by multiplicative congruential
                 generators",
  journal =      j-J-NUMER-METHODS-COMPUT-APPL,
  volume =       "17",
  number =       "1",
  pages =        "48--56",
  year =         "1996",
  CODEN =        "????",
  ISSN =         "1000-3266",
  MRclass =      "65C10",
  MRnumber =     "1408136",
  bibdate =      "Wed Dec 21 08:41:00 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal on Numerical Methods and Computer
                 Applications. Shuzhi Jisuan yu Jisuanji Yingyong",
}

@Article{Marini:1996:CHR,
  author =       "Marc Marini",
  title =        "A Class Hierarchy for Random Number Generation",
  journal =      j-CCCUJ,
  volume =       "14",
  number =       "10",
  pages =        "51--??",
  month =        oct,
  year =         "1996",
  CODEN =        "CCUJEX",
  ISSN =         "1075-2838",
  bibdate =      "Wed Nov 6 07:30:58 MST 1996",
  bibsource =    "http://www.cuj.com/cbklist.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "C/C++ Users Journal",
}

@TechReport{Marsaglia:1996:DBT,
  author =       "George Marsaglia",
  title =        "{DIEHARD}: a Battery of Tests of Randomness",
  type =         "Technical report",
  number =       "????",
  institution =  "Florida State University",
  address =      "Tallahassee, FL, USA",
  year =         "1996",
  bibdate =      "Mon Aug 02 10:51:00 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://euler.bd.psu.edu/~naras/diehard/snapshots.html;
                 http://stat.fsu.edu/~geo/;
                 http://www.stat.fsu.edu/pub/diehard/",
  acknowledgement = ack-nhfb,
}

@TechReport{Masuda:1996:PPR,
  author =       "N. Masuda and F. Zimmerman",
  title =        "{PRNGlib}: a Parallel Random Number Generator
                 Library",
  type =         "Technical Report",
  number =       "TR-96-08",
  institution =  "Swiss Center for Scientific Computing",
  address =      "Lugano, Switzerland",
  pages =        "48",
  year =         "1996",
  bibdate =      "Sat Mar 3 10:39:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Matsumoto:1996:SDR,
  author =       "Makoto Matsumoto and Yoshiharu Kurita",
  title =        "Strong deviations from randomness in $m$-sequences
                 based on trinomials",
  journal =      j-TOMACS,
  volume =       "6",
  number =       "2",
  pages =        "99--106",
  month =        apr,
  year =         "1996",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:32 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Matthews:1996:SRN,
  author =       "Tim Matthews",
  title =        "Suggestions for Random Number Generation in Software",
  journal =      "{RSA Laboratories' Bulletin}",
  volume =       "1",
  pages =        "1--4",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Dec 08 09:41:48 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://ftp.rsasecurity.com/pub/pdfs/bull-1.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Mikhailov:1996:ENU,
  author =       "G. A. Mikhailov and M. V. Antipov",
  title =        "Estimations of non-uniformity for distributions of the
                 congruent sums of random values",
  journal =      j-DOKL-AKAD-NAUK,
  volume =       "347",
  number =       "1",
  pages =        "23--26",
  month =        "????",
  year =         "1996",
  CODEN =        "DANKAS",
  ISSN =         "0002-3264",
  bibdate =      "Thu Mar 01 07:44:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Doklady Akademii nauk SSSR",
  journal-URL =  "http://istina.msu.ru/journals/366838/",
  language =     "Russian",
}

@Article{Mikhailov:1996:RSR,
  author =       "V. G. Mikha{\u\i}lov",
  title =        "Repetition of States of a Random-Number Generator
                 under Multiple Access",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "40",
  number =       "4",
  pages =        "679--689",
  month =        "????",
  year =         "1996",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/1140077",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "65C10",
  MRnumber =     "97h:65013",
  bibdate =      "Tue Apr 1 10:41:44 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/40/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 40}(4), (1995), pp. 786--797.",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 1996",
  xxauthor =     "V. G. Mikhailov",
  xxtitle =      "On the repeatability of the states of a pseudorandom
                 number generator under multiple use",
}

@Article{Mikov:1996:LSA,
  author =       "Alexander I. Mikov",
  title =        "Large-scale addition of machine real numbers:
                 {Accuracy} estimates",
  journal =      j-THEOR-COMP-SCI,
  volume =       "162",
  number =       "1",
  pages =        "151--170",
  day =          "05",
  month =        aug,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=162&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=162&issue=1&aid=2194",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Perm State Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "accuracy estimates; digital arithmetic; floating-point
                 arithmetic; large-scale addition; machine real numbers;
                 positive independent random variables; random
                 variables; real distribution interval; roundoff error",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mulmuley:1996:RGA,
  author =       "Ketan Mulmuley",
  title =        "Randomized Geometric Algorithms and Pseudorandom
                 Generators",
  journal =      j-ALGORITHMICA,
  volume =       "16",
  number =       "4--5",
  pages =        "450--463",
  year =         "1996",
  CODEN =        "ALGOEJ",
  ISSN =         "0178-4617 (print), 1432-0541 (electronic)",
  ISSN-L =       "0178-4617",
  MRclass =      "68U05 (68Q10 68Q25)",
  MRnumber =     "MR1407584 (97e:68137)",
  MRreviewer =   "Evangelos Kranakis",
  bibdate =      "Mon Jan 22 05:32:45 MST 2001",
  bibsource =    "dblp-journals-algorithmica.bib;
                 http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica16.html#Mulmuley96;
                 https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
                 https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Algorithmica. An International Journal in Computer
                 Science",
  journal-URL =  "http://link.springer.com/journal/453",
  oldlabel =     "Mulmuley96",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Mulmuley96",
}

@InProceedings{Nemnyugin:1996:SRW,
  author =       "S. Nemnyugin and A. Larionov",
  editor =       "Peter Borcherds and Marian Bubak and Andrzej
                 Maksymowicz",
  booktitle =    "{Proceedings of the 8th Joint EPS-APS International
                 Conference on Physics Computing: PC '96: September
                 17--21, 1996, Krak{\'o}w, Poland}",
  title =        "Set of random walk tests for pseudorandom generators",
  publisher =    "Academic Computer Centre CYFRONET",
  address =      "Krak{\'o}w, Poland",
  bookpages =    "xvi + 603",
  pages =        "269--272",
  year =         "1996",
  ISBN =         "83-902363-3-8",
  ISBN-13 =      "978-83-902363-3-9",
  LCCN =         "QC20 .I45 1996",
  bibdate =      "Sun Feb 12 09:11:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:1996:IBM,
  author =       "Harald Niederreiter",
  title =        "Improved Bounds in the Multiple-Recursive Matrix
                 Method for Pseudorandom Number and Vector Generation",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "2",
  number =       "3",
  pages =        "225--240",
  month =        jul,
  year =         "1996",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1996.0015",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 16:08:12 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579796900155",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Niederreiter:1996:LDS,
  author =       "H. Niederreiter and C. Xing",
  title =        "Low-Discrepancy Sequences and Global Function Fields
                 with Many Rational Places",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "2",
  number =       "3",
  pages =        "241--273",
  month =        "????",
  year =         "1996",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1996.0016",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  MRclass =      "11K38 (11R58 11T99)",
  MRnumber =     "1398076 (97h:11080)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Sat Mar 3 10:41:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Niederreiter:1996:QPG,
  author =       "H. Niederreiter and C. Xing",
  title =        "Quasirandom points and global function fields",
  crossref =     "Cohen:1996:FFA",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "269--296",
  year =         "1996",
  bibdate =      "Sat Mar 3 10:42:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "London Mathematical Society lecture note series",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nisan:1996:ERH,
  author =       "N. Nisan",
  editor =       "Steve Homer and Jin-Yi Cai",
  booktitle =    "{Proceedings of the 11th Annual IEEE Conference on
                 Computational Complexity, 24--27 May 1996}",
  title =        "Extracting Randomness: How and Why, a Survey",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "44--58",
  year =         "1996",
  DOI =          "https://doi.org/10.1109/CCC.1996.507667",
  ISBN =         "0-8186-7386-9, 0-8186-7387-7 (casebound),
                 0-8186-7388-5 (microfiche)",
  ISBN-13 =      "978-0-8186-7386-3, 978-0-8186-7387-0 (casebound),
                 978-0-8186-7388-7 (microfiche)",
  LCCN =         "QA267 S927 1996",
  bibdate =      "Sat Mar 3 10:51:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ogawa:1996:RRP,
  author =       "Shigeyoshi Ogawa",
  title =        "On a Robustness of The Random Particle Method",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "2",
  number =       "3",
  pages =        "175--189",
  month =        "????",
  year =         "1996",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1996.2.3.175",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C05",
  MRnumber =     "1414863 (97j:65008)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/issue-files/mcma.1996.2.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{Ogawa:1997:EAR}.",
  URL =          "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/mcma.1996.2.3.175/mcma.1996.2.3.175.xml;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Paplinski:1996:HIL,
  author =       "A. P. Paplinski and N. Bhattacharjee",
  title =        "Hardware implementation of the {Lehmer} random number
                 generator",
  journal =      j-IEE-PROC-COMPUT-DIGIT-TECH,
  volume =       "143",
  number =       "1",
  pages =        "93--95",
  year =         "1996",
  CODEN =        "ICDTEA",
  DOI =          "https://doi.org/10.1049/ip-cdt:19960100",
  ISSN =         "1350-2387 (print), 1359-7027 (electronic)",
  ISSN-L =       "1350-2387",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?ICE/143/93/1",
  acknowledgement = ack-nhfb,
  fjournal =     "IEE Proceedings. Computers and Digital Techniques",
  keywords =     "carry-propagate adder; carry-propagate subtracter;
                 carry-save adders; fast hardware implementation; Lehmer
                 random number generator; linear congruential;
                 multiplication mod M; pseudorandom number generators;
                 Sylvester resultant matrices",
}

@Article{Petrov:1996:LTP,
  author =       "Valentin V. Petrov and Wlodzimierz Bryc",
  title =        "Limit Theorems of Probability Theory: Sequences of
                 Independent Random Variables",
  journal =      j-SIAM-REVIEW,
  volume =       "38",
  number =       "3",
  pages =        "527--??",
  month =        sep,
  year =         "1996",
  CODEN =        "SIREAD",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Tue May 13 16:55:17 MDT 1997",
  bibsource =    "http://www.siam.org/journals/sirev/sirev383.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
}

@Article{Radovic:1996:QMC,
  author =       "Igor Radovi{\'c} and Ilya M. Sobol and Robert F.
                 Tichy",
  title =        "Quasi-{Monte Carlo} Methods for Numerical Integration:
                 Comparison of Different Low Discrepancy Sequences",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "2",
  number =       "1",
  pages =        "1--14",
  month =        jan,
  year =         "1996",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1996.2.1.1",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  bibdate =      "Mon Feb 27 12:42:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1996.2.issue-1/mcma.1996.2.1.1/mcma.1996.2.1.1.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Rubin:1996:OTP,
  author =       "Frank Rubin",
  title =        "One-Time Pad Cryptography",
  journal =      j-CRYPTOLOGIA,
  volume =       "20",
  number =       "4",
  pages =        "359--364",
  year =         "1996",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119691885040",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Sun May 15 12:00:38 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/titles/01611194.asp;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "his paper shows how a moderate amount of random key
                 stream can be used to generate a lifetime supply of
                 keys for one-time pads. It further shows how
                 arbitrarily many parties can correspond using the same
                 random key, without compromising one another's
                 communications. The net effect is to make the
                 unbreakable one-time pad practical for widespread
                 use.",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
}

@Article{Sanchis:1996:PAC,
  author =       "Laura A. Sanchis and Matthew B. Squire",
  title =        "Parallel Algorithms for Counting and Randomly
                 Generating Integer Partitions",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "34",
  number =       "1",
  pages =        "29--35",
  day =          "10",
  month =        apr,
  year =         "1996",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1006/jpdc.1996.0043",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Mar 9 09:18:59 MST 2000",
  bibsource =    "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0043/production;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0043/production/pdf",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5230 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Colgate Univ., Hamilton, NY,
                 USA",
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
  keywords =     "adaptive algorithms; algorithms; counting; parallel
                 algorithms; parallel logarithmic time; random number
                 generation; randomly generating integer partitions",
  treatment =    "P Practical",
}

@Article{Sarkar:1996:CAM,
  author =       "T. K. Sarkar",
  title =        "A Composition-Alias Method for Generating Gamma
                 Variates with Shape Parameter Greater than 1",
  journal =      j-TOMS,
  volume =       "22",
  number =       "4",
  pages =        "484--492",
  month =        dec,
  year =         "1996",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/235815.235822",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1996-22-4/p484-sarkar/",
  abstract =     "In this article the author describes a procedure for
                 generating gamma variates with shape parameter $ > 1 $.
                 Given a supply of ``good'' uniform $ (0, 1) $ variates,
                 the procedure makes use of composition method, squeeze
                 method, and aliasing to generate gamma variates.
                 Comparison with existing methods shows that the
                 author's method is faster in terms of computer time and
                 uses a smaller number of uniform $ (0, 1) $ variates.
                 The method is also statistically exact.",
  acknowledgement = ack-rfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
  keywords =     "algorithms, theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
}

@Article{Schervish:1996:VWT,
  author =       "Mark J. Schervish",
  title =        "{$P$} Values: What They Are and What They Are Not",
  journal =      j-AMER-STAT,
  volume =       "50",
  number =       "3",
  pages =        "203--206",
  month =        aug,
  year =         "1996",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "62F03 (62A99)",
  MRnumber =     "1 422 069",
  bibdate =      "Fri Jan 27 14:51:23 MST 2012",
  bibsource =    "http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326473;
                 https://www.math.utah.edu/pub/tex/bib/amstat1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2684655",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Book{Schneier:1996:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xxiii + 758",
  year =         "1996",
  ISBN =         "0-471-12845-7 (cloth), 0-471-11709-9 (paper)",
  ISBN-13 =      "978-0-471-12845-8 (cloth), 978-0-471-11709-4 (paper)",
  LCCN =         "QA76.9.A25 S35 1996",
  bibdate =      "Tue Oct 20 17:50:50 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sethumadhavan:1996:NPE,
  author =       "M. Sethumadhavan",
  title =        "On nonoverlapping pairs of explicit inversive
                 congruential pseudorandom numbers",
  journal =      "Bull. Pure Appl. Sci. Sect. E Math. Stat.",
  volume =       "15",
  number =       "2",
  pages =        "157--164",
  year =         "1996",
  CODEN =        "????",
  ISSN =         "0970-6577",
  MRclass =      "65C10",
  MRnumber =     "1443304 (98c:65007)",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Bulletin of Pure \& Applied Sciences. Section E.
                 Mathematics and Statistics",
}

@Article{Sezgin:1996:RNG,
  author =       "Fatin Sezgin",
  title =        "A random number generator for 16-bit microcomputers",
  journal =      j-COMP-OP-RES,
  volume =       "23",
  number =       "2",
  pages =        "193--198",
  month =        feb,
  year =         "1996",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/0305-0548(95)00006-8",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Fri Mar 09 09:06:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0305054895000068",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
  remark =       "The author tests the linear congruential generator
                 parameters reported in \cite{Chang:1994:SGM}, finds
                 some weakness, and proposes an alternative
                 very-long-period generator.",
}

@Article{Sezgin:1996:SIR,
  author =       "F. Sezgin",
  title =        "Some improvements for a random number generator with
                 single-precision floating-point arithmetic",
  journal =      j-COMP-GEOSCI,
  volume =       "22",
  number =       "4",
  publisher =    "Elsevier Science",
  pages =        "453--455",
  month =        may,
  year =         "1996",
  CODEN =        "CGEODT, CGOSDN",
  ISSN =         "0098-3004 (print), 1873-7803 (electronic)",
  ISSN-L =       "0098-3004",
  bibdate =      "Fri Nov 8 05:39:32 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; Ingenta
                 database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Geosciences",
  pagecount =    "3",
}

@Article{Sipper:1996:CEP,
  author =       "M. Sipper and M. Tomassini",
  title =        "Co-evolving Parallel Random Number Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1141",
  pages =        "950--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Dec 21 09:47:26 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Sipper:1996:GPR,
  author =       "Moshe Sipper and Marco Tomassini",
  title =        "Generating parallel random number generators by
                 cellular programming",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "7",
  number =       "2",
  pages =        "181--190",
  month =        apr,
  year =         "1996",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S012918319600017X",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 21:51:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@Article{Takashima:1996:HWT,
  author =       "Keizo Takashima",
  title =        "On {Hamming} weight test and sojourn time test of
                 $m$-sequences",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "2",
  number =       "4",
  pages =        "331--340",
  month =        "????",
  year =         "1996",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1996.2.4.331",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10 (60J15)",
  MRnumber =     "1434425 (97k:65020)",
  MRreviewer =   "Petru P. Blaga",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1996.2.issue-4/issue-files/mcma.1996.2.issue-4.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1996.2.issue-4/mcma.1996.2.4.331/mcma.1996.2.4.331.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Takashima:1996:LVT,
  author =       "K. Takashima",
  title =        "Last visit time tests for pseudo-random numbers",
  journal =      j-J-JAPAN-SOC-COMPUT-STAT,
  volume =       "9",
  number =       "1",
  pages =        "1--14",
  month =        "????",
  year =         "1996",
  ISSN =         "0915-2350 (print), 1881-1337 (electronic)",
  ISSN-L =       "0915-2350",
  bibdate =      "Thu Mar 01 08:01:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Japanese Society of Computational
                 Statistics",
}

@InProceedings{Takashima:1996:STT,
  author =       "K. Takashima and S. Ueda",
  editor =       "Shinzo Watanabe and M. Fukushima and Yu. V. Prohorov
                 and A. N. Shiryaev",
  booktitle =    "Probability Theory and Mathematical Statistics:
                 proceedings of the {Seventh Japan--Russia symposium:
                 Tokyo, 26--30 July 1995}",
  title =        "Sojourn time test of $m$-sequences by {Fushimi}'s fast
                 generation methods",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  bookpages =    "x + 515",
  pages =        "471--477",
  year =         "1996",
  ISBN =         "981-02-2426-5",
  ISBN-13 =      "978-981-02-2426-4",
  LCCN =         "QA276.A1 P962 1995",
  bibdate =      "Thu Mar 01 08:06:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ugrin-Sparac:1996:NAG,
  author =       "Dimitrije Ugrin-{\v{S}}parac",
  title =        "A Natural Algorithm for Generation of Pseudo-Random
                 Numbers and its Applications",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "2",
  number =       "3",
  pages =        "191--217",
  month =        "????",
  year =         "1996",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1996.2.3.191",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "1414864 (98g:65014)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/issue-files/mcma.1996.2.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1996.2.issue-3/mcma.1996.2.3.191/mcma.1996.2.3.191.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Ugrin-Sparac:1996:PET,
  author =       "G. Ugrin-{\v{S}}parac and D. Ugrin-{\v{S}}parac",
  title =        "On a Possible Error of Type {II} in Statistical
                 Evaluation of Pseudo-Random Number Generators",
  journal =      j-COMPUTING,
  volume =       "56",
  number =       "2",
  pages =        "105--116",
  month =        jun,
  year =         "1996",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (62F03)",
  MRnumber =     "97b:65010",
  bibdate =      "Fri Oct 15 15:41:00 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=289&id_volume=26&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "723.5; 921.6; 922.2",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Computer simulation; Error analysis; Pseudo random
                 number generators; Random number generation; Renewal
                 process; Statistical evaluation; Statistical tests",
}

@Article{Wallace:1996:FPG,
  author =       "C. S. Wallace",
  title =        "Fast pseudorandom generators for normal and
                 exponential variates",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "119--127",
  month =        mar,
  year =         "1996",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/225545.225554",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  note =         "See comments \cite{Brent:2008:SCC}.",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1996-22-1/p119-wallace/",
  abstract =     "Fast algorithms for generating pseudorandom numbers
                 from the unit-normal and unit-exponential distributions
                 are described. The methods are unusual in that they do
                 not rely on a source of uniform random numbers, but
                 generate the target distributions directly by using
                 their maximal-entropy properties. The algorithms are
                 fast. The normal generator is faster than the commonly
                 used Unix library uniform generator ``random'' when the
                 latter is used to yield real values. Their statistical
                 properties seem satisfactory, but only a limited suite
                 of tests has been conducted. They are written in C and
                 as written assume 32-bit integer arithmetic. The code
                 is publicly available as C source and can easily be
                 adopted for longer word lengths and/or vector
                 processing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; design; performance",
  remark =       "Wallace's generators produce normal and exponential
                 distributions directly, without first generation
                 numbers from a uniform distribution.",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@InProceedings{Wang:1996:LIL,
  author =       "Yongge Wang",
  editor =       "Steve Homer and Jin-Yi Cai",
  booktitle =    "{Proceedings of the 11th Annual IEEE Conference on
                 Computational Complexity, 24--27 May 1996}",
  title =        "The Law of the Iterated Logarithm for $p$-Random
                 Sequences",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "180--189",
  year =         "1996",
  DOI =          "https://doi.org/10.1109/CCC.1996.507680",
  ISBN =         "0-8186-7386-9, 0-8186-7387-7 (casebound),
                 0-8186-7388-5 (microfiche)",
  ISBN-13 =      "978-0-8186-7386-3, 978-0-8186-7387-0 (casebound),
                 978-0-8186-7388-7 (microfiche)",
  LCCN =         "QA267 S927 1996",
  bibdate =      "Sat Mar 3 10:55:40 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wegenkittl:1996:RSP,
  author =       "S. Wegenkittl and K. Entacher",
  title =        "On the relevance of splitting properties and the
                 compound method in parallel applications of
                 pseudorandom number generators",
  crossref =     "Trobec:1996:PIW",
  pages =        "??--??",
  year =         "1996",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/publications/ste/PACT_slovenia/art.ps.gz",
  acknowledgement = ack-nhfb,
}

@Article{Alon:1997:SSD,
  author =       "Noga Alon and Shai Ben-David and Nicol{\`o}
                 Cesa-Bianchi and David Haussler",
  title =        "Scale-sensitive dimensions, uniform convergence, and
                 learnability",
  journal =      j-J-ACM,
  volume =       "44",
  number =       "4",
  pages =        "615--631",
  month =        jul,
  year =         "1997",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/263867.263927",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 26 06:43:32 MST 1997",
  bibsource =    "http://www.acm.org/pubs/contents/journals/jacm/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p615-alon/",
  abstract =     "Learnability in Valiant's PAC learning model has been
                 shown to be strongly related to the existence of
                 uniform laws of large numbers. These laws define a
                 distribution-free convergence property of means to
                 expectations uniformly over classes of random
                 variables. Classes of real-valued functions enjoying
                 such a property are also known as uniform
                 Glivenko--Cantelli classes. In this paper, we prove,
                 through a generalization of Sauer's lemma that may be
                 interesting in its own right, a new characterization of
                 uniform Glivenko-Cantelli classes. Our characterization
                 yields Dudley, Gin{\'e}, and Zinn's previous
                 characterization as a corollary. Furthermore, it is the
                 first based on a Gin{\'e}, and Zinn's previous
                 characterization as a corollary. Furthermore, it is the
                 first based on a simple combinatorial quantity
                 generalizing the Vapnik--Chervonenkis dimension. We
                 apply this result to obtain the weakest combinatorial
                 condition known to imply PAC learnability in the
                 statistical regression (or ``agnostic'') framework.
                 Furthermore, we find a characterization of learnability
                 in the probabilistic concept model, solving an open
                 problem posed by Kearns and Schapire. These results
                 show that the accuracy parameter plays a crucial role
                 in determining the effective complexity of the
                 learner's hypothesis class.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "theory",
  subject =      "{\bf I.2.6} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Concept learning.",
}

@Article{Aluru:1997:LFR,
  author =       "Srinivas Aluru",
  title =        "Lagged {Fibonacci} Random Number Generators for
                 Distributed Memory Parallel Computers",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "45",
  number =       "1",
  pages =        "1--12",
  day =          "25",
  month =        aug,
  year =         "1997",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1006/jpdc.1997.1363",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Mar 9 09:19:03 MST 2000",
  bibsource =    "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.idealibrary.com/links/doi/10.1006/jpdc.1997.1363/production;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1997.1363/production/pdf;
                 http://www.idealibrary.com/links/doi/10.1006/jpdc.1997.1363/production/ref",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Annexstein:1997:GBS,
  author =       "F. S. Annexstein",
  title =        "Generating {de Bruijn} sequences: an efficient
                 implementation",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "46",
  number =       "2",
  pages =        "198--200",
  month =        feb,
  year =         "1997",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.565596",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jul 6 10:06:20 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=565596",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Arvind:1997:RBM,
  author =       "V. Arvind and J. K{\"o}bler",
  title =        "On Resource-Bounded Measure and Pseudorandomness",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1346",
  pages =        "235--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:51:29 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1346.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1346/13460235.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1346/13460235.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Athanasiu:1997:SGP,
  author =       "G. G. Athanasiu and E. G. Floratos and G. K. Savvidy",
  title =        "{$K$}-System Generator of Pseudorandom Numbers on
                 {Galois} Field",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "8",
  number =       "3",
  pages =        "555--565",
  month =        jun,
  year =         "1997",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183197000448",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 22:21:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/08/0803/S0129183197000448.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@Article{Baker:1997:NPU,
  author =       "Frank B. Baker",
  title =        "A note on the proper use of the {{\booktitle{Numerical
                 Recipes}}} {{\tt RAN1}} random number generator",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "25",
  number =       "2",
  pages =        "237--239",
  day =          "31",
  month =        jul,
  year =         "1997",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/S0167-9473(97)89649-1",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Fri Feb 6 11:40:19 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computstatdataanal1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{Antoch:1998:RPN}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947397896491",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Balakrishnan:1997:ASW,
  author =       "Hari Balakrishnan and Mark Stemm and Srinivasan Seshan
                 and Randy H. Katz",
  title =        "Analyzing stability in wide-area network performance",
  journal =      j-SIGMETRICS,
  volume =       "25",
  number =       "1",
  pages =        "2--12",
  month =        jun,
  year =         "1997",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/258612.258631",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:23:09 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "The Internet is a very large scale, complex, dynamical
                 system that is hard to model and analyze. In this
                 paper, we develop and analyze statistical models for
                 the observed end-to-end network performance based on
                 extensive packet-level traces (consisting of
                 approximately 1.5 billion packets) collected from the
                 primary Web site for the Atlanta Summer Olympic Games
                 in 1996. We find that observed mean throughputs for
                 these transfers measured over 60 million complete
                 connections vary widely as a function of end-host
                 location and time of day, confirming that the Internet
                 is characterized by a large degree of heterogeneity.
                 Despite this heterogeneity, we find (using best-fit
                 linear regression techniques) that we can express the
                 throughput for Web transfers to most hosts as a random
                 variable with a log-normal distribution. Then, using
                 observed throughput as the control parameter, we
                 attempt to quantify the {\em spatial\/} (statistical
                 similarity across neighboring hosts) and {\em
                 temporal\/} (persistence over time) stability of
                 network performance. We find that Internet hosts that
                 are close to each other often have almost identically
                 distributed probability distributions of throughput. We
                 also find that throughputs to individual hosts often do
                 not change appreciably for several minutes. Overall,
                 these results indicate that there is promise in
                 protocol mechanisms that cache and share network
                 characteristics both within a single host and amongst
                 nearby hosts.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Article{Bellare:1997:PRN,
  author =       "Mihir Bellare and Shafi Goldwasser and Daniele
                 Micciancio",
  title =        "{``Pseudo-Random''} Number Generation within
                 Cryptographic Algorithms: The {DSS} Case",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1294",
  pages =        "277--291",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:51:15 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1294.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1294/12940277.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1294/12940277.pdf",
  abstract =     "The DSS signature algorithm requires the signer to
                 generate a new random number with every signature. We
                 show that if random numbers for DSS are generated using
                 a linear congruential pseudorandom number generator
                 (LCG) then the secret key can be quickly recovered
                 after seeing a few signatures. This illustrates the
                 high vulnerability of the DSS to weaknesses in the
                 underlying random number generation process. It also
                 confirms, that a sequence produced by LCG is not only
                 predictable as has been known before, but should be
                 used with extreme caution even within cryptographic
                 applications that would appear to protect this
                 sequence. The attack we present applies to truncated
                 linear congruential generators as well, and can be
                 extended to any pseudo random generator that can be
                 described via modular linear equations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Berblinger:1997:MCI,
  author =       "M. Berblinger and Ch. Schlier and T. Weiss",
  title =        "{Monte Carlo} integration with quasi-random numbers:
                 experience with discontinuous integrands",
  journal =      j-COMP-PHYS-COMM,
  volume =       "99",
  number =       "2--3",
  pages =        "151--162",
  month =        jan,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(96)00131-2",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465596001312",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Berg:1997:CNF,
  author =       "Peer Berg and Bob Runyan and Henry Zongaro and Steve
                 Lionel and Stu Anderson and Alan Miller and Albert
                 Fasso and Phillip Helbig and Loren Meissner",
  title =        "Captured on the {Net}: {Fortran} Random Number
                 Generators, Intrinsic and Otherwise",
  journal =      j-FORTRAN-FORUM,
  volume =       "16",
  number =       "3",
  pages =        "3--4",
  month =        dec,
  year =         "1997",
  CODEN =        "????",
  ISSN =         "1061-7264 (print), 1931-1311 (electronic)",
  ISSN-L =       "1061-7264",
  bibdate =      "Thu Feb 07 06:54:12 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran-forum.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Fortran Forum",
  issue =        "50",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J286",
}

@Article{Binder:1997:AMC,
  author =       "K. Binder",
  title =        "Applications of {Monte Carlo} methods in statistical
                 physics",
  journal =      j-REP-PROG-PHYS,
  volume =       "60",
  number =       "5",
  pages =        "487--559",
  month =        may,
  year =         "1997",
  CODEN =        "RPPHAG",
  ISSN =         "0034-4885 (print), 1361-6633 (electronic)",
  ISSN-L =       "0034-4885",
  bibdate =      "Sat Oct 31 16:09:31 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://iopscience.iop.org/0034-4885/60/5;
                 http://stacks.iop.org/0034-4885/60/i=5/a=001",
  abstract =     "An introductory review of the Monte Carlo method for
                 the statistical mechanics of condensed matter systems
                 is given. Basic principles (random number generation,
                 simple sampling versus importance sampling, Markov
                 chains and master equations, etc) are explained and
                 some classical applications (self-avoiding walks,
                 percolation, the Ising model) are sketched. The
                 finite-size scaling analysis of both second- and
                 first-order phase transitions is described in detail,
                 and also the study of surface and interfacial phenomena
                 as well as the choice of appropriate boundary
                 conditions is discussed. Only brief comments are given
                 on topics such as applications to dynamic phenomena,
                 quantum problems, and recent algorithmic developments
                 (new sampling schemes based on reweighting techniques,
                 nonlocal updating, parallelization, etc). The
                 techniques described are exemplified with many
                 illustrative applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "Reports on Progress in Physics",
  journal-URL =  "http://iopscience.iop.org/0034-4885",
}

@Book{Binder:1997:MCS,
  author =       "K. (Kurt) Binder and Dieter W. Heermann",
  title =        "{Monte Carlo} simulation in statistical physics: an
                 introduction",
  volume =       "80",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "x + 150",
  year =         "1997",
  ISBN =         "3-540-63265-4 (softcover)",
  ISBN-13 =      "978-3-540-63265-8 (softcover)",
  ISSN =         "0171-1873",
  ISSN-L =       "0171-1873",
  LCCN =         "QC174.85.M64 B56 1997",
  bibdate =      "Sat Feb 8 18:03:14 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in solid-state sciences",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method; Statistical physics; Random walks
                 (Mathematics)",
}

@TechReport{Cario:1997:MGR,
  author =       "M. C. Cario and B. L. Nelson",
  title =        "Modeling and Generating Random Vectors with Arbitrary
                 Marginal Distributions and Correlation Matrix",
  type =         "Technical Report",
  institution =  "Department of Industrial Engineering and Management
                 Sciences, Northwestern University",
  address =      "Evanston, IL, USA",
  year =         "1997",
  bibdate =      "Thu Jan 05 17:20:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Coddington:1997:RNG,
  author =       "P. Coddington",
  title =        "Random number generators for parallel computers",
  type =         "Technical Report",
  number =       "13",
  institution =  "Northeast Parallel Architecture Center, Syracuse
                 University",
  address =      "Syracuse, NY, 13244-4100, USA",
  pages =        "26",
  day =          "28",
  month =        apr,
  year =         "1997",
  bibdate =      "Sun Dec 18 09:14:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Version 1.1",
  URL =          "http://surface.syr.edu/npac/13",
  abstract =     "Random number generators are used in many
                 applications, from slot machines to simulations of
                 nuclear reactors. For many computational science
                 applications, such as Monte Carlo simulation, it is
                 crucial that the generators have good randomness
                 properties. This is particularly true for large-scale
                 simulations done on high-performance parallel
                 computers. Good random number generators are hard to
                 find, and many widely-used techniques have been shown
                 to be inadequate. Finding high-quality, efficient
                 algorithms for random number generation on parallel
                 computers is even more difficult. Here we present a
                 review of the most commonly-used random number
                 generators for parallel computers, and evaluate each
                 generator based on theoretical knowledge and empirical
                 tests. In conclusion, we provide recommendations for
                 using random number generators on parallel computers.",
  acknowledgement = ack-nhfb,
  remark =       "Among the lessons of this paper are these:\par

                 Page 3: ``Random number generators, particular for
                 parallel computers, should not be trusted. It is {\bf
                 strongly} recommended that all simulations be done with
                 two or more different generators, and the results
                 compared to check whether the random number generator
                 is introducing a bias.''.\par

                 Page 5: ``In using a random number generator, it's
                 usually better to be slow than sorry.''\par

                 Page 12: To step ahead $n$ sequence members (the
                 leapfrog method) with a linear congruential generator,
                 replace the multiplier $a$ by $ A = a^n \bmod m $, and
                 the constant $c$ by $ C = c (a^n - 1) / (a - 1) \bmod m
                 $.\par

                 Page 12: ``A potentially serious problem with the
                 leapfrog method is that although the multiplier $a$ may
                 be chosen to perform well in the Spectral Test, there
                 is no guarantee that $ A = a^N $ will also have good
                 spectral properties.''\par

                 Page 16: ``The main recommendation we would give to
                 someone who needs to use a random number generator on a
                 parallel computer is simple --- never trust a parallel
                 random number generator.''",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Compagner:1997:RER,
  author =       "A. Compagner and A. S. Berdnikov and S. B. Turtia and
                 A. Larionov",
  title =        "Rounding errors in random number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "106",
  number =       "3",
  pages =        "207--218",
  month =        nov,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00070-2",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597000702",
  abstract =     "The deviations of the cumulative distribution function
                 from the uniform one for the pseudorandom floating
                 point values produced by integer arithmetics are
                 discussed. It is shown that the conversion from fixed
                 point values into floating point values introduces
                 specific artefacts even when the integer arithmetics
                 guarantees ideal uniformity. Two type of defects are
                 considered: the appearance of the value 1.0 among
                 pseudorandom values, and the sharp jumps of uniformity
                 at the level of discreteness which corresponds to the
                 computer representation of the floating point values.
                 The non-uniformity at small level of discreteness can
                 be neglected in most cases, but the appearance of the
                 parasitic value 1.0 where nobody expects it can be very
                 dangerous if special precautions are not taken by the
                 user. Both defects are demonstrated using the random
                 number generator from the system library of the
                 Microsoft Power Station Fortran 1.0.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Couture:1997:DPM,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "Distribution properties of multiply-with-carry random
                 number generators",
  journal =      j-MATH-COMPUT,
  volume =       "66",
  number =       "218",
  pages =        "591--607",
  month =        apr,
  year =         "1997",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-97-00827-2",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "MR1401939 (98i:65007)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Fri Jul 16 10:38:42 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1997-66-218;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-97-00827-2&u=/mcom/1997-66-218/;
                 http://www.jstor.org/stable/2153884",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Dai:1997:RCD,
  author =       "Liyi Dai",
  title =        "Rate of Convergence for Derivative Estimation of
                 Discrete-Time {Markov} Chains via Finite-Difference
                 Approximation with {Common Random Numbers}",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "57",
  number =       "3",
  pages =        "731--751",
  month =        jun,
  year =         "1997",
  CODEN =        "SMJMAP",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  MRclass =      "60J10 (60G17 62C20)",
  MRnumber =     "98a:60092; 1 450 847",
  bibdate =      "Thu Apr 9 10:55:15 MDT 1998",
  bibsource =    "Compendex database;
                 http://epubs.siam.org/sam-bin/dbq/toc/SIAP/57/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/27173",
  acknowledgement = ack-nhfb,
  affiliation =  "Washington Univ",
  affiliationaddress = "St. Louis, MO, USA",
  classification = "723.5; 921.2; 921.6; 922.1; 922.2",
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  journalabr =   "SIAM J Appl Math",
  keywords =     "Approximation theory; Common Random Numbers (CRN);
                 Computer simulation; Convergence of numerical methods;
                 Differentiation (calculus); Discrete time Markov
                 chains; Finite difference method; Markov processes;
                 Probability; Random number generation",
}

@Article{Dai:1997:RRW,
  author =       "Jack J. Dai and Martin V. Hildebrand",
  title =        "Random random walks on the integers $ \bmod n $",
  journal =      j-STAT-PROB-LETT,
  volume =       "35",
  number =       "4",
  pages =        "371--379",
  day =          "1",
  month =        nov,
  year =         "1997",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/S0167-7152(97)00035-7",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  bibdate =      "Tue Feb 14 09:41:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167715297000357",
  abstract =     "This paper considers typical random walks on the
                 integers $ \bmod n $ such that the random walk is
                 supported on constant $k$ values. This paper extends a
                 result of Hildebrand \cite{Hildebrand:1994:RWS} to show
                 that for any integer $n$, roughly $ n^{2 / (k - 1)} $
                 steps usually suffice to get the random walk close to
                 uniformly distributed if the $k$ values satisfy some
                 conditions needed for the random walk to get close to
                 uniformly distributed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
}

@Article{Deng:1997:SJC,
  author =       "Lih-Yuan Deng and Dennis K. J. Lin and Jiannong Wang
                 and Yilian Yuan",
  title =        "Statistical Justification of Combination Generators",
  journal =      j-STAT-SINICA,
  volume =       "7",
  number =       "4",
  pages =        "993--1003",
  month =        oct,
  year =         "1997",
  CODEN =        "STSNEO",
  ISSN =         "1017-0405 (print), 1996-8507 (electronic)",
  ISSN-L =       "1017-0405",
  MRclass =      "65C10",
  MRnumber =     "MR1488655 (98m:65013)",
  bibdate =      "Fri Mar 9 09:33:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www3.stat.sinica.edu.tw/statistica/j7n4/j7n412/j7n412.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistica Sinica",
  remark =       "The authors improve the theoretical grounds for the
                 combined Wichmann--Hill generator
                 \cite{Wichmann:1982:SAA}.",
}

@Article{Denk:1997:AME,
  author =       "G. Denk and S. Sch{\"a}ffler",
  title =        "{Adams} Methods for the Efficient Solution of
                 Stochastic Differential Equations with Additive Noise",
  journal =      j-COMPUTING,
  volume =       "59",
  number =       "2",
  pages =        "153--161",
  month =        jun,
  year =         "1997",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "60H10 (65U05)",
  MRnumber =     "1 475 532",
  bibdate =      "Sat Oct 21 17:13:37 2000",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=1539&id_volume=120&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "703.1; 723.5; 921.2; 921.6; 922.1",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Adams methods; Additive noise; Calculations; Circuit
                 theory; Computer simulation; Convergence of numerical
                 methods; Differential equations; Numerical methods;
                 Predictor corrector scheme; Random number; Random
                 processes; Spurious signal noise; Stochastic
                 differential equations",
}

@Article{Devroye:1997:RVG,
  author =       "Luc Devroye",
  title =        "Random variate generation for multivariate unimodal
                 densities",
  journal =      j-TOMACS,
  volume =       "7",
  number =       "4",
  pages =        "447--477",
  month =        oct,
  year =         "1997",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Dyadkin:1997:FEL,
  author =       "Iosif G. Dyadkin and Kenneth G. Hamilton",
  title =        "A family of enhanced {Lehmer} random number
                 generators, with hyperplane suppression, and direct
                 support for certain physical applications",
  journal =      j-COMP-PHYS-COMM,
  volume =       "107",
  number =       "1--3",
  pages =        "258--280",
  day =          "22",
  month =        dec,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00101-X",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  MRclass =      "65C10 86-08 86A20",
  bibdate =      "Thu Nov 14 10:49:00 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cpc.cs.qub.ac.uk/cpc/;
                 http://www.cpc.cs.qub.ac.uk/cpc/cgi-bin/list_summary.pl?CatNumber=ADGW;
                 http://www.sciencedirect.com/science/article/pii/S001046559700101X",
  ZMnumber =     "0938.65006",
  abstract =     "Over two hundred congruential pseudorandom number
                 generators, each with a different multiplier, are built
                 into a single assembler routine that returns 32-bit
                 integer and floating-point values. This gives a Monte
                 Carlo user the opportunity of selecting a combination
                 of sequences, so as to provide a greater appearance of
                 chaos. The software makes use of extended 64-bit
                 arithmetic on Intel 386/387 (or higher) chips, thus
                 attaining a period of 262 for each of the individual
                 generators. The routine also features entry points that
                 more directly support certain applications, such as
                 well logging in nuclear geophysics. In addition to the
                 customary uniform (0,1) ``white noise'' generator, the
                 package provides values distributed according to the
                 exponential and Gaussian distributions, random unit
                 vectors in two and three dimensions, as well as
                 Klein--Nishina and neutron scattering distributions.",
  acknowledgement = ack-nhfb,
  annote =       "This paper describes a Fortran-callable Intel IA-32
                 assembly language implementation of a family of 200
                 pseudo-random number generators, based on earlier work
                 \cite{Dyadkin:1997:SBM}, with associated routines for
                 generating several distributions (uniform, exponential,
                 Gaussian, 2-D and 3-D unit vectors, plus several
                 specific to physics applications). It contains a good
                 discussion of randomness-testing procedures, and
                 comparisons with other algorithms, including the
                 ziggurat method
                 \cite{Marsaglia:1984:FEI,Marsaglia:2000:ZMG} used in
                 Matlab version 5 and later \cite{Moler:2001:CCN}. The
                 software is available from the CPC Library, for a fee,
                 and with use restrictions.",
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "RNLEHMER200 (Intel IA-32 assembly language, 4044
                 Lines)",
  remark =       "The authors present a set of 210 good multipliers for
                 a 64-bit MCG with modulus $ 2^{32} $, and propose
                 returning the sequence $ \{ R(G[1]), R(G[2]), \ldots,
                 R(G[210]), \} $, cycling first by generator, and then
                 by random value, in order to mix up the MCG output.
                 Alternatively, for further mixing, they can use an
                 additional multiplier to generate a random generator
                 index that shuffles the data further. Also, they
                 compute a 64-bit MCG value, but discard the less-random
                 lower 32-bits. That produces a sequence of values whose
                 rightmost (low-order) bit has period $ 2^{31} $, and
                 the leftmost (high-order) bit has period $ 2^{62} $.",
}

@Article{Dyadkin:1997:SBM,
  author =       "Iosif G. Dyadkin and Kenneth G. Hamilton",
  title =        "A study of 64-bit multipliers for {Lehmer}
                 pseudorandom number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "103",
  number =       "2--3",
  pages =        "103--130",
  month =        jul,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00052-0",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  MRclass =      "65C10",
  MRnumber =     "98f:65013",
  bibdate =      "Thu Nov 14 11:03:33 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597000520",
  ZMnumber =     "0980.65007",
  abstract =     "A study was conducted of multipliers for 64-bit
                 congruential pseudorandom number generators. Extensive
                 analysis and testing resulted in the identification of
                 over $ 200 $ good multipliers of the form $ A = 5^k $,
                 where $k$ is a prime number. The integer lattice
                 structure from any single multiplier is so fine that it
                 is not visible when {\tt REAL*4} values are returned in
                 up to four dimensions. Known number-theoretic
                 characteristics of $ m = 2^l $ generators were
                 exploited to provide a remarkably sensitive new lattice
                 test, one that is based on analysis of spacings in
                 several dimensions. That examination led to new methods
                 that can provide lattice-free pseudorandom streams in
                 up to 200 dimensions, and with extended period
                 length.",
  acknowledgement = ack-nhfb,
  annote =       "This is the theoretical work behind the software
                 \cite{Dyadkin:1997:FEL}. The linear-congruential
                 generators have multipliers of the form $ A = 5^k \bmod
                 2^{64} $, where $k$ is a prime number, and testing has
                 identified more than 200 suitable values of $k$. This
                 work was later updated for 128-bit arithmetic
                 \cite{Dyadkin:2000:SBM}.",
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Eichenauer-Herrmann:1997:ADH,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Frank Emmerich and
                 Gerhard Larcher",
  title =        "Average Discrepancy, Hyperplanes, and Compound
                 Pseudorandom Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "3",
  number =       "3",
  pages =        "203--218",
  month =        jul,
  year =         "1997",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1997.0180",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579797901805",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Eichenauer-Herrmann:1997:AEP,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Gerhard Larcher",
  title =        "Average equidistribution properties of compound
                 nonlinear congruential pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "66",
  number =       "217",
  pages =        "363--372",
  month =        jan,
  year =         "1997",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "97g:11084",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Fri Jul 16 10:38:40 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1997-66-217;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-97-00802-8&u=/mcom/1997-66-217/;
                 http://www.jstor.org/stable/pdfplus/2153659.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Eichenauer-Herrmann:1997:CCC,
  author =       "J. Eichenauer-Herrmann and E. Herrmann",
  title =        "Compound Cubic Congruential Pseudo-random Numbers",
  journal =      j-COMPUTING,
  volume =       "59",
  number =       "1",
  pages =        "85--90",
  month =        mar,
  year =         "1997",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "98g:11089",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Fri Oct 15 15:41:24 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=1451&id_volume=112&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "921; 921.1; 921.6; 922.2",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Boundary conditions; Compound cubic congruential
                 method; Nonlinear equations; Numerical methods;
                 Polynomials; Random number generation; Statistical
                 independence; Statistical methods; Uniform pseudorandom
                 numbers",
}

@Article{Eichenauer-Herrmann:1997:ICP,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "Inversive congruential pseudorandom numbers:
                 Distribution of triples",
  journal =      j-MATH-COMPUT,
  volume =       "66",
  number =       "220",
  pages =        "1629--1644",
  month =        oct,
  year =         "1997",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-97-00867-3",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1423072 (98a:65010)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Fri Jul 16 10:38:48 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1997-66-220;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-97-00867-3&u=/mcom/1997-66-220/;
                 http://www.jstor.org/stable/pdfplus/2153689.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Eichenauer-Herrmann:1997:PSN,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "Parallel Streams of Nonlinear Congruential
                 Pseudorandom Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "3",
  number =       "3",
  pages =        "219--233",
  month =        jul,
  year =         "1997",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1997.0183",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579797901830",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Eichenauer-Herrmann:1997:QCP,
  author =       "J{\"u}rgen Eichenauer-Herrmann",
  title =        "Quadratic congruential pseudorandom numbers:
                 Distribution of lagged pairs",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "79",
  number =       "1",
  pages =        "75--85",
  day =          "3",
  month =        mar,
  year =         "1997",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(96)00158-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042796001586",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Article{Emmerich:1997:EPQ,
  author =       "Frank Emmerich",
  title =        "Equidistribution properties of quadratic congruential
                 pseudorandom numbers",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "79",
  number =       "2",
  pages =        "207--214",
  day =          "17",
  month =        mar,
  year =         "1997",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(96)00157-4",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042796001574",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@InProceedings{Entacher:1997:ASP,
  author =       "K. Entacher and A. Uhl and S. Wegenkittl",
  title =        "Analyzing Streams of Pseudorandom Numbers for Parallel
                 {Monte Carlo} Integration",
  crossref =     "Wyrzykowski:1997:PNP",
  pages =        "59--71",
  year =         "1997",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Entacher:1997:CSP,
  author =       "Karl Entacher",
  title =        "A collection of selected pseudorandom number
                 generators with linear structure",
  type =         "Report",
  number =       "97-1",
  institution =  "ACPC -- Austrian Center for Parallel Computation,
                 University of Vienna",
  address =      "Vienna, Austria",
  pages =        "25",
  day =          "21",
  month =        aug,
  year =         "1997",
  bibdate =      "Fri Dec 23 21:21:36 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.3686;
                 http://random.mat.sbg.ac.at/ftp/pub/data/genacpc.txt",
  acknowledgement = ack-nhfb,
}

@TechReport{Entacher:1997:PPL,
  author =       "K. Entacher and S. Wegenkittl",
  title =        "The {{\sc pLab}} Picturebook: Load Tests and Ultimate
                 Load Tests, {Part II}: Subsequences",
  type =         "Report",
  number =       "2",
  institution =  "University of Salzburg",
  address =      "Salzburg, Austria",
  year =         "1997",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/pLabReport1.ps",
  acknowledgement = ack-nhfb,
}

@TechReport{Entacher:1997:PPP,
  author =       "K. Entacher",
  title =        "The {{\sc pLab}} Picturebook {Part III}: Bad
                 Subsequences of {LCGs} --- The Results",
  type =         "Report",
  number =       "6",
  institution =  "University of Salzburg",
  address =      "Salzburg, Austria",
  year =         "1997",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://random.mat.sbg.ac.at/pub/data/pLabReport6.ps",
  acknowledgement = ack-nhfb,
}

@Book{Fishman:1997:MCC,
  author =       "George S. Fishman",
  title =        "{Monte Carlo}: concepts, algorithms, and
                 applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Corrected second printing",
  pages =        "xxv + 698",
  year =         "1997",
  ISBN =         "0-387-94527-X",
  ISBN-13 =      "978-0-387-94527-9",
  LCCN =         "QA298 .F57 1997",
  bibdate =      "Tue Dec 27 06:26:33 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in operations research",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/97168075-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/97168075-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method",
}

@Article{Foster:1997:DOT,
  author =       "Caxton C. Foster",
  title =        "Drawbacks of the One-Time Pad",
  journal =      j-CRYPTOLOGIA,
  volume =       "21",
  number =       "4",
  pages =        "350--352",
  year =         "1997",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-119791885986",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Sun May 15 12:00:39 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/titles/01611194.asp;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In which we look once again at the one-time-pad and
                 find the situation is not as hopeless as might be
                 imagined.",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
}

@InCollection{Gell-Mann:1997:ETZ,
  author =       "Murray Gell-Mann",
  title =        "{RANDomness}",
  crossref =     "Gell-Mann:1997:QJA",
  chapter =      "4",
  pages =        "43--50",
  year =         "1997",
  bibdate =      "Mon Sep 01 10:20:00 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Gilks:1997:CAR,
  author =       "W. R. Gilks and R. M. Neal and N. G. Best and K. K. C.
                 Tan",
  title =        "Corrigendum: Adaptive rejection {Metropolis}
                 sampling",
  journal =      j-APPL-STAT,
  volume =       "46",
  number =       "4",
  pages =        "541--??",
  year =         "1997",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Mon Oct 23 06:53:17 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/as1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Gilks:1995:ARM}.",
  URL =          "http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0035-9254&src=ard&aid=091&iid=4&vid=46",
  acknowledgement = ack-nhfb,
  author-1-adr = "Medical Research Council Biostatistics Unit,
                 Cambridge, UK",
  author-2-adr = "University of Toronto, Canada",
  author-3-adr = "Imperial College of Science, Technology and Medicine,
                 London, UK",
  author-4-adr = "Pfizer Central Research, Sandwich, UK",
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues;
                 http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0035-9254&src=arc",
}

@Article{Grabner:1997:MSR,
  author =       "Peter J. Grabner and Helmut Prodinger",
  title =        "Maximum Statistics of {$N$} Random Variables
                 Distributed by the Negative Binomial Distribution",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "6",
  number =       "2",
  pages =        "179--183",
  month =        jun,
  year =         "1997",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548397002939",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  bibdate =      "Mon Jul 7 15:38:03 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=6&issueId=02",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Hamilton:1997:AR,
  author =       "Kenneth G. Hamilton and F. James",
  title =        "Acceleration of {RANLUX}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "101",
  number =       "3",
  pages =        "241--248",
  month =        may,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00002-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597000027",
  abstract =     "A pseudorandom number generator that was proposed by
                 L{\"u}scher and coded in Fortran by James has been
                 accelerated by conversion to integer arithmetic. At the
                 maximum `luxury' level, this results in a doubling of
                 the execution speed while retaining all its other
                 properties including the portability.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "luxury random numbers; Monte Carlo; pseudorandom;
                 random number generators; random numbers",
}

@Article{Hamilton:1997:ARP,
  author =       "Kenneth G. Hamilton",
  title =        "Assembler {RANLUX} for {PCs}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "101",
  number =       "3",
  pages =        "249--253",
  day =          "1",
  month =        may,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00017-9",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:45:35 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597000179",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Hellekalek:1997:CAP,
  author =       "P. Hellekalek",
  editor =       "H. Niederreiter and P. Hellekalek and G. Larcher and
                 P. Zinterhof",
  booktitle =    "{Proceedings of the Second International Conference on
                 Monte Carlo and Quasi-Monte Carlo Methods in Scientific
                 Computing, Salzburg, July 9--12, 1996}",
  title =        "On correlation analysis of pseudorandom numbers",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "1997",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Lecture Notes in Statistics",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellekalek:1997:GRN,
  author =       "P. Hellekalek",
  title =        "Good Random Number Generators are (not so) Easy to
                 Find",
  crossref =     "Troch:1997:PSI",
  pages =        "??--??",
  year =         "1997",
  bibdate =      "Fri Mar 09 09:47:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Published in \cite{Hellekalek:1998:GRN}.",
}

@Article{Hellekalek:1997:NPNa,
  author =       "P. Hellekalek",
  title =        "A note on pseudorandom number generators",
  journal =      "EUROSIM Simulations News Europe",
  volume =       "20",
  number =       "??",
  pages =        "8--10",
  month =        "????",
  year =         "1997",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hellekalek:1997:NPNb,
  author =       "Peter Hellekalek",
  title =        "A note on pseudorandom number generators",
  journal =      j-SIM-PRACT-THEORY,
  volume =       "5",
  number =       "6",
  pages =        "p6--p8",
  day =          "15",
  month =        aug,
  year =         "1997",
  CODEN =        "SPTHEH",
  DOI =          "https://doi.org/10.1016/S0928-4869(97)84227-9",
  ISSN =         "0928-4869 (print), 1879-1433 (electronic)",
  ISSN-L =       "0928-4869",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0928486997842279",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation Practice and Theory",
}

@Article{Herendi:1997:FGR,
  author =       "T. Herendi and T. Siegl and R. F. Tichy",
  title =        "Fast {Gaussian} Random Number Generation Using Linear
                 Transformations",
  journal =      j-COMPUTING,
  volume =       "59",
  number =       "2",
  pages =        "163--181",
  month =        jun,
  year =         "1997",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10 (62E25 65C05)",
  MRnumber =     "98j:65005",
  MRreviewer =   "Francesco Fabris",
  bibdate =      "Fri Oct 15 15:41:27 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=1557&id_volume=120&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "921.3; 922.1",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Estimation; Fourier transforms; Gaussian random number
                 generation; Mathematical transformations; Number
                 theory; Random processes; Walsh transform",
}

@Article{Heuer:1997:CCS,
  author =       "Andreas Heuer and Burkhard D{\"u}nweg and Alan M.
                 Ferrenberg",
  title =        "Considerations on correlations in shift-register
                 pseudorandom number generators and their removal",
  journal =      j-COMP-PHYS-COMM,
  volume =       "103",
  number =       "1",
  pages =        "1--9",
  month =        jun,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00026-X",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S001046559700026X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "R250 shift-register random-number generator",
  remark =       "This paper analyzes the failure of the R250 generator
                 (GFSR(250, 103, xor)) in Monte Carlo simulations, and
                 proposes a modified generator called R250/521 that
                 dramatically reduces the errors. See also
                 \cite{Shchur:1997:CMC} for a related analysis, and
                 \cite{Janke:2002:PRN} for a summary.",
}

@Article{Imperiale:1997:PUG,
  author =       "Cosimo Imperiale",
  title =        "Programmable uniform-{Gaussian}, quasi-white noise
                 generator and data acquisition-processing system for
                 electrophysiology",
  journal =      j-MEASUREMENT,
  volume =       "20",
  number =       "3",
  pages =        "149--163",
  month =        mar,
  year =         "1997",
  DOI =          "https://doi.org/10.1016/S0263-2241(97)00023-7",
  ISSN =         "0263-2241 (print), 1873-412X (electronic)",
  ISSN-L =       "0263-2241",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0263224197000237",
  acknowledgement = ack-nhfb,
  fjournal =     "Measurement: Journal of the International Measurement
                 Confederation",
}

@Article{James:1997:MSS,
  author =       "F. James and J. Hoogland and R. Kleiss",
  title =        "Multidimensional sampling for simulation and
                 integration: measures, discrepancies, and quasi-random
                 numbers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "99",
  number =       "2--3",
  pages =        "180--220",
  month =        jan,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(96)00108-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:41 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465596001087",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Kao:1997:SSG,
  author =       "Chiang Kao and H. C. Tang",
  title =        "Systematic searches for good multiple recursive random
                 number generators",
  journal =      j-COMP-OP-RES,
  volume =       "24",
  number =       "10",
  pages =        "899--905",
  month =        oct,
  year =         "1997",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/S0305-0548(97)00017-8",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0305054897000178",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
}

@Article{Kao:1997:UBS,
  author =       "Chiang Kao and Huey-Chin Tang",
  title =        "Upper bounds in spectral test for multiple recursive
                 random number generators with missing terms",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "33",
  number =       "4",
  pages =        "119--125",
  month =        feb,
  year =         "1997",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(97)00012-6",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122197000126",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Kato:1997:LSP,
  author =       "Takashi Kato and Li-Ming Wu and Niro Yanagihara",
  title =        "On the lattice structure of pseudo-random numbers
                 generated by the modified inversive congruential
                 generator with modulus $ 2^\alpha $",
  journal =      j-JAPAN-J-INDUST-APPL-MATH,
  volume =       "14",
  number =       "1",
  pages =        "33--38",
  year =         "1997",
  CODEN =        "JAPJI7",
  ISSN =         "0916-7005 (print), 1868-937x (electronic)",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1443108 (98c:11079)",
  MRreviewer =   "Milan Pa{\v{s}}t{\'e}ka",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kato:1996:NCP} for the original work, and
                 \cite{Kato:1996:STN} for a treatment of the discrepancy
                 of the inversive congruential generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "Japan Journal of Industrial and Applied Mathematics",
}

@Article{Kotz:1997:MVD,
  author =       "Samuel Kotz and Kai-Tai Fang and Jia-Juan Liang",
  title =        "On Multivariate Vertical Density Representation and
                 its Application to Random Number Generation",
  journal =      j-STATISTICS,
  volume =       "30",
  number =       "2",
  pages =        "163--180",
  year =         "1997",
  CODEN =        "MOSSD5",
  DOI =          "https://doi.org/10.1080/02331889708802607",
  ISSN =         "0233-1888 (print), 1029-4910 (electronic)",
  ISSN-L =       "0233-1888",
  bibdate =      "Wed Oct 8 11:24:12 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statistics.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics: a Journal of Theoretical and Applied
                 Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/gsta20",
}

@Article{Kreckel:1997:PAM,
  author =       "Richard Kreckel",
  title =        "Parallelization of adaptive {MC} integrators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "106",
  number =       "3",
  pages =        "258--266",
  month =        nov,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00099-4",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597000994",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{LEcuyer:1997:BLS,
  author =       "Pierre L'Ecuyer",
  title =        "Bad lattice structures for vectors of non-successive
                 values produced by some linear recurrences",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "9",
  number =       "1",
  pages =        "57--60",
  month =        "Winter",
  year =         "1997",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.9.1.57",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  MRclass =      "65C10",
  MRnumber =     "1478040 (98f:65014)",
  bibdate =      "Wed Dec 21 09:28:23 2011",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@TechReport{LEcuyer:1997:EBT,
  author =       "Pierre L'Ecuyer and A. Compagner and J.-F. Cordeau",
  title =        "Entropy-based tests for random-number generators",
  institution =  "Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, PQ, Canada",
  year =         "1997",
  bibdate =      "Sat Mar 03 15:10:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.iro.umontreal.ca/%7Elecuyer/myftp/papers/myftp/papers/entrop.ps",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:1997:ILS,
  author =       "Pierre L'Ecuyer and Raymond Couture",
  title =        "An implementation of the lattice and spectral tests
                 for multiple recursive linear random number
                 generators",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "9",
  number =       "2",
  pages =        "206--217",
  month =        "Spring",
  year =         "1997",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.9.2.206",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  MRclass =      "65B10",
  MRnumber =     "1477315",
  bibdate =      "Wed Dec 21 09:34:14 2011",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@Article{LEcuyer:1997:RNG,
  author =       "Pierre L'Ecuyer and Terry H. Andres",
  title =        "A random number generator based on the combination of
                 four {LCGs}",
  journal =      j-MATH-COMP-SIM,
  volume =       "44",
  number =       "1",
  pages =        "99--107",
  month =        may,
  year =         "1997",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(97)00052-9",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  MRclass =      "65C10",
  MRnumber =     "1471631 (98d:65012)",
  bibdate =      "Fri Dec 30 14:46:26 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475497000529",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{LEcuyer:1997:TBS,
  author =       "Pierre L'Ecuyer",
  title =        "Tests based on sum-functions of spacings for uniform
                 random numbers",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "59",
  number =       "3",
  pages =        "251--269",
  month =        "????",
  year =         "1997",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659708811859",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659708811859",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  remark =       "This paper reports results of two new goodness-of-fit
                 statistics on 18 popular random-number generators: 6
                 LCGs, 6 ICGs, 2 GFSRs, 1 combined LCG, 1 combined MCG,
                 and 1 combined Tausworthe generator. Only the last five
                 did well on the new tests. The author reports that the
                 ICGs also fail entropy tests \cite{LEcuyer:1997:EBT}.",
}

@InProceedings{LEcuyer:1997:URN,
  author =       "Pierre L'Ecuyer",
  title =        "Uniform Random Number Generators: a Review",
  crossref =     "Andradottir:1997:PWS",
  pages =        "127--134",
  year =         "1997",
  bibdate =      "Thu Jan 05 14:09:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Leeb:1997:ILC,
  author =       "Hannes Leeb and Stefan Wegenkittl",
  title =        "Inversive and linear congruential pseudorandom number
                 generators in empirical tests",
  journal =      j-TOMACS,
  volume =       "7",
  number =       "2",
  pages =        "272--286",
  month =        apr,
  year =         "1997",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:34 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Book{Li:1997:IKC,
  author =       "Ming Li and P. M. B. (Paul Michael B{\'e}la)
                 Vit{\'a}nyi",
  title =        "An Introduction to {Kolmogorov} Complexity and Its
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 637",
  year =         "1997",
  ISBN =         "0-387-94868-6 (hardcover)",
  ISBN-13 =      "978-0-387-94868-3 (hardcover)",
  LCCN =         "QA267.7",
  MRclass =      "68Q30, 03B48, 60A05, 68-02, 82B03, 94A17",
  bibdate =      "Mon Apr 29 06:15:18 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Graduate texts in computer science",
  URL =          "http://catdir.loc.gov/catdir/enhancements/fy0815/96042357d.html;
                 http://www.zentralblattmath.org/zmath/en/search/?an=0866.68051",
  acknowledgement = ack-nhfb,
  remark =       "See also first \cite{Li:1993:IKC} and third
                 \cite{Li:2008:IKC} editions.",
  subject =      "Kolmogorov complexity; Kolmogorov complexity.;
                 Kolmogorov-Komplexit{\"a}t",
  tableofcontents = "Preface to the First Edition / v \\
                 How to Use This Book / viii \\
                 Acknowledgments / x \\
                 Preface to the Second Edition / xii \\
                 Outlines of One-Semester Courses / xii \\
                 List of Figures / xix \\
                 1 Preliminaries / 1 \\
                 1.1 A Brief Introduction / 1 \\
                 1.2 Prerequisites and Notation / 6 \\
                 1.3 Numbers and Combinatorics / 8 \\
                 1.4 Binary Strings / 12 \\
                 1.5 Asymptotic Notation / 15 \\
                 1.6 Basics of Probability Theory / 18 \\
                 1.7 Basics of Computability Theory / 24 \\
                 1.8 The Roots of Kolmogorov Complexity / 47 \\
                 1.9 Randomness / 49 \\
                 1.10 Prediction and Probability / 59 \\
                 1.11 Information Theory and Coding / 65 \\
                 1.12 State x Symbol Complexity / 84 \\
                 1.13 History and References / 86 \\
                 2 Algorithmic Complexity / 93 \\
                 2.1 The Invariance Theorem / 96 \\
                 2.2 Incompressibility / 108 \\
                 2.3 C as an Integer Function / 119 \\
                 2.4 Random Finite Sequences / 127 \\
                 2.5 *Random Infinite Sequences / 136 \\
                 2.6 Statistical Properties of Finite Sequences / 158
                 \\
                 2.7 Algorithmic Properties of C / 167 \\
                 2.8 Algorithmic Information Theory / 179 \\
                 2.9 History and References / 185 \\
                 3 Algorithmic Prefix Complexity / 189 \\
                 3.1 The Invariance Theorem / 192 \\
                 3.2 *Sizes of the Constants / 197 \\
                 3.3 Incompressibility / 202 \\
                 3.4 if as an Integer Function / 206 \\
                 3.5 Random Finite Sequences / 208 \\
                 3.6 *Random Infinite Sequences / 211 \\
                 3.7 Algorithmic Properties of if / 224 \\
                 3.8 *Complexity of Complexity / 226 \\
                 3.9 *Symmetry of Algorithmic Information / 229 \\
                 3.10 History and References / 237 \\
                 4 Algorithmic Probability / 239 \\
                 4.1 Enumerable Functions Revisited / 240 \\
                 4.2 Nonclassical Notation of Measures / 242 \\
                 4.3 Discrete Sample Space / 245 \\
                 4.4 Universal Average-Case Complexity / 268 \\
                 4.5 Continuous Sample Space / 272 \\
                 4.6 Universal Average-Case Complexity, Continued / 307
                 \\
                 4.7 History and References / 307 \\
                 5 Inductive Reasoning / 315 \\
                 5.1 Introduction / 315 \\
                 5.2 SoIomonofF's Theory of Prediction / 324 \\
                 5.3 Universal Recursion Induction / 335 \\
                 5.4 Simple Pae-Learning / 339 \\
                 5.5 Hypothesis Identification by Minimum Description
                 Length / 351 \\
                 5.6 History and References / 372 \\
                 6 The Ineompressibility Method / 379 \\
                 6.1 Three Examples / 380 \\
                 6.2 High-Probability Properties / 385 \\
                 6.3 Combinatorics / 389 \\
                 6.4 Kolmogorov Random Graphs / 396 \\
                 6.5 Compact Routing / 404 \\
                 6.6 Average-Case Complexity of Heapsort / 412 \\
                 6.7 Longest Common Subsequence / 417 \\
                 6.8 Formal Language Theory / 420 \\
                 6.9 Online CFL Recognition / 427 \\
                 6.10 Turing Machine Time Complexity / 432 \\
                 6.11 Parallel Computation / 445 \\
                 6.12 Switching Lemma / 449 \\
                 6.13 History and References / 452 \\
                 7 Resource-Bounded Complexity / 459 \\
                 7.1 Mathematical Theory / 460 \\
                 7.2 Language Compression / 476 \\
                 7.3 Computational Complexity / 488 \\
                 7.4 Instance Complexity / 495 \\
                 7.5 Kt Complexity and Universal Optimal Search / 502
                 \\
                 7.6 Time-Limited Universal Distributions / 506 \\
                 7.7 Logical Depth / 510 \\
                 7.8 History and References / 516 \\
                 8 Physics, Information, and Computation / 521 \\
                 8.1 Algorithmic Complexity and Shannon Entropy / 522
                 \\
                 8.2 Reversible Computation / 528 \\
                 8.3 Information Distance / 537 \\
                 8.4 Thermodynamics / 554 \\
                 8.5 Entropy Revisited / 565 \\
                 8.6 Compression in Nature / 583 \\
                 8.7 History and References / 586 \\
                 References / 591 \\
                 Index / 618",
}

@Book{Lidl:1997:FF,
  author =       "Rudolf Lidl and Harald Niederreiter",
  title =        "Finite fields",
  volume =       "20",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xiv + 755",
  year =         "1997",
  ISBN =         "0-521-39231-4 (hardcover)",
  ISBN-13 =      "978-0-521-39231-0 (hardcover)",
  LCCN =         "QA247.3 .L53 1997",
  bibdate =      "Tue Dec 27 11:22:28 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Encyclopedia of mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/description/cam027/96031467.html;
                 http://www.loc.gov/catdir/toc/cam029/96031467.html",
  acknowledgement = ack-nhfb,
  subject =      "Finite fields (Algebra)",
}

@Misc{Marsaglia:1997:RNG,
  author =       "George Marsaglia",
  title =        "A random number generator for {C}",
  howpublished = "Posted to the {\tt sci.math.num-analysis} news group",
  day =          "29",
  month =        sep,
  year =         "1997",
  bibdate =      "Thu Dec 20 20:21:51 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "From the posting: ``Keep the following six lines of
                 code somewhere in your files. \#define znew
                 ((z=36969*(z\&65535)+(z>>16))<<16) \#define wnew
                 ((w=18000*(w\&65535)+(w>>16))\&65535) \#define IUNI
                 (znew+wnew) \#define UNI (znew+wnew)*4.656613e-10
                 static unsigned long z=362436069, w=521288629; void
                 setseed(unsigned long i1,unsigned long i2){z=i1; w=i2;}
                 Whenever you need random integers or random reals in
                 your C program, just insert those six lines at (near?)
                 the beginning of the program. In every expression where
                 you want a random real in $ [0, 1) $ use UNI, or use
                 IUNI for a random 32-bit integer. No need to mess with
                 ranf() or ranf(lastI), etc, with their requisite
                 overheads. Choices for replacing the two multipliers
                 36969 and 18000 are given below. Thus you can tailor
                 your own in-line multiply-with-carry random number
                 generator.''",
  URL =          "http://mathforum.org/kb/thread.jspa?messageID=1607565",
  acknowledgement = ack-nhfb,
}

@Book{Menezes:1997:HAC,
  author =       "A. J. (Alfred J.) Menezes and Paul C. {Van Oorschot}
                 and Scott A. Vanstone",
  title =        "Handbook of Applied Cryptography",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xxviii + 780",
  year =         "1997",
  ISBN =         "0-8493-8523-7",
  ISBN-13 =      "978-0-8493-8523-0",
  LCCN =         "QA76.9.A25 M463 1997",
  bibdate =      "Sat Oct 17 16:25:07 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "The CRC Press series on discrete mathematics and its
                 applications",
  acknowledgement = ack-nhfb,
  keywords =     "access control; computers; cryptography; handbooks,
                 manuals, etc",
  referencedin = "Referenced in \cite[Ref. 6]{Silverman:1997:FGR}.",
  tableofcontents = "Chapter 1: Overview of Cryptography \\
                 Chapter 2: Mathematics Background \\
                 Chapter 3: Number-Theoretic Reference Problems \\
                 Chapter 4: Public-Key Parameters \\
                 Chapter 5: Pseudorandom Bits and Sequences \\
                 Chapter 6: Stream Ciphers \\
                 Chapter 7: Block Ciphers \\
                 Chapter 8: Public-Key Encryption \\
                 Chapter 9: Hash Functions and Data Integrity \\
                 Chapter 10: Identification and Entity Authentication
                 \\
                 Chapter 11: Digital Signatures \\
                 Chapter 12: Key Establishment Protocols \\
                 Chapter 13: Key Management Techniques \\
                 Chapter 14: Efficient Implementation \\
                 Chapter 15: Patents and Standards \\
                 Appendix: Bibliography of Papers from Selected
                 Cryptographic Forums \\
                 References \\
                 Index",
}

@InProceedings{Naor:1997:NTC,
  author =       "M. Naor and O. Reingold",
  title =        "Number-theoretic constructions of efficient
                 pseudo-random functions",
  crossref =     "IEEE:1997:ASF",
  pages =        "458--467",
  year =         "1997",
  bibdate =      "Thu Apr 5 06:13:52 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/focs1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Naveau:1997:CBC,
  author =       "Philippe Naveau",
  title =        "Comparison Between the {Chernoff} and Factorial Moment
                 Bounds for Discrete Random Variables",
  journal =      j-AMER-STAT,
  volume =       "51",
  number =       "1",
  pages =        "40--41",
  month =        feb,
  year =         "1997",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  MRclass =      "60E15",
  MRnumber =     "97k:60051",
  bibdate =      "Thu Nov 5 09:34:14 MST 1998",
  bibsource =    "http://www.amstat.org/publications/tas/toc.html;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.amstat.org/publications/tas/abstracts/naveau.html",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@TechReport{Needham:1997:TE,
  author =       "Roger M. Needham and David J. Wheeler",
  title =        "{TEA} Extensions",
  type =         "Report",
  institution =  "Cambridge University",
  address =      "Cambridge, UK",
  month =        oct,
  year =         "1997",
  bibdate =      "Thu Feb 02 05:45:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also original TEA \cite{Wheeler:1995:TTE} and
                 extension XXTEA \cite{Wheeler:1998:CX}.",
  URL =          "http://www.movable-type.co.uk/scripts/xtea.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "TEA; Tiny Encryption Algorithm; XTEA",
}

@Article{Novak:1997:DRS,
  author =       "S. Yu. Novak",
  title =        "On the Distribution of the Ratio of Sums of Random
                 Variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "41",
  number =       "3",
  pages =        "479--503",
  month =        "????",
  year =         "1997",
  CODEN =        "TPRBAU",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  MRclass =      "60F05 (62E17)",
  MRnumber =     "98f:60045",
  MRreviewer =   "Petr Lachout",
  bibdate =      "Mon Dec 7 09:27:31 MST 1998",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/41/3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  note =         "Original Russian article in {\em Teor. Veroyatnost. i
                 Primenen.}, {\bf 41}(3), (1996), pp. 533--560.",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/97525",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  alttitle =     "On the distribution of a ratio of sums of random
                 variables",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
}

@Article{Ogawa:1997:EAR,
  author =       "Shigeyoshi Ogawa",
  title =        "Erratum to the article: {``On a robustness of the
                 random particle method'' [Monte Carlo Methods Appl.
                 {\bf 2} (1996), no. 3, 175--189; MR1414863
                 (97j:65008)]}",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "3",
  number =       "1",
  pages =        "83--??",
  month =        "????",
  year =         "1997",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1997.3.1.83",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C05",
  MRnumber =     "1451579",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1997.3.issue-1/issue-files/mcma.1997.3.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Ogawa:1996:RRP}.",
  URL =          "http://www.degruyter.com/view/j/mcma.1997.3.issue-1/mcma.1997.3.1.83/mcma.1997.3.1.83.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Pages:1997:SLD,
  author =       "Gilles Pag{\`e}s and Yi-Jun Xiao",
  title =        "Sequences with low discrepancy and pseudo-random
                 numbers: theoretical results and numerical tests",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "56",
  number =       "2",
  pages =        "163--188",
  month =        jan,
  year =         "1997",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659708811786",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:04:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659708811786",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Panconesi:1997:RDE,
  author =       "Alessandro Panconesi and Aravind Srinivasan",
  title =        "Randomized Distributed Edge Coloring via an Extension
                 of the {Chernoff--Hoeffding} Bounds",
  journal =      j-SIAM-J-COMPUT,
  volume =       "26",
  number =       "2",
  pages =        "350--368",
  month =        apr,
  year =         "1997",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/S0097539793250767",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "05C85 (60C05 60F10 68Q22 68Q25 68R10)",
  MRnumber =     "98d:05135",
  MRreviewer =   "Richard C. Brewster",
  bibdate =      "Mon Nov 29 11:03:06 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SICOMP/26/2;
                 http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/26/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/25076",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1160
                 (Combinatorial mathematics); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Freie Univ. Berlin, Germany",
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  keywords =     "Chernoff--Hoeffding bounds; computational complexity;
                 distributed algorithms; edge coloring problems; graph
                 colouring; polylogarithmic time; probability; random
                 processes; random variables; randomised algorithms;
                 randomized algorithms; randomized distributed edge
                 coloring; resource allocation problems; stochastic
                 independence; synchronous distributed point to point
                 model; tail probabilities; vertex coloring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pincus:1997:APR,
  author =       "Steve Pincus and Rudolf E. Kalman",
  title =        "Not all (possibly) ``random'' sequences are created
                 equal",
  journal =      j-PROC-NATL-ACAD-SCI-USA,
  volume =       "94",
  pages =        "3513--3518",
  month =        apr,
  year =         "1997",
  CODEN =        "PNASA6",
  ISSN =         "0027-8424 (print), 1091-6490 (electronic)",
  ISSN-L =       "0027-8424",
  bibdate =      "Mon Dec 08 09:26:47 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.pnas.org/cgi/content/full/94/8/3513?terms=pincus%20kalman;
                 http://www.pnas.org/cgi/reprint/94/8/3513.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the National Academy of Sciences of the
                 United States of America",
  journal-URL =  "http://www.pnas.org/search",
}

@MastersThesis{Schaber:1997:DIC,
  author =       "K. Schaber",
  title =        "Digital inversive congruential generators",
  school =       "{Institut f{\"u}r Mathematik, Universit{\"a}t
                 Salzburg}",
  address =      "Salzburg, Austria",
  year =         "1997",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shchur:1997:CMC,
  author =       "Lev N. Shchur and Henk W. J. Bl{\"o}te",
  title =        "Cluster {Monte Carlo}: Scaling of systematic errors in
                 the two-dimensional {Ising} model",
  journal =      j-PHYS-REV-E,
  volume =       "55",
  number =       "5",
  pages =        "R4905--R4908",
  month =        may,
  year =         "1997",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.55.R4905",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Feb 16 18:18:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.55.R4905",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark =       "This paper analyzes the failure of a shift-register
                 generator in a Monte Carlo simulation of the
                 two-dimensional Ising lattice, for which the exact
                 solution was discovered by Lars Onsager
                 \cite{Onsager:1944:CST}, winner of the 1968 Nobel Prize
                 in Chemistry. See also \cite{Heuer:1997:CCS} for a
                 related analysis, and \cite{Janke:2002:PRN} for a
                 summary.",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Shchur:1997:SDR,
  author =       "L. N. Shchur and J. R. Heringa and H. W. J.
                 Bl{\"o}te",
  title =        "Simulation of a directed random-walk model: the effect
                 of pseudo-random-number correlations",
  journal =      j-PHYSICA-A,
  volume =       "241",
  number =       "3--4",
  pages =        "579--592",
  day =          "15",
  month =        jul,
  year =         "1997",
  CODEN =        "PHYADX",
  DOI =          "https://doi.org/10.1016/S0378-4371(97)00126-X",
  ISSN =         "0378-4371 (print), 1873-2119 (electronic)",
  ISSN-L =       "0378-4371",
  bibdate =      "Thu Feb 16 06:59:24 MST 2012",
  bibsource =    "http://www.sciencedirect.com/science/journal/03784371;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S037843719700126X",
  acknowledgement = ack-nhfb,
  fjournal =     "Physica A. Statistical Mechanics and its
                 Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784371",
  remark =       "See \cite{Ferrenberg:1992:MCS,Kankaala:1993:BLC,
                 Selke:1993:CFM,Holian:1994:PNG,Schmid:1995:EMC,
                 Shchur:1997:SDR,Vattulainen:1994:PTR} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Slone:1997:EBR,
  author =       "Dale M. Slone and Garry H. Rodrigue",
  title =        "Efficient biased random bit generation for parallel
                 lattice gas simulations",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "22",
  number =       "12",
  pages =        "1597--1620",
  day =          "21",
  month =        feb,
  year =         "1997",
  CODEN =        "PACOEJ",
  DOI =          "https://doi.org/10.1016/S0167-8191(96)00060-9",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Fri Aug 6 10:14:46 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1997&volume=22&issue=12;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_sub/browse/browse.cgi?year=1997&volume=22&issue=12&aid=1111;
                 http://www.sciencedirect.com/science/article/pii/S0167819196000609",
  acknowledgement = ack-nhfb,
  affiliation =  "Lawrence Livermore Natl Lab",
  affiliationaddress = "CA, USA",
  classification = "721.1; 722.4; 723.2; 723.5; 921.1; 922.2; A0230
                 (Function theory, analysis); A0550 (Lattice theory and
                 statistics; A0560 (Transport processes: theory); C4170
                 (Differential equations); C4240P (Parallel programming
                 and algorithm theory); C6185 (Simulation techniques);
                 C7320 (Physics and chemistry computing); Ising
                 problems)",
  corpsource =   "Lawrence Livermore Nat. Lab., CA, USA",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  journalabr =   "Parallel Comput",
  keywords =     "1D Burgers; algorithms; BBN TC2200 parallel; bit; Bit
                 vector algorithm; Burgers equation; Computer
                 simulation; computing; CRAY 90 parallel processors;
                 diffusion; diffusive systems; Digital arithmetic;
                 digital simulation; efficient algorithm; efficient
                 biased random bit generation; equation; kinetics
                 modelling; lattice gas; lattice gas automation; Lattice
                 gas methods; Mathematical models; parallel; Parallel
                 algorithms; parallel lattice gas; Parallel processing
                 systems; partial differential equations; physics;
                 processors; Random number generation; random number
                 generation; randomly biased bit vector generation;
                 simulations; vector operations; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Song:1997:GDR,
  author =       "Peter Xue-Kun Song",
  title =        "Generating dependent random numbers with given
                 correlations and margins from exponential dispersion
                 models",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "56",
  number =       "4",
  pages =        "317--335",
  month =        "????",
  year =         "1997",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659708811797",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:30:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659708811797",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  keywords =     "compound Poisson distribution; gamma distribution;
                 inverse Gaussian distribution; negative binomial
                 distribution; normal distribution; Poisson
                 distribution",
  onlinedate =   "11 Oct 2011",
}

@Article{Strauss:1997:NNS,
  author =       "Martin Strauss",
  title =        "Normal numbers and sources for {BPP}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "178",
  number =       "1--2",
  pages =        "155--169",
  day =          "30",
  month =        may,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:54 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=178&issue=1-2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=178&issue=1-2&aid=2302",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "alternate notions; bounded-error probabilistic
                 machines; BPP; classical normal numbers; computational
                 complexity; DSPACE(2/sup polynomial/); nonrandom
                 sequence; normal numbers; normal sequences; normal
                 sources; notion of source; PSPACE; random bits",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Struckmeier:1997:GRV,
  author =       "J. Struckmeier",
  title =        "Generation of Random Variates Using Asymptotic
                 Expansions",
  journal =      j-COMPUTING,
  volume =       "59",
  number =       "4",
  pages =        "331--347",
  month =        dec,
  year =         "1997",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65C10",
  MRnumber =     "99b:65008",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Fri Oct 15 15:41:31 MDT 1999",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database; OCLC Contents1st database",
  URL =          "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=2503&id_volume=212&id_journal=8",
  acknowledgement = ack-nhfb,
  classification = "921; 921.2; 921.6; 922.1; 922.2",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput Vienna New York",
  keywords =     "Asymptotic expansions; Error analysis; Integration;
                 Monte Carlo methods; Probability; Random number
                 generation; Theorem proving",
}

@InProceedings{Takashima:1997:RWTa,
  author =       "K. Takashima",
  editor =       "S. Ogawa and K. Sabelfeld",
  booktitle =    "{Proceedings of the Workshop on Turbulent Diffusion
                 and Related Problems in Stochastic Numerics}",
  title =        "Random walk tests of additive number generators",
  publisher =    "Inst. Stat. Math.",
  address =      "????",
  pages =        "55--65",
  year =         "1997",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Mar 01 08:02:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "",
  acknowledgement = ack-nhfb,
}

@Article{Takashima:1997:RWTb,
  author =       "Keizo Takashima",
  title =        "Random walk tests of reciprocal $m$-sequences",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "3",
  number =       "2",
  pages =        "155--166",
  month =        "????",
  year =         "1997",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1997.3.2.155",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C20 (65U05)",
  MRnumber =     "1459900 (98c:65010)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1997.3.issue-2/issue-files/mcma.1997.3.issue-2.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1997.3.issue-2/mcma.1997.3.2.155/mcma.1997.3.2.155.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{vanHameren:1997:GLD,
  author =       "Andr{\'e} van Hameren and Ronald Kleiss and Jiri
                 Hoogland",
  title =        "{Gaussian} limits for discrepancies {I}. Asymptotic
                 results",
  journal =      j-COMP-PHYS-COMM,
  volume =       "107",
  number =       "1--3",
  pages =        "1--20",
  month =        dec,
  year =         "1997",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(97)00105-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465597001057",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Woodward:1997:ECD,
  author =       "J. Arthur Woodward and Christina G. S. Palmer",
  title =        "On the Exact Convolution of Discrete Random
                 Variables",
  journal =      j-APPL-MATH-COMP,
  volume =       "83",
  number =       "1",
  pages =        "69--77",
  day =          "1",
  month =        apr,
  year =         "1997",
  CODEN =        "AMHCBQ",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  MRclass =      "62E15",
  MRnumber =     "1 433 169",
  bibdate =      "Fri Oct 22 17:48:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/amc/cas_free/browse/browse.cgi?year=1997&volume=83&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/applmathcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/amc/cas_sub/browse/browse.cgi?year=1997&volume=83&issue=1&aid=9600047",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Wu:1997:MCR,
  author =       "Pei-Chi Wu",
  title =        "Multiplicative, congruential random-number generators
                 with multiplier $ \pm 2^{k_1} \pm 2^{k_2} $ and modulus
                 $ 2^p - 1 $",
  journal =      j-TOMS,
  volume =       "23",
  number =       "2",
  pages =        "255--265",
  month =        jun,
  year =         "1997",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/264029.264056",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1997-23-2/p255-wu/",
  abstract =     "The demand for random numbers in scientific
                 applications in increasing. However, the most widely
                 used multiplicative, congruential random-number
                 generators with modulus $ 2^31 - 1 $ have a cycle
                 length of about $ 2.1 \times 10^9 $. Moreover,
                 developing portable and efficient generators with a
                 larger modulus such as $ 2^61 - 1 $ is more difficult
                 than those with modulus $ 2^31 - 1 $. This article
                 presents the development of multiplicative,
                 congruential generators with modulus $ m = 2 p - 1 $
                 and four forms of multipliers: $ 2^{k_1} - 2^{k_2},
                 2^{k_1} + 2^{k_2}, m - 2^{k_1} + 2^{k_2} $, and $ m -
                 2^{k_1} - 2^{k_2}, {k_1} > {k_2} $. The multipliers for
                 modulus $ 2^{31} - 1 $ and $ 2^{61} - 1 $ are measured
                 by spectral tests, and the best ones are presented. The
                 generators with these multipliers are portable and vary
                 fast. They have also passed several empirical tests,
                 including the frequency test, the urn test, and the
                 maximum-of-$t$ test.",
  acknowledgement = ack-rfb # " and " # ack-kr,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "cycle length, efficiency, multiplicative congruential
                 random-number generators, portability, spectral test",
  subject =      "{\bf G.3} Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
  xxURL =        "http://www.acm.org/pubs/citations/journals/toms/1997-23-2/p255-wu/",
}

@InProceedings{Zubkov:1997:PTD,
  author =       "A. M. Zubkov",
  booktitle =    "Proceedings in discrete mathematics, Vol. 1
                 ({Russian})",
  title =        "Peculiarities of two-dimensional distributions of a
                 sequence generated by a linear congruential generator",
  volume =       "1",
  publisher =    "Nauchn. Izd. TVP",
  address =      "Moscow, Russia",
  pages =        "113--120",
  year =         "1997",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1904188 (2003b:11073)",
  MRreviewer =   "Vladimir S. Anashin",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Tr. Diskretn. Mat.",
  acknowledgement = ack-nhfb,
}

@Article{Aiello:1998:DPP,
  author =       "William Aiello and S. Raj Rajagopalan and Ramarathnam
                 Venkatesan",
  title =        "Design of Practical and Provably Good Random Number
                 Generators",
  journal =      j-J-ALG,
  volume =       "29",
  number =       "2",
  pages =        "358--389",
  month =        nov,
  year =         "1998",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1006/jagm.1998.0952",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Thu Dec 29 14:48:25 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S019667749890952X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
}

@Article{Andreev:1998:NGD,
  author =       "Alexander E. Andreev and Andrea E. F. Clementi and
                 Jos{\'e} D. P. Rolim",
  title =        "A new general derandomization method",
  journal =      j-J-ACM,
  volume =       "45",
  number =       "1",
  pages =        "179--213",
  month =        jan,
  year =         "1998",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/273865.273933",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Apr 10 17:54:32 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/contents/journals/jacm/1998-45/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p179-andreev/",
  abstract =     "We show that {\em quick hitting set generators\/} can
                 replace {\em quick pseudorandom generators\/} to
                 derandomize any probabilistic {\em two-sided error\/}
                 algorithms. Up to now {\em quick hitting set
                 generators\/} have been known as the general and
                 uniform derandomization method for probabilistic {\em
                 one-sided error\/} algorithms, while {\em quick
                 pseudorandom generators\/} as the generators as the
                 general and uniform method to derandomize probabilistic
                 {\em two-sided error\/} algorithms. Our method is based
                 on a deterministic algorithm that, given a Boolean
                 circuit {\em C\/} and given access to a hitting set
                 generator, constructs a {\em discrepancy\/} set for
                 {\em C}. The main novelty is that the discrepancy set
                 depends on {\em C}, so the new derandomization method
                 is not uniform (i.e., not oblivious). The algorithm
                 works in time exponential in {\em k(p(n))\/} where {\em
                 k\/}(*) is the {\em price\/} of the hitting set
                 generator and {\em p(*)\/} is a polynomial function in
                 the size of {\em C}. We thus prove that if a
                 logarithmic price quick hitting set generator exists
                 then BPP = P.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "algorithms; theory",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf G.3} Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Probabilistic algorithms
                 (including Monte Carlo).",
}

@Article{Antoch:1998:RPN,
  author =       "Jarom{\'\i}r Antoch and Jean-Marc Deshouill{\'e}rs and
                 Gusti Putu Purnaba",
  title =        "Revisiting the pseudorandom number generator {{\tt
                 ran1}} from the {{\booktitle{Numerical Recipes}}}",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "27",
  number =       "4",
  pages =        "487--495",
  month =        jun,
  year =         "1998",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/S0167-9473(98)80002-9",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Thu Jan 19 16:48:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Baker:1997:NPU}.",
  URL =          "http://dl.acm.org/citation.cfm?id=292570.292582;
                 http://www.sciencedirect.com/science/article/B6V8V-3TC6SXY-8/2/594e7cff0a7497ab7b7670408b57955f",
  acknowledgement = ack-nhfb,
  acmid =        "292582",
  fjournal =     "Computational Statistics \& Data Analysis",
  issue =        "4",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
  keywords =     "Central Limit Theorem; chi square and
                 Kolmogorov-Smirnov's tests of fit; Diehard; Monte Carlo
                 simulations and integration; pseudorandom numbers",
  numpages =     "9",
  remark =       "From the abstract: ``We show experimentally that the
                 main problem is not in the implementation of these
                 generators but in ``their definition''. Two examples
                 show what can happen when we try to establish critical
                 values through simulations basing the necessary
                 calculations on these generators. The third example,
                 ``casting doubts on the validity of the central limit
                 theorem'', demonstrates another dangerous situation.
                 Finally, a fourth example shows the high sensitivity of
                 the random number generators studied to changes of the
                 constants defining them. These examples again clearly
                 show the imperative need to check pseudorandom
                 generators before their use, as we do (or at least as
                 we should do) with the theorems we apply.''",
}

@Article{Bach:1998:EPM,
  author =       "Eric Bach",
  title =        "Efficient prediction of {Marsaglia--Zaman} random
                 number generators",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "44",
  number =       "3",
  pages =        "1253--1257",
  year =         "1998",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/18.669305",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  MRclass =      "65C10",
  MRnumber =     "99b:65007",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0915.65003",
  abstract =     "This paper presents two properties of the random
                 number generator by {\it G. Marsaglia} and {\it A.
                 Zaman} [Ann. Appl. Probab. 1, No. 3, 462-480 (1991; Zbl
                 0733.65005)]. First, it is shown that its successive
                 digits are digits of certain rational $b$-adic numbers.
                 Then, an efficient algorithm is derived to predict an
                 unknown pseudorandom sequence of this type. Two
                 examples of the prediction are given.",
  acknowledgement = ack-nhfb,
  classmath =    "*65C10 Random number generation 11K45 Pseudo-random
                 numbers, etc.",
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  keywords =     "$b$-adic number; algorithm; continued fraction;
                 pseudo-random number generator",
  ZMreviewer =   "K. Uosaki (Tottori)",
}

@Article{Baldwin:1998:PAB,
  author =       "Robert W. Baldwin",
  title =        "Preliminary Analysis of the {BSAFE 3.x} Pseudorandom
                 Number Generators",
  journal =      "{RSA Laboratories' Bulletin}",
  volume =       "8",
  pages =        "1--11",
  day =          "3",
  month =        sep,
  year =         "1998",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Dec 08 09:46:12 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://ftp.rsasecurity.com/pub/pdfs/bull-3.pdf",
  acknowledgement = ack-nhfb,
}

@Misc{Baldwin:1998:PPR,
  author =       "Robert W. Baldwin and James W. {Gray, III}",
  title =        "{PCKS} \#14: Pseudo-Random Number Generation",
  howpublished = "World-Wide Web slide presentation.",
  month =        oct,
  year =         "1998",
  bibdate =      "Mon Dec 08 08:40:24 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://ftp.rsasecurity.com/pub/pkcs/98workshop/pkcs14_proposal3.ppt;
                 ftp://ftp.rsasecurity.com/pub/pkcs/99workshop/workshop.zip",
  acknowledgement = ack-nhfb,
}

@Article{Ballesteros:1998:TRN,
  author =       "H. G. Ballesteros and V. Mart{\'\i}n-Mayor",
  title =        "Test for random number generators: {Schwinger--Dyson}
                 equations for the {Ising} model",
  journal =      j-PHYS-REV-E,
  volume =       "58",
  number =       "5",
  pages =        "6787--6791",
  month =        nov,
  year =         "1998",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.58.6787",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Mon Jan 16 15:31:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.58.6787",
  abstract =     "We use a set of Schwinger--Dyson equations for the
                 Ising model to check several random number generators.
                 For the model in two and three dimensions, it is shown
                 that the equations are sensitive tests of bias
                 originating with the random numbers. The method is
                 almost costless in computer time when added to any
                 simulation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
}

@Article{Barni:1998:CPD,
  author =       "Mauro Barni and Franco Bartolini and Vito Cappellini
                 and Alessandro Piva",
  title =        "Copyright protection of digital images by embedded
                 unperceivable marks",
  journal =      j-IMAGE-VIS-COMPUT,
  volume =       "16",
  number =       "12--13",
  pages =        "897--906",
  month =        aug,
  year =         "1998",
  CODEN =        "IVCODK",
  ISSN =         "0262-8856 (print), 1872-8138 (electronic)",
  ISSN-L =       "0262-8856",
  bibdate =      "Mon Dec 28 14:40:10 MST 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Firenze",
  affiliationaddress = "Firenze, Italy",
  classification = "723; 723.2; 723.5; 902.3; 921.3; 922.2",
  fjournal =     "Image and Vision Computing",
  journalabr =   "Image Vision Comput",
  keywords =     "Algorithms; Copyrights; Cosine transforms; Digital
                 watermarking method; Discrete cosine transform (dct)
                 coefficients; Feature extraction; Frequency domain
                 analysis; Image analysis; Image processing; Multimedia
                 systems; Random number generation; Security of data",
}

@Book{Bennett:1998:R,
  author =       "Deborah J. Bennett",
  title =        "Randomness",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "238",
  year =         "1998",
  ISBN =         "0-674-10745-4",
  ISBN-13 =      "978-0-674-10745-8",
  LCCN =         "QA273.15 .B46 1998",
  bibdate =      "Mon Dec 08 09:10:56 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Chance Encounters \\
                 2. Why Resort to Chance? \\
                 3. When the Gods Played Dice \\
                 4. Figuring the Odds \\
                 5. Mind Games for Gamblers \\
                 6. Chance or Necessity? \\
                 7. Order in Apparent Chaos \\
                 8. Wanted: Random Numbers \\
                 9. Randomness as Uncertainty \\
                 10. Paradoxes in Probability.",
}

@Article{Berleant:1998:BRA,
  author =       "D. Berleant and C. Goodman-Strauss",
  title =        "Bounding the Results of Arithmetic Operations on
                 Random Variables of Unknown Dependency using
                 Intervals",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "4",
  number =       "??",
  pages =        "147--165",
  year =         "1998",
  CODEN =        "RCOMF8",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  bibdate =      "Sat Oct 02 12:47:47 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ee.iastate.edu/~djb/Research/Pdfs/unknownDependency.ps",
  acknowledgement = ack-nhfb,
  fjournal =     "Reliable Computing = Nadezhnye vychisleniia",
  journal-URL =  "http://link.springer.com/journal/11155",
}

@InProceedings{Birman:1998:ACH,
  author =       "Mark Birman",
  title =        "Accelerating Cryptography in Hardware: Public Key,
                 Random Number Generation, Symmetric Key",
  crossref =     "IEEE:1998:HCC",
  pages =        "??--??",
  year =         "1998",
  bibdate =      "Mon Jan 08 17:02:55 2001",
  bibsource =    "ftp://www.hotchips.org/pub/hotc7to11cd/hc98/pdf_1up/hc98_4b_birman_1up.txt;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Bramley:1998:TNRa,
  author =       "Randall Bramley",
  title =        "Technology News \& Reviews: Geographic Information
                 Systems; {Scalable Parallel Random Number Generators}
                 --- {SPRNG}; Portable power for laptops",
  journal =      j-IEEE-COMPUT-SCI-ENG,
  volume =       "5",
  number =       "1",
  pages =        "13--15",
  month =        jan # "\slash " # mar,
  year =         "1998",
  CODEN =        "ISCEE4",
  DOI =          "https://doi.org/10.1109/MCSE.1998.660286",
  ISSN =         "1070-9924 (print), 1558-190X (electronic)",
  ISSN-L =       "1070-9924",
  bibdate =      "Sat Jan 9 08:57:23 MST 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeecomputscieng.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dlib.computer.org/cs/books/cs1998/pdf/c1013.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Computational Science \& Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=99",
}

@Article{Brent:1998:RNG,
  author =       "R. P. Brent",
  title =        "Random Number Generation and Simulation on Vector and
                 Parallel Computers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1470",
  pages =        "1--??",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Oct 10 14:40:24 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Cattell:1998:EST,
  author =       "Kevin Cattell and Jon C. Muzio",
  title =        "An Explicit Similarity Transform between Cellular
                 Automata and {LFSR} Matrices",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "4",
  number =       "3",
  pages =        "239--251",
  month =        jul,
  year =         "1998",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1998.0212",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:54:09 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S107157979890212X",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InCollection{Cheng:1998:RVG,
  author =       "Russell C. H. Cheng",
  title =        "Random variate generation",
  crossref =     "Banks:1998:HSP",
  pages =        "138--172",
  year =         "1998",
  bibdate =      "Tue Dec 20 15:26:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "$k$-Erlang distribution; $t$-distribution;
                 autoregressive process distribution; Bernoulli
                 distribution; beta distribution; Cauchy distribution;
                 chi-squared distribution; Dirichlet distribution;
                 empirical distribution; exponential distribution;
                 extreme value distribution; F-distribution; gamma
                 distribution; geometric distribution; hypergeometric
                 distribution; inverse Gaussian distribution; lognormal
                 distribution; Markov process distribution; moving
                 average distribution; multivariate normal distribution;
                 negative binomial distribution; normal distribution;
                 Pearson type V distribution; Pearson type VI
                 distribution; Poisson distribution; Poisson process
                 distribution; Triangular distribution; uniform
                 distribution; uniform distribution on the
                 $n$-dimensional sphere; von Mises distribution; Weibull
                 distribution",
}

@InProceedings{Coddington:1998:RNG,
  author =       "Paul D. Coddington and Sung-Hoon Ko",
  editor =       "Greg Egan and Richard Brent and Dennis Gannon",
  booktitle =    "{ICS '98: Conference proceedings of the 1998
                 International Conference on Supercomputing: Melbourne,
                 Australia, July 13--17, 1998}",
  title =        "Random Number Generator for Parallel Computers",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "x + 464",
  pages =        "282--288",
  year =         "1998",
  DOI =          "https://doi.org/10.1145/277830.277895",
  ISBN =         "0-89791-998-X",
  ISBN-13 =      "978-0-89791-998-2",
  LCCN =         "QA76.5 .I58 1998",
  bibdate =      "Wed Oct 21 09:10:14 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Couture:1998:GEI,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "Guest editors' introduction: special issue on uniform
                 random number generation",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{DSouza:1998:SBD,
  author =       "Raissa M. D'Souza and Yaneer Bar-Yam and Mehran
                 Kardar",
  title =        "Sensitivity of ballistic deposition to pseudorandom
                 number generators",
  journal =      j-PHYS-REV-E,
  volume =       "57",
  number =       "5",
  pages =        "5044--5052",
  month =        may,
  year =         "1998",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.57.5044",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Dec 29 09:44:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.57.5044",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Eichenauer-Herrmann:1998:IUB,
  author =       "J. Eichenauer-Herrmann",
  title =        "Improved upper bounds for the discrepancy of pairs of
                 inversive congruential pseudorandom numbers with power
                 of two modulus",
  journal =      "Acta Math. Hungar.",
  volume =       "79",
  number =       "4",
  pages =        "295--303",
  year =         "1998",
  CODEN =        "AMAHE9",
  DOI =          "https://doi.org/10.1023/A:1006563028869",
  ISSN =         "0236-5294",
  ISSN-L =       "0001-5954",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1619812 (2000c:11129)",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Mathematica Hungarica",
}

@Article{Eichenauer-Herrmann:1998:LBD,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Harald
                 Niederreiter",
  title =        "Lower bounds for the discrepancy of triples of
                 inversive congruential pseudorandom numbers with power
                 of two modulus",
  journal =      j-MONAT-MATH,
  volume =       "125",
  number =       "3",
  pages =        "211--217",
  month =        sep,
  year =         "1998",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/BF01317314",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K45 (11K38 65C10)",
  MRnumber =     "1614275 (99m:11086)",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@InCollection{Eichenauer-Herrmann:1998:SQI,
  author =       "J{\"u}rgen Eichenauer-Herrmann and Eva Herrmann and
                 Stefan Wegenkittl",
  title =        "A survey of quadratic and inversive congruential
                 pseudorandom numbers",
  crossref =     "Niederreiter:1998:MCQ",
  pages =        "66--97",
  year =         "1998",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1644512 (99d:11085)",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Ellison:1998:CRN,
  author =       "C. Ellison",
  title =        "Cryptographic Random Numbers",
  institution =  "????",
  address =      "????",
  year =         "1998",
  bibdate =      "Tue Jan 31 15:46:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Draft P1363 Appendix E",
  acknowledgement = ack-nhfb,
}

@Article{Emmerich:1998:EPC,
  author =       "Frank Emmerich",
  title =        "Equidistribution Properties of Compound Inversive
                 Pseudorandom Vectors",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "4",
  number =       "1",
  pages =        "16--28",
  month =        jan,
  year =         "1998",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1997.0194",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579797901945",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Emmerich:1998:SIP,
  author =       "Frank Emmerich",
  title =        "Statistical independence properties of inversive
                 pseudorandom vectors over parts of the period",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "2",
  pages =        "140--152",
  month =        apr,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:36 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Entacher:1998:BSW,
  author =       "Karl Entacher",
  title =        "Bad subsequences of well-known linear congruential
                 pseudorandom number generators",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "61--70",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Entacher:1998:LCG,
  author =       "K. Entacher and A. Uhl and S. Wegenkittl",
  title =        "Linear congruential generators for parallel {Monte
                 Carlo}: the leap-frog case",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "4",
  number =       "1",
  pages =        "1--15",
  month =        jan,
  year =         "1998",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1998.4.1.1",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10 (65C05)",
  MRnumber =     "1622246",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@InProceedings{Entacher:1998:LIP,
  author =       "K. Entacher and A. Uhl and S. Wegenkittl",
  editor =       "Richard M. Fujimoto and David Bruce",
  booktitle =    "{Twelfth Workshop on Parallel and Distributed
                 Simulation. PADS'98, May 26th--29th, 1998, Banff,
                 Alberta, Canada}",
  title =        "Linear and Inversive Pseudorandom Numbers for Parallel
                 and Distributed Simulation",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "90--97",
  year =         "1998",
  DOI =          "https://doi.org/10.1109/PADS.1998.685274",
  ISBN =         "0-8186-8457-7, 0-8186-8459-3",
  ISBN-13 =      "978-0-8186-8457-9, 978-0-8186-8459-3",
  LCCN =         "QA76.9.C65 W674 1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 98TB100233.",
  URL =          "ftp://random.mat.sbg.ac.at/pub/publications/ste/pads98/pads_rev.ps.gz",
  acknowledgement = ack-nhfb,
}

@Article{Evans:1998:RVG,
  author =       "M. Evans and T. Swartz",
  title =        "Random Variable Generation Using Concavity Properties
                 of Transformed Densities",
  journal =      j-J-COMPUT-GRAPH-STAT,
  volume =       "7",
  number =       "4",
  pages =        "514--528",
  month =        dec,
  year =         "1998",
  CODEN =        "????",
  ISSN =         "1061-8600 (print), 1537-2715 (electronic)",
  ISSN-L =       "1061-8600",
  bibdate =      "Sat Jan 2 17:28:37 MST 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputgraphstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.amstat.org/publications/jcgs/abstracts98/evans.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Graphical Statistics",
  journal-URL =  "http://www.tandfonline.com/loi/ucgs20",
}

@Article{Fuster-Sabater:1998:LPS,
  author =       "A. Fuster-Sabater and L. J. Garcia-Villalba",
  title =        "Likelihood that a pseudorandom sequence generator has
                 optimal properties",
  journal =      j-ELECT-LETTERS,
  volume =       "34",
  number =       "7",
  pages =        "646--647",
  day =          "2",
  month =        apr,
  year =         "1998",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:19980499",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=673772",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Gammel:1998:HRR,
  author =       "B. M. Gammel",
  title =        "{Hurst}'s rescaled range statistical analysis for
                 pseudorandom number generators used in physical
                 simulations",
  journal =      j-PHYS-REV-E,
  volume =       "58",
  number =       "2",
  pages =        "2586--2597",
  month =        aug,
  year =         "1998",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.58.2586",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Dec 29 09:41:32 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.58.2586",
  abstract =     "The rescaled range statistical analysis (R/S) is
                 proposed as a method to detect correlations in
                 pseudorandom number generators used in Monte Carlo
                 simulations. In an extensive test it is demonstrated
                 that the R/S analysis provides a very sensitive method
                 to reveal hidden long-run and short-run correlations.
                 Several widely used and also some recently proposed
                 pseudorandom number generators are subjected to this
                 test. In many generators correlations are detected and
                 quantified.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Article{Garcia:1998:GCE,
  author =       "Alejandro L. Garcia and Berni J. Alder",
  title =        "Generation of the {Chapman--Enskog} Distribution",
  journal =      j-J-COMPUT-PHYS,
  volume =       "140",
  number =       "1",
  pages =        "66--70",
  day =          "10",
  month =        feb,
  year =         "1998",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1006/jcph.1998.5889",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 07:55:24 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0021999198958892",
  abstract =     "A pair of simple, efficient, and robust algorithms for
                 generating random velocities sampled from the
                 Chapman--Enskog distribution is presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Book{Gentle:1998:RNG,
  author =       "James E. Gentle",
  title =        "Random Number Generation and {Monte Carlo} Methods",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 247",
  year =         "1998",
  ISBN =         "0-387-98522-0",
  ISBN-13 =      "978-0-387-98522-0",
  LCCN =         "QA298.G46 1998",
  bibdate =      "Fri Dec 05 08:25:24 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.science.gmu.edu/~jgentle/rngbk/index1.htm",
  acknowledgement = ack-nhfb,
  remark =       "See also second edition \cite{Gentle:2003:RNG}.",
}

@InProceedings{Gutmann:1998:SGP,
  author =       "Peter Gutmann",
  title =        "Software Generation of Practically Strong Random
                 Numbers",
  crossref =     "USENIX:1998:SUS",
  pages =        "??--??",
  year =         "1998",
  bibdate =      "Fri Oct 18 09:16:59 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://usenix.org/publications/library/proceedings/sec98/full_papers/gutmann/gutmann.pdf;
                 http://www.cs.auckland.ac.nz/~pgut001/;
                 http://www.cs.auckland.ac.nz/~pgut001/pubs/usenix98.pdf;
                 http://www.usenix.org/publications/library/proceedings/sec98/gutmann.html",
  abstract =     "Although much thought usually goes into the design of
                 encryption algorithms and protocols, less consideration
                 is often given to equally important issues such as the
                 selection of cryptographically strong random numbers,
                 so that an attacker may find it easier to break the
                 random number generator than the security system it is
                 used with. This paper provides a comprehensive guide to
                 designing and implementing a practically strong random
                 data accumulator and generator which requires no
                 specialised hardware or access to privileged system
                 services. The performance of the generator on a variety
                 of systems is analysed, and measures which can make
                 recovery of the accumulator/generator state information
                 more difficult for an attacker are presented. The
                 result is an easy-to-use random number generator which
                 should be suitable even for demanding cryptographic
                 applications.",
  acknowledgement = ack-nhfb,
  keywords =     "cryptography",
  pagecount =    "16",
}

@Article{Hamilton:1998:AEP,
  author =       "K. G. Hamilton",
  title =        "{Algorithm 780}: Exponential Pseudorandom
                 Distribution",
  journal =      j-TOMS,
  volume =       "24",
  number =       "1",
  pages =        "102--106",
  month =        mar,
  year =         "1998",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/285861.285866;
                 http://www.acm.org/pubs/citations/journals/toms/1998-24-1/p102-hamilton/",
  abstract =     "An algorithm is presented for the calculation of
                 exponentially distributed random numbers. It is based
                 on mathematics that was published by Ahrend and Dieter,
                 but some errors have been corrected.",
  accepted =     "June 1997",
  acknowledgement = ack-rfb # " and " # ack-kr,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms, exponential distribution, random numbers,
                 pseudorandom numbers.",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Fortran 90. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Random number
                 generation. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing. {\bf
                 I.6.0}: Computing Methodologies, SIMULATION AND
                 MODELING, General.",
}

@InProceedings{Hellekalek:1998:ARQ,
  author =       "P. Hellekalek",
  title =        "On the assessment of random and quasi-random point
                 sets",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "49--108",
  year =         "1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellekalek:1998:CAP,
  author =       "P. Hellekalek",
  title =        "On correlation analysis of pseudorandom numbers",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "251--265",
  year =         "1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellekalek:1998:DTP,
  author =       "Peter Hellekalek",
  editor =       "????",
  booktitle =    "{Twelfth Workshop on Parallel and Distributed
                 Simulation. PADS'98, May 26th--29th, 1998, Banff,
                 Alberta, Canada}",
  title =        "Don't trust parallel {Monte Carlo}!",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "82--89",
  year =         "1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hellekalek:1998:GRN,
  author =       "P. Hellekalek",
  title =        "Good random number generators are (not so) easy to
                 find",
  journal =      j-MATH-COMP-SIM,
  volume =       "46",
  number =       "5--6",
  pages =        "485--505",
  month =        jun,
  year =         "1998",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(98)00078-0",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Sun Dec 18 09:26:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://random.mat.sbg.ac.at/results/peter/A19final.pdf",
  ZMnumber =     "Zbl 0931.65001",
  abstract =     "Every random number generator has its advantages and
                 deficiencies. There are no `safe' generators. The
                 practitioner's problem is how to decide which random
                 number generator will suit his needs best. In this
                 paper, we will discuss criteria for good random number
                 generators: theoretical support, empirical evidence and
                 practical aspects. We will study several recent
                 algorithms that perform better than most generators in
                 actual use. We will compare the different methods and
                 supply numerical results as well as selected pointers
                 and links to important literature and other sources.
                 Additional information on random number generation,
                 including the code of most algorithms discussed in this
                 paper is available from our web-server under the
                 address http://random.mat.sbg.ac.at/.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
  remark =       "From page 502 of the paper: ``Random number generators
                 are like antibiotics. Every type of generator has its
                 unwanted side-effects. There are no safe generators.
                 Good random number generators are characterized by
                 theoretical support, convincing empirical evidence, and
                 positive practical aspects. They will produce correct
                 results in many, though not all, simulations.''",
}

@Article{Hellekalek:1998:WST,
  author =       "Peter Hellekalek and Harald Niederreiter",
  title =        "The weighted spectral test: diaphony",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "43--60",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@InProceedings{Hickernell:1998:LRH,
  author =       "Fred J. Hickernell",
  title =        "Lattice Rules: How Well Do They Measure up?",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "109--177",
  year =         "1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Hoffman:1998:RNG,
  author =       "Eric J. Hoffman",
  title =        "Random number generator",
  howpublished = "US Patent 5,706,218",
  day =          "6",
  month =        jan,
  year =         "1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "US patent application number 08/648,553, filed 15 May
                 1996 by Intel Corporation.",
  URL =          "https://www.google.com/patents/US5706218",
  abstract =     "A random number generator using a single, slow,
                 voltage controlled oscillator which receives a noise
                 input and a plurality of high frequency ring
                 oscillators. The ring oscillators are sampled under
                 control of the slow oscillator. A circuit is used
                 between the output of each of the ring oscillators and
                 its respective D-type latch to assure that the sampling
                 is unbiased, that is, that there will be near even
                 distribution of 1s and 0s in the random numbers.",
}

@InProceedings{Jakobsson:1998:PSP,
  author =       "Markus Jakobsson and Elizabeth Shriver and Bruce K.
                 Hillyer and Ari Juels",
  editor =       "{ACM}",
  booktitle =    "Proceedings of the Fifth {ACM} Conference on Computer
                 and Communications Security, November 3--5, 1998, San
                 Francisco, California",
  title =        "A practical secure physical random bit generator",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "viii + 160",
  pages =        "103--111",
  year =         "1998",
  DOI =          "https://doi.org/10.1145/288090.288114",
  ISBN =         "1-58113-007-4",
  ISBN-13 =      "978-1-58113-007-2",
  LCCN =         "QA76.9.A25 A33 1998",
  bibdate =      "Sat Dec 24 11:08:40 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.bell-labs.com/user/shriver/random.html",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Kao:1998:RNG,
  author =       "Chiang Kao and J. Y. Wong",
  title =        "Random number generators with long period and sound
                 statistical properties",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "36",
  number =       "3",
  pages =        "113--121",
  month =        aug,
  year =         "1998",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(98)00133-3",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122198001333",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Kao:1998:SET,
  author =       "Chiang Kao and Hui-Chin Tang",
  title =        "Several extensively tested multiple recursive random
                 number generators",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "36",
  number =       "6",
  pages =        "129--136",
  month =        sep,
  year =         "1998",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(98)00166-7",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122198001667",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Kelsey:1998:CAP,
  author =       "John Kelsey and Bruce Schneier and David Wagner and
                 Chris Hall",
  title =        "Cryptanalytic Attacks on Pseudorandom Number
                 Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1372",
  pages =        "168--188",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:51:41 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1372.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1998a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1372/13720168.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1372/13720168.pdf;
                 http://www.counterpane.com/pseudorandom_number.html;
                 http://www.schneier.com/paper-prngs.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Knudsen:1998:JHH,
  author =       "Jonathan Knudsen",
  title =        "{JavaTalk}: Horseshoes, hand grenades and random
                 numbers",
  journal =      j-SUNSERVER,
  volume =       "12",
  number =       "1",
  pages =        "16--17",
  month =        jan,
  year =         "1998",
  CODEN =        "????",
  ISSN =         "1091-4986",
  bibdate =      "Wed Jan 14 08:24:51 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SunServer",
}

@Book{Knuth:1998:SA,
  author =       "Donald E. Knuth",
  title =        "Seminumerical Algorithms",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xiii + 762",
  year =         "1998",
  ISBN =         "0-201-89684-2",
  ISBN-13 =      "978-0-201-89684-8",
  LCCN =         "QA76.6 .K64 1997",
  bibdate =      "Fri Jul 11 15:41:22 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$52.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "3: Random Numbers / 1 \\
                 3.1. Introduction / 1 \\
                 3.2. Generating Uniform Random Numbers / 10 \\
                 3.2.1. The Linear Congruential Method / 10 \\
                 3.2 1.1. Choice of modulus / 12 \\
                 3.2.1.2 Choice of multiplier / 16 \\
                 3.2.1.3. Potency / 23 \\
                 3.2.2. Other Methods / 26 \\
                 3.3. Statistical Tests / 41 \\
                 3.3.1. General Test Procedures for Studying Random Data
                 / 41 \\
                 3.3.2. Empirical Tests / 61 \\
                 *3.3.3. Theoretical Tests / 80 \\
                 3.3.4. The Spectral Test / 93 \\
                 3.4. Other Types of Random Quantities / 119 \\
                 3.4 1. Numerical Distributions / 119 \\
                 3.4.2. Random Sampling and Shuffling / 142 \\
                 *3.5. What Is a Random Sequence? / 149 \\
                 3.6. Summary / 184 \\
                 4: Arithmetic / 194 \\
                 4.1. Positional Number Systems / 195 \\
                 4.2. Floating Point Arithmetic / 214 \\
                 4.2.1. Single-Precision Calculations / 214 \\
                 4.2 2. Accuracy of Floating Point Arithmetic / 229 \\
                 *4.2.3. Double-Precision Calculations / 246 \\
                 4.2.4. Distribution of Floating Point Numbers / 253 \\
                 4.3 Multiple Precision Arithmetic / 265 \\
                 4.3.1. The Classical Algorithms / 265 \\
                 *4.3.2. Modular Arithmetic / 284 \\
                 *4.3.3. How Fast Can We Multiply? / 294 \\
                 4.4. Radix Conversion / 319 \\
                 4.5. Rational Arithmetic / 330 \\
                 4.5.1. Fractions / 330 \\
                 4.5.2. The Greatest Common Divisor / 333 \\
                 *4.5.3. Analysis of Euclid's Algorithm / 356 \\
                 4.5.4. Factoring into Primes / 379 \\
                 4.6. Polynomial Arithmetic / 418 \\
                 4.6.1. Division of Polynomials / 420 \\
                 *4.6.2. Factorization of Polynomials / 439 \\
                 4.6.3. Evaluation of Powers / 461 \\
                 4.6.4. Evaluation of Polynomials / 485 \\
                 *4.7. Manipulation of Power Series / 525 \\
                 Answers to Exercises / 538 \\
                 Appendix A: Tables of Numerical Quantities / 726 \\
                 1. Fundamental Constants (decimal) / 726 \\
                 2; Fundamental Constants ( octal) / 727 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 728 \\
                 Appendix B: Index to Notations / 730 \\
                 Index and Glossary / 735",
}

@Article{Kolmogorov:1998:TRN,
  author =       "A. N. Kolmogorov",
  title =        "On tables of random numbers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "207",
  number =       "2",
  pages =        "387--395",
  day =          "06",
  month =        nov,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:22:11 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=207&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/207/2/2906.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@InProceedings{Larcher:1998:DPS,
  author =       "Gerhard Larcher",
  title =        "Digital Point Sets: Analysis and Application",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "178--222",
  year =         "1998",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{}.",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:1998:DPS,
  author =       "P. L'Ecuyer and P. Hellekalek",
  title =        "Design Principles and Statistical Tests of Random
                 Number Generators",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "223--265",
  year =         "1998",
  bibdate =      "Thu Dec 29 15:35:33 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxtitle =      "Random number generators: Selection criteria and
                 testing",
}

@TechReport{LEcuyer:1998:GPI,
  author =       "Pierre L'Ecuyer",
  title =        "Good parameters and implementations for combined
                 multiple recursive random number generators",
  type =         "Report",
  institution =  "Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, PQ, Canada",
  year =         "1998",
  bibdate =      "Wed Dec 21 09:30:17 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Published in \cite{LEcuyer:1999:GPI}.",
  URL =          "http://www.iro.umontreal.ca/blecuyer/papers.html",
  acknowledgement = ack-nhfb,
  remark =       "Document available as file {\tt combmrg2.ps}, witg C
                 code in file {\tt combmrg2.c}.",
}

@InCollection{LEcuyer:1998:RNGa,
  author =       "Pierre L'Ecuyer",
  title =        "Random number generation",
  crossref =     "Banks:1998:HSP",
  chapter =      "4",
  pages =        "93--137",
  year =         "1998",
  bibdate =      "Tue Dec 20 15:26:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:1998:RNGb,
  author =       "Pierre L'Ecuyer and Peter Hellekalek",
  title =        "Random number generators: selection criteria and
                 testing",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "223--265",
  year =         "1998",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1662843 (99m:65014)",
  MRreviewer =   "Francesco Fabris",
  bibdate =      "Wed Feb 22 14:14:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:1998:RNGc,
  author =       "Pierre L'Ecuyer",
  title =        "Random number generators and empirical tests",
  crossref =     "Niederreiter:1998:MCQ",
  pages =        "124--138",
  year =         "1998",
  MRclass =      "65C10",
  MRnumber =     "1644515",
  bibdate =      "Wed Feb 22 14:14:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:1998:URNa,
  author =       "Pierre L'Ecuyer",
  title =        "Uniform random number generation",
  crossref =     "Kent:1998:ECS",
  pages =        "323--339",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:16:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:1998:URNb,
  author =       "P. L'Ecuyer",
  title =        "Uniform Random Number Generators",
  crossref =     "Medeiros:1998:WSC",
  pages =        "97--104",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:26:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lu:1998:IPG,
  author =       "Chi-Jen Lu",
  title =        "Improved Pseudorandom Generators for Combinatorial
                 Rectangles",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1443",
  pages =        "223--??",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:52:31 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1443.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1443/14430223.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1443/14430223.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Lurie:1998:AMS,
  author =       "Philip M. Lurie and Matthew S. Goldberg",
  title =        "An Approximate Method for Sampling Correlated Random
                 Variables from Partially-Specified Distributions",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "44",
  number =       "2",
  pages =        "203--218",
  month =        feb,
  year =         "1998",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.44.2.203",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@Article{Malov:1998:RVG,
  author =       "Sergey V. Malov",
  title =        "Random variables generated by ranks in dependent
                 schemes",
  journal =      j-METRIKA,
  volume =       "48",
  number =       "1",
  pages =        "61--67",
  month =        sep,
  year =         "1998",
  CODEN =        "MTRKA8",
  DOI =          "https://doi.org/10.1007/PL00003972",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Mon Feb 2 16:28:02 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metrika.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/PL00003972",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika",
  journal-URL =  "http://link.springer.com/journal/184",
}

@Article{Marsaglia:1998:MPMa,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "The {Monty Python} Method for Generating Gamma
                 Variables",
  journal =      j-J-STAT-SOFT,
  volume =       "3",
  number =       "3",
  pages =        "1--8",
  year =         "1998",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Sun Nov 17 22:35:43 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/v03/i03;
                 http://www.jstatsoft.org/v03/i03/GERMGAM.PDF;
                 http://www.jstatsoft.org/v03/i03/GERMGAM.PS;
                 http://www.jstatsoft.org/v03/i03/updates",
  abstract =     "The Monty Python Method for generating random
                 variables takes a decreasing density, cuts it into
                 three pieces, then, using area-preserving
                 transformations, folds it into a rectangle of area $1$.
                 A random point $ (x, y) $ from that rectangle is used
                 to provide a variate from the given density, most of
                 the time as $x$ itself or a linear function of $x$. The
                 decreasing density is usually the right half of a
                 symmetric density.\par The Monty Python method has
                 provided short and fast generators for normal, $t$ and
                 von Mises densities, requiring, on the average, from $
                 1.5 $ to $ 1.8 $ uniform variables. In this article, we
                 apply the method to non-symmetric densities,
                 particularly the important gamma densities. We lose
                 some of the speed and simplicity of the symmetric
                 densities, but still get a method for variates that is
                 simple and fast enough to provide beta variates in the
                 form $ \gamma_a = (\gamma_a + \gamma_b) $. We use an
                 average of less than $ 1.7 $ uniform variates to
                 produce a gamma variate whenever $ \alpha \geq 1 $.
                 Implementation is simpler and from three to five times
                 as fast as a recent method reputed to be the best for
                 changing $ \alpha $ s.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
}

@Article{Marsaglia:1998:MPMb,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "The {Monty Python} method for generating random
                 variables",
  journal =      j-TOMS,
  volume =       "24",
  number =       "3",
  pages =        "341--350",
  month =        sep,
  year =         "1998",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/292395.292453",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (60E99)",
  MRnumber =     "99k:65014",
  bibdate =      "Mon Feb 8 17:51:43 MST 1999",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/1998-24/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib;
                 MathSciNet database",
  URL =          "http://www.acm.org:80/pubs/citations/journals/toms/1998-24-3/p341-marsaglia/",
  ZMnumber =     "0930.65002",
  abstract =     "We suggest an interesting and fast method for
                 generating normal, exponential, $t$, von Mises, and
                 certain other important random variables used in Monte
                 Carlo studies. The right half of a symmetric density is
                 cut into pieces, then, using simple area-preserving
                 transformations, reassembled into a rectangle from
                 which the $x$-coordinate---or a linear function of the
                 $x$-coordinate---of a random point provides the
                 required variate. To illustrate the speed and
                 simplicity of the Monty Python method, we provide a
                 small C program, self-contained, for rapid generation
                 of normal (Gaussian) variables. It is self-contained in
                 the sense that required uniform variates are generated
                 in-line, as pairs of 16-bit integers by means of the
                 remarkable new multiply-with-carry method.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "$t$ variates; algorithms; Monte Carlo studies; Monty
                 Python method; normal variates; random variable
                 generation; theory; von Mises variates",
  subject =      "{\bf G.3} Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1} Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
  ZMclass =      "65C10 Random number generation 65C05 Monte Carlo
                 methods",
}

@Article{Mascagni:1998:PLC,
  author =       "Michael Mascagni",
  title =        "Parallel linear congruential generators with prime
                 moduli",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "24",
  number =       "5--6",
  pages =        "923--936",
  day =          "1",
  month =        jun,
  year =         "1998",
  CODEN =        "PACOEJ",
  DOI =          "https://doi.org/10.1016/S0167-8191(98)00010-6",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "65C10 (65Y05)",
  MRnumber =     "1635411 (99d:65022)",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "Compendex database;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/parco/cas_free/browse/browse.cgi?year=1998&volume=24&issue=5-6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/parco/sub/1998/24/5-6/1287.pdf;
                 http://www.sciencedirect.com/science/article/pii/S0167819198000106",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southern Mississippi",
  affiliationaddress = "Hattiesburg, MI, USA",
  classification = "722.4; 723; 922.2",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
  journalabr =   "Parallel Comput",
  keywords =     "Linear congruential generators (lcg); Parallel
                 algorithms; Parallel processing systems; Random number
                 generation",
}

@InProceedings{Matsumoto:1998:DCP,
  author =       "M. Matsumoto and T. Nishimura",
  title =        "Dynamic creation of pseudorandom number generators",
  crossref =     "Niederreiter:1998:MCQ",
  pages =        "56--69",
  year =         "1998",
  bibdate =      "Sat Dec 31 10:14:38 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Matsumoto:1998:MTD,
  author =       "Makoto Matsumoto and Takuji Nishimura",
  title =        "{Mersenne} twister: a 623-dimensionally
                 equidistributed uniform pseudo-random number
                 generator",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "3--30",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/272991.272995",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Mar 15 17:33:34 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  URL =          "http://www.math.keio.ac.jp/~matsumoto/emt.html",
  abstract =     "A new algorithm called Mersenne Twister (MT) is
                 proposed for generating uniform pseudorandom numbers.
                 For a particular choice of parameters, the algorithm
                 provides a super astronomical period of $ 2^{19937} - 1
                 $ and 623-dimensional equidistribution up to 32-bit
                 accuracy, while using a working area of only 624 words.
                 This is a new variant of the previously proposed
                 generators, TGFSR, modified so as to admit a
                 Mersenne-prime period. The characteristic polynomial
                 has many terms. The distribution up to $v$ bits
                 accuracy for $ 1 \leq v \leq 32 $ is also shown to be
                 good. An algorithm is also given that checks the
                 primitivity of the characteristic polynomial of MT with
                 computational complexity $ O(p^2) $ where $p$ is the
                 degree of the polynomial.\par

                 We implemented this generator in portable C-code. It
                 passed several stringent statistical tests, including
                 diehard. Its speed is comparable to other modern
                 generators. Its merits are due to the efficient
                 algorithms that are unique to polynomial calculations
                 over the two-element field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  remark =       "See remark in \cite{Plesser:2010:RSI} about bad
                 initializers for the Mersenne Twister.",
}

@Article{Matsumoto:1998:SCA,
  author =       "Makoto Matsumoto",
  title =        "Simple cellular automata as pseudorandom $m$-sequence
                 generators for built-in self-test",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "31--42",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Misc{Mende:1998:MSP,
  author =       "R. G. Mende and L. C. Noll and S. Sisodiya",
  title =        "Method for Seeding a Pseudo-random Number Generator
                 with a Cryptographic Hash of a Digitization of a
                 Chaotic System",
  howpublished = "US Patent No. 5,732,138A.",
  day =          "24",
  month =        mar,
  year =         "1998",
  bibdate =      "Sat Nov 29 14:18:02 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Patent filed 29 January 1996.",
  URL =          "https://www.google.com/patents/US5732138",
  abstract =     "A method for generating a pseudo-random numbers
                 Initially, the state of a chaotic system is digitized
                 to form a binary string. This binary string is then
                 hashed to produce a second binary string. It is this
                 second binary string which is used to seed a
                 pseudo-random number generator. The output from the
                 pseudo-random number generator may be used in forming a
                 password or cryptographic key for use in a security
                 system.",
  acknowledgement = ack-nhfb,
}

@Article{Miller:1998:BPG,
  author =       "Jeff Miller",
  title =        "{Bivar}: a program for generating correlated random
                 numbers",
  journal =      j-BEHAV-RES-METH-INSTR-COMP,
  volume =       "30",
  number =       "4",
  pages =        "720--723",
  month =        dec,
  year =         "1998",
  CODEN =        "BRMCEW",
  DOI =          "https://doi.org/10.3758/BF03209492",
  ISSN =         "0743-3808 (print), 1532-5970 (electronic)",
  ISSN-L =       "0743-3808",
  bibdate =      "Fri Mar 09 07:28:01 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/m765v63np2420764/",
  acknowledgement = ack-nhfb,
  fjournal =     "Behavior Research Methods, Instruments, and
                 Computers",
  journal-URL =  "http://link.springer.com/journal/13428",
  remark =       "Bivar generates random numbers from a wide variety of
                 bivariate distributions.",
}

@TechReport{Morohosi:1998:DAR,
  author =       "H. Morohosi and M. Fushimi",
  title =        "Designing Asymptotically Random {GFSR} Sequences",
  type =         "Report",
  number =       "METR 98-11",
  institution =  "Department of Mathematical Engineering and Information
                 Physics, The University of Tokyo",
  address =      "Tokyo, Japan",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:29:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Niederreiter:1998:AGA,
  author =       "H. Niederreiter and C. Xing",
  title =        "The Algebraic-Geometry Approach to Low-Discrepancy
                 Sequences",
  crossref =     "Niederreiter:1998:MCQ",
  pages =        "139--160",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:46:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Niederreiter:1998:NSA,
  author =       "H. Niederreiter and C. Xing",
  title =        "Nets, $ (t, s) $-Sequences, and Algebraic Geometry",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "267--302",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:47:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Owen:1998:LSS,
  author =       "Art B. Owen",
  title =        "Latin supercube sampling for very high-dimensional
                 simulations",
  journal =      j-TOMACS,
  volume =       "8",
  number =       "1",
  pages =        "71--102",
  month =        jan,
  year =         "1998",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:35 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Park:1998:AGC,
  author =       "Chul Gyu Park and Dong Wan Shin",
  title =        "An algorithm for generating correlated random
                 variables in a class of infinitely divisible
                 distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "61",
  number =       "1--2",
  pages =        "127--139",
  month =        "????",
  year =         "1998",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659808811905",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:41:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659808811905",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Patel:1998:EDL,
  author =       "Sarvar Patel and Ganapathy S. Sundaram",
  title =        "An Efficient Discrete Log Pseudo Random Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1462",
  pages =        "304--317",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:52:43 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1462.htm;
                 http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1462/14620304.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1462/14620304.pdf;
                 http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography/073818.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "information hiding; steganography",
}

@Book{Peterson:1998:JRM,
  author =       "Ivars Peterson",
  title =        "The Jungles of Randomness: a Mathematical Safari",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 239",
  year =         "1998",
  ISBN =         "0-471-16449-6",
  ISBN-13 =      "978-0-471-16449-4",
  LCCN =         "QA273.15.P48 1997",
  bibdate =      "Sun Dec 28 22:33:36 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
}

@InProceedings{Petrie:1998:NBR,
  author =       "C. S. Petrie and J. A. Connelly",
  editor =       "{IEEE}",
  booktitle =    "{ISCAS '98: proceedings of the 1998 IEEE International
                 Symposium on Circuits and Systems: May 31--June 3,
                 1998, Monterey Conference Center, Monterey, CA}",
  title =        "A noise-based random bit generator {IC} for
                 applications in cryptography",
  volume =       "2",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  year =         "1998",
  DOI =          "https://doi.org/10.1109/ISCAS.1998.706875",
  ISBN =         "0-7803-4455-3 (paperback), 0-7803-4456-1 (hardcover)",
  ISBN-13 =      "978-0-7803-4455-6 (paperback), 978-0-7803-4456-3
                 (hardcover)",
  LCCN =         "TK7801.I22 1998",
  bibdate =      "Thu Feb 23 08:27:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Resende:1998:URN,
  author =       "F. J. Resende and B. V. Costa",
  title =        "Using random number generators in {Monte Carlo}
                 simulations",
  journal =      j-PHYS-REV-E,
  volume =       "58",
  number =       "4",
  pages =        "5183--5184",
  month =        oct,
  year =         "1998",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.58.5183",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Mon Jan 16 16:22:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.58.5183",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@InProceedings{Rey:1998:GRN,
  author =       "W. J. J. Rey",
  editor =       "B. Grigelionis and J. Kubilius and V. Paulauskas and
                 H. Pragarauskas and R. Rudzkis and V.
                 Statulevi{\v{c}}ius",
  booktitle =    "Probability theory and mathematical statistics:
                 proceedings of the Seventh Vilnius Conference (1998),
                 Vilnius, Lithuania, 12--18 August, 1998 [in conjunction
                 with the 22nd European Meeting of Statisticians]",
  title =        "On generating random numbers, with help of $ y = [(a +
                 x) \sin (b x)] \bmod 1 $",
  publisher =    "TEV",
  address =      "Vilnius, Lithuania",
  bookpages =    "viii + 740",
  pages =        "390--??",
  year =         "1998",
  ISBN =         "90-6764-313-0",
  ISBN-13 =      "978-90-6764-313-9",
  LCCN =         "QA273.A1 V53 1998",
  bibdate =      "Fri Mar 09 10:48:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "The book reference is WRONG! This paper is not found
                 in the book's on-line table of contents.",
}

@Article{Schatte:1998:BLV,
  author =       "P. Schatte",
  title =        "On {Benford}'s law to variable base",
  journal =      j-STAT-PROB-LETT,
  volume =       "37",
  number =       "4",
  pages =        "391--397",
  day =          "30",
  month =        mar,
  year =         "1998",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/S0167-7152(97)00142-9",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "60F05 (60E15)",
  MRnumber =     "1624423 (99e:60072)",
  MRreviewer =   "Theodore P. Hill",
  bibdate =      "Tue Nov 22 11:28:19 MST 2011",
  bibsource =    "http://www.sciencedirect.com/;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167715297001429",
  abstract =     "Benford's law is studied in dependence on the base $ b
                 > 1 $. It can hold to large bases $b$ only
                 approximately. The quality of approximation is
                 estimated in cases of products and sums of random
                 variables, respectively, and in case of some
                 deterministic sequences. Always the approximation by
                 Benford's law becomes worse as $ b \to \infty $, but as
                 a rule also as $ b \to 1 + 0 $",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
  keywords =     "Benford's Law",
}

@InCollection{Schmid:1998:SNN,
  author =       "W. C. Schmid",
  title =        "Shift-Nets: a New Class of Binary Digital $ (t, m, s)
                 $-Nets",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "369--381",
  year =         "1998",
  bibdate =      "Fri Mar 09 10:50:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Schneier:1998:YSP,
  author =       "Bruce Schneier",
  title =        "Yarrow: a secure pseudorandom number generator",
  howpublished = "World-Wide Web site.",
  year =         "1998",
  bibdate =      "Mon Dec 08 08:45:11 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Yarrow is no longer being supported.",
  URL =          "http://www.schneier.com/yarrow.html",
  acknowledgement = ack-nhfb,
}

@Article{Shchur:1998:RGR,
  author =       "Lev N. Shchur and Paolo Butera",
  title =        "The {RANLUX} Generator: Resonances in a Random Walk
                 Test",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "9",
  number =       "4",
  pages =        "607--624",
  month =        jun,
  year =         "1998",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183198000509",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 22:15:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/hep-lat/9805017;
                 http://www.worldscinet.com/ijmpc/09/0904/S0129183198000509.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@Misc{Soto:1998:STR,
  author =       "Juan Soto",
  title =        "Statistical Testing of {RNGs}",
  howpublished = "World-Wide Web slide presentation.",
  month =        jun,
  year =         "1998",
  bibdate =      "Mon Dec 08 07:53:34 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Presented at Computer Security Division Meeting,
                 Gaithersburg, MD",
  URL =          "http://csrc.nist.gov/rng/Copy-of-sts.ppt",
  acknowledgement = ack-nhfb,
}

@Article{Sugita:1998:LTS,
  author =       "Hiroshi Sugita and Satoshi Takanobu",
  title =        "Limit theorem for symmetric statistics with respect to
                 {Weyl} transformation: Disappearance of dependency",
  journal =      j-J-MATH-KYOTO-UNIV,
  volume =       "38",
  number =       "4",
  pages =        "653--671",
  month =        "????",
  year =         "1998",
  CODEN =        "JMKYAZ",
  ISSN =         "0023-608X",
  bibdate =      "Wed Feb 29 21:51:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "bl 0939.60009",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of mathematics of Kyoto University",
}

@InProceedings{Takashima:1998:RWT,
  author =       "K. Takashima",
  editor =       "????",
  booktitle =    "{Proceedings of Third St. Petersburg Workshop on
                 Simulations}",
  title =        "Random walk tests of pseudo-random number generations
                 by cellular automata",
  publisher =    "Saint Petersburg University Press",
  address =      "Saint Petersburg, Russia",
  pages =        "302--305",
  year =         "1998",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Thu Mar 01 08:12:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tanaka:1998:OLA,
  author =       "H. Tanaka and T. Ohishi and T. Kaneko",
  title =        "An Optimised Linear Attack on Pseudorandom Generators
                 Using a Non linear Combiner",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1396",
  pages =        "43--??",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Oct 10 14:40:24 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InCollection{Tezuka:1998:FAM,
  author =       "Shu Tezuka",
  title =        "Financial Applications of {Monte Carlo} and
                 Quasi-{Monte Carlo} Methods",
  crossref =     "Hellekalek:1998:RQR",
  pages =        "303--329",
  year =         "1998",
  bibdate =      "Thu Dec 29 15:37:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Thomlinson:1998:NBP,
  author =       "Matthew W. Thomlinson and Daniel R. Simon and Bennet
                 Yee",
  title =        "Non-biased pseudo random number generator",
  howpublished = "United States Patent 5,778,069.",
  day =          "7",
  month =        jul,
  year =         "1998",
  bibdate =      "Tue Dec 27 16:52:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http:www.google.com/patents/US5778069",
  abstract =     "A computer-implemented pseudo random number generator
                 includes an input device to assemble multiple classes
                 of bits from multiple sources into an input bit string.
                 The multiple classes of bits include an internal class
                 of bits from at least one source internal to the random
                 number generator, such as a static bit register which
                 maintains the current state of the generator. The input
                 device also gathers one or more external classes of
                 bits from one or more sources external to the random
                 number generator, such as a machine class of bits which
                 relate to operating parameters of the computer and an
                 application class of bits which relate to execution of
                 an application running on the computer. The input
                 device concatenates the three classes of bits into an
                 arbitrary length input bit string. The random number
                 generator also has a hash computing device which
                 computes an m-bit hash value of the input bit string
                 assembled by the input device. The hash computing
                 device computes the hash value using a hashing
                 function, such as SHA (secure hash algorithm), whereby
                 it is computationally infeasible to derive the
                 concatenated input bit string from the output hash
                 value or intentionally bias the output of the hash
                 function. The SHA is a one-way hash that reduces the
                 512-bit input bit string to a 160-bit hash value. The
                 hash value becomes the initializing seed for the random
                 number generator. A stream generator (i.e., a stream
                 cipher) is coupled to the hash computing device to
                 receive the hash value. The stream generator uses the
                 hash value as the initializing seed to produce an
                 output bit string of random (or pseudo random) bits.",
  acknowledgement = ack-nhfb,
}

@Article{Trotter:1998:RTS,
  author =       "William T. Trotter and Peter Winkler",
  title =        "{Ramsey} Theory and Sequences of Random Variables",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "7",
  number =       "2",
  pages =        "221--238",
  month =        jun,
  year =         "1998",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548398003393",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  bibdate =      "Mon Jul 7 15:38:05 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=7&issueId=02",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Vallee:1998:CAB,
  author =       "Brigitte Vall{\'e}e",
  title =        "The complete analysis of the binary {Euclidean}
                 algorithm",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1423",
  bookpages =    "x + 640",
  pages =        "77--94",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISBN =         "3-540-64657-4",
  ISBN-13 =      "978-3-540-64657-0",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA241 .A43 1998",
  bibdate =      "Thu Dec 29 06:29:39 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.csie.nuk.edu.tw/~cychen/gcd/The%20complete%20analysis%20of%20the%20binary%20Euclidean%20Algorithm.pdf;
                 http://www.springer.com/computer/theoretical+computer+science/book/978-3-540-64657-0",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  remark =       "Appears in conference proceedings
                 \cite{Buhler:1998:ANT}.",
}

@Article{Vallee:1998:DBE,
  author =       "Brigitte Vall{\'e}e",
  title =        "Dynamics of the binary {Euclidean} algorithm:
                 functional analysis and operators",
  journal =      j-ALGORITHMICA,
  volume =       "22",
  number =       "?",
  pages =        "660--685",
  month =        "????",
  year =         "1998",
  CODEN =        "ALGOEJ",
  ISSN =         "0178-4617 (print), 1432-0541 (electronic)",
  ISSN-L =       "0178-4617",
  bibdate =      "Thu Dec 29 06:30:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.info.unicaen.fr/~brigitte/Publications/bin-gcd.ps",
  acknowledgement = ack-nhfb,
  fjournal =     "Algorithmica",
  journal-URL =  "http://link.springer.com/journal/453",
}

@Article{vanHameren:1998:GLD,
  author =       "Andr{\'e} van Hameren and Ronald Kleiss and Jiri
                 Hoogland",
  title =        "{Gaussian} limits for discrepancies",
  journal =      j-NUCL-PHYS-B-PROC-SUPPL,
  volume =       "63",
  number =       "1--3",
  pages =        "988--990",
  month =        apr,
  year =         "1998",
  CODEN =        "NPBSE7",
  DOI =          "https://doi.org/10.1016/S0920-5632(97)00964-X",
  ISSN =         "0920-5632 (print), 1873-3832 (electronic)",
  ISSN-L =       "0920-5632",
  bibdate =      "Fri Dec 30 10:33:06 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S092056329700964X",
  abstract =     "It is well known that in the Monte Carlo method of
                 integration of an $s$-dimensional integral the
                 convergence to zero of the expected error can be
                 improved by using point sets that are distributed more
                 uniformly than truly random point sets. For a
                 mathematical analysis of these point sets measures of
                 non-uniformity are needed. These measures are called
                 discrepancies. We investigated the asymptotic
                 behaviour, in the limit of a large number of points, of
                 probability distributions of these discrepancies, and
                 were able to formulate a `Central Limit Theorem' for
                 these distributions.",
  acknowledgement = ack-nhfb,
  fjournal =     "Nuclear Physics B, Proceedings Supplements",
  journal-URL =  "http://www.sciencedirect.com/science/journal/09205632",
}

@Article{Wegenkittl:1998:THS,
  author =       "Stefan Wegenkittl",
  title =        "Are there hyperbolas in the scatter plots of inversive
                 congruential pseudorandom numbers?",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "95",
  number =       "1--2",
  pages =        "117--125",
  day =          "28",
  month =        aug,
  year =         "1998",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(98)00077-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1646374 (99g:11096)",
  MRreviewer =   "Genady Lazarevich Margolin",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@TechReport{Wheeler:1998:CX,
  author =       "David J. Wheeler and Roger M. Needham",
  title =        "Correction to {XTEA}",
  type =         "Report",
  institution =  "Cambridge University",
  address =      "Cambridge, UK",
  month =        oct,
  year =         "1998",
  bibdate =      "Thu Feb 02 05:48:22 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also original TEA \cite{Wheeler:1995:TTE} and
                 first extension XTEA \cite{Needham:1997:TE}.",
  URL =          "http://www.movable-type.co.uk/scripts/xxtea.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "TEA; Tiny Encryption Algorithm; XTEA; XXTEA",
}

@Book{Williams:1998:ELP,
  author =       "Hugh C. Williams",
  title =        "{{\'E}douard Lucas} and primality testing",
  volume =       "22",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 525",
  year =         "1998",
  ISBN =         "0-471-14852-0 (hardcover)",
  ISBN-13 =      "978-0-471-14852-4 (hardcover)",
  LCCN =         "QA246 .W43 1998",
  bibdate =      "Fri Mar 9 15:07:41 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Canadian Mathematical Society series of monographs and
                 advanced texts",
  URL =          "http://www.loc.gov/catdir/description/wiley033/97044760.html;
                 http://www.loc.gov/catdir/toc/onix04/97044760.html",
  acknowledgement = ack-nhfb,
  subject =      "Numbers, Prime; Lucas, {\'E}douard",
  subject-dates = "1842--1891",
}

@Article{Williamson:1998:CNR,
  author =       "Patrica Pepple Williamson",
  title =        "{C.449}. {A} note on the random generation of
                 {Dirichlet} variates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "60",
  number =       "2",
  pages =        "168--173",
  month =        mar,
  year =         "1998",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949659808811882",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Sat Jan 07 08:52:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949659808811882",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Wolf:1998:RWP,
  author =       "Marek Wolf",
  title =        "Random Walk on the Prime Numbers",
  journal =      j-PHYSICA-A,
  volume =       "250",
  number =       "1--4",
  pages =        "335--344",
  day =          "15",
  month =        feb,
  year =         "1998",
  CODEN =        "PHYADX",
  DOI =          "https://doi.org/10.1016/S0378-4371(97)00661-4",
  ISSN =         "0378-4371 (print), 1873-2119 (electronic)",
  ISSN-L =       "0378-4371",
  bibdate =      "Tue Feb 14 09:32:36 2012",
  bibsource =    "http://www.sciencedirect.com/science/journal/03784371;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378437197006614",
  acknowledgement = ack-nhfb,
  fjournal =     "Physica A. Statistical Mechanics and its
                 Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784371",
  remark =       "The author suggests that random walks on prime numbers
                 could be a good source of random numbers.",
}

@Article{Woodcock:1998:ACR,
  author =       "Christopher F. Woodcock and Nigel P. Smart",
  title =        "{$p$}-adic chaos and random number generation",
  journal =      j-EXP-MATH,
  volume =       "7",
  number =       "4",
  pages =        "333--342",
  month =        "????",
  year =         "1998",
  CODEN =        "????",
  ISSN =         "1058-6458 (print), 1944-950X (electronic)",
  ISSN-L =       "1058-6458",
  bibdate =      "Mon Mar 5 10:25:51 MST 2012",
  bibsource =    "http://projecteuclid.org/euclid.em;
                 https://www.math.utah.edu/pub/tex/bib/expmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.em/1047674151",
  acknowledgement = ack-nhfb,
  fjournal =     "Experimental Mathematics",
  journal-URL =  "http://www.tandfonline.com/loi/uexm20",
}

@Article{Ziff:1998:FTS,
  author =       "Robert M. Ziff",
  title =        "Four-Tap Shift-Register-Sequence Random-Number
                 Generators",
  journal =      j-COMPUT-PHYS,
  volume =       "12",
  number =       "4",
  pages =        "385--392",
  month =        jul # "\slash " # aug,
  year =         "1998",
  CODEN =        "CPHYE2",
  DOI =          "https://doi.org/10.1063/1.168692",
  ISSN =         "0894-1866 (print), 1558-4208 (electronic)",
  ISSN-L =       "0894-1866",
  bibdate =      "Mon Jun 27 21:34:41 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/cond-mat/9710104",
  abstract =     "It is shown how correlations in the generalized
                 feedback shift-register (GFSR) random-number generator
                 are greatly diminished when the number of feedback taps
                 is increased from two to four (or more) and the tap
                 offsets are lengthened. Simple formulas for producing
                 maximal-cycle four-tap rules from available primitive
                 trinomials are given, and explicit three- and
                 four-point correlations are found for some of those
                 rules. A number of generators are also tested using a
                 simple but sensitive random-walk simulation that
                 relates to a problem in percolation theory. While
                 virtually all two-tap generators fail this test,
                 four-tap generators with offset greater than about 500
                 pass it, have passed tests carried out by others, and
                 appear to be good multi-purpose high-quality
                 random-number generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers in Physics",
  journal-URL =  "https://aip.scitation.org/journal/cip",
  keywords =     "generalized feedback shift register (GFSR) algorithm;
                 {\tt gfsr()}",
}

@Article{Aiello:1999:HSP,
  author =       "William Aiello and S. Rajagopalan and Ramarathnam
                 Venkatesan",
  title =        "High-Speed Pseudorandom Number Generation with Small
                 Memory",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1636",
  pages =        "290--304",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:54:19 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1636.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1999b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1636/16360290.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1636/16360290.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "fast software encryption; FSE",
}

@Book{Beltrami:1999:WRCa,
  author =       "Edward Beltrami",
  title =        "What Is Random?: Chance and Order in Mathematics and
                 Life",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "1999",
  DOI =          "https://doi.org/10.1007/978-1-4612-1472-4",
  ISBN =         "1-4612-7156-8",
  ISBN-13 =      "978-1-4612-7156-7",
  LCCN =         "QA273.A1-274.9; QA274-274.9",
  bibdate =      "Tue Apr 29 18:44:55 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat1990.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  abstract =     "(Not for distribution) We all know what randomness is.
                 We sometimes choose between options ``at random'', and
                 if we toss a coin we know it will land heads or tails
                 at random. But are events like these truly random?
                 Randomness turns out to be one of those concepts, like
                 ``solid matter'' in physics, that works just fine on an
                 everyday level but mysteriously disappears once we move
                 in to examine its fine structure. In this fascinating
                 book, mathematician Ed Beltrami takes a close enough
                 look at randomness to make it mysteriously disappear.
                 The results of coin tosses, it turns out, are
                 determined from the start, and only our incomplete
                 knowledge makes them look random. ``Random'' sequences
                 of numbers are more elusive--they may be truly random,
                 but Godel's undecidability theorem informs us that
                 we'll never know. Their apparent randomness may be only
                 a shortcoming of our minds. Mathematicians have even
                 discovered a string of numbers that appears random--but
                 when you reverse the string, it's completely
                 deterministic! People familiar with quantum
                 indeterminacy tell us that order is an illusion, and
                 that the world is fundamentally random. Yet randomness
                 is also an illusion. Then which is real? Perhaps order
                 and randomness, like waves and particles, are only two
                 sides of the same coin.",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Distribution (Probability theory)",
}

@Article{Berdnikov:1999:CLV,
  author =       "A. S. Berdnikov and S. B. Turtia and A. Compagner",
  title =        "The combination of {LP$_\tau $} vectors and shift
                 register {RNGs} as a way to generate independent random
                 sequences for parallel computations",
  journal =      j-COMP-PHYS-COMM,
  volume =       "121--122",
  pages =        "612--612",
  month =        sep # "\slash " # oct,
  year =         "1999",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(06)70019-4",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:28 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465506700194",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@TechReport{Berleant:1999:IBA,
  author =       "Daniel Berleant",
  title =        "Interval Based, Automatically Verified Arithmetic on
                 Random Variables",
  howpublished = "World-Wide Web document",
  institution =  "Dept. of Electrical and Computer Engineering, 2215
                 Coover Hall, Iowa State University",
  address =      "Ames, IA, USA",
  year =         "1999",
  bibdate =      "Fri Oct 01 18:42:57 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://engr.uark.edu/~djb/me/vita/vita.html;
                 http://engr.uark.edu/~djb/Research/Pdfs/Overview/index.html",
  acknowledgement = ack-nhfbp,
}

@TechReport{Brent:1999:FAB,
  author =       "Richard P. Brent",
  title =        "Further analysis of the binary {Euclidean} algorithm",
  type =         "Technical Report",
  number =       "TR-7-99",
  institution =  "Programming Research Group, Oxford University",
  address =      "Oxford, UK",
  day =          "4",
  month =        nov,
  year =         "1999",
  bibdate =      "Thu Dec 29 06:11:00 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also earlier work \cite{Brent:1976:ABE}.",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.122.7959&rep=rep1&type=pdf",
  acknowledgement = ack-nhfb,
  remark =       "The worst case complexity of the binary Euclidean
                 algorithm is shown to be $ O(\lg N) $, and the number
                 of right shifts at most $ 2 \lg (N) $. The average
                 complexity is $ O(0.705 \lg N) $, where $ N = \max
                 (|u|, |v|) $.",
}

@Article{Brunner:1999:OML,
  author =       "D. Brunner and A. Uhl",
  title =        "Optimal multipliers for linear congruential pseudo
                 random number generators with prime moduli: Parallel
                 computation and properties",
  journal =      j-BIT-NUM-MATH,
  volume =       "39",
  number =       "2",
  pages =        "193--209",
  month =        jun,
  year =         "1999",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1023/A:1022333627834",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 15:06:03 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=39&issue=2;
                 http://www.mai.liu.se/BIT/contents/bit39.html;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st database",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=39&issue=2&spage=193",
  abstract =     "Two systematic search methods are employed to find
                 multipliers for linear congruential pseudo-random
                 number generation which are optimal with respect to an
                 upper bound for the discrepancy of pairs of successive
                 pseudo-random numbers. The efficiency of these search
                 procedures when executed on parallel systems is
                 assessed by experimental results of a MIMD parallel
                 implementation on a Meiko CS-2 and a workstation
                 cluster. Furthermore the quality of the computed
                 multipliers is evaluated by using the spectral test in
                 dimensions 2--8 and by calculating the actual
                 discrepancy of pairs of the resulting full-period
                 sequences.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Chang:1999:EIH,
  author =       "T. Chang and B. Park and Y. H. Kim",
  title =        "An efficient implementation of the {$D$}-homomorphism
                 for generation of {de Bruijn} sequences",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "45",
  number =       "4",
  pages =        "1280--1283",
  month =        "????",
  year =         "1999",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/18.761285",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Tue Feb 07 11:08:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@TechReport{Chen:1999:SSM,
  author =       "E. J. Chen and P. L'Ecuyer and W. D. Kelton",
  title =        "Seed and Stream Management for Multiple Recursive
                 Random Number Generators",
  type =         "Technical Report",
  number =       "????",
  institution =  "Department of Quantitative Analysis and Operations
                 Management, University of Cincinnati",
  address =      "Cincinnati, OH, USA",
  year =         "1999",
  bibdate =      "Thu Jan 05 14:00:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chu:1999:DTF,
  author =       "Pong P. Chu and Robert E. Jones",
  editor =       "????",
  booktitle =    "{MAPLD 99 Proceedings: Military and Aerospace
                 Applications of Programmable Devices and Technologies
                 Conference, September 28-30, 1999, Kossiakoff
                 Conference Center, The Johns Hopkins University,
                 Applied Physics Laboratory 11100 Johns Hopkins Road,
                 Laurel, Maryland 20723-6099}",
  title =        "Design Techniques of {FPGA}-Based Random Number
                 Generator (Extended Abstract)",
  publisher =    "????",
  address =      "Greenbelt, MD, USA",
  pages =        "1--2",
  year =         "1999",
  DOI =          "",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "",
  bibdate =      "Thu Nov 24 09:37:03 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://web.archive.org/web/20080720093740/http://klabs.org/richcontent/MAPLDCon99/Abstracts/chu.pdf",
  acknowledgement = ack-nhfb,
  remark =       "I can find the 1998 conference in library catalogs,
                 but not the 1999 conference; there appears to be no
                 publisher. I finally found old Web pages in the WayBack
                 Machine archive.",
}

@Article{Coddington:1999:IIR,
  author =       "P. D. Coddington and J. A. Mathew and K. A. Hawick",
  title =        "Interfaces and Implementations of Random Number
                 Generators for {Java Grande} Applications",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1593",
  pages =        "873--??",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Sep 13 16:57:02 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1999a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{deRaadt:1999:COO,
  author =       "Theo de Raadt and Niklas Hallqvist and Artur Grabowski
                 and Angelos D. Keromytis and Niels Provos",
  title =        "Cryptography in {OpenBSD}: An Overview",
  crossref =     "USENIX:1999:UAT",
  pages =        "??--??",
  year =         "1999",
  bibdate =      "Thu Feb 24 11:35:57 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://static.usenix.org/publications/library/proceedings/usenix99/full_papers/deraadt/deraadt_html/;
                 http://www.openbsd.org/papers/crypt-paper.ps",
  abstract =     "Cryptographic mechanisms are an important security
                 component of an operating system in securing the system
                 itself and its communication paths. Indeed, in many
                 situations, cryptography is the only tool that can
                 solve a particular problem, e.g., network-level
                 security. While cryptography by itself does not
                 guarantee security, when applied correctly, it can
                 significantly improve overall security. Since one of
                 the main foci of the OpenBSD system is security,
                 various cryptographic mechanisms are employed in a
                 number of different roles.\par

                 This paper gives an overview of the cryptography
                 employed in OpenBSD. We discuss the various components
                 (IPsec, SSL libraries, stronger password encryption,
                 Kerberos IV, random number generators, etc.), their
                 role in system security, and their interactions with
                 the rest of the system (and, where applicable, the
                 network).",
  acknowledgement = ack-nhfb,
  keywords =     "/dev/arandom; /dev/random; /dev/srandom; /dev/urandom;
                 arc4random(); bcrypt(); IPsec; MD5; nonrepeating random
                 numbers; S/KEY one-time password system; SHA1; SSL",
  pagecount =    "9",
}

@TechReport{Durrant:1999:RND,
  author =       "S. Durrant",
  title =        "Random Numbers in Data Security Systems",
  type =         "Report",
  institution =  "Intel Corporation",
  address =      "????",
  year =         "1999",
  bibdate =      "Tue Jan 31 15:36:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.intel.com/design/security/rng/WP_Durrant.htm",
  acknowledgement = ack-nhfb,
}

@Article{Eichelsbacher:1999:CPA,
  author =       "Peter Eichelsbacher and Ma{\l}gorzata Roos",
  title =        "Compound {Poisson} Approximation for Dissociated
                 Random Variables via {Stein}'s Method",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "8",
  number =       "4",
  pages =        "335--346",
  month =        jul,
  year =         "1999",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548399003880",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "60F05",
  MRnumber =     "MR1723647 (2000i:60019)",
  MRreviewer =   "Ai Hua Xia",
  bibdate =      "Mon Jul 7 15:38:07 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Random graphs and combinatorial structures
                 (Oberwolfach, 1997)",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=8&issueId=04",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Entacher:1999:CSR,
  author =       "Karl Entacher",
  title =        "On the {CRAY}-System Random Number Generator",
  journal =      j-SIMULATION,
  volume =       "72",
  number =       "3",
  pages =        "163--169",
  month =        mar,
  year =         "1999",
  CODEN =        "SIMUA2",
  DOI =          "https://doi.org/10.1177/003754979907200308",
  ISSN =         "0037-5497 (print), 1741-3133 (electronic)",
  ISSN-L =       "0037-5497",
  bibdate =      "Wed Jan 11 10:43:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://sim.sagepub.com/content/72/3/163.abstract",
  abstract =     "We present a theoretical and empirical analysis of the
                 quality of the CRAY-system random number generator RANF
                 in parallel settings. Subsequences of this generator
                 are used to obtain parallel streams of random numbers
                 for each processor. We use the spectral test to analyze
                 the quality of lagged subsequences of RANF with step
                 sizes $ 2^l, l \geq 1 $, appropriate for CRAY systems.
                 Our results demonstrate that with increasing $l$, the
                 quality of lagged subsequences is strongly reduced in
                 comparison to the original sequence. The results are
                 supported by a numerical Monte Carlo integration study.
                 We also use the spectral test to exhibit the well known
                 long-range correlations between consecutive blocks of
                 random numbers obtained from RANF.",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation",
  journal-URL =  "http://sim.sagepub.com/content/by/year",
}

@Article{Entacher:1999:PRN,
  author =       "Karl Entacher and Andreas Uhl and Stefan Wegenkittl",
  title =        "Parallel Random Number Generation: Long-Range
                 Correlations Among Multiple Processors",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1557",
  pages =        "107--116",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:53:38 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1557.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1557/15570107.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1557/15570107.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "image processing; multimedia; parallel computation;
                 parallel computing; parallel numerics; ParNum",
}

@Article{Entacher:1999:PSL,
  author =       "Karl Entacher",
  title =        "Parallel streams of linear random numbers in the
                 spectral test",
  journal =      j-TOMACS,
  volume =       "9",
  number =       "1",
  pages =        "31--44",
  month =        jan,
  year =         "1999",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@InCollection{Entacher:1999:QMC,
  author =       "Karl Entacher and Peter Hellekalek and Pierre
                 L'Ecuyer",
  title =        "Quasi-{Monte Carlo} node sets from linear congruential
                 generators",
  crossref =     "Niederreiter:1999:MCQ",
  pages =        "188--198",
  year =         "1999",
  MRclass =      "65C05 (11K45 65D30)",
  MRnumber =     "1849851 (2002e:65007)",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Falk:1999:SAG,
  author =       "Michael Falk",
  title =        "A simple approach to the generation of uniformly
                 distributed random variables with prescribed
                 correlations",
  journal =      j-COMMUN-STAT-SIMUL-COMPUT,
  volume =       "28",
  number =       "3",
  pages =        "785--791",
  year =         "1999",
  CODEN =        "CSSCDB",
  DOI =          "https://doi.org/10.1080/03610919908813578",
  ISSN =         "0361-0918",
  ISSN-L =       "0361-0918",
  bibdate =      "Sat Jan 30 06:32:48 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstatsimulcomput1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Simulation and
                 Computation",
  journal-URL =  "http://www.tandfonline.com/loi/lssp20",
}

@Article{Fernandez:1999:AER,
  author =       "Julio F. Fern{\'a}ndez",
  title =        "Algorithm for exponential random numbers",
  journal =      j-COMP-PHYS-COMM,
  volume =       "121--122",
  pages =        "78--82",
  month =        sep # "\slash " # oct,
  year =         "1999",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(99)00285-4",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Tue Feb 14 08:45:17 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465599002854",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  remark =       "The paper proves the correctness of the author's
                 algorithm for direct generation of exponential random
                 numbers proposed earlier \cite{Fernandez:1996:FAR}. The
                 method needs two internal buffers of length $N$, where
                 $N$ depends on the number of values to be generated,
                 and is about $ N \approx 10^3 $ for $ 10^{15} $ values.
                 The generator also needs a warm-up of about 10 complete
                 sweeps through the internal buffers to randomize them.
                 See also \cite{Wallace:1996:FPG}.",
}

@Article{Fernandez:1999:ANRa,
  author =       "Julio F. Fern{\'a}ndez and Carlos Criado",
  title =        "Algorithm for normal random numbers",
  journal =      "arxiv.org",
  pages =        "5",
  day =          "20",
  month =        jan,
  year =         "1999",
  bibdate =      "Thu Feb 16 18:28:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/cond-mat/9901202v1",
  abstract =     "We propose a simple algorithm for generating normally
                 distributed pseudo random numbers. The algorithm
                 simulates $N$ molecules that exchange energy among
                 themselves following a simple stochastic rule. We prove
                 that the system is ergodic, and that a Maxwell-like
                 distribution that may be used as a source of normally
                 distributed random deviates follows when $N$ tends to
                 infinity. The algorithm passes various performance
                 tests, including Monte Carlo simulation of a finite 2D
                 Ising model using Wolff's algorithm. It only requires
                 four simple lines of computer code, and is
                 approximately ten times faster than the Box--Muller
                 algorithm.",
  acknowledgement = ack-nhfb,
}

@Article{Fernandez:1999:ANRb,
  author =       "Julio F. Fern{\'a}ndez and Carlos Criado",
  title =        "Algorithm for normal random numbers",
  journal =      j-PHYS-REV-E,
  volume =       "60",
  number =       "3",
  pages =        "3361--3365",
  month =        sep,
  year =         "1999",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.60.3361",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Feb 16 18:30:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See comment \cite{Probert:2001:CAN} and reply
                 \cite{Fernandez:2001:RCA}.",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.60.3361",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
}

@TechReport{Gartner:1999:PCP,
  author =       "Bernd G{\"a}rtner",
  title =        "Pitfalls in Computing with Pseudorandom Determinants",
  type =         "Report",
  institution =  "Institut f{\"u}r Theoretische Informatik, ETH
                 Z{\"u}rich",
  address =      "ETH Zentrum, CH8092 Z{\"u}rich, Switzerland",
  year =         "1999",
  bibdate =      "Wed Jan 18 07:15:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.inf.ethz.ch/personal/gaertner/texts/own_work/random_matrices.pdf",
  acknowledgement = ack-nhfb,
  remark =       "This paper demonstrates a failure of the Unix/Posix
                 {\tt drand48()} 48-bit linear congruential generator.",
}

@Article{Gartner:1999:RCZ,
  author =       "Bernd G{\"a}rtner",
  title =        "{Ein Reinfall mit Computer-Zufallszahlen}. ({German})
                 [{A} failure with computer random numbers]",
  journal =      j-MDMV,
  volume =       "2",
  number =       "??",
  pages =        "55--60",
  month =        "????",
  year =         "1999",
  CODEN =        "????",
  ISSN =         "0947-4471",
  bibdate =      "Tue Jan 17 22:30:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.inf.ethz.ch/personal/gaertner/texts/own_work/dmv.ps.gz",
  acknowledgement = ack-nhfb,
  fjournal =     "Mitteilungen der Deutschen Mathematiker-Vereinigung",
  journal-URL =  "http://www.degruyter.com/view/j/dmvm",
  language =     "German",
  remark =       "This paper demonstrates a failure of the Unix/Posix
                 {\tt drand48()} 48-bit linear congruential generator.",
}

@Article{Goldreich:1999:IDB,
  author =       "O. Goldreich and A. Wigderson",
  title =        "Improved Derandomization of {BPP} Using a Hitting Set
                 Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1671",
  pages =        "131--??",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Sep 13 16:57:02 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Book{Goldreich:1999:MCP,
  author =       "Oded Goldreich",
  title =        "Modern cryptography, probabilistic proofs, and
                 pseudorandomness",
  volume =       "17",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 182",
  year =         "1999",
  ISBN =         "3-540-64766-X",
  ISBN-13 =      "978-3-540-64766-9",
  ISSN =         "0937-5511",
  LCCN =         "QA76.9.A25 G64 1999",
  bibdate =      "Mon Oct 16 09:48:58 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Algorithms and combinatorics",
  acknowledgement = ack-nhfb,
  keywords =     "computer security; cryptography",
}

@Article{Goldreich:1999:P,
  author =       "Oded Goldreich",
  title =        "Pseudorandomness",
  journal =      j-NAMS,
  volume =       "46",
  number =       "10",
  pages =        "1209--1216",
  month =        nov,
  year =         "1999",
  CODEN =        "AMNOAN",
  ISSN =         "0002-9920 (print), 1088-9477 (electronic)",
  ISSN-L =       "0002-9920",
  MRclass =      "65C10 (11K45 68W20)",
  MRnumber =     "1715507",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Thu Aug 15 07:17:02 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/nams1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "1194.65022",
  acknowledgement = ack-nhfb,
  ajournal =     "Notices Amer. Math. Soc.",
  fjournal =     "Notices of the American Mathematical Society",
  journal-URL =  "http://www.ams.org/notices/",
  keywords =     "65C10, 68W20, 11K45",
  ZBmath =       "5783673",
}

@Article{Gonzalez:1999:RNG,
  author =       "Jorge A. Gonz{\'a}lez and Ramiro Pino",
  title =        "A random number generator based on unpredictable
                 chaotic functions",
  journal =      j-COMP-PHYS-COMM,
  volume =       "120",
  number =       "2--3",
  pages =        "109--114",
  month =        aug,
  year =         "1999",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(99)00233-7",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:28 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465599002337",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Griffin:1999:DNR,
  author =       "Frances Griffin and Harald Niederreiter and Igor
                 Shparlinski",
  title =        "On the Distribution of Nonlinear Recursive
                 Congruential Pseudorandom Numbers of Higher Orders",
  crossref =     "Fossorier:1999:AAA",
  pages =        "87--93",
  year =         "1999",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/aaecc/aaecc1999.html#GriffinNS99;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Haastad:1999:PGO,
  author =       "Johan H{\aa}stad and Russell Impagliazzo and Leonid A.
                 Levin and Michael Luby",
  title =        "A Pseudorandom Generator from any One-way Function",
  journal =      j-SIAM-J-COMPUT,
  volume =       "28",
  number =       "4",
  pages =        "1364--1396",
  month =        aug,
  year =         "1999",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/S0097539793244708",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Sat Jul 17 20:22:13 MDT 1999",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/28/4;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/24470",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  keywords =     "cryptography",
}

@TechReport{Intel:1999:IRN,
  author =       "{Intel Platform Security Division}",
  title =        "The {Intel} random number generator",
  type =         "Intel technical brief",
  institution =  "Intel Corporation",
  address =      "????",
  year =         "1999",
  bibdate =      "Thu Feb 23 08:09:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://download.intel.com/design/security/rng/techbrief.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
  remark =       "Document no longer available at FTP site (23 February
                 2012).",
}

@TechReport{Jun:1999:IRN,
  author =       "Benjamin Jun and Paul Kocher",
  title =        "The {Intel} Random Number Generator",
  type =         "White paper prepared for {Intel Corporation}",
  institution =  "Cryptography Research, Inc.",
  address =      "Menlo Park, CA, USA",
  day =          "22",
  month =        apr,
  year =         "1999",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "ftp://download.intel.com/design/security/rng/CRIwp.pdf;
                 http://www.cryptography.com/intelRNG.pdf",
  acknowledgement = ack-nhfb,
  added-at =     "Mon Apr 10 15:54:42 2000",
  added-by =     "sti",
  annote =       "Summary of evaluation of Intel's True random number
                 generator (TRNG). TRNG is based on Johnson (thermal)
                 noise source (resistor) driving a slow oscillator
                 triggering measurements of a fast (clocked) oscillator.
                 Postcorrection using von Neuman corrector. Also
                 considers shortly related software mixing functions
                 based on SHA-1.",
}

@Article{Kleinman:1999:SBO,
  author =       "Nathan L. Kleinman and James C. Spall and Daniel Q.
                 Naiman",
  title =        "Simulation-Based Optimization with Stochastic
                 Approximation Using {Common Random Numbers}",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "45",
  number =       "??",
  pages =        "1570--1578",
  month =        "????",
  year =         "1999",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.45.11.1570",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Koldobsky:1999:PDD,
  author =       "Alexander Koldobsky",
  title =        "Positive Definite Distributions and Subspaces of {$
                 L_p $} With Applications to Stable Processes",
  journal =      j-CAN-MATH-BULL,
  volume =       "42",
  number =       "3",
  pages =        "344--353",
  month =        sep,
  year =         "1999",
  CODEN =        "CMBUA3",
  DOI =          "https://doi.org/10.4153/CMB-1999-040-5",
  ISSN =         "0008-4395 (print), 1496-4287 (electronic)",
  ISSN-L =       "0008-4395",
  MRclass =      "42A82, 46B04, 46F12, 60E07",
  bibdate =      "Thu Sep 8 10:22:25 MDT 2011",
  bibsource =    "http://cms.math.ca/cmb/v42/;
                 https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We define embedding of an $n$-dimensional normed space
                 into $ L_{-p} $, $ 0 < p < n $ by extending
                 analytically with respect to $p$ the corresponding
                 property of the classical $ L_p $-spaces. The
                 well-known connection between embeddings into $ L_p $
                 and positive definite functions is extended to the case
                 of negative $p$ by showing that a normed space embeds
                 in $ L_{-p} $ if and only if $ \| x \|^{-p} $ is a
                 positive definite distribution. We show that the
                 technique of embedding in $ L_{-p} $ can be applied to
                 stable processes in some situations where standard
                 methods do not work. As an example, we prove
                 inequalities of correlation type for the expectations
                 of norms of stable vectors. In particular, for every $
                 p \in [n - 3, n) $, $ \mathbb {E}(\max_{i = 1, \dots,
                 n} |X_i|^{-p}) \ge \mathbb {E}(\max_{i = 1, \dots, n}
                 |Y_i|^{-p}) $, where $ X_1, \dots, X_n $ and $ Y_1,
                 \dots, Y_n $ are jointly $q$-stable symmetric random
                 variables, $ 0 < q \le 2 $, so that, for some $ k \in
                 \mathbb {N} $, $ 1 \le k < n $, the vectors $ (X_1,
                 \dots, X_k) $ and $ (X_{k + 1}, \dots, X_n) $ have the
                 same distributions as $ (Y_1, \dots, Y_k) $ and $ (Y_{k
                 + 1}, \dots, Y_n) $, respectively, but $ Y_i $ and $
                 Y_j $ are independent for every choice of $ 1 \le i \le
                 k $, $ k + 1 \le j \le n $.",
  acknowledgement = ack-nhfb,
  ams-subject-primary = "42A82, 46B04, 46F12, 60E07",
  fjournal =     "Canadian mathematical bulletin = Bulletin canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cmb/",
  journalabbrev = "CMB",
  refnum =       "7367",
}

@Article{Koshiba:1999:UPN,
  author =       "Takeshi Koshiba",
  title =        "Unpredictability of pseudorandom number generators on
                 public key cryptosystems with random inputs",
  journal =      "S{\=u}rikaisekikenky{\=u}sho K\=oky{\=u}roku",
  volume =       "1093",
  pages =        "162--167",
  year =         "1999",
  CODEN =        "????",
  ISSN =         "????",
  MRclass =      "65C10 (94A60)",
  MRnumber =     "1 744 455",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Models of computation and algorithms (Japanese)
                 (Kyoto, 1999)",
  acknowledgement = ack-nhfb,
  fjournal =     "S{\=u}rikaisekikenky{\=u}sho K\=oky{\=u}roku",
}

@Article{Larcher:1999:ADS,
  author =       "Gerhard Larcher and Reinhard Wolf and J{\"u}rgen
                 Eichenauer-Herrmann",
  title =        "On the average discrepancy of successive tuples of
                 pseudo-random numbers over parts of the period",
  journal =      j-MONAT-MATH,
  volume =       "127",
  number =       "2",
  pages =        "141--154",
  month =        feb,
  year =         "1999",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050050029",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Jan 9 17:33:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0932.11049",
  acknowledgement = ack-nhfb,
  classmath =    "11K45 (Pseudo-random numbers; Monte Carlo methods)
                 65C10 (Random number generation (numerical analysis))",
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
  keywords =     "discrepancy; period; permutation polynomial;
                 pseudo-random numbers",
  reviewer =     "Yaochen Zhu (Beijing)",
}

@Article{LEcuyer:1999:BLC,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "Beware of Linear Congruential Generators with
                 Multipliers of the Form $ a = \pm 2^q \pm 2^r $",
  journal =      j-TOMS,
  volume =       "25",
  number =       "3",
  pages =        "367--374",
  month =        sep,
  year =         "1999",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/326147.326156",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Sep 19 09:42:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toms/1999-25-3/p367-l_ecuyer/;
                 http://www.acm.org/pubs/citations/journals/toms/1999-25-3/p367-l_ecuyer/p367-l_ecuyer.pdf",
  abstract =     "Linear congruential random-number generators with
                 Mersenne prime modulus and multipliers of the form $ a
                 = \pm 2^q \pm 2^r $ have been proposed recently. Their
                 main advantage is the availability of a simple and fast
                 implementation algorithm for such multipliers. This
                 note generalizes this algorithm, points out statistical
                 weaknesses of these multipliers when used in a
                 straightforward manner, and suggests in what context
                 they could be used safely.",
  accepted =     "24 Aug 1999",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "correlation test; linear congruential generators;
                 random number generation",
  subject =      "Mathematics of Computing --- Mathematical Software
                 (G.4): {\bf Algorithm design and analysis}; Computing
                 Methodologies --- Simulation and Modeling (I.6);
                 Mathematics of Computing --- Probability and Statistics
                 (G.3): {\bf Random number generation}; General Terms:
                 Algorithms, Experimentation, Measurement, Performance",
}

@Article{LEcuyer:1999:GPI,
  author =       "Pierre L'Ecuyer",
  title =        "Good Parameters and Implementations for Combined
                 Multiple Recursive Random Number Generators",
  journal =      j-OPER-RES,
  volume =       "47",
  number =       "1",
  pages =        "159--164",
  month =        jan # "\slash " # feb,
  year =         "1999",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.47.1.159",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Wed Nov 12 10:22:27 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://pubsonline.informs.org/doi/abs/10.1287/opre.47.1.159;
                 http://www.jstor.org/stable/222902",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@InProceedings{LEcuyer:1999:SRU,
  author =       "P. L'Ecuyer",
  editor =       "Helena Szczerbicka",
  booktitle =    "Modelling and simulation: a tool for the next
                 millennium: 13th European Simulation Multiconference
                 1999, {ESM'99}: June 1--4, 1999, Warsaw, Poland",
  title =        "Some Recommendable Uniform Random Number Generators",
  volume =       "1",
  publisher =    pub-SOC-COMPUT-SIM,
  address =      pub-SOC-COMPUT-SIM:adr,
  bookpages =    "xvi + 546",
  pages =        "185--190",
  year =         "1999",
  ISBN =         "1-56555-171-0 (vol. 1), 1-56555-172-9 (vol. 2)",
  ISBN-13 =      "978-1-56555-171-8 (vol. 1), 978-1-56555-172-5 (vol.
                 2)",
  LCCN =         "????",
  bibdate =      "Fri Mar 9 10:54:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxaddress =    "Ghent, Belgium",
  xxeditor =     "Erik Mosekilde and Bernd Schmidt and Miroslav Snorek",
}

@Article{LEcuyer:1999:TLC,
  author =       "Pierre L'Ecuyer",
  title =        "Tables of linear congruential generators of different
                 sizes and good lattice structure",
  journal =      j-MATH-COMPUT,
  volume =       "68",
  number =       "225",
  pages =        "249--260",
  year =         "1999",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-99-00996-5",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1489972 (99c:11101)",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2585108.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{LEcuyer:1999:TME,
  author =       "Pierre L'Ecuyer",
  title =        "Tables of maximally equidistributed combined {LFSR}
                 generators",
  journal =      j-MATH-COMPUT,
  volume =       "68",
  number =       "225",
  pages =        "261--269",
  month =        jan,
  year =         "1999",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-99-01039-X",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10",
  MRnumber =     "1620231",
  bibdate =      "Fri Jul 16 10:39:00 MDT 1999",
  bibsource =    "http://www.ams.org/mcom/1999-68-225;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-99-01039-X&u=/mcom/1999-68-225/",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Misc{Marsaglia:1999:RNC,
  author =       "George Marsaglia",
  title =        "Random numbers for {C}: The {END}?",
  howpublished = "Message-ID {\tt 36A5FC62.17C9CC33@stat.fsu.edu}.
                 Posting to the {\tt sci.crypt.random-numbers}, {\tt
                 sci.math}, and {\tt sci.stat.math} news groups.",
  day =          "20",
  month =        jan,
  year =         "1999",
  bibdate =      "Thu Dec 20 20:22:58 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://groups.google.com/group/sci.crypt/browse_thread/thread/ca8682a4658a124d/",
  acknowledgement = ack-nhfb,
  keywords =     "KISS generator",
}

@InCollection{Mascagni:1999:SMP,
  author =       "M. Mascagni",
  title =        "Some methods of parallel pseudorandom number
                 generation",
  crossref =     "Heath:1999:APP",
  pages =        "277--288",
  year =         "1999",
  bibdate =      "Tue Feb 07 10:43:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "Contains discussion of parameterization of LCGs for
                 use in parallel computations.",
}

@Article{Matus:1999:CIA,
  author =       "F. Mat{\'u}{\v{s}}",
  title =        "Conditional independences among four random variables.
                 {III}. {Final} conclusion",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "8",
  number =       "3",
  pages =        "269--276",
  month =        may,
  year =         "1999",
  CODEN =        "CPCOFG",
  DOI =          "????",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  MRclass =      "68T30 (05B35 60A99)",
  MRnumber =     "MR1702569 (2000i:68176)",
  MRreviewer =   "Ram Shanmugam",
  bibdate =      "Mon Jul 7 15:38:07 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=8&issueId=03",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{McCullough:1999:ARS,
  author =       "B. D. McCullough",
  title =        "Assessing the Reliability of Statistical Software:
                 {Part II}",
  journal =      j-AMER-STAT,
  volume =       "53",
  number =       "2",
  pages =        "149--??",
  year =         "1999",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Oct 22 14:33:54 1999",
  bibsource =    "http://www.amstat.org/publications/tas/toc_99.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.amstat.org/publications/tas/mccull.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{McCullough:1999:ASP,
  author =       "B. D. McCullough and B. Wilson",
  title =        "On the accuracy of statistical procedures in
                 {Microsoft Excel 97}",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "31",
  number =       "1",
  pages =        "27--37",
  day =          "28",
  month =        jul,
  year =         "1999",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/S0167-9473(99)00004-3",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:11:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947399000043",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{McCullough:1999:NRE,
  author =       "B. D. McCullough and H. D. Vinod",
  title =        "The Numerical Reliability of Econometric Software",
  journal =      j-J-ECON-LIT,
  volume =       "37",
  number =       "2",
  pages =        "633--665",
  month =        jun,
  year =         "1999",
  CODEN =        "JECLB3",
  DOI =          "https://doi.org/10.1257/jel.37.2.633",
  ISSN =         "0022-0515 (print), 1547-1101 (electronic)",
  ISSN-L =       "0022-0515",
  bibdate =      "Thu Oct 17 05:56:48 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2565215;
                 https://www.aeaweb.org/articles?id=10.1257/jel.37.2.633",
  abstract =     "Numerous examples show that some econometric software
                 packages contain serious flaws, and that users cannot
                 safely assume that their software is accurate. A brief
                 survey of the fundamentals of computer arithmetic
                 discusses the sources of numerical error and emphasizes
                 that computer arithmetic is not at all like
                 pencil-and-paper arithmetic. Both users and developers
                 of econometrics software should first pay attention to
                 accuracy, and only later consider user-friendliness.
                 Details are provided for assessing the accuracy of
                 basic estimation routines, statistical distributions,
                 and random number generators. More accuracy benchmarks
                 are needed, especially for specialized econometric
                 procedures.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Economic Literature",
  journal-URL =  "https://www.aeaweb.org/journals/jel/issues",
  remark =       "This paper discusses the effect of both floating-point
                 arithmetic and random-number generators on econometric
                 computations.",
}

@Article{MRaihi:1999:CAR,
  author =       "D. M'Raihi and D. Naccache and D. Pointcheval and S.
                 Vaudenay",
  title =        "Computational Alternatives to Random Number
                 Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1556",
  pages =        "72--??",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Sep 13 16:57:02 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Muller:1999:CRV,
  author =       "Norbert Th. M{\"u}ller",
  title =        "Computability on random variables",
  journal =      j-THEOR-COMP-SCI,
  volume =       "219",
  number =       "1--2",
  pages =        "287--299",
  day =          "28",
  month =        may,
  year =         "1999",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:22:39 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1999&volume=219&issue=1-2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/tcs/sub/1999/219/1-2/3100.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Naor:1999:STA,
  author =       "Moni Naor and Omer Reingold",
  title =        "Synthesizers and Their Application to the Parallel
                 Construction of Pseudo-Random Functions",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "58",
  number =       "2",
  pages =        "336--375",
  month =        apr,
  year =         "1999",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1006/jcss.1998.1618",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Tue Jan 29 15:26:38 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S002200009891618X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Niederreiter:1999:DLS,
  author =       "Harald Niederreiter and Igor E. Shparlinski",
  title =        "On the Distribution and Lattice Structure of Nonlinear
                 Congruential Pseudorandom Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "5",
  number =       "3",
  pages =        "246--253",
  month =        jul,
  year =         "1999",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.1999.0257",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579799902575",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Peterson:1999:FRU,
  author =       "Ivars Peterson",
  title =        "{Fibonacci} at Random: Uncovering a new mathematical
                 constant",
  journal =      j-SCIENCE-NEWS,
  volume =       "155",
  number =       "24",
  pages =        "376--377",
  day =          "12",
  month =        jun,
  year =         "1999",
  CODEN =        "SCNEBK",
  ISSN =         "0036-8423 (print), 1943-0930 (electronic)",
  ISSN-L =       "0036-8423",
  bibdate =      "Sat Mar 03 15:31:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/4011459",
  acknowledgement = ack-nhfb,
  fjournal =     "Science News (Washington, DC)",
  journal-URL =  "http://www.jstor.org/journals/00368423.html;
                 http://www.sciencenews.org/view/archives;
                 http://www3.interscience.wiley.com/journal/122396840/home",
  remark =       "See \cite{Viswanath:2000:RFS} for the new constant
                 discussed in this article.",
}

@Article{Peyravian:1999:GUB,
  author =       "Mohammad Peyravian and Stephen M. Matyas and Allen
                 Roginsky and Nev Zunic",
  title =        "Generating user-based cryptographic keys and random
                 numbers",
  journal =      j-COMPUT-SECUR,
  volume =       "18",
  number =       "7",
  pages =        "619--626",
  month =        "????",
  year =         "1999",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Mon Sep 23 09:45:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.sciencedirect.com/science/article/pii/S0167404899820409",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Book{Robert:1999:MCS,
  author =       "Christian P. Robert and George Casella",
  title =        "{Monte Carlo} statistical methods",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 507",
  year =         "1999",
  ISBN =         "0-387-98707-X",
  ISBN-13 =      "978-0-387-98707-1",
  LCCN =         "QA276 .R575 1999",
  bibdate =      "Wed Jun 22 08:52:43 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer texts in statistics",
  acknowledgement = ack-nhfb,
  remark =       "Section 2.1.2 gives a description of the
                 Marsaglia\slash Zaman KISS generator.",
  subject =      "Mathematical statistics; Monte Carlo method",
}

@Article{Rouzankin:1999:CAR,
  author =       "P. S. Rouzankin and A. V. Voytishek",
  title =        "On the cost of algorithms for random selection",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "5",
  number =       "1",
  pages =        "39--54",
  month =        "????",
  year =         "1999",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1999.5.1.39",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10 (65Y20)",
  MRnumber =     "1684992 (2000a:65011)",
  MRreviewer =   "P. Neumann",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1999.5.issue-1/issue-files/mcma.1999.5.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1999.5.issue-1/mcma.1999.5.1.39/mcma.1999.5.1.39.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
  remark =       "See \cite{Fan:1962:DSP} for the original algorithm for
                 sampling $n$ of $N$ values, with time cost $ O(N) $.
                 Rouzankin and Voytishek discuss that algorithm, and
                 introduce several others, one with storage cost $ O(N)
                 $ and time $ O(n) $, a second with storage cost $ O(n)
                 $ and time cost $ O(n^2) $, and more complex algorithms
                 with time cost $ O(n \log n) $ and $ O(n) $. See also
                 \cite{Bentley:1980:GSL} for a short algorithm with
                 worst case time $ O(n) $ with storage $ O(1) $ (with
                 immediate output) or $ O(n) $ with array output, and
                 the selected values are sorted.",
}

@Article{Sackrowitz:1999:VRV,
  author =       "Harold Sackrowitz and Ester Samuel-Cahn",
  title =        "{$P$} Values as Random Variables---Expected {$P$}
                 Values",
  journal =      j-AMER-STAT,
  volume =       "53",
  number =       "4",
  pages =        "326--331",
  month =        nov,
  year =         "1999",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Oct 19 10:18:22 MDT 2000",
  bibsource =    "http://www.amstat.org/publications/tas/toc_99.html;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2686051",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@TechReport{Schindler:1999:AFC,
  author =       "W. Schindler",
  title =        "{AIS 20}: Functionality Classes and Evaluation
                 Methodology for Deterministic Random Number
                 Generators",
  type =         "Report",
  institution =  "Bundesamt fur Sicherheit in der Informationstechnik
                 (BSI)",
  address =      "????",
  month =        dec,
  year =         "1999",
  bibdate =      "Tue Jan 31 15:02:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Version 2.0",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schmid:1999:EQP,
  author =       "W. Ch. Schmid",
  title =        "The exact quality parameter of nets derived from
                 {Sobol'} and {Niederreiter} sequences",
  crossref =     "Iliev:1999:RAN",
  pages =        "287--295",
  year =         "1999",
  bibdate =      "Fri Mar 09 10:57:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shchur:1999:QRN,
  author =       "Lev N. Shchur",
  title =        "On the quality of random number generators with taps",
  journal =      j-COMP-PHYS-COMM,
  volume =       "121--122",
  pages =        "83--85",
  month =        sep # "\slash " # oct,
  year =         "1999",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(99)00286-6",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Tue Feb 14 08:45:17 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465599002866",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@MastersThesis{Siu:1999:PNG,
  author =       "Chi Sang Obadiah Siu",
  title =        "Pseudorandom number generator by cellular automata and
                 its application to cryptography",
  type =         "{M.Phil.}",
  school =       "Chinese University of Hong Kong",
  address =      "Hong Kong",
  pages =        "68",
  year =         "1999",
  bibdate =      "Thu Jan 19 17:25:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sobol:1999:DRR,
  author =       "I. M. Sobol and B. V. Shukhman and A. Guinzbourg",
  title =        "On the distribution of random ranges",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "5",
  number =       "2",
  pages =        "113--134",
  month =        "????",
  year =         "1999",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.1999.5.2.113",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "11K45 (60D05)",
  MRnumber =     "1696967 (2000e:11100)",
  MRreviewer =   "Peter J. Grabner",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.1999.5.issue-2/issue-files/mcma.1999.5.issue-2.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.1999.5.issue-2/mcma.1999.5.2.113/mcma.1999.5.2.113.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Sobol:1999:PRN,
  author =       "I. M. Sobol' and Yu. L. Levitan",
  title =        "A Pseudo-Random Number Generator for Personal
                 Computers",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "37",
  number =       "4--5",
  pages =        "33--40",
  month =        feb # "\slash " # mar,
  year =         "1999",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(99)00057-7",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 08 08:49:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Translation of the Russian original, \booktitle{O
                 datchike psevdosluchainykh chisel dlya personalnykh
                 kompyuterov}, Matematicheskoe Modelirovanie, {\bf 2}
                 (8) (1990), pp. 119--126, with the authors reversed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  remark =       "The authors propose a generator formed by adding the
                 scaled fractional parts of three short-period MCGs with
                 $ (A, M) = (171, 30369) $, $ (172, 30307) $, and $
                 (170, 30323) $. The period is the product of the
                 moduli, or about $ 6.9 \times 10^{12} $.",
}

@Misc{Soto:1999:EST,
  author =       "Juan Soto",
  title =        "Empirical Statistical Testing of {RNGs}",
  howpublished = "World-Wide Web slide presentation.",
  month =        jan,
  year =         "1999",
  bibdate =      "Mon Dec 08 07:53:34 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Presented at the 1999 RSA Data Security Conference,
                 San Jose, CA",
  URL =          "http://csrc.nist.gov/rng/Copy-of-rsa.ppt",
  acknowledgement = ack-nhfb,
}

@TechReport{Soto:1999:RTA,
  author =       "Juan Soto and Lawrence Bassham",
  title =        "Randomness Testing of the {Advanced Encryption
                 Standard} Candidate Algorithms",
  type =         "NIST internal report",
  number =       "6390",
  institution =  pub-NIST,
  address =      pub-NIST:adr,
  pages =        "14",
  year =         "1999",
  bibdate =      "Mon Dec 08 07:47:32 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         sep,
  URL =          "http://csrc.nist.gov/rng/AES-REPORT2.doc",
  acknowledgement = ack-nhfb,
}

@InProceedings{Soto:1999:STRa,
  author =       "Juan Soto",
  title =        "Statistical Testing of Random Number Generators",
  crossref =     "Anonymous:1999:NIS",
  pages =        "12--??",
  year =         "1999",
  bibdate =      "Mon Dec 08 07:42:41 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/groups/ST/toolkit/rng/documents/nissc-paper.pdf;
                 http://csrc.nist.gov/rng/AES-REPORT2.doc",
  acknowledgement = ack-nhfb,
}

@Misc{Soto:1999:STRb,
  author =       "Juan Soto",
  title =        "Statistical Testing of {RNGs}",
  howpublished = "World-Wide Web slide presentation.",
  month =        apr,
  year =         "1999",
  bibdate =      "Mon Dec 08 07:53:34 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Presented at the ANSI X9F1 Meeting, Institute for
                 Defense Analyses, Alexandria, VA",
  URL =          "http://csrc.nist.gov/rng/ANSIX9F1.ppt",
  acknowledgement = ack-nhfb,
}

@Misc{Soto:1999:STRc,
  author =       "Juan Soto",
  title =        "Statistical Testing of Random Number Generators",
  howpublished = "World-Wide Web slide presentation.",
  month =        oct,
  year =         "1999",
  bibdate =      "Mon Dec 08 07:53:34 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Presented at The 22nd National Information Systems
                 Security Conference, Crystal City, VA.",
  URL =          "http://csrc.nist.gov/rng/nissc3.ppt",
  acknowledgement = ack-nhfb,
}

@Article{Stauffer:1999:IMT,
  author =       "Dietrich Stauffer",
  title =        "{Ising} model as test for simple random number
                 generators",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "10",
  number =       "5",
  pages =        "807--808",
  month =        jul,
  year =         "1999",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183199000619",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Thu Feb 23 22:19:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.worldscinet.com/ijmpc/10/1005/S0129183199000619.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@InProceedings{Sudan:1999:PGX,
  author =       "Madhu Sudan and Luca Trevisan and Salil Vadhan",
  title =        "Pseudorandom generators without the {XOR Lemma}
                 (extended abstract)",
  crossref =     "ACM:1999:PTF",
  pages =        "537--546",
  year =         "1999",
  bibdate =      "Wed Feb 20 18:34:04 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/301250/p537-sudan/p537-sudan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/301250/p537-sudan/",
  acknowledgement = ack-nhfb,
}

@Article{Tomassini:1999:GHQ,
  author =       "Marco Tomassini and Moshe Sipper and Mos{\'e} Zolla
                 and Mathieu Perrenoud",
  title =        "Generating high-quality random numbers in parallel by
                 cellular automata",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "16",
  number =       "2--3",
  pages =        "291--305",
  month =        dec,
  year =         "1999",
  CODEN =        "FGSEVI",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 27 12:41:19 MST 2002",
  bibsource =    "http://www.elsevier.com/locate/issn/0167739X;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.com/gej-ng/10/19/19/41/25/35/abstract.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Tretiakov:1999:EMC,
  author =       "K. V. Tretiakov and K. W. Wojciechowski",
  title =        "Efficient {Monte Carlo} simulations using a shuffled
                 nested {Weyl} sequence random number generator",
  journal =      j-PHYS-REV-E,
  volume =       "60",
  number =       "6",
  pages =        "7626--7628",
  month =        dec,
  year =         "1999",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.60.7626",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Mon Jan 16 15:31:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.60.7626",
  abstract =     "The pseudorandom number generator proposed recently by
                 Holian et al. \cite{Holian:1994:PNG} is tested via
                 Monte Carlo computation of the free energy difference
                 between the defectless hcp and fcc hard sphere crystals
                 by the Frenkel--Ladd method [D. Frenkel and A. J. C.
                 Ladd, J. Chem. Phys. {\bf 81}, 3188 (1984)]. It is
                 shown that this fast and convenient for parallel
                 computing generator gives results in good agreement
                 with results obtained by other generators. An estimate
                 of high accuracy is obtained for the hcp-fcc free
                 energy difference near melting.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
}

@InProceedings{Trevisan:1999:CEU,
  author =       "Luca Trevisan",
  title =        "Construction of extractors using pseudo-random
                 generators (extended abstract)",
  crossref =     "ACM:1999:PTF",
  pages =        "141--148",
  year =         "1999",
  bibdate =      "Wed Feb 20 18:34:04 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/301250/p141-trevisan/p141-trevisan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/301250/p141-trevisan/",
  acknowledgement = ack-nhfb,
}

@Article{Vattulainen:1999:FTR,
  author =       "I. Vattulainen",
  title =        "Framework for testing random numbers in parallel
                 calculations",
  journal =      j-PHYS-REV-E,
  volume =       "59",
  pages =        "7200--7204",
  month =        jun,
  year =         "1999",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.59.7200",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Feb 24 18:06:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.59.7200",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  issue =        "6",
  journal-URL =  "http://pre.aps.org/browse",
}

@Article{Watanabe:1999:SGR,
  author =       "Yuji Watanabe and Hideki Imai",
  title =        "Shared Generation of Random Number with Timestamp: How
                 to Cope with the Leakage of the {CA}'s Secret",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1560",
  pages =        "290--305",
  year =         "1999",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:53:42 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1560.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs1999a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1560/15600290.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1560/15600290.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "PKC; public key cryptography",
}

@Article{Wegenkittl:1999:GRC,
  author =       "Stefan Wegenkittl and Makoto Matsumoto",
  title =        "Getting rid of correlations among pseudorandom
                 numbers: discarding versus tempering",
  journal =      j-TOMACS,
  volume =       "9",
  number =       "3",
  pages =        "282--294",
  month =        jul,
  year =         "1999",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:38 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@TechReport{Wegenkittl:1999:GTP,
  author =       "Stefan Wegenkittl",
  title =        "Gambling Tests for Pseudorandom Number Generators",
  type =         "Report",
  institution =  "Institut f{\"u}r Mathematik, Universit{\"a}t
                 Salzburg",
  address =      "Salzburg, Austria",
  day =          "27",
  month =        aug,
  year =         "1999",
  bibdate =      "Sat Mar 03 08:46:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Jenkins:19xx:IFC,
  author =       "Bob {Jenkins, Jr.}",
  title =        "{ISAAC}: a fast cryptographic random number
                 generator",
  howpublished = "Web site",
  year =         "19xx",
  bibdate =      "Wed Feb 08 10:08:41 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "ISAAC (Indirection, Shift, Accumulate, Add, and Count)
                 is based on cryptographic principles, and generates
                 32-bit random numbers. ISAAC-64 is similar, but
                 requires 64-bit arithmetic, and generates 64-bit
                 results.",
  URL =          "http://burtleburtle.net/bob/rand/isaacafa.html",
  acknowledgement = ack-nhfb,
  lastaccess =   "08 February 2012",
  remark =       "Timing tests reported in \cite{Wichmann:2006:GGP} show
                 this generator to be the fastest of eight tested.",
}

@InProceedings{Alekhnovich:2000:PGP,
  author =       "M. Alekhnovich and E. Ben-Sasson and A. A. Razborov
                 and A. Wigderson",
  title =        "Pseudorandom generators in propositional proof
                 complexity",
  crossref =     "IEEE:2000:ASF",
  pages =        "43--53",
  year =         "2000",
  bibdate =      "Thu Apr 5 06:14:11 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Anonymous:2000:RNG,
  author =       "Anonymous",
  title =        "Random number generation and testing",
  howpublished = "Web site.",
  institution =  pub-NIST,
  address =      pub-NIST:adr,
  month =        dec,
  year =         "2000",
  bibdate =      "Sat Dec 24 11:02:07 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/rng/",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Balazs:2000:ONC,
  author =       "Nandor L. Balazs and John C. Browne and James D. Louck
                 and Daniel S. Strottman",
  title =        "Obituary: {Nicholas Constantine Metropolis}",
  journal =      j-PHYS-TODAY,
  volume =       "53",
  number =       "10",
  pages =        "100--100",
  month =        oct,
  year =         "2000",
  CODEN =        "PHTOAD",
  ISSN =         "0031-9228 (print), 1945-0699 (electronic)",
  ISSN-L =       "0031-9228",
  bibdate =      "Tue Mar 20 21:19:12 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.aip.org/pt/vol-53/iss-10/p100.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Physics Today",
  journal-URL =  "http://www.physicstoday.org/",
}

@Article{Beichl:2000:MA,
  author =       "Isabel Beichl and Francis Sullivan",
  title =        "The {Metropolis} Algorithm",
  journal =      j-COMPUT-SCI-ENG,
  volume =       "2",
  number =       "1",
  pages =        "65--69",
  month =        jan # "\slash " # feb,
  year =         "2000",
  CODEN =        "CSENFA",
  ISSN =         "1521-9615 (print), 1558-366X (electronic)",
  ISSN-L =       "1521-9615",
  bibdate =      "Fri Oct 13 14:31:09 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dlib.computer.org/cs/books/cs2000/pdf/c1065.pdf;
                 http://www.computer.org/cse/cs1999/c1065abs.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing in Science and Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
}

@Article{Borkowf:2000:BRB,
  author =       "Craig B. Borkowf",
  title =        "Book Review: {{\booktitle{Random Number Generation and
                 Monte Carlo Methods}} by James E. Gentle}",
  journal =      j-TECHNOMETRICS,
  volume =       "42",
  number =       "4",
  pages =        "431--432",
  month =        nov,
  year =         "2000",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.1080/00401706.2000.10485723;
                 https://doi.org/10.2307/1270960",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 15:53:47 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i254383;
                 http://www.tandf.co.uk/journals/titles/00401706.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics2000.bib",
  URL =          "http://www.jstor.org/stable/1270960",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html;
                 http://www.tandfonline.com/loi/utch20",
}

@InProceedings{Brent:2000:TYA,
  author =       "Richard P. Brent",
  title =        "Twenty years' analysis of the binary {Euclidean}
                 algorithm",
  crossref =     "Davies:2000:MPC",
  pages =        "41--52",
  year =         "2000",
  bibdate =      "Thu Dec 29 06:21:23 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.ox.ac.uk/people/richard.brent/pd/rpb183pr.pdf",
  acknowledgement = ack-nhfb,
  lastaccess =   "13 January 2012",
  remark =       "The ftp URL no longer works: it may have been replaced
                 by http://oucs.ox.ac.uk, but I cannot find the document
                 there. The PDF file in the second URL is
                 downloadable.",
  xxURL =        "ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Richard.Brent/rpb183.dvi.gz;
                 http://www.cs.ox.ac.uk/people/richard.brent/pd/rpb183pr.pdf",
}

@Article{Chen:2000:RRI,
  author =       "Zhi-Zhong Chen and Ming-Yang Kao",
  title =        "Reducing Randomness via Irrational Numbers",
  journal =      j-SIAM-J-COMPUT,
  volume =       "29",
  number =       "4",
  pages =        "1247--1256",
  month =        aug,
  year =         "2000",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/S0097539798341600",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Fri Oct 27 06:28:31 MDT 2000",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/29/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/34160",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Couture:2000:LCR,
  author =       "Raymond Couture and Pierre L'Ecuyer",
  title =        "Lattice computations for random numbers",
  journal =      j-MATH-COMPUT,
  volume =       "69",
  number =       "230",
  pages =        "757--765",
  month =        apr,
  year =         "2000",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-99-01112-6",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1651748 (2000i:11125)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Wed Nov 1 11:50:03 MST 2000",
  bibsource =    "http://www.ams.org/mcom/2000-69-230;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-99-01112-6;
                 http://www.ams.org/mcom/2000-69-230/S0025-5718-99-01112-6/S0025-5718-99-01112-6.dvi;
                 http://www.ams.org/mcom/2000-69-230/S0025-5718-99-01112-6/S0025-5718-99-01112-6.pdf;
                 http://www.ams.org/mcom/2000-69-230/S0025-5718-99-01112-6/S0025-5718-99-01112-6.ps;
                 http://www.ams.org/mcom/2000-69-230/S0025-5718-99-01112-6/S0025-5718-99-01112-6.tex",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InProceedings{Danger:2000:EFI,
  author =       "J. L. Danger and A. Ghazel and E. Boutillon and H.
                 Laamari",
  booktitle =    "{7th IEEE International Conference on Electronics,
                 Circuits \& Systems, December 17--20, 2000, Jounieh,
                 Lebanon}",
  title =        "Efficient {FPGA} implementation of {Gaussian} noise
                 generator for communication channel emulation",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "xxiv + 1033 (two volumes)",
  pages =        "366--369",
  year =         "2000",
  DOI =          "https://doi.org/10.1109/ICECS.2000.911557",
  ISBN =         "0-7803-6542-9",
  ISBN-13 =      "978-0-7803-6542-1",
  LCCN =         "TK7801 .I226 2000",
  bibdate =      "Thu Nov 24 08:09:04 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 00EX445.",
  URL =          "http://ieeexplore.ieee.org/document/911557/",
  acknowledgement = ack-nhfb,
}

@Article{Deng:2000:RNG,
  author =       "Lih-Yuan Deng and Dennis K. J. Lin",
  title =        "Random Number Generation for the New Century",
  journal =      j-AMER-STAT,
  volume =       "54",
  number =       "2",
  pages =        "145--150",
  month =        may,
  year =         "2000",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jul 20 11:18:01 MDT 2001",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.amstat.org/publications/tas/Deng.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Devroye:2000:PSQ,
  author =       "Luc Devroye and James Fill and Ralph Neininger",
  title =        "Perfect Simulation from the {Quicksort} Limit
                 Distribution",
  journal =      j-ELECTRON-COMMUN-PROBAB,
  volume =       "5",
  pages =        "12:95--12:99",
  year =         "2000",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1214/ECP.v5-1024",
  ISSN =         "1083-589X",
  ISSN-L =       "1083-589X",
  bibdate =      "Mon Sep 1 19:06:47 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ecp.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ecp.ejpecp.org/article/view/1024",
  abstract =     "The weak limit of the normalized number of comparisons
                 needed by the Quicksort algorithm to sort $n$ randomly
                 permuted items is known to be determined implicitly by
                 a distributional fixed-point equation. We give an
                 algorithm for perfect random variate generation from
                 this distribution.",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Communications in Probability",
  journal-URL =  "http://ecp.ejpecp.org/",
  keywords =     "Quicksort, random variate generation, simulation,
                 perfect simulation,rejection method, Monte Carlo
                 method, fixed-point equation",
}

@Article{Dewen:2000:NMG,
  author =       "H. Dewen",
  title =        "A Novel Method for Generating Pseudorandom Integer
                 Strings and Pseudorandom Sequences",
  journal =      j-SCI-CHINA-SER-E-TECH-SCI,
  volume =       "43",
  number =       "4",
  pages =        "413--420",
  year =         "2000",
  CODEN =        "SCETFO",
  DOI =          "https://doi.org/10.1007/BF02916989",
  ISSN =         "1006-9321 (print), 1862-281X (electronic)",
  ISSN-L =       "1006-9321",
  MRclass =      "65C10 (94A55)",
  MRnumber =     "1787895 (2001i:65011)",
  bibdate =      "Fri Mar 9 10:59:29 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Science in China. Series E. Technological Sciences",
  keywords =     "full-recurrent-decimal-sequences (FRDS) method",
}

@Article{Dyadkin:2000:SBM,
  author =       "Iosif G. Dyadkin and Kenneth G. Hamilton",
  title =        "A study of 128-bit multipliers for congruential
                 pseudorandom number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "125",
  number =       "1--3",
  pages =        "239--258",
  month =        mar,
  year =         "2000",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(99)00467-1",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Nov 14 11:21:52 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://cpc.cs.qub.ac.uk/summaries/ADLK;
                 http://www.elsevier.com/gej-ng//10/15/40/55/25/42/abstract.html;
                 http://www.sciencedirect.com/science/article/pii/S0010465599004671",
  abstract =     "A study was conducted of multipliers for 128-bit
                 congruential pseudorandom number generators. Extensive
                 analysis and testing resulted in the identification of
                 over 2000 good multipliers of the form $ A = 5^k \bmod
                 2^{128} $, where $k$ is a prime number. The integer
                 lattice structure from any single multiplier is so fine
                 that it is not visible when {\tt REAL*8} values are
                 returned in up to four dimensions, or {\tt REAL*4}
                 values in seven dimensions. The multipliers are
                 designed to be used in sets, and are suitable for use
                 in massively-parallel computation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "ADLK; Congruential; General purpose; Monte Carlo;
                 Multipliers; Pseudorandom; Random number generators;
                 Random numbers; RNMULT128; Statistical methods",
  remark =       "This paper extends the authors' earlier work on 64-bit
                 generators \cite{Dyadkin:1997:FEL,Dyadkin:1997:SBM} to
                 128-bit arithmetic and more than 2000 generators, each
                 with a different multiplier. The paper has a clear
                 presentation of various statistical tests that are used
                 for assessing generator quality; some of those tests
                 are part of the Diehard Battery Test Suite, for which
                 test-algorithm documentation is sparse. The authors
                 found 2155 128-bit multipliers, but unfortunately, they
                 are not listed in the article: they are claimed to be
                 on a CD-ROM that accompanied the journal issue. It
                 appears that they are available in the CPC library at
                 the first URL in this entry, but access requires a
                 library subscription. The authors propose use of
                 generator families with cycling over multipliers to
                 disrupt the undesirable lattice structure of LCGs
                 (although, with the resolution of this generator,
                 lattice spacing is tiny (a desirable feature)).
                 Computation of the 128-bit LCG is done with David
                 Bailey's Fortran 90 arbitrary-precision floating-point
                 library.",
}

@Book{Evans:2000:AIM,
  author =       "Michael (Michael John) Evans and T. Swartz",
  title =        "Approximating integrals via {Monte Carlo} and
                 deterministic methods",
  volume =       "20",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "ix + 288",
  year =         "2000",
  ISBN =         "0-19-850278-8",
  ISBN-13 =      "978-0-19-850278-4",
  LCCN =         "QA311 .E92 2000",
  bibdate =      "Thu Dec 29 15:29:08 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Oxford statistical science series",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0604/99052843-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0604/99052843-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Calculus, Integral; Approximation theory; Monte Carlo
                 method",
}

@Article{Fukuyama:2000:PFA,
  author =       "Katusi Fukuyama and Tetsuo Tomokuni",
  title =        "On pseudorandom functions and asymptotic
                 distributions",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "6",
  number =       "3",
  pages =        "167--174",
  month =        "????",
  year =         "2000",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2000.6.3.167",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "60F99 (60G99 65C10)",
  MRnumber =     "1804133 (2001m:60079)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2000.6.issue-3/issue-files/mcma.2000.6.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2000.6.issue-3/mcma.2000.6.3.167/mcma.2000.6.3.167.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Gennaro:2000:IPR,
  author =       "Rosario Gennaro",
  title =        "An Improved Pseudo-random Generator Based on Discrete
                 Log",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1880",
  pages =        "469--??",
  year =         "2000",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Feb 1 09:16:56 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800469.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1880/18800469.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Gentleman:2000:LSS,
  author =       "Robert Gentleman and Ross Ihaka",
  title =        "Lexical Scope and Statistical Computing",
  journal =      j-J-COMPUT-GRAPH-STAT,
  volume =       "9",
  number =       "3",
  pages =        "491--508",
  month =        sep,
  year =         "2000",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/10618600.2000.10474895",
  ISSN =         "1061-8600 (print), 1537-2715 (electronic)",
  ISSN-L =       "1061-8600",
  bibdate =      "Thu Aug 13 10:27:50 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputgraphstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
  URL =          "http://www.amstat.org/publications/jcgs/abstracts00/Ihaka.htm;
                 http://www.tandfonline.com/doi/abs/10.1080/10618600.2000.10474895",
  abstract =     "Programming environments such as S and Lisp-Stat have
                 languages for performing computations, data storage
                 mechanisms, and a graphical interface. These languages
                 provide an interactive interface to data analysis that
                 is invaluable. To take full advantage of these
                 programming environments, statisticians must understand
                 the differences between them. Ihaka and Gentleman
                 introduced R, a version of S which uses a different
                 scoping regimen. In some ways this makes R behave more
                 like Lisp-Stat. This article discusses the concept of
                 scoping rules and shows how lexical scope can enhance
                 the functionality of a language.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Graphical Statistics",
  journal-URL =  "http://www.amstat.org/publications/jcgs/;
                 http://www.tandfonline.com/loi/ucgs20",
  keywords =     "function closure; random number generators",
  onlinedate =   "21 Feb 2012",
}

@Article{Goldreich:2000:ITP,
  author =       "Oded Goldreich",
  title =        "Invited Talk: Pseudorandomness",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1853",
  pages =        "687--??",
  year =         "2000",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:08:44 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1853.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1853/18530687.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1853/18530687.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Gutierrez:2000:MDI,
  author =       "Jaime Gutierrez and Harald Niederreiter and Igor E.
                 Shparlinski",
  title =        "On the multidimensional distribution of inversive
                 congruential pseudorandom numbers in parts of the
                 period",
  journal =      j-MONAT-MATH,
  volume =       "129",
  number =       "1",
  pages =        "31--36",
  month =        jan,
  year =         "2000",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050050004",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K45 (11K38 11L05)",
  MRnumber =     "1741034 (2001e:11088)",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Hickernell:2000:ELS,
  author =       "Fred J. Hickernell and Hee Sun Hong and Pierre
                 L'{\'E}cuyer and Christiane Lemieux",
  title =        "Extensible lattice sequences for quasi-{Monte Carlo}
                 quadrature",
  journal =      j-SIAM-J-SCI-COMP,
  volume =       "22",
  number =       "3",
  pages =        "1117--1138 (electronic)",
  year =         "2000",
  CODEN =        "SJOCE3",
  DOI =          "https://doi.org/10.1137/S1064827599356638",
  ISSN =         "1064-8275 (print), 1095-7197 (electronic)",
  ISSN-L =       "1064-8275",
  MRclass =      "65D32 (65C05)",
  MRnumber =     "1785348 (2001h:65032)",
  MRreviewer =   "Petru P. Blaga",
  bibdate =      "Thu Feb 23 17:57:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific Computing",
  journal-URL =  "http://epubs.siam.org/sisc",
}

@Article{Hormann:2000:AAG,
  author =       "Wolfgang H{\"o}rmann",
  title =        "{Algorithm 802}: an automatic generator for bivariate
                 log-concave distributions",
  journal =      j-TOMS,
  volume =       "26",
  number =       "1",
  pages =        "201--219",
  month =        mar,
  year =         "2000",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/347837.347908",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Sep 19 09:42:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/347837.347908;
                 http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p201-hormann/;
                 http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p201-hormann/p201-hormann.pdf",
  abstract =     "Different automatic (also called universal or
                 black-box) methods have been suggested to sample from
                 univariate log-concave distributions. Our new automatic
                 algorithm for bivariate log-concave distributions is
                 based on the method of transformed density rejection.
                 In order to construct a hat function for a rejection
                 algorithm the bivariate density is transformed by the
                 logarithm into a concave function. Then it is possible
                 to construct a dominating function by taking the
                 minimum of several tangent planes, which are by
                 exponentiation transformed back into the original
                 scale. The choice of the points of contact is automated
                 using adaptive rejection sampling. This means that
                 points that are rejected by the rejection algorithm can
                 be used as additional points of contact. The article
                 describes the details how this main idea can be used to
                 construct Algorithm ALC2D that can generate random
                 pairs from all bivariate log-concave distributions with
                 known domain, computable density, and computable
                 partial derivatives.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "automatic generator; bivariate log-concave
                 distributions; rejection method; universal generator",
  subject =      "Software --- Programming Languages --- Language
                 Classifications (D.3.2); Mathematics of Computing ---
                 Probability and Statistics (G.3): {\bf Random number
                 generation}",
}

@InProceedings{Hormann:2000:ARV,
  author =       "Wolfgang H{\"o}rmann and Josef Leydold",
  title =        "Automatic random variate generation for simulation
                 input",
  crossref =     "Joines:2000:WSC",
  pages =        "675--683",
  year =         "2000",
  bibdate =      "Thu Dec 29 15:38:59 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{IEEE:2000:IPH,
  author =       "{IEEE}",
  title =        "The {IEEE P1363} Home Page: Standard Specifications
                 For Public-Key Cryptography",
  howpublished = "World-Wide Web site.",
  year =         "2000",
  bibdate =      "Mon Dec 08 08:02:36 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://grouper.ieee.org/groups/1363/index.html",
  acknowledgement = ack-nhfb,
}

@InProceedings{Impagliazzo:2000:EPR,
  author =       "Russell Impagliazzo and Ronen Shaltiel and Avi
                 Wigderson",
  title =        "Extractors and pseudo-random generators with optimal
                 seed length",
  crossref =     "ACM:2000:PTS",
  pages =        "1--10",
  year =         "2000",
  bibdate =      "Wed Feb 20 18:35:45 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/series/stoc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/stoc/335305/p1-impagliazzo/p1-impagliazzo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/stoc/335305/p1-impagliazzo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Indyk:2000:SDP,
  author =       "P. Indyk",
  title =        "Stable distributions, pseudorandom generators,
                 embeddings and data stream computation",
  crossref =     "IEEE:2000:ASF",
  pages =        "189--197",
  year =         "2000",
  bibdate =      "Thu Apr 5 06:14:11 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Iwata:2000:PAF,
  author =       "Tetsu Iwata and Kaoru Kurosawa",
  title =        "On the Pseudorandomness of {AES} Finalists --- {RC6},
                 {Serpent}, {MARS} and {Twofish} (abstract only)",
  crossref =     "NIST:2000:TAE",
  pages =        "9--9",
  year =         "2000",
  bibdate =      "Wed Feb 07 19:03:41 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The aim of this paper is to compare the security of
                 AES finalists in an idealized model like Luby and
                 Rackoff. We mainly prove that a five round idealized
                 RC6 and a three round idealized Serpent are
                 super-pseudorandom permutations. We then show a
                 comparison about this kind of pseudorandomness for four
                 AES finalists, RC6, Serpent, MARS and Twofish.",
  acknowledgement = ack-nhfb,
}

@Article{Jennewein:2000:FCQ,
  author =       "Thomas Jennewein and Ulrich Achleitner and Gregor
                 Weihs and Harald Weinfurter and Anton Zeilinger",
  title =        "A fast and compact quantum random number generator",
  journal =      j-REV-SCI-INSTRUM,
  volume =       "71",
  number =       "4",
  pages =        "1675--1680",
  year =         "2000",
  CODEN =        "RSINAK",
  DOI =          "https://doi.org/10.1063/1.1150518",
  ISSN =         "1089-7623, 0034-6748",
  ISSN-L =       "0034-6748",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?RSI/71/1675/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Review of scientific instruments",
  journal-URL =  "http://rsi.aip.org/",
  keywords =     "binary sequences; optical beam splitters; optical
                 polarisers; quantum cryptography; quantum optics;
                 random number generation; true random numbers from
                 physical sources",
}

@InProceedings{Johansson:2000:FCA,
  author =       "Thomas Johansson and Fredrik J{\"o}nsson",
  editor =       "Mihir Bellare",
  booktitle =    "Advances in Cryptology --- {CRYPTO 2000}: {20th Annual
                 International Cryptology Conference, Santa Barbara,
                 California, USA, August 20-24, 2000. Proceedings}",
  title =        "Fast Correlation Attacks Through Reconstruction of
                 Linear Polynomials",
  volume =       "1880",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "300--315",
  year =         "2000",
  DOI =          "https://doi.org/10.1007/3-540-44598-6_19",
  bibdate =      "Sat Apr 05 12:26:48 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/content/pdf/10.1007/3-540-44598-6_19",
  acknowledgement = ack-nhfb,
}

@Article{Juels:2000:HTL,
  author =       "A. Juels and M. Jakobsson and E. Shriver and B. K.
                 Hillyer",
  title =        "How to turn loaded dice into fair coins",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "46",
  number =       "3",
  pages =        "911--921",
  month =        "????",
  year =         "2000",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/18.841170",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Sat Dec 24 11:59:09 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
  remark =       "This paper discusses how to turn a possibly-biased
                 source of true random numbers into an unbiased uniform
                 distribution.",
}

@TechReport{Kabal:2000:GGP,
  author =       "Peter Kabal",
  title =        "Generating {Gaussian} Pseudo-Random Deviates",
  type =         "Report",
  institution =  "Department of Electrical and Computer Engineering,
                 McGill University",
  address =      "Montr{\'e}al, QC, Canada",
  year =         "2000",
  bibdate =      "Thu Nov 24 08:31:13 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www-mmsp.ece.mcgill.ca/documents/reports/2000/kabalr2000c.pdf",
  abstract =     "This report examines low-complexity methods to
                 generate pseudo-random Gaussian (normal) deviates. We
                 introduce a new method based on modelling the Gaussian
                 probability density function using piecewise linear
                 segments. This approach is shown to be both efficient
                 \ldots{}",
  acknowledgement = ack-nhfb,
  keywords =     "Gaussian probability density function; Gaussian
                 pseudo-random deviate; low-complexity method; new
                 method; piecewise linear segment; pseudo-random
                 Gaussian",
}

@InProceedings{Kelsey:2000:YND,
  author =       "John Kelsey and Bruce Schneier and Niels Ferguson",
  title =        "{Yarrow-160}: Notes on the design and analysis of the
                 {Yarrow} cryptographic pseudorandom number generator",
  crossref =     "Heys:2000:SAC",
  pages =        "13--33",
  year =         "2000",
  bibdate =      "Mon Aug 30 17:37:07 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.counterpane.com/yarrow-notes.html;
                 http://www.schneier.com/paper-yarrow.html",
  abstract =     "We describe the design of Yarrow, a family of
                 cryptographic pseudo-random number generators (PRNG).
                 We describe the concept of a PRNG as a separate
                 cryptographic primitive, and the design principles used
                 to develop Yarrow. We then discuss the ways that PRNGs
                 can fail in practice, which motivates our discussion of
                 the components of Yarrow and how they make Yarrow
                 secure. Next, we define a specific instance of a PRNG
                 in the Yarrow family that makes use of available
                 technology today.",
  acknowledgement = ack-nhfb,
  pagecount =    "14",
  xxtitle =      "Notes on the Design and Analysis of the {Yarrow}
                 Cryptographic Pseudorandom Number Generator",
}

@Book{Knuth:2000:SPA,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Analysis of Algorithms",
  volume =       "102",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 621",
  year =         "2000",
  ISBN =         "1-57586-212-3 (paperback), 1-57586-211-5 (hardcover)",
  ISBN-13 =      "978-1-57586-212-5 (paperback), 978-1-57586-211-8
                 (cloth)",
  LCCN =         "QA9.58 .K65 2000",
  MRclass =      "68Q25 (01A75 68W40)",
  MRnumber =     "1762319 (2001c:68066)",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Mathematical Analysis of Algorithms / 1 \\
                 2: The Dangers of Computer Science Theory / 19 \\
                 3: The Analysis of Algorithms / 27 \\
                 4: Big Omicron and Big Omega and Big Theta / 35 \\
                 5: Optimal Measurement Points for Program Frequency
                 Counts / 43 \\
                 6: Estimating the Efficiency of Backtrack Programs / 55
                 \\
                 7: Ordered Hash Tables / 77 \\
                 8: Activity in an Interleaved Memory / 101 \\
                 9: An Analysis of Alpha-Beta Pruning / 105 \\
                 10: Notes on Generalized Dedekind Sums / 149 \\
                 11: The Distribution of Continued Fraction
                 Approximations / 181 \\
                 12: Evaluation of Porter's Constant / 189 \\
                 13: The Subtractive Algorithm for Greatest Common
                 Divisors / 195 \\
                 14: Length of Strings for a Merge Sort / 205 \\
                 15: The Average Height of Planted Plane Trees / 215 \\
                 16: The Toilet Paper Problem / 225 \\
                 17: An Analysis of Optimum Caching / 235 \\
                 18: A Trivial Algorithm Whose Analysis Isn't / 257 \\
                 19: Deletions That Preserve Randomness / 283 \\
                 20: Analysis of a Simple Factorization Algorithm / 303
                 \\
                 21: The Expected Linearity of a Simple Equivalence
                 Algorithm / 341 \\
                 22: Textbook Examples of Recursion / 391 \\
                 23: An Exact Analysis of Stable Allocation / 415 \\
                 24: Stable Husbands / 429 \\
                 25 Shellsort With Three Increments / 447 \\
                 26: The Average Time for Carry Propagation / 467 \\
                 27: Linear Probing and Graphs / 473 \\
                 28: A Terminological Proposal / 485 \\
                 29: Postscript About NP-Hard Problems / 493 \\
                 30: An Experiment in Optimal Sorting / 495 \\
                 31: Duality in Addition Chains / 501 \\
                 32: Complexity Results for Bandwidth Minimization / 505
                 \\
                 33: The Problem of Compatible Representatives / 535 \\
                 34: The Complexity of Nonuniform Random Number
                 Generation / 545 \\
                 Index / 605",
}

@Book{Law:2000:SMA,
  author =       "Averill M. Law and W. David Kelton",
  title =        "Simulation modeling and analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Third",
  pages =        "xxi + 760",
  year =         "2000",
  ISBN =         "0-07-059292-6",
  ISBN-13 =      "978-0-07-059292-6",
  LCCN =         "QA76.9.C65 L38 2000",
  bibdate =      "Mon Jan 2 15:04:52 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in industrial engineering and
                 management science",
  URL =          "http://www.loc.gov/catdir/bios/mh041/99052146.html;
                 http://www.loc.gov/catdir/description/mh023/99052146.html;
                 http://www.loc.gov/catdir/toc/mh023/99052146.html",
  acknowledgement = ack-nhfb,
  remark =       "See \cite{Law:1982:SMA,Law:1991:SMA,Law:2006:SMA} for
                 other editions.",
  subject =      "Digital computer simulation",
  tableofcontents = "1 Basic Simulation Modeling \\
                 2 Modeling Complex Systems \\
                 3 Simulation Software \\
                 4 Review of Basic Probability and Statistics \\
                 5 Building Valid, Credible, and Appropriately Detailed
                 Simulation Models \\
                 6 Selecting Input Probability Distributions \\
                 7 Random-Number Generators \\
                 8 Generating Random Variates \\
                 9 Output Data Analysis for a Single System \\
                 10 Comparing Alternative System Configurations \\
                 11 Variance-Reduction Techniques \\
                 12 Experimental Design, Sensitivity Analysis, and
                 Optimization \\
                 13 Simulation of Manufacturing Systems",
}

@Article{LEcuyer:2000:CPS,
  author =       "Pierre L'{\'E}cuyer and Jean-Fran{\c{c}}ois Cordeau
                 and Richard Simard",
  title =        "Close-Point Spatial Tests and Their Application to
                 Random Number Generators",
  journal =      j-OPER-RES,
  volume =       "48",
  number =       "2",
  pages =        "308--317",
  month =        mar # "\slash " # apr,
  year =         "2000",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.48.2.308.12385",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  MRclass =      "65C10",
  MRnumber =     "1761436 (2001c:65009)",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Tue Dec 20 08:50:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/223147",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@InProceedings{LEcuyer:2000:FCM,
  author =       "Pierre L'Ecuyer and R. Touzin",
  title =        "Fast Combined Multiple Recursive Generators with
                 Multipliers of the Form $ a = \pm 2^q \pm 2^r $",
  crossref =     "Joines:2000:WSC",
  pages =        "683--689",
  year =         "2000",
  bibdate =      "Fri Mar 09 11:04:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:2000:NCL,
  author =       "P. L'Ecuyer and F. Panneton",
  title =        "A New Class of Linear Feedback Shift Register
                 Generators",
  crossref =     "Joines:2000:WSC",
  pages =        "690--696",
  year =         "2000",
  bibdate =      "Fri Mar 09 11:04:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:2000:VRL,
  author =       "Pierre L'Ecuyer and Christiane Lemieux",
  title =        "Variance reduction via lattice rules",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "46",
  number =       "9",
  pages =        "1214--1235",
  month =        "????",
  year =         "2000",
  CODEN =        "MSCIAM",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Fri Dec 30 14:58:38 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
}

@InCollection{Lemieux:2000:CMC,
  author =       "Christiane Lemieux and Pierre L'Ecuyer",
  booktitle =    "{Monte Carlo and quasi-Monte Carlo methods 1998
                 (Claremont, CA)}",
  title =        "A comparison of {Monte Carlo}, lattice rules and other
                 low-discrepancy point sets",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "326--340",
  year =         "2000",
  MRclass =      "65C05 (91B28)",
  MRnumber =     "1849861 (2002e:65011)",
  bibdate =      "Wed Feb 22 14:01:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lepley:2000:HST,
  author =       "J. J. Lepley and J. G. Ellison and A. S. Siddiqui",
  title =        "High-speed true random bit sequence generator",
  journal =      j-ELECT-LETTERS,
  volume =       "36",
  number =       "17",
  pages =        "1480--1481",
  day =          "17",
  month =        aug,
  year =         "2000",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:20001069",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:32 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=865050",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Leydold:2000:ASR,
  author =       "Josef Leydold",
  title =        "Automatic sampling with the ratio-of-uniforms method",
  journal =      j-TOMS,
  volume =       "26",
  number =       "1",
  pages =        "78--98",
  month =        mar,
  year =         "2000",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/347837.347863",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Sep 19 09:42:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/347837.347863;
                 http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p78-leydold/;
                 http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p78-leydold/p78-leydold.pdf",
  abstract =     "Applying the ratio-of-uniforms method for generating
                 random variates results in very efficient, fast, and
                 easy-to-implement algorithms. However parameters for
                 every particular type of density must be precalculated
                 analytically. In this article we show, that the
                 ratio-of-uniforms method is also useful for the design
                 of a black-box algorithm suitable for a large class of
                 distributions, including all with log-concave
                 densities. Using polygonal envelopes and squeezes
                 results in an algorithm that is extremely fast. In
                 opposition to any other ratio-of-uniforms algorithm the
                 expected number of uniform random numbers is less than
                 two. Furthermore, we show that this method is in some
                 sense equivalent to transformed density rejection.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "adaptive method; log-concave; nonuniform;
                 random-number generation; ratio of uniforms; rejection
                 method; T-concave; universal method",
  subject =      "Mathematics of Computing --- Probability and
                 Statistics (G.3): {\bf Random number generation}",
}

@Article{Mansharamani:2000:RTG,
  author =       "Rajesh Mansharamani and Prasad Kallepalli and Harsha
                 Veerabhadraiah and Benny Mathew",
  title =        "{RVGEN}: a tool for generation of random variates",
  journal =      j-SOFTW-CONCEPTS-TOOLS,
  volume =       "19",
  number =       "4",
  pages =        "161--167",
  month =        oct,
  year =         "2000",
  CODEN =        "SCOTE5",
  DOI =          "https://doi.org/10.1007/s003789900002",
  ISSN =         "0945-8115 (print), 1432-2188 (electronic)",
  ISSN-L =       "0945-8115",
  bibdate =      "Sat Jul 23 06:08:38 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/structprogram.bib",
  URL =          "https://link.springer.com/article/10.1007/s003789900002",
  acknowledgement = ack-nhfb,
  fjournal =     "Software --- Concepts and Tools",
  journal-URL =  "https://link.springer.com/journal/378",
}

@Unpublished{Marsaglia:2000:ADS,
  author =       "J. C. Marsaglia and G. Marsaglia",
  title =        "The {Anderson--Darling--Savage} goddess-of-fit test",
  year =         "2000",
  bibdate =      "Tue Apr 17 07:50:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Unpublished. See
                 \cite{Anderson:1952:ATC,Savage:1957:ITR}.",
  acknowledgement = ack-nhfb,
  remark =       "Was this ever published? It is cited at
                 http://www.cs.hku.hk/cisc/projects/va/ and
                 www.csis.hku.hk/cisc/download/idetect/, but is not
                 found in the Elsevier or Springer databases on 17 April
                 2012, nor by three major Web engines.",
}

@TechReport{Marsaglia:2000:MRN,
  author =       "George Marsaglia",
  title =        "The Monster, a Random Number Generator with Period
                 over $ 10^{2857} $ Times as Long as the Previously
                 Touted Longest-period One",
  type =         "Technical report",
  number =       "????",
  institution =  "Florida State University",
  address =      "Tallahassee, FL, USA",
  month =        "????",
  year =         "2000",
  bibdate =      "Mon Aug 02 10:39:48 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:2000:SMG,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "A Simple Method for Generating Gamma Variables",
  journal =      j-TOMS,
  volume =       "26",
  number =       "3",
  pages =        "363--372",
  month =        sep,
  year =         "2000",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/358407.358414",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "65C10 (65C60)",
  MRnumber =     "2001k:65015",
  bibdate =      "Wed Feb 6 16:43:42 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/toms.bib",
  abstract =     "We offer a procedure for generating a gamma variate as
                 the cube of a suitably scaled normal variate. It is
                 fast and simple, assuming one has a fast way to
                 generate normal variables. In brief: generate a normal
                 variate $x$ and a uniform variate $U$ until $ \ln (U) <
                 0.5 x^2 + d - d v + d \ln (v) $, then return $ d v $.
                 Here, the gamma parameter is $ \alpha \geq 1 $, and $ v
                 = (1 + x / \sqrt {9d})^3 $ with $ d = \alpha - 1 / 3 $.
                 The efficiency is high, exceeding 0.951, 0.981, 0.992,
                 0.996 at $ \alpha = 1, 2, 4, 8 $. The procedure can be
                 made to run faster by means of a simple squeeze that
                 avoids the two logarithms most of the time; return $ d
                 v $ if $ U < 1 - 0.0331 x^4 $. We give a short C
                 program for any $ \alpha \geq 1 $, and show how to
                 boost an $ \alpha < 1 $ into an $ \alpha > 1 $. The
                 gamma procedure is particularly fast for C
                 implementation if the normal variate is generated
                 in-line, via the {\tt \#define} feature. We include
                 such an inline version, based on our ziggurat method.
                 With it, and an inline uniform generator, gamma
                 variates can be produced in 400MHz CPUs at better than
                 1.3 million per second, with the parameter $ \alpha $
                 changing from call to call.",
  accepted =     "14 Jan 2000",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Marsaglia:2000:ZMG,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "The ziggurat method for generating random variables",
  journal =      j-J-STAT-SOFT,
  volume =       "5",
  number =       "8",
  pages =        "1--7",
  year =         "2000",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Sun Nov 17 22:35:43 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Leong:2005:CIZ,Rubin:2006:EGE}.",
  URL =          "http://www.jstatsoft.org/v05/i08;
                 http://www.jstatsoft.org/v05/i08/rnorrexp.c;
                 http://www.jstatsoft.org/v05/i08/updates;
                 http://www.jstatsoft.org/v05/i08/ziggurat.pdf",
  abstract =     "We provide a new version of our ziggurat method for
                 generating a random variable from a given decreasing
                 density. It is faster and simpler than the original,
                 and will produce, for example, normal or exponential
                 variates at the rate of 15 million per second with a C
                 version on a 400MHz PC. It uses two tables, integers $
                 k_i $ and reals $ w_i $. Some 99\% of the time, the
                 required $x$ is produced by: Generate a random 32-bit
                 integer $j$ and let $i$ be the index formed from the
                 rightmost 8 bits of $j$. If $ j < k_i $ return $ x = j
                 \times w_i $.\par

                 We illustrate with C code that provides for inline
                 generation of both normal and exponential variables,
                 with a short procedure for setting up the necessary
                 tables.",
  acknowledgement = ack-nhfb,
  annote =       "This algorithm is used in Matlab's randn() function
                 for generating normally-distributed pseudo-random
                 numbers; see \cite{Moler:2001:CCN}.",
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
}

@Article{Mascagni:2000:ASS,
  author =       "Michael Mascagni and Ashok Srinivasan",
  title =        "{Algorithm 806}: {SPRNG}: a scalable library for
                 pseudorandom number generation",
  journal =      j-TOMS,
  volume =       "26",
  number =       "3",
  pages =        "436--461",
  month =        sep,
  year =         "2000",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Wed Feb 6 16:43:42 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See correction \cite{Mascagni:2000:CAS}.",
  URL =          "http://doi.acm.org/10.1145/358407.358427",
  abstract =     "In this article we present background, rationale, and
                 a description of the Scalable Parallel Random Number
                 Generators (SPRNG) library. We begin by briefly
                 presenting some methods for parallel pseudorandom
                 number generation. We will focus on methods based on
                 parameterization, meaning that we will not consider
                 splitting methods. We describe parameterized versions
                 of the following pseudorandom number generators: (i)
                 linear congruential generators, (ii) shift-register
                 generators, and (iii) lagged-Fibonacci generators. We
                 briefly describe the methods, detail some advantages
                 and disadvantages of each method and recount results
                 from number theory that impact our understanding of
                 their quality in parallel applications. SPRNG was
                 designed around the uniform implementation of different
                 families of parameterized random number generators. We
                 then present a short description of SPRNG. The
                 description contained within this document is meant
                 only to outline the rationale behind and the
                 capabilities of SPRNG. Much more information, including
                 examples and detailed documentation aimed at helping
                 users with installing and using SPRNG on scalable
                 systems is available at the url
                 http://www.ncsa.uiuc.edu/Apps/SPRNG. In our description
                 of SPRNG we discuss the random number library as well
                 as the suite of tests of randomness that is an integral
                 part of SPRNG. Random number tools for parallel Monte
                 Carlo applications must be subjected to classical as
                 well as new types of empirical tests of randomness to
                 eliminate generators that show defects when used in
                 scalable environments.",
  accepted =     "26 may 2000",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@Article{Mascagni:2000:CAS,
  author =       "Michael Mascagni and Ashok Srinivasan",
  title =        "Corrigendum: {Algorithm 806}: {SPRNG}: a scalable
                 library for pseudorandom number generation",
  journal =      j-TOMS,
  volume =       "26",
  number =       "4",
  pages =        "618--619",
  month =        dec,
  year =         "2000",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Wed Feb 6 16:43:42 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Mascagni:2000:ASS}.",
  URL =          "http://doi.acm.org/10.1145/365723.365738",
  abstract =     "In this article we present background, rationale, and
                 a description of the Scalable Parallel Random Number
                 Generators (SPRNG) library. We begin by presenting some
                 methods for parallel pseudorandom number generation. We
                 will focus on methods based on parameterization,
                 meaning that we will not consider splitting methods
                 such as the leap-frog or blocking methods. We describe,
                 in detail, parameterized versions of the following
                 pseudorandom number generators: (i) linear congruential
                 generators, (ii) shift-register generators, and (iii)
                 lagged-Fibonacci generators. We briefly describe the
                 methods, detail some advantages and disadvantages of
                 each method, and recount results from number theory
                 that impact our understanding of their quality of
                 parallel applications. SPRNG was designed around the
                 uniform implementation of different families of
                 parameterized random number generators. We then present
                 a short description of SPRNG. The description contained
                 within this document is meant only to outline the
                 rationale behind and the capabilities of SPRNG. Much
                 more information, including examples and detailed
                 documentation aimed at helping users with putting and
                 using SPRNG on scalable systems is available at
                 http://sprng.cs.fsu.edu. In this description of SPRNG
                 we discuss the random-number generator library as well
                 as the suite of tests of randomness that is an integral
                 part of SPRNG. Random-number tools for parallel Monte
                 Carlo applications must be subjected to classical as
                 well as new types of empirical tests of randomness to
                 eliminate generators that show defects when used in
                 scalable environments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "Algorithms; Design; Documentation; Experimentation;
                 lagged-Fibonacci generator; linear congruential
                 generator; parallel random-number generators;
                 Performance; random-number software; random-number
                 tests; Reliability; Standardization",
  subject =      "Primary Classification: D. Software D.3 PROGRAMMING
                 LANGUAGES Additional Classification: D. Software D.3
                 PROGRAMMING LANGUAGES D.3.2 Language Classifications
                 Nouns: FORTRAN; C++ G. Mathematics of Computing G.4
                 MATHEMATICAL SOFTWARE Subjects: Efficiency;
                 Documentation; Parallel and vector implementations;
                 Algorithm design and analysis; Reliability and
                 robustness",
}

@Article{Mauduit:2000:FPBa,
  author =       "Christian Mauduit and Andr{\'a}s S{\'a}rk{\"o}zy",
  title =        "On Finite Pseudorandom Binary Sequences, {V}. {On} $
                 (n \alpha) $ and $ (n^2 \alpha) $ Sequences",
  journal =      j-MONAT-MATH,
  volume =       "129",
  number =       "3",
  pages =        "197--216",
  month =        mar,
  year =         "2000",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050050071",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 12:06:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See improved result in \cite{Philipp:2002:MTD}.",
  URL =          "http://www.springerlink.com/content/4r6x9bxdvhfgc4vk/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
  keywords =     "correlation; Diophantine approximation; pseudorandom;
                 uniform distribution",
}

@Article{Mauduit:2000:FPBb,
  author =       "Christian Mauduit and Andr{\'a}s S{\'a}rk{\"o}zy",
  title =        "On Finite Pseudorandom Binary Sequences, {VI}, (On $
                 (n^k \alpha) $ Sequences)",
  journal =      j-MONAT-MATH,
  volume =       "130",
  number =       "4",
  pages =        "281--298",
  month =        sep,
  year =         "2000",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050070028",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 12:06:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/1d1x140wbj6qygqf/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Miles:2000:L,
  author =       "Wyman Eric Miles",
  title =        "{LPRng}",
  journal =      j-SYS-ADMIN,
  volume =       "9",
  number =       "6",
  pages =        "8, 10, 12, 14, 16, 18, 22",
  month =        jun,
  year =         "2000",
  CODEN =        "SYADE7",
  ISSN =         "1061-2688",
  bibdate =      "Mon Sep 18 08:02:40 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.samag.com/",
  abstract =     "Miles explains how to configure and install the next
                 generation LPR.",
  acknowledgement = ack-nhfb,
  fjournal =     "Sys admin: the journal for UNIX system
                 administrators",
}

@Article{Moriai:2000:PTL,
  author =       "Shiho Moriai and Serge Vaudenay",
  title =        "On the Pseudorandomness of Top-Level Schemes of Block
                 Ciphers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1976",
  pages =        "289--??",
  year =         "2000",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Feb 1 09:17:24 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760289.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1976/19760289.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Niederreiter:2000:DPN,
  author =       "H. Niederreiter and I. E. Shparlinski",
  title =        "On the distribution of pseudorandom numbers and
                 vectors generated by inversive methods",
  journal =      j-APPL-ALGEBRA-ENG-COMMUN-COMPUT,
  volume =       "10",
  number =       "??",
  pages =        "189--202",
  month =        "????",
  year =         "2000",
  CODEN =        "AAECEW",
  ISSN =         "0938-1279 (print), 1432-0622 (electronic)",
  ISSN-L =       "0938-1279",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applicable algebra in engineering, communication and
                 computing",
}

@Article{Niederreiter:2000:ESD,
  author =       "Harald Niederreiter and Igor E. Shparlinski",
  title =        "Exponential sums and the distribution of inversive
                 congruential pseudorandom numbers with prime-power
                 modulus",
  journal =      j-ACTA-ARITHMETICA,
  volume =       "92",
  number =       "1",
  pages =        "89--98",
  year =         "2000",
  CODEN =        "AARIA9",
  ISSN =         "0065-1036 (print), 1730-6264 (electronic)",
  ISSN-L =       "0065-1036",
  MRclass =      "11K45 (11L07 65C10)",
  MRnumber =     "1739735 (2001g:11127)",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Arithmetica",
  journal-URL =  "https://www.impan.pl/en/publishing-house/journals-and-series/acta-arithmetica/all",
}

@Article{Niederreiter:2000:IES,
  author =       "H. Niederreiter and A. Winterhof",
  title =        "Incomplete exponential sums over finite fields and
                 their applications to new inversive pseudorandom number
                 generators",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "93",
  number =       "??",
  pages =        "387--399",
  month =        "????",
  year =         "2000",
  CODEN =        "FFTAFM",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Jan 6 11:17:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Nishimura:2000:TBM,
  author =       "Takuji Nishimura",
  title =        "Tables of 64-bit {Mersenne} twisters",
  journal =      j-TOMACS,
  volume =       "10",
  number =       "4",
  pages =        "348--357",
  month =        oct,
  year =         "2000",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:40 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Misc{NIST:2000:RNG,
  author =       "NIST",
  title =        "Random Number Generation and Testing",
  howpublished = "World-Wide Web site.",
  year =         "2000",
  bibdate =      "Mon Dec 08 08:48:44 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/rng/",
  acknowledgement = ack-nhfb,
}

@MastersThesis{Panneton:2000:GNA,
  author =       "Fran{\c{c}}ois Panneton",
  title =        "{G}{\'e}n{\'e}rateurs de nombres al{\'e}atoires
                 utilisant des r{\'e}currences lin{\'e}aires modulo $2$.
                 ({French}) [Random-number generators using linear
                 recurrences modulo $2$ ]",
  type =         "Th{\`e}se ({M.Sc.})",
  school =       "D{\'e}partement d'informatique et de recherche
                 op{\'e}rationnelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, QC, Canada",
  pages =        "xiii + 179",
  year =         "2000",
  LCCN =         "QA 76 U54 2001 v.007",
  bibdate =      "Fri Mar 09 11:07:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "M{\'e}moire pr{\'e}sent{\'e} {\`a} la facult{\'e} des
                 {\'e}tudes sup{\'e}rieures en vue de l'obtention du
                 grade de Ma{\^\i}tre {\`e}s sciences (M.Sc.) en
                 informatique option recherche op{\'e}rationnelle.",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Petrie:2000:NBI,
  author =       "C. Petrie and J. Connelly",
  title =        "A noise-based {IC} random number generator for
                 applications in cryptography",
  journal =      j-IEEE-J-SOLID-STATE-CIRCUITS,
  volume =       "47",
  number =       "5",
  pages =        "615--621",
  month =        "????",
  year =         "2000",
  CODEN =        "IJSCBC",
  DOI =          "https://doi.org/10.1109/81.847868",
  ISSN =         "0018-9200 (print), 1558-173X (electronic)",
  ISSN-L =       "0018-9200",
  bibdate =      "Thu Feb 23 08:24:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Journal of Solid-State Circuits",
}

@Article{Proykova:2000:HIR,
  author =       "Ana Proykova",
  title =        "How to improve a random number generator",
  journal =      j-COMP-PHYS-COMM,
  volume =       "124",
  number =       "2--3",
  pages =        "125--131",
  month =        feb,
  year =         "2000",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(99)00434-8",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 23:40:33 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465599004348",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Misc{RSA:2000:PKC,
  author =       "{RSA}",
  title =        "Public-Key Cryptography Standards",
  howpublished = "World-Wide Web site.",
  year =         "2000",
  bibdate =      "Mon Dec 08 08:03:51 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.rsasecurity.com/rsalabs/pkcs/",
  acknowledgement = ack-nhfb,
}

@Article{Saitoh:2000:DPR,
  author =       "Naoko Saitoh and Hiroaki Yoshida",
  title =        "$q$-deformed {Poisson} random variables on $q$-{Fock}
                 space",
  journal =      j-J-MATH-PHYS,
  volume =       "41",
  number =       "8",
  pages =        "5767--5772",
  month =        aug,
  year =         "2000",
  CODEN =        "JMAPAQ",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Fri Oct 20 08:10:40 MDT 2000",
  bibsource =    "http://www.aip.org/ojs/jmp.html;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
}

@Article{Sasaki:2000:SCB,
  author =       "T. Sasaki and H. Togo and J. Tanida and Y. Ichioka",
  title =        "Stream cipher based on pseudorandom number generation
                 with optical affine transformation",
  journal =      j-APPL-OPTICS,
  volume =       "39",
  number =       "14",
  pages =        "2340--2346",
  day =          "10",
  month =        may,
  year =         "2000",
  CODEN =        "APOPAI",
  DOI =          "https://doi.org/10.1364/AO.39.002340",
  ISSN =         "0003-6935",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Optics",
  journal-URL =  "http://www.osapublishing.org/ao/browse.cfm",
}

@TechReport{Saucier:2000:CGS,
  author =       "Richard Saucier",
  title =        "Computer Generation of Statistical Distributions",
  type =         "Report",
  number =       "ARL-TR-2168",
  institution =  "U.S. Army Research Laboratory",
  address =      "Aberdeen Proving Ground, MD, USA",
  pages =        "x + 105",
  month =        mar,
  year =         "2000",
  bibdate =      "Mon Jun 27 21:50:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ftp.arl.mil/random/random.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Savas:2000:MMI,
  author =       "E. Savas and {\c{C}}. K. Ko{\c{c}}",
  title =        "The {Montgomery} Modular Inverse---Revisited",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "49",
  number =       "7",
  pages =        "763--766",
  month =        jul,
  year =         "2000",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.863048",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 5 10:35:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Proceedings database",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=863048",
  abstract =     "We modify an algorithm given by Kaliski to compute the
                 Montgomery inverse of an integer modulo a prime number.
                 We also give a new definition of the Montgomery
                 inverse, and introduce efficient algorithms for
                 computing the classical modular inverse, the
                 Kaliski-Montgomery inverse, and the new Montgomery
                 inverse. The proposed algorithms are suitable for
                 software implementations on general-purpose
                 microprocessors",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "ARITH-14",
  remark =       "Selected papers from ARITH'14 \cite{Koren:1999:ISC}.",
}

@Article{Schwab:2000:MSC,
  author =       "Matthias Schwab and Martin Karrenbach and Jon
                 Claerbout",
  title =        "Making Scientific Computations Reproducible",
  journal =      j-COMPUT-SCI-ENG,
  volume =       "2",
  number =       "6",
  pages =        "61--67",
  month =        nov # "\slash " # dec,
  year =         "2000",
  CODEN =        "CSENFA",
  DOI =          "https://doi.org/10.1109/5992.881708",
  ISSN =         "1521-9615 (print), 1558-366X (electronic)",
  ISSN-L =       "1521-9615",
  bibdate =      "Wed Jul 18 06:52:29 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computscieng.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dlib.computer.org/cs/books/cs2000/pdf/c6061.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing in Science and Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
}

@TechReport{Soto:2000:RTA,
  author =       "Juan Soto and Lawrence Bassham",
  title =        "Randomness Testing of the {Advanced Encryption
                 Standard} Finalist Candidates",
  type =         "NIST internal report",
  number =       "6483",
  institution =  pub-NIST,
  address =      pub-NIST:adr,
  month =        apr,
  year =         "2000",
  bibdate =      "Mon Dec 08 07:51:45 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/rng/aes-report-final.doc",
  acknowledgement = ack-nhfb,
}

@Article{Stefanescu:2000:GUR,
  author =       "Stefan V. Stefanescu",
  title =        "Generating uniform random points inside a cone",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "6",
  number =       "2",
  pages =        "115--130",
  month =        "????",
  year =         "2000",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2000.6.2.115",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "1773373 (2001e:65014)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2000.6.issue-2/issue-files/mcma.2000.6.issue-2.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2000.6.issue-2/mcma.2000.6.2.115/mcma.2000.6.2.115.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Stefanov:2000:OQR,
  author =       "A. Stefanov and N. Gisin and O. Guinnard and L.
                 Guinnard and H. Zbinden",
  title =        "Optical quantum random number generator",
  journal =      j-J-MOD-OPT,
  volume =       "47",
  number =       "4",
  pages =        "595--598",
  month =        "????",
  year =         "2000",
  CODEN =        "JMOPEW",
  DOI =          "https://doi.org/10.1080/09500340008233380",
  ISSN =         "0950-0340 (print), 1362-3044 (electronic)",
  ISSN-L =       "0950-0340",
  bibdate =      "Fri Mar 9 11:12:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Modern Optics",
  journal-URL =  "http://www.tandfonline.com/loi/tmop20",
  keywords =     "true random numbers from physical sources",
}

@Article{Sugita:2000:RWS,
  author =       "Hiroshi Sugita and Satoshi Takanobu",
  title =        "Random {Weyl} sampling for robust numerical
                 integration of complicated functions",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "6",
  number =       "1",
  pages =        "27--48",
  month =        jan,
  year =         "2000",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2000.6.1.27",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C50",
  MRnumber =     "1754381 (2001d:65013)",
  bibdate =      "Mon Feb 27 17:55:18 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2000.6.issue-1/mcma.2000.6.1.27/mcma.2000.6.1.27.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Takashima:2000:HPR,
  author =       "K. Takashima",
  title =        "Hybrid pseudo-random number generation",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "6",
  number =       "1",
  pages =        "49--59",
  month =        "????",
  year =         "2000",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2000.6.1.49",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "1754382 (2001f:65010)",
  MRreviewer =   "Robert F. Tichy",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2000.6.issue-1/issue-files/mcma.2000.6.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2000.6.issue-1/mcma.2000.6.1.49/mcma.2000.6.1.49.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
  remark =       "The author describes six combination generators: (1)
                 MCG and $m$-sequences (floating-point addition); (2)
                 MCG and $m$-sequences (integer addition); (3) MCG and
                 additive number generator; (4) MCG and cellular
                 automata generator (added, modulo M, to MCG); (5)
                 $m$-sequence ($ Y_n = Y_{n - 89} {\rm XOR} Y_{n - 38} $
                 ); (6) cellular automata generator (exclusive-OR of
                 three successive terms). However, no information is
                 given about the expected periods of the combined
                 generators.",
}

@Article{Tomassini:2000:GHQ,
  author =       "M. Tomassini and M. Sipper and M. Perrenoud",
  title =        "On the generation of high-quality random numbers by
                 two-dimensional cellular automata",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "49",
  number =       "10",
  pages =        "1146--1151",
  month =        oct,
  year =         "2000",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/12.888056",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 5 10:35:26 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=888056",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Viswanath:2000:RFS,
  author =       "Divakar Viswanath",
  title =        "Random {Fibonacci} sequences and the number $
                 1.13198824 \dots $",
  journal =      j-MATH-COMPUT,
  volume =       "69",
  number =       "231",
  pages =        "1131--1155",
  month =        jul,
  year =         "2000",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Wed Nov 1 11:50:05 MST 2000",
  bibsource =    "http://www.ams.org/mcom/2000-69-231;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-99-01145-X;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.dvi;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.pdf;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.ps;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.tex",
  abstract =     "For the familiar Fibonacci sequence (defined by $ f_1
                 = f_2 = 1 $ and $ f_n = f_{n - 1} + f_{n - 2} $ for $ n
                 > 2 $ ), $ f_n $ increases exponentially with n at a
                 rate given by the golden ratio $ (1 + \sqrt {5}) / 2 =
                 1.61803398 \ldots {} $. But for a simple modification
                 with both additions and subtractions the random
                 Fibonacci sequences defined by $ t_1 = t_2 = 1 $, and
                 for $ n > 2 $, $ t_n = \pm t_{n - 1} \pm t_{n - 2} $,
                 where each $ \pm $ sign is independent and either $+$
                 or $-$ with probability $ 1 / 2 $, it is not even
                 obvious if $ |t_n| $ should increase with $n$. Our main
                 result is that\par $$ \sqrt [n]{|t_n|} \to 1.13198824
                 \ldots {} \qquad {\rm as} n \to \infty $$ with
                 probability 1. Finding the number $ 1.13198824 \ldots
                 {} $ involves the theory of random matrix products,
                 Stern--Brocot division of the real line, a fractal
                 measure, a computer calculation, and a rounding error
                 analysis to validate the computer calculation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
  remark =       "This paper generalizes the Fibonacci sequence by
                 replacing the addition rule by a random choice of
                 addition or subtraction; the surprising result is that
                 the terms still grow exponentially, and the absolute
                 value of the $ n^{\mbox {th}} $ term obtained this way
                 approaches the $ n^{\mbox {th}} $ power of $ 1.13198824
                 \dots $, a new mathematical constant, for large $n$.",
}

@Article{Wikramaratna:2000:PRN,
  author =       "Roy S. Wikramaratna",
  title =        "Pseudo-random number generation for parallel
                 processing --- a splitting approach",
  journal =      j-SIAM-NEWS,
  volume =       "33",
  number =       "9",
  pages =        "??--??",
  month =        "????",
  year =         "2000",
  CODEN =        "????",
  ISSN =         "0036-1437",
  bibdate =      "Fri Dec 30 22:34:32 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM News",
  journal-URL =  "http://www.siam.org/news/",
}

@Article{Yaguchi:2000:RHR,
  author =       "Hirotake Yaguchi",
  title =        "Randomness of {Horner}'s rule and a new method of
                 generating random numbers",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "6",
  number =       "1",
  pages =        "61--76",
  month =        "????",
  year =         "2000",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2000.6.1.61",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "1754383 (2001b:65013)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Mon Feb 27 12:47:21 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2000.6.issue-1/issue-files/mcma.2000.6.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2000.6.issue-1/mcma.2000.6.1.61/mcma.2000.6.1.61.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Zhukov:2000:ANA,
  author =       "Yu. V. Zhukov",
  title =        "On the Accuracy of Normal Approximation for the
                 Densities of Sums of Independent Identically
                 Distributed Random Variables",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "44",
  number =       "4",
  pages =        "785--793",
  month =        dec,
  year =         "2000",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/S0040585X9797794X",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:42:30 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/44/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/97794",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 2000",
}

@Article{Ackermann:2001:PRN,
  author =       "J. Ackermann and U. Tangen and B. B{\"o}dekker and J.
                 Breyer and E. Stoll and J. S. McCaskill",
  title =        "Parallel random number generator for inexpensive
                 configurable hardware cells",
  journal =      j-COMP-PHYS-COMM,
  volume =       "140",
  number =       "3",
  pages =        "293--302",
  day =          "1",
  month =        nov,
  year =         "2001",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(01)00242-9",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Tue Feb 14 07:32:06 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465501002429",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Agrawal:2001:CDF,
  author =       "Mani K. Agrawal and Salah E. Elmaghraby",
  title =        "On computing the distribution function of the sum of
                 independent random variables",
  journal =      j-COMP-OP-RES,
  volume =       "28",
  number =       "5",
  pages =        "473--483",
  month =        apr,
  year =         "2001",
  CODEN =        "CMORAP",
  DOI =          "https://doi.org/10.1016/S0305-0548(99)00133-1",
  ISSN =         "0305-0548 (print), 1873-765X (electronic)",
  ISSN-L =       "0305-0548",
  bibdate =      "Fri Mar 09 08:55:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0305054899001331",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Operations Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03050548",
}

@Article{Agrawal:2001:HSP,
  author =       "Manindra Agrawal",
  title =        "Hard Sets and Pseudo-random Generators for Constant
                 Depth Circuits",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2245",
  pages =        "58--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:07:30 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2245.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2245/22450058.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2245/22450058.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Alexander:2001:AMC,
  author =       "S. A. Alexander and R. L. Coldwell",
  title =        "Atomic and Molecular Calculations Using Quasirandom
                 Numbers",
  journal =      j-J-COMPUT-PHYS,
  volume =       "172",
  number =       "2",
  pages =        "908--916",
  day =          "20",
  month =        sep,
  year =         "2001",
  CODEN =        "JCTPAH",
  DOI =          "https://doi.org/10.1006/jcph.2001.6865",
  ISSN =         "0021-9991 (print), 1090-2716 (electronic)",
  ISSN-L =       "0021-9991",
  bibdate =      "Mon Jan 2 22:12:09 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputphys2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0021999101968652",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00219991/",
}

@Article{AlOsh:2001:SAG,
  author =       "M. A. {Al Osh} and S. J. Lee",
  title =        "A simple approach for generating correlated binary
                 variates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "70",
  number =       "3",
  pages =        "231--255",
  month =        "????",
  year =         "2001",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949650108812119",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:46:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949650108812119",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@Article{Arvind:2001:PRB,
  author =       "V. Arvind and Johannes K{\"o}bler",
  title =        "On pseudorandomness and resource-bounded measure",
  journal =      j-THEOR-COMP-SCI,
  volume =       "255",
  number =       "1--2",
  pages =        "205--221",
  day =          "28",
  month =        mar,
  year =         "2001",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Apr 17 08:40:28 MDT 2001",
  bibsource =    "http://www.elsevier.com/locate/issn/03043975;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
  URL =          "http://www.elsevier.nl../31/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/41/16/197/21/31/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Bailey:2001:RCF,
  author =       "David H. Bailey and Richard E. Crandall",
  title =        "On the Random Character of Fundamental Constant
                 Expansions",
  journal =      j-EXP-MATH,
  volume =       "10",
  number =       "2",
  pages =        "175--190",
  month =        "????",
  year =         "2001",
  CODEN =        "????",
  ISSN =         "1058-6458 (print), 1944-950X (electronic)",
  ISSN-L =       "1058-6458",
  bibdate =      "Mon Mar 5 10:25:54 MST 2012",
  bibsource =    "http://projecteuclid.org/euclid.em;
                 https://www.math.utah.edu/pub/tex/bib/expmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.em/999188630",
  abstract =     "We propose a theory to explain random behavior for the
                 digits in the expansions of fundamental mathematical
                 constants. At the core of our approach is a general
                 hypothesis concerning the distribution of the iterates
                 generated by dynamical maps. On this main hypothesis,
                 one obtains proofs of base-2 normality---namely bit
                 randomness in a specific technical sense---for a
                 collection of celebrated constants, including $ \pi $,
                 $ \log 2 $, $ \zeta (3) $, and others. Also on the
                 hypothesis, the number $ \zeta (5) $ is either rational
                 or normal to base 2. We indicate a research connection
                 between our dynamical model and the theory of
                 pseudorandom number generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Experimental Mathematics",
  journal-URL =  "http://www.tandfonline.com/loi/uexm20",
}

@Book{Banks:2001:DES,
  author =       "Jerry Banks and John S. Carson and Barry L. Nelson and
                 David M. Nicol",
  title =        "Discrete-Event System Simulation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "xiv + 594",
  year =         "2001",
  ISBN =         "0-13-088702-1",
  ISBN-13 =      "978-0-13-088702-3",
  LCCN =         "T57.62. B35 2000",
  bibdate =      "Thu Jan 5 14:53:44 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice-Hall international series in industrial and
                 systems engineering",
  acknowledgement = ack-nhfb,
  subject =      "Simulation methods",
}

@Article{Barker:2001:SPE,
  author =       "Lawrence Barker and Henry Rolka and Deborah Rolka and
                 Cedric Brown",
  title =        "Statistical Practice --- Equivalence Testing for
                 Binomial Random Variables: Which Test to Use?",
  journal =      j-AMER-STAT,
  volume =       "55",
  number =       "4",
  pages =        "279--287",
  year =         "2001",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Tue Mar 5 18:50:48 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; OCLC
                 Article1st",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Battaglia:2001:GAP,
  author =       "Francesco Battaglia",
  title =        "Genetic algorithms, pseudo-random numbers generators,
                 and {Markov} chain {Monte Carlo} methods",
  journal =      j-METRON,
  volume =       "59",
  number =       "1--2",
  pages =        "131--155",
  month =        "????",
  year =         "2001",
  CODEN =        "MRONAM",
  ISSN =         "0026-1424 (print), 2281-695X (electronic)",
  ISSN-L =       "0026-1424",
  MRclass =      "65C10 (62F15 65C05); 65C10 62F15 65C05 65C40",
  MRnumber =     "1858182",
  bibdate =      "Sun Jul 5 08:55:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metron2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "0999.65501; 01772402",
  acknowledgement = ack-nhfb,
  fjournal =     "Metron",
  journal-URL =  "https://www.springer.com/journal/40300",
  keywords =     "convergence; genetic algorithm; Markov chain Monte
                 Carlo methods; pseudo-random samples generation",
}

@InProceedings{Batu:2001:TRV,
  author =       "T. Batu and E. Fischer and L. Fortnow and R. Kumar and
                 R. Rubinfeld and P. White",
  title =        "Testing random variables for independence and
                 identity",
  crossref =     "IEEE:2001:ISF",
  pages =        "442--451",
  year =         "2001",
  bibdate =      "Fri Feb 22 06:31:27 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Chamayou:2001:PRN,
  author =       "J.-F. Chamayou",
  title =        "Pseudo random numbers for the {Landau} and {Vavilov}
                 distributions",
  journal =      j-COMP-STAT,
  volume =       "16",
  number =       "1",
  pages =        "131--152",
  month =        mar,
  year =         "2001",
  CODEN =        "CSTAEB",
  DOI =          "https://doi.org/10.1007/s001800100055",
  ISSN =         "0943-4062 (print), 1613-9658 (electronic)",
  ISSN-L =       "0943-4062",
  bibdate =      "Thu Jun 18 16:19:26 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/s001800100055",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Stat.",
  fjournal =     "Computational Statistics",
  journal-URL =  "http://link.springer.com/journal/180",
}

@Article{Chen:2001:ING,
  author =       "Huifen Chen",
  title =        "Initialization for {NORTA}: Generation of Random
                 Vectors with Specified Marginals and Correlations",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "13",
  number =       "4",
  pages =        "312--331",
  month =        "Fall",
  year =         "2001",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.13.4.312.9736",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  bibdate =      "Fri Jan 06 17:42:11 2012",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@Article{Chick:2001:NPS,
  author =       "Stephen E. Chick and Koichiro Inoue",
  title =        "New Procedures to Select the Best Simulated System
                 Using {Common Random Numbers}",
  journal =      j-MANAGEMENT-SCIENCE,
  volume =       "47",
  number =       "8",
  pages =        "1133--1149",
  month =        aug,
  year =         "2001",
  CODEN =        "MSCIAM",
  DOI =          "https://doi.org/10.1287/mnsc.47.8.1133.10229",
  ISSN =         "0025-1909 (print), 1526-5501 (electronic)",
  ISSN-L =       "0025-1909",
  bibdate =      "Thu Jan 05 17:41:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Management Science",
  journal-URL =  "http://pubsonline.informs.org/loi/mnsc",
  keywords =     "Common Random Numbers (CRN)",
}

@Article{Chowdhury:2001:ESI,
  author =       "Sandeepan Chowdhury and Subhamoy Maitra",
  title =        "Efficient Software Implementation of Linear Feedback
                 Shift Registers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2247",
  pages =        "297--307",
  year =         "2001",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45311-3_28",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  MRclass =      "94A55 (68N99)",
  MRnumber =     "1934506",
  bibdate =      "Sat Feb 2 13:07:31 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470297.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2247/22470297.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Coffman:2001:TPS,
  author =       "E. G. {Coffman, Jr.} and Predrag Jelenkovi{\'c}",
  title =        "Threshold policies for single-resource reservation
                 systems",
  journal =      j-SIGMETRICS,
  volume =       "28",
  number =       "4",
  pages =        "9--10",
  month =        mar,
  year =         "2001",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/544397.544401",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:34:13 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "Requests for a resource arrive at rate $ \lambda $,
                 each request specifying a future time interval, called
                 a {\em reservation interval}, to be booked for its use
                 of the resource. The {\em advance notices\/} (delays
                 before reservation intervals are to begin) are
                 independent and drawn from a distribution $ A(z) $. The
                 durations of reservation intervals are sampled from the
                 distribution $ B(z) $ and are independent of each other
                 and the advance notices. We let $A$ and $B$ denote
                 random variables with the distributions $ A(z) $ and $
                 B(z) $ (the functional notation will always allow one
                 to distinguish between our two uses of the symbols $A$
                 and $B$ ).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@Book{Crandall:2001:PNC,
  author =       "Richard Crandall and Carl Pomerance",
  title =        "Prime Numbers: a Computational Perspective",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 545",
  year =         "2001",
  ISBN =         "0-387-94777-9",
  ISBN-13 =      "978-0-387-94777-8",
  LCCN =         "QA246 .C74 2001",
  bibdate =      "Mon May 17 15:47:50 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  remark =       "While not strictly about pseudorandom numbers, Chapter
                 8 of this book discusses applications of prime numbers
                 to cryptography, random-number generation, and
                 quasi-Monte Carlo methods.",
}

@Article{Cryan:2001:PGN,
  author =       "Mary Cryan and Peter Bro Miltersen",
  title =        "On Pseudorandom Generators in {NC}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2136",
  pages =        "272--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:05:38 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2136.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2136/21360272.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2136/21360272.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Entacher:2001:EOR,
  author =       "Karl Entacher and Thomas Schell and Andreas Uhl",
  title =        "Evolutionary optimization of random number
                 generators",
  crossref =     "Schueller:2001:MCS",
  pages =        "19--26",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:02:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Entacher:2001:ORN,
  author =       "Karl Entacher and Thomas Schell and Andreas Uhl",
  title =        "Optimization of random number generators: efficient
                 search for high-quality {LCGs}",
  journal =      j-PROB-ENG-MECH,
  volume =       "16",
  number =       "4",
  pages =        "289--293",
  month =        oct,
  year =         "2001",
  CODEN =        "PEMEEX",
  DOI =          "https://doi.org/10.1016/S0266-8920(01)00021-2",
  ISSN =         "0266-8920 (print), 1878-4275 (electronic)",
  ISSN-L =       "0266-8920",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0266892001000212",
  acknowledgement = ack-nhfb,
  fjournal =     "Probabilistic engineering mechanics",
  remark =       "The optimal parameters found in this study for
                 multiplicative congruential generators (MCG) are $ x_{n
                 + 1} = A x_n \bmod M $ $ M = 2^{31} - 1 $: $ A =
                 1281694259, 1610997471, 711254123 $, $ M = 2^{61} - 1
                 $: $ A = 576499412011439685, 1470535122213743586,
                 273635001254884560 $, $ M = 2^{64} - 59 $: $ A =
                 1812254979190146906, 12392816392420730400,
                 3401048658419419339 $. All of the $M$ values are prime
                 numbers.",
}

@InProceedings{Entacher:2001:PQ,
  author =       "K. Entacher and Th. Schell",
  title =        "From 'pseudo' to 'quasi'",
  crossref =     "Schueller:2001:MCS",
  pages =        "27--34",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Faure:2001:VS,
  author =       "Henri Faure",
  title =        "Variations on $ (0, s) $-Sequences",
  journal =      j-J-COMPLEXITY,
  volume =       "17",
  number =       "4",
  pages =        "741--753",
  month =        dec,
  year =         "2001",
  CODEN =        "JOCOEH",
  DOI =          "https://doi.org/10.1006/jcom.2001.0590",
  ISSN =         "0885-064X (print), 1090-2708 (electronic)",
  ISSN-L =       "0885-064X",
  bibdate =      "Fri Mar 09 11:20:12 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0885064X01905904",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of complexity",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0885064X",
}

@Article{Fernandez:2001:RCA,
  author =       "Julio F. Fern{\'a}ndez and Carlos Criado",
  title =        "Reply to {``Comment on `Algorithm for normal random
                 numbers'\,''}",
  journal =      j-PHYS-REV-E,
  volume =       "63",
  pages =        "058702",
  month =        apr,
  year =         "2001",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.63.058702",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Feb 24 18:01:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Fernandez:1999:ANRb,Probert:2001:CAN}.",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.63.058702",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  issue =        "5",
  journal-URL =  "http://pre.aps.org/browse",
  numpages =     "2",
}

@TechReport{Fischer:2001:CLT,
  author =       "Hans Fischer",
  title =        "The {Central Limit Theorem} from {Laplace} to
                 {Cauchy}: Changes in Stochastic Objectives and in
                 Analytical Methods",
  type =         "Report",
  institution =  "Katholische Universit{\"a}t Eichst{\"a}tt",
  address =      "D-85071 Eichst{\"a}tt, Germany",
  pages =        "ii + 34",
  month =        oct,
  year =         "2001",
  bibdate =      "Wed Aug 04 15:33:54 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The URL contains a concise English version of the
                 first 2 chapters of this book on the history of the
                 central limit theorem, however with a partially new
                 interpretation of the
                 Cauchy--Bienaym{\'e}-controversy.",
  URL =          "http://mathsrv.ku-eichstaett.de/MGF/homes/didmath/seite/1850.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fischer:2001:TRN,
  author =       "V. Fischer and M. Drutarovsky",
  title =        "True random number generator embedded in
                 reconfigurable hardware",
  crossref =     "Koc:2001:CHEa",
  pages =        "415--430",
  year =         "2001",
  bibdate =      "Thu Feb 23 07:58:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@InProceedings{Fluhrer:2001:SAA,
  author =       "Scott R. Fluhrer and David A. McGrew",
  editor =       "Gerhard Goos and Juris Hartmanis and Jan Leeuwen and
                 Bruce Schneier",
  booktitle =    "Fast Software Encryption: {7th International Workshop,
                 FSE 2000, New York, NY, USA, April 10--12, 2000.
                 Proceedings}",
  title =        "Statistical Analysis of the Alleged {RC4} Keystream
                 Generator",
  volume =       "1978",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "19--30",
  year =         "2001",
  DOI =          "https://doi.org/10.1007/3-540-44706-7_2",
  bibdate =      "Sat Apr 05 12:13:24 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/content/pdf/10.1007/3-540-44706-7_2.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Folegati:2001:CLR,
  author =       "Katia Folegati and Roberto Segala",
  title =        "Coin Lemmas with Random Variables",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2165",
  pages =        "71--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:06:08 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2165.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2165/21650071.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2165/21650071.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Gerosa:2001:FIB,
  author =       "A. Gerosa and R. Bernardini and S. Pietri",
  editor =       "{IEEE}",
  booktitle =    "{SSMSD 2001 Southwest Symposium on Mixed-Signal
                 Design, 25--27 February, 2001, Austin, Texas, USA}",
  title =        "A fully integrated 8-bit, {20MHz}, truly random
                 numbers generator, based on a chaotic system",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "viii + 173",
  pages =        "87--92",
  year =         "2001",
  DOI =          "https://doi.org/10.1109/SSMSD.2001.914944",
  ISBN =         "0-7803-6742-1",
  ISBN-13 =      "978-0-7803-6742-5",
  LCCN =         "TK7874.75 .S65 2001",
  bibdate =      "Thu Feb 23 08:02:36 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@InProceedings{Golic:2001:CAS,
  author =       "Jovan Dj. Goli{\'c}",
  editor =       "Joe Kilian",
  booktitle =    "{CRYPTO '01}: Proceedings of the {21st Annual
                 International Cryptology Conference on Advances in
                 Cryptology}",
  title =        "Correlation Analysis of the Shrinking Generator",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "440--457",
  year =         "2001",
  bibdate =      "Sat Apr 05 11:51:01 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://iacr.org/archive/crypto2001/21390439.pdf",
  abstract =     "The shrinking generator is a well-known keystream
                 generator composed of two linear feedback shift
                 registers, LFSR1 and LFSR2, where LFSR1 is
                 clock-controlled according to regularly clocked LFSR2.
                 A probabilistic analysis of the shrinking generator
                 which shows that this generator can be vulnerable to a
                 specific fast correlation attack is conducted. The
                 first stage of the attack is based on a recursive
                 computation of the posterior probabilities of
                 individual bits of the regularly clocked LFSR1 sequence
                 when conditioned on a given segment of the keystream
                 sequence. Theoretical analysis shows that these
                 probabilities are significantly different from one half
                 and can hence be used for reconstructing the initial
                 state of LFSR1 by iterative probabilistic decoding
                 algorithms for fast correlation attacks on regularly
                 clocked LFSR's. In the second stage of the attack, the
                 initial state of LFSR2 is reconstructed in a similar
                 way, which is based on a recursive computation of the
                 posterior probabilities of individual bits of the LFSR2
                 sequence when conditioned on the keystream sequence and
                 on the reconstructed LFSR1 sequence.",
  acknowledgement = ack-nhfb,
}

@Misc{Gonsalves:2001:PAS,
  author =       "Richard J. Gonsalves",
  title =        "Pivot algorithm for self-avoiding walks on a square
                 lattice",
  howpublished = "Fortran program",
  year =         "2001",
  bibdate =      "Thu Mar 01 10:00:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The program contains code (near the end) for the
                 portable {\tt rannyu()} generator. It is a linear
                 congruential generator with multiplier $ A = 31, 167,
                 285 = 0 x1 d b9335 $ and modulus $ M = 2^{48} $,
                 implemented to require only 32-bit signed integer
                 arithmetic.",
  URL =          "http://www.physics.buffalo.edu/gonsalves/phy411-506_spring01/Files/Chapter12/saw.f",
  acknowledgement = ack-nhfb,
  lastaccess =   "01 March 2012",
}

@Article{Guimond:2001:CRN,
  author =       "Louis-S{\'e}bastian Guimond and Ji{\v{r}}{\'\i} Patera
                 and Jan Patera",
  title =        "Combining random number generators using cut and
                 project sequences",
  journal =      j-CZECH-J-PHYS,
  volume =       "51",
  number =       "4",
  pages =        "305--311",
  month =        apr,
  year =         "2001",
  CODEN =        "CZYPAO",
  DOI =          "https://doi.org/10.1023/A:1017533304855",
  ISSN =         "0011-4626 (print), 1572-9486 (electronic)",
  ISSN-L =       "0011-4626",
  bibdate =      "Wed Aug 31 08:04:15 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1023/A%3A1017533304855",
  acknowledgement = ack-nhfb,
  ajournal =     "Czechoslov. J. Phys.",
  fjournal =     "Czechoslovak Journal of Physics",
  journal-URL =  "http://link.springer.com/journal/10582",
  received =     "19 February 2001",
  remark =       "DI-CRM Workshop on Mathematical Physics (Prague,
                 2000)",
}

@Article{Gutierrez:2001:IMP,
  author =       "J. Gutierrez and D. Gomez-Perez",
  title =        "Iterations of Multivariate Polynomials and Discrepancy
                 of Pseudorandom Numbers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2227",
  pages =        "192--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:07:13 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2227.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2227/22270192.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2227/22270192.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InCollection{Gutmann:2001:RNG,
  author =       "Peter Gutmann",
  booktitle =    "????",
  title =        "Random Number Generation",
  chapter =      "6",
  publisher =    "????",
  address =      "????",
  pages =        "155--193",
  month =        oct,
  year =         "2001",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Mon Dec 26 11:51:30 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cypherpunks.to/~peter/06_random.pdf",
  acknowledgement = ack-nhfb,
  remark =       "The section headings in this chapter are similar to
                 those in \cite{Gutmann:2004:CSA}, but the contents are
                 quite different. I have not yet found where, if at all,
                 this apparently-older version was published. Strings
                 from this chapter are not found in searches at
                 http://books.google.com/.",
}

@Article{Haastad:2001:PCA,
  author =       "Johan H{\aa}stad and Mats N{\"a}slund",
  title =        "Practical Construction and Analysis of
                 Pseudo-Randomness Primitives",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2248",
  pages =        "442--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:07:33 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480442.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2248/22480442.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Hernandez:2001:DTR,
  author =       "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a
                 Sierra and Arturo Ribagorda and Benjam{\'\i}n Ramos and
                 J. C. Mex-Perera",
  title =        "Distinguishing {TEA} from a Random Permutation:
                 Reduced Round Versions of {TEA} Do Not Have the {SAC}
                 or Do Not Generate Random Numbers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2260",
  pages =        "374--377",
  year =         "2001",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45325-3_34",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Feb 01 16:50:09 2012",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
                 https://www.math.utah.edu/pub/tex/bib/lncs2001d.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://163.117.174.60/downloads/Publicaciones/2001/HernandezSRRM01.pdf;
                 http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600374.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2260/22600374.pdf",
  abstract =     "In this paper the authors present a statistical test
                 for testing the strict avalanche criterion (SAC), a
                 property that cryptographic primitives such as block
                 ciphers and hash functions must have. Random
                 permutations should also behave as good random number
                 generators when, given any initial input, its output is
                 considered part of a pseudorandom stream and then used
                 as an input block to produce more output bits. Using
                 these two ideal properties, we construct a test
                 framework for cryptographic primitives that is shown at
                 work on the block cipher TEA. In this way, we are able
                 to distinguish reduced round versions of it from a
                 random permutation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  remark =       "The authors show that TEA with 1 to 5 rounds is
                 unsatisfactory as a random-number generator, and
                 suggest that will be true for 6 rounds too. They
                 believe that 7 or more rounds may be required to make
                 TEA a suitable random-number generator.",
}

@InProceedings{Hernandez:2001:FNO,
  author =       "J. C. Hernandez and A. Ribagorda and P. Isasi and J.
                 M. Sierra",
  title =        "Finding near optimal parameters for linear
                 congruential pseudorandom number generators by means of
                 evolutionary computation",
  crossref =     "Spector:2001:GPG",
  pages =        "1292--1298",
  year =         "2001",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2001/d24.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Hernandez:2001:GAC,
  author =       "J. C. Hern{\'a}ndez and A. Ribagorda and P. Isasi and
                 J. M. Sierra",
  title =        "Genetic Algorithms Can Be Used to Obtain Good Linear
                 Congruential Generators",
  journal =      j-CRYPTOLOGIA,
  volume =       "25",
  number =       "3",
  pages =        "213--229",
  year =         "2001",
  CODEN =        "CRYPE6",
  DOI =          "https://doi.org/10.1080/0161-110191889897",
  ISSN =         "0161-1194 (print), 1558-1586 (electronic)",
  ISSN-L =       "0161-1194",
  bibdate =      "Sun May 15 11:37:45 MDT 2011",
  bibsource =    "http://www.tandf.co.uk/journals/titles/01611194.asp;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Linear Congruential Generators (LCGs) are one model of
                 pseudorandom number generators used in a great number
                 of applications. They strongly depend on, and are
                 completely characterized by, some critical parameters.
                 The selection of good parameters to define a LCG is a
                 difficult task mainly done, nowadays, by consulting
                 tabulated values [10] or by trial and error. In this
                 work, the authors present a method based on genetic
                 algorithms that can automatically solve the problem of
                 finding good parameters for a LCG. They also show that
                 the selection of an evaluation function for the
                 generated solutions is critical to the problem and how
                 a seemingly good function such as entropy could lead to
                 poor results. Finally, other fitness functions are
                 proposed and one of them is shown to produce very good
                 results. Some other possibilities and variations that
                 may produce fine linear congruential generators are
                 also mentioned.",
  acknowledgement = ack-nhfb,
  fjournal =     "Cryptologia",
  journal-URL =  "http://www.tandfonline.com/loi/ucry20",
}

@Article{Howgrave-Graham:2001:PRN,
  author =       "N. Howgrave-Graham and J. Dyer and R. Gennaro",
  title =        "Pseudo-random Number Generation on the {IBM 4758
                 Secure Crypto Coprocessor}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2162",
  pages =        "93--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:06:06 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620093.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2162/21620093.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Iwata:2001:PAF,
  author =       "Tetsu Iwata and Kaoru Kurosawa",
  title =        "On the Pseudorandomness of the {AES} Finalists ---
                 {RC6} and {Serpent}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1978",
  pages =        "231--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:03:00 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780231.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1978/19780231.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Johnson:2001:CCO,
  author =       "George Johnson",
  title =        "Connoisseurs of Chaos Offer a Valuable Product:
                 Randomness",
  journal =      j-NY-TIMES,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "12",
  month =        jun,
  year =         "2001",
  CODEN =        "NYTIAO",
  ISSN =         "0362-4331 (print), 1542-667X, 1553-8095",
  ISSN-L =       "0362-4331",
  bibdate =      "Wed Mar 07 10:51:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Section F; Column 3; Science Desk; Pg. 1",
  URL =          "http://www.fourmilab.ch/hotbits;
                 http://www.nytimes.com; http://www.random.org/",
  acknowledgement = ack-nhfb,
  fjournal =     "New York Times",
  journal-URL =  "http://www.nytimes.com/",
}

@Article{Kang:2001:PMT,
  author =       "Ju-Sung Kang and Okyeon Yi and Dowon Hong and Hyunsook
                 Cho",
  title =        "Pseudorandomness of {MISTY}-Type Transformations and
                 the Block Cipher {KASUMI}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2119",
  pages =        "60--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:05:21 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190060.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2119/21190060.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@TechReport{Killmann:2001:AFC,
  author =       "W. Killmann and W. Schindler",
  title =        "{AIS 31}: Functionality Classes and Evaluation
                 Methodology for True (Physical) Random Number
                 Generators",
  type =         "Report",
  institution =  "Bundesamt fur Sicherheit in der Informationstechnik
                 (BSI)",
  address =      "Postfach 20 03 63, 53133 Bonn, Germany",
  day =          "9",
  month =        sep,
  year =         "2001",
  bibdate =      "Tue Jan 31 15:03:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Version 3.1.",
  acknowledgement = ack-nhfb,
}

@Article{Krause:2001:MHC,
  author =       "Matthias Krause and Stefan Lucks",
  title =        "On the Minimal Hardware Complexity of Pseudorandom
                 Function Generators (Extended Abstract)",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2010",
  pages =        "419--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:03:28 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2010.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2010/20100419.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2010/20100419.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Kuang:2001:CSA,
  author =       "Lei Kuang and Armand M. Makowski",
  title =        "Convex stability and asymptotic convex ordering for
                 non-stationary arrival processes",
  journal =      j-SIGMETRICS,
  volume =       "28",
  number =       "4",
  pages =        "22--23",
  month =        mar,
  year =         "2001",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/544397.544406",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:34:13 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "The notion of convex stability for a sequence of
                 non-negative random variables is discussed in the
                 context of several applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
}

@InProceedings{LEcuyer:2001:CQR,
  author =       "Pierre L'Ecuyer and Christiane Lemieux",
  title =        "On the choice of quasi-random point sets with a
                 lattice structure",
  crossref =     "Schueller:2001:MCS",
  pages =        "11--17",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:2001:PBS,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "On the performance of birthday spacings tests with
                 certain families of random number generators",
  journal =      j-MATH-COMP-SIM,
  volume =       "55",
  number =       "1--3",
  pages =        "131--137",
  day =          "15",
  month =        feb,
  year =         "2001",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(00)00253-6",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  MRclass =      "65C10",
  MRnumber =     "1823110",
  bibdate =      "Fri Dec 30 14:46:26 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475400002536",
  abstract =     "We examine how a statistical test based on discrete
                 spacings between points, in one or more dimensions,
                 detects the regularities in certain popular classes of
                 random number generators. We provide a rule of thumb
                 giving the minimal sample size for the test to reject
                 the generator systematically, as a function of the
                 generator's size (or period length), for generator
                 families such as the linear congruential, Tausworthe,
                 nonlinear inversive, etc. Full period linear
                 congruential generators with a good behavior in the
                 spectral test, for example, start to fail the
                 two-dimensional test decisively at sample sizes
                 approximately equal to the cubic root of their period
                 length (or modulus).",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
  keywords =     "birthday spacings; distribution; random number
                 generators; statistical tests",
}

@InCollection{LEcuyer:2001:RN,
  author =       "P. L'Ecuyer",
  title =        "Random Numbers",
  crossref =     "Smelser:2001:IES",
  volume =       "19",
  pages =        "12734--12738",
  year =         "2001",
  DOI =          "https://doi.org/10.1016/B0-08-043076-7/00493-9",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/B0080430767004939",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:2001:RNG,
  author =       "Pierre L'Ecuyer",
  title =        "Random number generators",
  crossref =     "Gass:2001:EOR",
  pages =        "695--702",
  year =         "2001",
  DOI =          "https://doi.org/10.1007/1-4020-0611-X_852",
  bibdate =      "Mon Jun 27 22:24:04 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{LEcuyer:2001:SUR,
  author =       "Pierre L'Ecuyer",
  title =        "Software for Uniform Random Number Generation:
                 Distinguishing the Good and the Bad",
  crossref =     "Peters:2001:WPW",
  pages =        "95--105",
  year =         "2001",
  bibdate =      "Wed Aug 04 10:01:34 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Manual{LEcuyer:2001:TSL,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "{TestU01}: a Software Library in {ANSI C} for
                 Empirical Testing of Random Number Generators, Software
                 User's Guide",
  organization = "D{\'e}partement d'Informatique et Recherche
                 op{\'e}rationnelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, Qu{\'e}bec, Canada",
  year =         "2001",
  bibdate =      "Tue Dec 23 10:40:40 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.iro.umontreal.ca/~simardr/TestU01.zip",
  acknowledgement = ack-nhfb,
}

@Article{Lee:2001:PBG,
  author =       "Eonkyung Lee and Sang Jin Lee and Sang Geun Hahn",
  title =        "Pseudorandomness from Braid Groups",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2139",
  pages =        "486--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:05:41 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390486.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2139/21390486.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "Crypto '2001; cryptography",
}

@Article{Lemieux:2001:SCL,
  author =       "Christiane Lemieux and Pierre L'Ecuyer",
  title =        "On selection criteria for lattice rules and other
                 quasi-{Monte Carlo} point sets",
  journal =      j-MATH-COMP-SIM,
  volume =       "55",
  number =       "1--3",
  pages =        "139--148",
  day =          "15",
  month =        feb,
  year =         "2001",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(00)00254-8",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Fri Dec 30 14:46:26 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The Second IMACS Seminar on Monte Carlo Methods
                 (Varna, 1999).",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475400002548",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{Lenczewski:2001:FRV,
  author =       "Romuald Lenczewski",
  title =        "Filtered random variables, bialgebras, and
                 convolutions",
  journal =      j-J-MATH-PHYS,
  volume =       "42",
  number =       "12",
  pages =        "5876--5903",
  month =        dec,
  year =         "2001",
  CODEN =        "JMAPAQ",
  ISSN =         "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
  ISSN-L =       "0022-2488",
  bibdate =      "Thu Mar 28 19:47:21 MST 2002",
  bibsource =    "http://www.aip.org/ojs/jmp.html;
                 https://www.math.utah.edu/pub/tex/bib/jmathphys2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Mathematical Physics",
  journal-URL =  "http://jmp.aip.org/",
}

@Article{Levin:2001:SIC,
  author =       "Mordechay B. Levin",
  title =        "On the statistical independence of compound
                 pseudorandom numbers over part of the period",
  journal =      j-TOMACS,
  volume =       "11",
  number =       "3",
  pages =        "294--311",
  month =        jul,
  year =         "2001",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:42 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Leydold:2001:SUG,
  author =       "Josef Leydold",
  title =        "A simple universal generator for continuous and
                 discrete univariate {$T$}-concave distributions",
  journal =      j-TOMS,
  volume =       "27",
  number =       "1",
  pages =        "66--82",
  month =        mar,
  year =         "2001",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/382043.382322",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Wed Feb 6 16:43:42 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We use inequalities to design short universal
                 algorithms that can be used to generate random variates
                 from large classes of univariate continuous or discrete
                 distributions (including all log-concave
                 distributions). The expected time is uniformly bounded
                 over all these distributions. The algorithms can be
                 implemented in a few lines of high-level language code.
                 In opposition to other black-box algorithms hardly any
                 setup step is required, and thus it is superior in the
                 changing-parameter case.",
  accepted =     "27 November 2000",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@InProceedings{Leydold:2001:UAA,
  author =       "Josef Leydold and Wolfgang H{\"o}rmann",
  title =        "Universal algorithms as an alternative for generating
                 non-uniform continuous random variates",
  crossref =     "Schueller:2001:MCS",
  pages =        "177--183",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://epub.wu.ac.at/844/1/document.pdf;
                 http://epub.wu.ac.at/id/eprint/844",
  acknowledgement = ack-nhfb,
}

@Article{Li:2001:SPD,
  author =       "Shujun Li and Qi Li and Wenmin Li and Xuanqin Mou and
                 Yuanlong Cai",
  title =        "Statistical Properties of Digital Piecewise Linear
                 Chaotic Maps and Their Roles in Cryptography and
                 Pseudo-Random Coding",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2260",
  pages =        "205--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:07:45 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600205.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2260/22600205.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Liang:2001:NET,
  author =       "Yufeng Liang and P. A. Whitlock",
  title =        "A new empirical test for parallel pseudo-random number
                 generators",
  journal =      j-MATH-COMP-SIM,
  volume =       "55",
  number =       "1--3",
  pages =        "149 158",
  day =          "15",
  month =        feb,
  year =         "2001",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(00)00255-X",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Fri Mar 09 11:27:07 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S037847540000255X",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
  remark =       "The Second IMACS Seminar on Monte Carlo Methods.",
}

@Article{Liang:2001:TMU,
  author =       "Jia-Juan Liang and Kai-Tai Fang and Fred J. Hickernell
                 and Runze Li",
  title =        "Testing multivariate uniformity and its applications",
  journal =      j-MATH-COMPUT,
  volume =       "70",
  number =       "233",
  pages =        "337--355",
  month =        jan,
  year =         "2001",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Wed Apr 18 05:10:15 MDT 2001",
  bibsource =    "http://www.ams.org/mcom/2001-70-233;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-00-01203-5;
                 http://www.ams.org/mcom/2001-70-233/S0025-5718-00-01203-5/S0025-5718-00-01203-5.dvi;
                 http://www.ams.org/mcom/2001-70-233/S0025-5718-00-01203-5/S0025-5718-00-01203-5.pdf;
                 http://www.ams.org/mcom/2001-70-233/S0025-5718-00-01203-5/S0025-5718-00-01203-5.ps;
                 http://www.ams.org/mcom/2001-70-233/S0025-5718-00-01203-5/S0025-5718-00-01203-5.tex",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Litvak:2001:SPE,
  author =       "Nelly Litvak",
  title =        "Some Peculiarities of Exponential Random Variables",
  journal =      j-J-APPL-PROBAB,
  volume =       "38",
  number =       "3",
  pages =        "787--792",
  month =        sep,
  year =         "2001",
  CODEN =        "JPRBAM",
  DOI =          "https://doi.org/10.2307/3216132",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Sat May 3 07:44:04 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i361384;
                 https://www.math.utah.edu/pub/tex/bib/japplprobab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/3216132",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html",
}

@InProceedings{Mantin:2001:PAB,
  author =       "Itsik Mantin and Adi Shamir",
  editor =       "????",
  booktitle =    "{FSE '01}: Revised Papers from the 8th International
                 Workshop on Fast Software Encryption",
  title =        "A Practical Attack on Broadcast {RC4}",
  volume =       "????",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "152--164",
  year =         "2001",
  bibdate =      "Sat Apr 05 12:37:57 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  remark =       "TO DO: Find missing data.",
}

@InProceedings{Mascagni:2001:PIC,
  author =       "M. Mascagni and S. Rahimi",
  title =        "Parallel inversive congruential generators: Software
                 and field-programmable gate array implementations",
  crossref =     "Schueller:2001:MCS",
  pages =        "35--39",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Moler:2001:CCN,
  author =       "Cleve B. Moler",
  title =        "{Cleve}'s Corner: Normal Behavior: {Ziggurat}
                 algorithm generates normally distributed random
                 numbers",
  type =         "Technical note",
  institution =  inst-MATHWORKS,
  address =      inst-MATHWORKS:adr,
  pages =        "1",
  month =        "Spring",
  year =         "2001",
  bibdate =      "Thu Oct 24 07:16:21 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.mathworks.com/company/newsletter/clevescorner/spring01_cleve.shtml",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Marsaglia:2000:ZMG} for the algorithm used
                 in Matlab's (version 5 and later) randn() function for
                 generating normally-distributed pseudo-random
                 numbers.",
  keywords =     "Matlab",
}

@Article{Myers:2001:EAS,
  author =       "Steven Myers",
  title =        "Efficient Amplification of the Security of Weak
                 Pseudo-random Function Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2045",
  pages =        "358--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:04:02 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450358.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2045/20450358.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Nelsen:2001:BRB,
  author =       "Roger Nelsen",
  title =        "Book Review: {{\booktitle{Probability and Random
                 Variables: a Beginner's Guide}}}",
  journal =      j-AMER-STAT,
  volume =       "55",
  number =       "1",
  pages =        "82--83",
  month =        feb,
  year =         "2001",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jan 27 18:16:34 MST 2012",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 http://www.jstor.org/journals/00031305.html;
                 http://www.jstor.org/stable/i326511;
                 https://www.math.utah.edu/pub/tex/bib/amstat2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/2685536",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Nelsen:2001:PRV,
  author =       "Roger Nelsen",
  title =        "Probability and Random Variables: a Beginner's Guide",
  journal =      j-AMER-STAT,
  volume =       "55",
  number =       "1",
  pages =        "82--??",
  month =        feb,
  year =         "2001",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Fri Jul 20 11:18:01 MDT 2001",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@InProceedings{Niederreiter:2001:DAN,
  author =       "H. Niederreiter",
  title =        "Design and analysis of nonlinear pseudorandom number
                 generators",
  crossref =     "Schueller:2001:MCS",
  pages =        "3--9",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:2001:DCI,
  author =       "Harald Niederreiter and Arne Winterhof",
  title =        "On the distribution of compound inversive congruential
                 pseudorandom numbers",
  journal =      j-MONAT-MATH,
  volume =       "132",
  number =       "1",
  pages =        "35--48",
  month =        apr,
  year =         "2001",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050170057",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "1825718 (2002g:11113)",
  MRreviewer =   "Peter J. Hellekalek",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Niederreiter:2001:DIC,
  author =       "Harald Niederreiter and Igor E. Shparlinski",
  title =        "On the distribution of inversive congruential
                 pseudorandom numbers in parts of the period",
  journal =      j-MATH-COMPUT,
  volume =       "70",
  number =       "236",
  pages =        "1569--1574",
  month =        oct,
  year =         "2001",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-00-01273-4",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "11K45 (11T99 65C10)",
  MRnumber =     "1836919 (2002e:11104)",
  MRreviewer =   "Vladimir S. Anashin",
  bibdate =      "Mon Jul 16 07:53:14 MDT 2001",
  bibsource =    "http://www.ams.org/mcom/2001-70-236;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-00-01273-4;
                 http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01273-4/S0025-5718-00-01273-4.dvi;
                 http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01273-4/S0025-5718-00-01273-4.pdf;
                 http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01273-4/S0025-5718-00-01273-4.ps;
                 http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01273-4/S0025-5718-00-01273-4.tex;
                 http://www.jstor.org/stable/pdfplus/2698742.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Niederreiter:2001:NCI,
  author =       "Harald Niederreiter and Arne Winterhof",
  title =        "On a New Class of Inversive Pseudorandom Numbers for
                 Parallelized Simulation Methods",
  journal =      j-PERIOD-MATH-HUNGAR,
  volume =       "42",
  number =       "1--2",
  pages =        "77--87",
  year =         "2001",
  CODEN =        "PMHGAW",
  DOI =          "https://doi.org/10.1023/A:1015296523748",
  ISSN =         "0031-5303 (print), 1588-2829 (electronic)",
  ISSN-L =       "0031-5303",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1832696 (2002b:65011)",
  MRreviewer =   "Gheorghe Barbu",
  bibdate =      "Fri Mar 09 11:30:27 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Periodica Mathematica Hungarica",
}

@Manual{NIST:2001:BST,
  author =       "{NIST}",
  title =        "Batteries of Statistical Tests for Random Number
                 Generators",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  year =         "2001",
  bibdate =      "Mon Dec 08 08:43:08 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "World-Wide Web site.",
  URL =          "http://csrc.nist.gov/rng/rng6_3.html",
  acknowledgement = ack-nhfb,
}

@TechReport{NIST:2001:SRC,
  author =       "{NIST}",
  title =        "Security Requirements for Cryptographic Modules",
  type =         "Federal Information Processing Standards Publication",
  number =       "FIPS PUB 140-2",
  institution =  pub-NIST,
  address =      pub-NIST:adr,
  day =          "25",
  month =        may,
  year =         "2001",
  bibdate =      "Wed Aug 04 09:46:50 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Noll:2001:HGL,
  author =       "Landon Curt Noll and Simon Cooper and Mel Pleasant",
  title =        "How good is {LavaRnd}?",
  howpublished = "Web site",
  year =         "2001",
  bibdate =      "Sat Dec 24 11:54:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.lavarnd.org/what/nist-test.html",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
  remark =       "The site presents result from the NIST test suite for
                 the LavaRnd generator, and several others, including
                 {\tt /dev/random} and {\tt /dev/urandom} on various
                 systems. It classifies the generators as having high,
                 medium, and low quality.",
}

@Book{Peebles:2001:PRV,
  author =       "Peyton Z. Peebles",
  title =        "Probability, random variables, and random signal
                 principles",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "xviii + 462",
  year =         "2001",
  ISBN =         "0-07-366007-8",
  ISBN-13 =      "978-0-07-366007-3",
  LCCN =         "TA340 .P43 2001",
  bibdate =      "Wed Nov 16 10:01:12 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "McGraw-Hill series in electrical and computer
                 engineering",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/mh021/00034881.html;
                 http://www.loc.gov/catdir/toc/mh021/00034881.html",
  acknowledgement = ack-nhfb,
  keywords =     "Matlab",
  subject =      "Probabilities; Random variables; Signal theory
                 (Telecommunication)",
}

@Article{Peterson:2001:PMM,
  author =       "Ivars Peterson",
  title =        "Pi {\`a} la Mode: Mathematicians tackled the seeming
                 randomness of pi's digits",
  journal =      j-SCIENCE-NEWS,
  volume =       "160",
  number =       "9",
  pages =        "136--137",
  day =          "1",
  month =        sep,
  year =         "2001",
  CODEN =        "SCNEBK",
  ISSN =         "0036-8423 (print), 1943-0930 (electronic)",
  ISSN-L =       "0036-8423",
  bibdate =      "Sat Mar 03 15:27:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/crandall-richard-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/4012633",
  acknowledgement = ack-nhfb,
  fjournal =     "Science News (Washington, DC)",
  journal-URL =  "http://www.jstor.org/journals/00368423.html;
                 http://www.sciencenews.org/view/archives;
                 http://www3.interscience.wiley.com/journal/122396840/home",
  keywords =     "Richard E. Crandall",
  remark =       "See \cite{Bailey:2001:RCF} for the research discussed
                 by Peterson.",
}

@Article{Probert:2001:CAN,
  author =       "M. I. J. Probert",
  title =        "Comment on {``Algorithm for normal random numbers''}",
  journal =      j-PHYS-REV-E,
  volume =       "63",
  pages =        "058701",
  month =        apr,
  year =         "2001",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.63.058701",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Feb 24 17:59:26 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Fernandez:1999:ANRb} and reply
                 \cite{Fernandez:2001:RCA}.",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.63.058701",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  issue =        "5",
  journal-URL =  "http://pre.aps.org/browse",
  numpages =     "2",
}

@Book{RAND:2001:MRD,
  author =       "{RAND Corporation}",
  title =        "A Million Random Digits With 100,000 Normal Deviates",
  publisher =    "RAND Corporation",
  address =      "Santa Monica, CA, USA",
  pages =        "xxv + 400 + 200",
  year =         "2001",
  ISBN =         "0-8330-3047-7",
  ISBN-13 =      "978-0-8330-3047-4",
  LCCN =         "QA276.25 .M55 2001",
  bibdate =      "Sat Aug 23 07:58:03 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See also \cite{RAND:1955:MRD}.",
  URL =          "http://www.rand.org/content/dam/rand/pubs/monograph_reports/2005/digits.txt.zip;
                 http://www.rand.org/pubs/monograph_reports/MR1418.html",
  abstract =     "Not long after research began at RAND in 1946, the
                 need arose for random numbers that could be used to
                 solve problems of various kinds of experimental
                 probability procedures. These applications, called
                 Monte Carlo methods, required a large supply of random
                 digits and normal deviates of high quality, and the
                 tables presented here were produced to meet those
                 requirements. This book was a product of RAND's
                 pioneering work in computing, as well a testament to
                 the patience and persistence of researchers in the
                 early days of RAND. The tables of random numbers in
                 this book have become a standard reference in
                 engineering and econometrics textbooks and have been
                 widely used in gaming and simulations that employ Monte
                 Carlo trials. Still the largest published source of
                 random digits and normal deviates, the work is
                 routinely used by statisticians, physicists,
                 polltakers, market analysts, lottery administrators,
                 and quality control engineers. A 2001 article in the
                 New York Times on the value of randomness featured the
                 original edition of the book, published in 1955 by the
                 Free Press. The rights have since reverted to RAND, and
                 in this digital age, we thought it appropriate to
                 reissue a new edition of the book in its original
                 format, with a new foreword by Michael D. Rich, RAND's
                 Executive Vice President.",
  acknowledgement = ack-nhfb,
  remark =       "See \cite{Brown:1949:HRR,Brown:1951:HRR} for a
                 description of how the random digits were produced.
                 Curiously, even though numbers are not subject to
                 copyright or patents, the RAND Corporation regards the
                 collection as proprietary: see the Web site
                 \url{http://hcoop.net/~ntk/random/}. The digits
                 themselves are available in the ZIP file given in the
                 URL field.",
}

@Article{Raqab:2001:ELS,
  author =       "Mohammad M. Raqab and M. Ahsanullah",
  title =        "Estimation of the location and scale parameters of
                 generalized exponential distribution based on order
                 statistics",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "69",
  number =       "2",
  pages =        "109--123",
  year =         "2001",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949650108812085",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:12:04 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Manual{Rukhin:2001:STS,
  author =       "Andrew Rukhin and Juan Soto and James Nechvatal and
                 Miles Smid and Elaine Barker and Stefan Leigh and Mark
                 Levenson and Mark Vangel and David Banks and Alan
                 Heckert and James Dray and San Vo",
  title =        "A Statistical Test Suite For Random and Pseudorandom
                 Number Generators for Cryptographic Applications",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  pages =        "xi + 153",
  month =        apr,
  year =         "2001",
  bibdate =      "Tue Apr 19 15:40:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "NIST Special Publication 800-22, with revisions dated
                 May 15, 2001.",
  URL =          "http://csrc.nist.gov/rng/rng2.html;
                 http://csrc.nist.gov/rng/SP800-22b.pdf;
                 http://csrc.nist.gov/rng/sts-1.5.tar;
                 http://csrc.nist.gov/rng/sts.data.tar;
                 http://csrc.nist.gov/rng/StsGui.zip;
                 http://www.cs.sunysb.edu/~algorith/implement/rng/distrib/SP800-22b.pdf;
                 http://www.dtic.mil/dtic/tr/fulltext/u2/a393366.pdf",
  abstract =     "This paper discusses some aspects of selecting and
                 testing random and pseudorandom number generators. The
                 outputs of such generators may be used in many
                 cryptographic applications, such as the generation of
                 key material. Generators suitable for use in
                 cryptographic applications may need to meet stronger
                 requirements than for other applications. In
                 particular, their outputs must be unpredictable in the
                 absence of knowledge of the inputs. Some criteria for
                 characterizing and selecting appropriate generators are
                 discussed in this document. The subject of statistical
                 testing and its relation to cryptanalysis is also
                 discussed, and some recommended statistical tests are
                 provided. These tests may be useful as a first step in
                 determining whether or not a generator is suitable for
                 a particular cryptographic application. However, no set
                 of statistical tests can absolutely certify a generator
                 as appropriate for usage in a particular application,
                 i.e., statistical testing cannot serve as a substitute
                 for cryptanalysis. The design and cryptanalysis of
                 generators is outside the scope of this paper.",
  acknowledgement = ack-nhfb,
  keywords =     "hypothesis test; P-value; random number generator",
}

@Article{Rukhin:2001:TRS,
  author =       "A. L. Rukhin",
  title =        "Testing Randomness: a Suite of Statistical
                 Procedures",
  journal =      j-THEORY-PROBAB-APPL,
  volume =       "45",
  number =       "1",
  pages =        "111--132",
  month =        mar,
  year =         "2001",
  CODEN =        "TPRBAU",
  DOI =          "https://doi.org/10.1137/S0040585X97978087",
  ISSN =         "0040-585X (print), 1095-7219 (electronic)",
  ISSN-L =       "0040-585X",
  bibdate =      "Tue Apr 1 10:42:33 MDT 2014",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/TVP/45/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/97808",
  acknowledgement = ack-nhfb,
  ajournal =     "Theory Probab. Appl.",
  fjournal =     "Theory of Probability and its Applications",
  journal-URL =  "http://epubs.siam.org/tvp",
  onlinedate =   "January 2001",
  xxauthor =     "A. L. Ruhkin",
}

@Article{Schindler:2001:EOT,
  author =       "W. Schindler",
  title =        "Efficient Online Tests for True Random Number
                 Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2162",
  pages =        "103--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:06:06 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620103.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2162/21620103.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@TechReport{Shackleford:2001:FIN,
  author =       "Barry Shackleford and Motoo Tanaka and Richard J.
                 Carter and Greg Snider",
  title =        "{FPGA} implementation of neighborhood-of-four cellular
                 automata random number generators",
  type =         "Technical report",
  number =       "??",
  institution =  "HP Labs",
  address =      "????",
  year =         "2001",
  bibdate =      "Thu Feb 23 08:56:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shaltiel:2001:SEA,
  author =       "Ronen Shaltiel and Christopher Umans",
  title =        "Simple extractors for all min-entropies and a new
                 pseudo-random generator",
  crossref =     "IEEE:2001:ISF",
  pages =        "648--657",
  year =         "2001",
  bibdate =      "Fri Feb 22 06:31:27 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shparlinski:2001:LCN,
  author =       "Igor E. Shparlinski and Joseph H. Silverman",
  title =        "On the Linear Complexity of the {Naor--Reingold}
                 Pseudo-random Function from Elliptic Curves",
  journal =      j-DESIGNS-CODES-CRYPTOGR,
  volume =       "24",
  number =       "3",
  pages =        "279--289",
  month =        dec,
  year =         "2001",
  CODEN =        "DCCREC",
  ISSN =         "0925-1022 (print), 1573-7586 (electronic)",
  ISSN-L =       "0925-1022",
  bibdate =      "Sun Nov 18 08:15:28 MST 2001",
  bibsource =    "http://www.wkap.nl/issuetoc.htm/0925-1022+24+3+2001;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.wkap.nl/oasis.htm/356536",
  acknowledgement = ack-nhfb,
  fjournal =     "Designs, codes, and cryptography",
  journal-URL =  "http://link.springer.com/journal/10623",
}

@Article{Shujun:2001:PRB,
  author =       "L. Shujun and M. Xuanqin and C. Yuanlong",
  title =        "Pseudo-random Bit Generator Based on Couple Chaotic
                 Systems and Its Applications in Stream-Cipher
                 Cryptography",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2247",
  pages =        "316--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:07:31 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470316.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2247/22470316.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Soubusta:2001:QRN,
  author =       "Jan Soubusta and Ondrej Haderka and Martin Hendrych",
  editor =       "Jan {Perina, Sr.} and Miroslav Hrabovsky and Jaromir
                 Krepelka",
  title =        "Quantum random number generator",
  journal =      j-PROC-SPIE,
  volume =       "4356",
  number =       "1",
  pages =        "54--60",
  year =         "2001",
  CODEN =        "PSISDG",
  DOI =          "https://doi.org/10.1117/12.417868",
  ISSN =         "0277-786X (print), 1996-756X (electronic)",
  ISSN-L =       "0277-786X",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "12th Czech-Slovak-Polish Optical Conference on Wave
                 and Quantum Aspects of Contemporary Optics.",
  URL =          "http://link.aip.org/link/?PSI/4356/54/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the SPIE --- The International Society
                 for Optical Engineering",
  keywords =     "true random numbers from physical sources",
  location =     "Velke Losiny, Czech Republic",
}

@Article{Stojanovski:2001:CBRa,
  author =       "T. Stojanovski and L. Kocarev",
  title =        "Chaos-based random number generators-part {I}:
                 analysis [cryptography]",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST-I-FUNDAM-THEORY-APPL,
  volume =       "48",
  number =       "3",
  pages =        "281--288",
  month =        mar,
  year =         "2001",
  CODEN =        "ITCAEX",
  DOI =          "https://doi.org/10.1109/81.915385",
  ISSN =         "1057-7122 (print), 1558-1268 (electronic)",
  ISSN-L =       "1057-7122",
  bibdate =      "Thu Feb 23 09:01:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems I:
                 Fundamental Theory and Application",
}

@Article{Stojanovski:2001:CBRb,
  author =       "T. Stojanovski and J. Pil and L. Kocarev",
  title =        "Chaos-based random number generators. {Part II}:
                 practical realization",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST-I-FUNDAM-THEORY-APPL,
  volume =       "48",
  number =       "3",
  pages =        "382--385",
  month =        mar,
  year =         "2001",
  CODEN =        "ITCAEX",
  DOI =          "https://doi.org/10.1109/81.915396",
  ISSN =         "1057-7122 (print), 1558-1268 (electronic)",
  ISSN-L =       "1057-7122",
  bibdate =      "Thu Feb 23 08:58:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Circuits and Systems I:
                 Fundamental Theory and Application",
  keywords =     "true random numbers from physical sources",
}

@Article{Sudan:2001:PGX,
  author =       "Madhu Sudan and Luca Trevisan and Salil Vadhan",
  title =        "Pseudorandom Generators without the {XOR} Lemma",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "62",
  number =       "2",
  pages =        "236--266",
  month =        mar,
  year =         "2001",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1006/jcss.2000.1730",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Sat Mar 17 07:28:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022000000917306",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Swartz:2001:NTR,
  author =       "Ray Swartz",
  title =        "A New Twist on Random Number Generators",
  journal =      j-LOGIN,
  volume =       "26",
  number =       "1",
  pages =        "46--48",
  month =        feb,
  year =         "2001",
  CODEN =        "LOGNEM",
  ISSN =         "1044-6397 (print), 2169-9364 (electronic)",
  bibdate =      "Tue Apr 11 10:45:51 MDT 2006",
  bibsource =    "http://www.usenix.org/publications/login/2001-02/index.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
  URL =          "http://www.usenix.org/publications/login/2001-02/pdfs/swartz.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     ";login: the USENIX Association newsletter",
}

@Article{Talim:2001:CRW,
  author =       "J. Talim and Z. Liu and Ph. Nain and E. G. {Coffman,
                 Jr.}",
  title =        "Controlling the robots of {Web} search engines",
  journal =      j-SIGMETRICS,
  volume =       "29",
  number =       "1",
  pages =        "236--244",
  month =        jun,
  year =         "2001",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/378420.378788",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:34:55 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "Robots are deployed by a Web search engine for
                 collecting information from different Web servers in
                 order to maintain the currency of its data base of Web
                 pages. In this paper, we investigate the number of
                 robots to be used by a search engine so as to maximize
                 the currency of the data base without putting an
                 unnecessary load on the network. We adopt a
                 finite-buffer queueing model to represent the system.
                 The arrivals to the queueing system are Web pages
                 brought by the robots; service corresponds to the
                 indexing of these pages. Good performance requires that
                 the number of robots, and thus the arrival rate of the
                 queueing system, be chosen so that the indexing queue
                 is rarely starved or saturated. Thus, we formulate a
                 multi-criteria stochastic optimization problem with the
                 loss rate and empty-buffer probability being the
                 criteria. We take the common approach of reducing the
                 problem to one with a single objective that is a linear
                 function of the given criteria. Both static and dynamic
                 policies can be considered. In the static setting the
                 number of robots is held fixed; in the dynamic setting
                 robots may be re-activated/de-activated as a function
                 of the state. Under the assumption that arrivals form a
                 Poisson process and that service times are independent
                 and exponentially distributed random variables, we
                 determine an optimal decision rule for the dynamic
                 setting, i.e., a rule that varies the number of robots
                 in such a way as to minimize a given linear function of
                 the loss rate and empty-buffer probability. Our results
                 are compared with known results for the static case. A
                 numerical study indicates that substantial gains can be
                 achieved by dynamically controlling the activity of the
                 robots.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
  keywords =     "Markov decision process; queues; web robots; Web
                 search engines",
}

@Article{Tan:2001:PPR,
  author =       "Chih Jeng Kenneth Tan",
  title =        "On Parallel Pseudo-Random Number Generation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2073",
  pages =        "589--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:04:28 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2073.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2073/20730589.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2073/20730589.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Tang:2001:SAS,
  author =       "Hui-Chin Tang",
  title =        "A statistical analysis of the screening measure of
                 multiple recursive random number generators of orders
                 one and two",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "71",
  number =       "4",
  pages =        "345--356",
  month =        "????",
  year =         "2001",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949650108812153",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:25:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949650108812153",
  abstract =     "This paper presents the results of a comprehensive
                 empirical analysis of the screening measure of multiple
                 recursive generators (MRGs) of orders one and two. Two
                 kinds of screening measures are distinguished: spectral
                 test and lattice test. With regard to these screening
                 measures, two exhaustive searches of the twenty best
                 MRGs of orders one and two are conducted. Some
                 empirical comparisons reveal that the screening
                 procedure with maximum spectral value criterion is
                 preferred in terms of efficiency and thus, is a good
                 way of obtaining ideal MRGs of higher orders. Several
                 extensively tested second-order MRGs are also presented
                 and are therefore recommended.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "20 Mar 2007",
}

@MastersThesis{Touzin:2001:GRM,
  author =       "Ren{\'e}e Touzin",
  title =        "Des g{\'e}n{\'e}rateurs r{\'e}cursifs multiples
                 combin{\'e}s rapides avec des coefficients de la forme
                 $ \pm 2^{p_1} \pm 2^{p_2} $. ({French}) [{Fast}
                 combined multiple recursive generators of the form $
                 \pm 2^{p_1} \pm 2^{p_2} $ ]",
  type =         "Th{\`e}se ({M.Sc.})",
  school =       "D{\'e}partement d'informatique et de recherche
                 op{\'e}rationnelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, QC, Canada",
  pages =        "xiii + 128",
  year =         "2001",
  bibdate =      "Fri Mar 09 11:41:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "M{\'e}moire pr{\'e}sent{\'e} {\`a} la facult{\'e} des
                 {\'e}tudes sup{\'e}rieures en vue de l'obtention du
                 grade de Ma{\^\i}tre {\`e}s sciences (M.Sc.) en
                 informatique option recherche op{\'e}rationnelle",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Article{Trevisan:2001:EPG,
  author =       "Luca Trevisan",
  title =        "Extractors and pseudorandom generators",
  journal =      j-J-ACM,
  volume =       "48",
  number =       "4",
  pages =        "860--879",
  month =        jul,
  year =         "2001",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/502090.502099",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 1 16:42:49 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We introduce a new approach to constructing
                 extractors. Extractors are algorithms that transform a
                 `weakly random' distribution into an almost uniform
                 distribution. Explicit constructions of extractors have
                 a variety of important applications, and tend to be
                 very difficult to obtain. We demonstrate an unsuspected
                 connection between extractors and pseudorandom
                 generators. In fact, we show that every pseudorandom
                 generator of a certain kind is an extractor. A
                 pseudorandom generator construction due to Impagliazzo
                 and Wigderson, once reinterpreted via our connection,
                 is already an extractor that beats most known
                 constructions and solves an important open question. We
                 also show that, using the simpler Nisan--Wigderson
                 generator and standard error-correcting codes, one can
                 build even better extractors with the additional
                 advantage that both the construction and the analysis
                 are simple and admit a short self-contained
                 description.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@PhdThesis{Tu:2001:NFG,
  author =       "Shu-Ju Tu",
  title =        "A new formalism for geometric probability and its
                 applications to physics",
  type =         "{Ph.D.} thesis",
  school =       "Purdue University",
  address =      "West Lafayette, IN",
  pages =        "179",
  year =         "2001",
  ISBN =         "0-493-96014-7",
  ISBN-13 =      "978-0-493-96014-2",
  bibdate =      "Tue Jan 17 21:58:14 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We present a new mathematical formalism for
                 analytically obtaining the probability density
                 function, $ P_n(s) $, of the random distance $s$
                 separated by two random points distributed in a
                 geometric object defined in $n$-dimensional Euclidean
                 space. The formalism allows us to calculate $ P_n(s) $
                 for a spherical geometric object in $n$ dimensions
                 having an arbitrary non-uniform density, and reproduces
                 the well-known results for the case of uniform density.
                 The results find applications in elementary particle
                 physics, statistical physics, computational science,
                 molecular biology, geostatistics, and stochastic
                 geometry.",
  acknowledgement = ack-nhfb,
  advisor =      "Ephraim Fischbach.",
}

@Article{Vadhan:2001:OP,
  author =       "Salil P. Vadhan",
  title =        "Order in Pseudorandomness",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2129",
  pages =        "10--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:05:30 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2129.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2129/21290010.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2129/21290010.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Vanura:2001:ARC,
  author =       "T. Vanura",
  title =        "Algorithm for randomize [sic] choice from random
                 digits",
  crossref =     "Schueller:2001:MCS",
  pages =        "41--45",
  year =         "2001",
  bibdate =      "Sat Feb 18 22:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Watkins:2001:ERN,
  author =       "R. K. Watkins and J. C. Isaacs and S. Y. Foo",
  title =        "Evolvable random number generators: a schemata-based
                 approach",
  crossref =     "Spector:2001:GPG",
  pages =        "469--473",
  year =         "2001",
  bibdate =      "Thu Feb 23 09:17:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Wegenkittl:2001:GTP,
  author =       "Stefan Wegenkittl",
  title =        "Gambling Tests for Pseudorandom Number Generators",
  journal =      j-MATH-COMP-SIM,
  volume =       "55",
  number =       "1--3",
  pages =        "281--288",
  day =          "15",
  month =        feb,
  year =         "2001",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(00)00271-8",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Sat Mar 03 08:49:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475400002718",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{Wu:2001:RNG,
  author =       "Pei-Chi Wu",
  title =        "Random number generation with primitive pentanomials",
  journal =      j-TOMACS,
  volume =       "11",
  number =       "4",
  pages =        "346--351",
  month =        oct,
  year =         "2001",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:42 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Agarwal:2002:FPN,
  author =       "R. C. Agarwal and R. F. Enenkel and F. G. Gustavson
                 and A. Kothari and M. Zubair",
  title =        "Fast pseudorandom-number generators with modulus $ 2^k
                 $ or $ 2^{k - 1} $ using fused multiply--add",
  journal =      j-IBM-JRD,
  volume =       "46",
  number =       "1",
  pages =        "97--116",
  month =        jan,
  year =         "2002",
  CODEN =        "IBMJAE",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Mon Mar 18 17:27:08 MST 2002",
  bibsource =    "http://www.research.ibm.com/journal/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.research.ibm.com/journal/rd/461/agarwal.html;
                 http://www.research.ibm.com/journal/rd/461/agarwal.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
  ordernumber =  "G322-0230",
}

@Manual{Anonymous:2002:AWG,
  author =       "Anonymous",
  title =        "Additive white {Gaussian} noise ({AWGN}) core",
  organization = "Xilinx, Inc.",
  address =      "San Jose, CA, USA",
  pages =        "5",
  day =          "30",
  month =        oct,
  year =         "2002",
  bibdate =      "Thu Nov 24 09:18:15 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.xilinx.com/support/documentation/ip_documentation/awgn.pdf",
  acknowledgement = ack-nhfb,
  remark =       "Discontinued product.",
}

@Misc{Anonymous:2002:EEG,
  author =       "Anonymous",
  title =        "{EGD (Entropy Gathering Daemon)}",
  howpublished = "Web site.",
  day =          "1",
  month =        apr,
  year =         "2002",
  bibdate =      "Sat Dec 24 11:51:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://everything2.com/title/EGD",
  acknowledgement = ack-nhfb,
  keywords =     "EGD (Entropy Gathering Daemon); true random numbers
                 from physical sources",
  remark =       "From the site: ``It works be executing various
                 programs on the system, like vmstat and df, and then
                 combining it into a pool which is mixed using
                 SHA-1.''",
}

@Article{Bailey:2002:RGN,
  author =       "David H. Bailey and Richard E. Crandall",
  title =        "Random Generators and Normal Numbers",
  journal =      j-EXP-MATH,
  volume =       "11",
  number =       "4",
  pages =        "527--546",
  month =        "????",
  year =         "2002",
  CODEN =        "????",
  ISSN =         "1058-6458 (print), 1944-950X (electronic)",
  ISSN-L =       "1058-6458",
  bibdate =      "Mon Mar 5 10:25:56 MST 2012",
  bibsource =    "http://projecteuclid.org/euclid.em;
                 https://www.math.utah.edu/pub/tex/bib/expmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.em/1057864662",
  acknowledgement = ack-nhfb,
  fjournal =     "Experimental Mathematics",
  journal-URL =  "http://www.tandfonline.com/loi/uexm20",
}

@Book{Binder:2002:MCS,
  author =       "K. (Kurt) Binder and Dieter W. Heermann",
  title =        "{Monte Carlo} simulation in statistical physics: an
                 introduction",
  volume =       "80",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "xii + 180",
  year =         "2002",
  ISBN =         "3-540-43221-3",
  ISBN-13 =      "978-3-540-43221-0",
  ISSN =         "0171-1873",
  ISSN-L =       "0171-1873",
  LCCN =         "QC174.85.M64 B56 2002",
  bibdate =      "Sat Feb 8 18:03:14 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in solid-state sciences",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003537870-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003537870-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Monte Carlo method; Statistical physics; Random walks
                 (Mathematics)",
}

@Article{Brattka:2002:RNI,
  author =       "Vasco Brattka",
  title =        "Random Numbers and an Incomplete Immune Recursive
                 Set",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2380",
  pages =        "950--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:10:00 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2380.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2380/23800950.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2380/23800950.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Misc{Brent:2002:SUN,
  author =       "Richard P. Brent",
  title =        "Some uniform and normal random number generators, {\tt
                 ranut} version 1.03 ({January 2002}) and {\tt xorgens}
                 version 2.01 ({August 2004})",
  howpublished = "Web site",
  month =        jan,
  year =         "2002",
  bibdate =      "Sat Dec 24 12:09:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.comlab.ox.ac.uk/oucl/work/richard.brent/random.html",
  acknowledgement = ack-nhfb,
}

@Book{Brillhart:2002:FHP,
  author =       "John Brillhart and D. H. Lehmer and J. L. Selfridge
                 and Bryant Tuckerman and S. S. {Wagstaff, Jr.}",
  title =        "Factorizations of $ b^n \pm 1 $, $ b = 2, 3, 5, 6, 7,
                 10, 11, 12 $ up to high powers",
  volume =       "22",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  edition =      "Third",
  pages =        "????",
  year =         "2002",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0271-4132 (print), 1098-3627 (electronic)",
  ISSN-L =       "0271-4132",
  LCCN =         "QA161.F3 F33 2002",
  bibdate =      "Sat Mar 10 10:18:16 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Contemporary mathematics",
  acknowledgement = ack-nhfb,
  remark =       "Factorizations of the form in the title are of
                 interest for simplifying computations in the
                 determination of optimal parameters for linear and
                 multiplicative congruential generators.",
  remark-2 =     "I cannot find this in most library catalogs, or at the
                 publisher Web site, or in the MathSciNet database. No
                 ISBN or page count can be found either.",
  subject =      "factors (algebra); tables",
}

@Article{Cameron:2002:HDM,
  author =       "Craig W. Cameron and Steven H. Low and David X. Wei",
  title =        "High-density model for server allocation and
                 placement",
  journal =      j-SIGMETRICS,
  volume =       "30",
  number =       "1",
  pages =        "152--159",
  month =        jun,
  year =         "2002",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/511334.511354",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:38:22 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "It is well known that optimal server placement is
                 NP-hard. We present an approximate model for the case
                 when both clients and servers are dense, and propose a
                 simple server allocation and placement algorithm based
                 on high-rate vector quantization theory. The key idea
                 is to regard the location of a request as a random
                 variable with probability density that is proportional
                 to the demand at that location, and the problem of
                 server placement as source coding, i.e., to optimally
                 map a source value (request location) to a code-word
                 (server location) to minimize distortion (network
                 cost). This view has led to a joint server allocation
                 and placement algorithm that has a time-complexity that
                 is linear in the number of clients. Simulations are
                 presented to illustrate its performance.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
  keywords =     "content distribution; high density; server placement
                 and allocation",
}

@Article{Choe:2002:FRT,
  author =       "Geon Ho Choe and Dong Han Kim",
  title =        "The first return time test of pseudorandom numbers",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "143",
  number =       "2",
  pages =        "263--274",
  day =          "15",
  month =        jun,
  year =         "2002",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(01)00510-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042701005106",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Book{Churchhouse:2002:CCJ,
  author =       "Robert F. Churchhouse",
  title =        "Codes and Ciphers: {Julius Caesar}, the {Enigma}, and
                 the {Internet}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 240",
  year =         "2002",
  ISBN =         "0-521-81054-X (hardcover), 0-521-00890-5 (paperback)",
  ISBN-13 =      "978-0-521-81054-8 (hardcover), 978-0-521-00890-7
                 (paperback)",
  LCCN =         "Z103 .C48 2002",
  bibdate =      "Tue Apr 02 15:05:50 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$55.00 (hardcover), US\$20.00 (paperback)",
  acknowledgement = ack-nhfb,
  keywords =     "ciphers; cryptography",
  subject =      "Cryptography; Ciphers",
  tableofcontents = "Chapter 1. Introduction 1 \\
                 Some aspects of secure communication 1 \\
                 Julius Caesar's cipher 2 \\
                 Some basic definitions 3 \\
                 Three stages to decryption identification, breaking and
                 setting 4 \\
                 Codes and ciphers 5 \\
                 Assessing the strength of a cipher system 7 \\
                 Error detecting and correcting codes 8 \\
                 Other methods of concealing messages 9 \\
                 Modular arithmetic 10 \\
                 Modular addition and subtraction of letters 11 \\
                 Gender 11 \\
                 End matter 12 \\
                 Chapter 2. From Julius Caesar to simple substitution 13
                 \\
                 Julius Caesar ciphers and their solution 13 \\
                 Simple substitution ciphers 15 \\
                 How to solve a simple substitution cipher 17 \\
                 Letter frequencies in languages other than English 24
                 \\
                 How many letters are needed to solve a simple
                 substitution cipher? 26 \\
                 Chapter 3. Polyalphabetic systems 28 \\
                 Strengthening Julius Caesar Vigen{\'e}re ciphers 28 \\
                 How to solve a Vigen{\'e}re cipher 30 \\
                 Indicators 33 \\
                 Depths 34 \\
                 Recognising `depths' 34 \\
                 How much text do we need to solve a Vigen{\'e}re
                 cipher? 37 \\
                 Jefferson's cylinder 37 \\
                 Chapter 4. Jigsaw ciphers 40 \\
                 Transpositions 40 \\
                 Simple transposition 40 \\
                 Double transposition 44 \\
                 Other forms of transposition 48 \\
                 Assessment of the security of transposition ciphers 51
                 \\
                 Double encipherment in general 52 \\
                 Chapter 5. Two-letter ciphers 54 \\
                 Monograph to digraph 54 \\
                 MDTM ciphers 56 \\
                 Digraph to digraph 58 \\
                 Playfair encipherment 59 \\
                 Playfair decipherment 60 \\
                 Cryptanalytic aspects of Playfair 61 \\
                 Double Playfair 61 \\
                 Chapter 6. Codes 64 \\
                 Characteristics of codes 64 \\
                 One part and two-part codes 65 \\
                 Code plus additive 67 \\
                 Chapter 7. Ciphers for spies 72 \\
                 Stencil ciphers 73 \\
                 Book ciphers 75 \\
                 Letter frequencies in book ciphers 79 \\
                 Solving a book cipher 79 \\
                 Indicators 86 \\
                 Disastrous errors in using a book cipher 86 \\
                 {`Garbo'}'s ciphers 88 \\
                 One-time pad 92 \\
                 Chapter 8. Producing random numbers and letters 94 \\
                 Random sequences 94 \\
                 Producing random sequences 95 \\
                 Coin spinning 95 \\
                 Throwing dice 96 \\
                 Lottery type draws 97 \\
                 Cosmic rays 97 \\
                 Amplifier noise 97 \\
                 Pseudo-random sequences 98 \\
                 Linear recurrences 99 \\
                 Using a binary stream of key for encipherment 100 \\
                 Binary linear sequences as key generators 101 \\
                 Cryptanalysis of a linear recurrence 104 \\
                 Improving the security of binary keys 104 \\
                 Pseudo-random number generators 106 \\
                 The mid-square method 106 \\
                 Linear congruential generators 107 \\
                 Chapter 9. The Enigma cipher machine 110 \\
                 Historical background 110 \\
                 The original Enigma 112 \\
                 Encipherment using wired wheels 116 \\
                 Encipherment by the Enigma 118 \\
                 The Enigma plugboard 121 \\
                 The Achilles heel of the Enigma 121 \\
                 The indicator `chains' in the Enigma 125 \\
                 Aligning the chains 128 \\
                 Identifying RI and its setting 128 \\
                 Doubly-enciphered Enigma messages 132 \\
                 The Abwehr Enigma 132 \\
                 Chapter 10. The Hagelin cipher machine 133 \\
                 Historical background 133 \\
                 Structure of the Hagelin machine 134 \\
                 Encipherment on the Hagelin 135 \\
                 Choosing the cage for the Hagelin 138 \\
                 The theoretical `work factor' for the Hagelin 142 \\
                 Solving the Hagelin from a stretch of keys 143 \\
                 Additional features of the Hagelin machine 147 \\
                 The slide 147 \\
                 Identifying the slide in a cipher message 148 \\
                 Overlapping 148 \\
                 Solving the Hagelin from cipher texts only 150 \\
                 Chapter 11. Beyond the Enigma 153 \\
                 The SZ42: a pre-electronic machine 153 \\
                 Description of the 742 machine 155 \\
                 Encipherment on the SZ42 155 \\
                 Breaking and setting the 5Z42 158 \\
                 Modifications to the SZ42 159 \\
                 Chapter 12. Public key cryptography 161 \\
                 Historical background 161 \\
                 Security issues 163 \\
                 Protection of programs and data 163 \\
                 Encipherment of programs, data and messages 164 \\
                 The key distribution problem 166 \\
                 The Diffie-Hellman key exchange system 166 \\
                 Strength of the Diffie-Hellman system 168 \\
                 Chapter 13. Encipherment and the Internet 170 \\
                 Generalisation of simple substitution 170 \\
                 Factorisation of large integers 171 \\
                 The standard method of factorisation 172 \\
                 Fermat's ``Little Theorem'' 174 \\
                 The Fermat-Euler Theorem (as needed in the RSA system)
                 175 \\
                 Encipherment and decipherment keys in the RSA system
                 175 \\
                 The encipherment and decipherment processes in the RSA
                 system 178 \\
                 How does the key-owner reply to correspondents? 182 \\
                 The Data Encryption Standard (DES) 183 \\
                 Security of the DES 184 \\
                 Chaining 186 \\
                 Implementation of the DES 186 \\
                 Using both RSA and DES 186 \\
                 A salutary note 187 \\
                 Beyond the DES 187 \\
                 Authentication and signature verification 188 \\
                 Elliptic curve cryptography 189 \\
                 Appendix 190 \\
                 Solutions to problems 218 \\
                 References 230 \\
                 Name index 235 \\
                 Subject index 237.",
}

@Book{Delfs:2002:ICP,
  author =       "Hans Delfs and Helmut Knebl",
  title =        "Introduction to Cryptography: Principles and
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 310",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-3-642-87126-9",
  ISBN =         "3-642-87126-7 (e-book), 3-642-87128-3",
  ISBN-13 =      "978-3-642-87126-9 (e-book), 978-3-642-87128-3",
  ISSN =         "1619-7100 (print), 2197-845X (electronic)",
  ISSN-L =       "1619-7100",
  LCCN =         "QA76.9.A25",
  bibdate =      "Sat Jun 10 08:35:18 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Information Security and Cryptography",
  URL =          "http://www.springerlink.com/content/978-3-642-87126-9",
  abstract =     "Due to the rapid growth of digital communication and
                 electronic data exchange, information security has
                 become a crucial issue in industry, business, and
                 administration. Modern cryptography provides essential
                 techniques for securing information and protecting
                 data. In the first part, this book covers the key
                 concepts of cryptography on an undergraduate level,
                 from encryption and digital signatures to cryptographic
                 protocols. Essential techniques are demonstrated in
                 protocols for key exchange, user identification,
                 electronic elections and digital cash. In the second
                 part, more advanced topics are addressed, such as the
                 bit security of one-way functions and computationally
                 perfect pseudorandom bit generators. The security of
                 cryptographic schemes is a central topic. Typical
                 examples of provably secure encryption and signature
                 schemes and their security proofs are given. Though
                 particular attention is given to the mathematical
                 foundations, no special background in mathematics is
                 presumed. The necessary algebra, number theory and
                 probability theory are included in the appendix. Each
                 chapter closes with a collection of exercises. The
                 second edition contains corrections, revisions and new
                 material, including a complete description of the AES,
                 an extended section on cryptographic hash functions, a
                 new section on random oracle proofs, and a new section
                 on public-key encryption schemes that are provably
                 secure against adaptively-chosen-ciphertext attacks.",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Data encryption (Computer science);
                 Coding theory; Coding theory; Computer science; Data
                 encryption (Computer science)",
  tableofcontents = "1. Introduction \\
                 1.1 Encryption and Secrecy \\
                 1.2 The Objectives of Cryptography \\
                 1.3 Attacks \\
                 1.4 Cryptographic Protocols \\
                 1.5 Provable Security \\
                 2. Symmetric-Key Encryption \\
                 2.1 Stream Ciphers \\
                 2.2 Block Ciphers \\
                 3. Public-Key Cryptography \\
                 3.1 The Concept of Public-Key Cryptography \\
                 3.2 Modular Arithmetic \\
                 3.3 RSA \\
                 3.4 Hash Functions \\
                 3.5 The Discrete Logarithm \\
                 3.6 Modular Squaring \\
                 4. Cryptographic Protocols \\
                 4.1 Key Exchange and Entity Authentication \\
                 4.2 Identification Schemes \\
                 4.3 Commitment Schemes \\
                 4.4 Electronic Elections \\
                 4.5 Digital Cash \\
                 5. Probabilistic Algorithms \\
                 5.1 Coin-Tossing Algorithms \\
                 5.2 Monte Carlo and Las Vegas Algorithms \\
                 6. One-Way Functions and the Basic Assumptions \\
                 6.1 A Notation for Probabilities \\
                 6.2 Discrete Exponential Function \\
                 6.3 Uniform Sampling Algorithms \\
                 6.4 Modular Powers \\
                 6.5 Modular Squaring \\
                 6.6 Quadratic Residuosity Property \\
                 6.7 Formal Definition of One-Way Functions \\
                 6.8 Hard-Core Predicates \\
                 7. Bit Security of One-Way Functions \\
                 7.1 Bit Security of the Exp Family \\
                 7.2 Bit Security of the RSA Family \\
                 7.3 Bit Security of the Square Family \\
                 8. One-Way Functions and Pseudorandomness \\
                 8.1 Computationally Perfect Pseudorandom Bit Generators
                 \\
                 8.2 Yao's Theorem \\
                 9. Provably Secure Encryption \\
                 9.1 Classical Information-Theoretic Security \\
                 9.2 Perfect Secrecy and Probabilistic Attacks \\
                 9.3 Public-Key One-Time Pads \\
                 9.4 Computationally Secret Encryption Schemes \\
                 9.5 Unconditional Security of Cryptosystems \\
                 10. Provably Secure Digital Signatures \\
                 10.1 Attacks and Levels of Security \\
                 10.2 Claw-Free Pairs and Collision-Resistant Hash
                 Functions \\
                 10.3 Authentication-Tree-Based Signatures \\
                 10.4 A State-Free Signature Scheme \\
                 A. Algebra and Number Theory \\
                 A.1 The Integers \\
                 A.2 Residues \\
                 A.3 The Chinese Remainder Theorem \\
                 A.4 Primitive Roots and the Discrete Logarithm \\
                 A.5 Quadratic Residues \\
                 A.6 Modular Square Roots \\
                 A.7 Primes and Primality Tests \\
                 B. Probabilities and Information Theory \\
                 B.1 Finite Probability Spaces and Random Variables \\
                 B.2 The Weak Law of Large Numbers \\
                 B.3 Distance Measures \\
                 B.4 Basic Concepts of Information Theory \\
                 References",
}

@Article{DeMatteis:2002:PP,
  author =       "A. {De Matteis} and S. Pagnutti",
  title =        "Pseudorandom permutation",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "142",
  number =       "2",
  pages =        "367--375",
  day =          "15",
  month =        may,
  year =         "2002",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(01)00425-3",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042701004253",
  abstract =     "A number-theoretical approach to the permutation of a
                 sequence of objects performed by means of a linear
                 congruential generator of pseudorandom numbers is
                 presented. A sufficient condition is found for
                 obtaining permutations with the property that each
                 object definitely abandons its initial position. Since
                 cryptography is among the possible applications, the
                 generator performing the inverse transformation is also
                 given.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "congruential generators; cryptography;
                 multiplicative-additive generators; pseudorandom
                 numbers; random permutation; shuffling, inverse
                 permutation",
}

@TechReport{Deng:2002:DSI,
  author =       "L.-Y. Deng and H. Xu",
  title =        "Design, search, and implementation of
                 high-dimensional, efficient, long-cycle, and portable
                 uniform random variate generator",
  type =         "Preprint",
  number =       "327",
  institution =  "Department of Statistics, University of California at
                 Los Angeles",
  address =      "Los Angeles, CA, USA",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:45:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Desai:2002:POT,
  author =       "Anand Desai and Alejandro Hevia and Yiqun Lisa Yin",
  title =        "A Practice-Oriented Treatment of Pseudorandom Number
                 Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2332",
  pages =        "368--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:37 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320368.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2332/23320368.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Misc{Dultz:2002:ORN,
  author =       "W. Dultz and E. Hildebrandt",
  title =        "Optical Random-Number Generator Based on Single-Photon
                 Statistics at the Optical Beam Splitter",
  howpublished = "US Patent No. 6,393,448.",
  day =          "17",
  month =        may,
  year =         "2002",
  bibdate =      "Sat Nov 29 14:03:26 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Patent filed 17 September 1997.",
  URL =          "https://www.google.com/patents/US6393448",
  abstract =     "A random-check generator for generating a random
                 number, which is preferably represented in binary form,
                 having a particle source, a random-check generating
                 element which acts on particles emitted by the particle
                 source, and a detection system which allocates a
                 numerical value, preferably in binary form, to the
                 detection of a particle emerging from the random-check
                 generating element. The random-check generator is not
                 susceptible to external interference and delivers
                 high-quality random numbers. To that end, the particle
                 source can emit at least two particles substantially
                 simultaneously, and one particle can activate the
                 detection system in order to detect a further particle
                 influenced by the random-check generating element and
                 allocate a numerical value thereto.",
  acknowledgement = ack-nhfb,
}

@Article{Emmerich:2002:AES,
  author =       "Frank Emmerich",
  title =        "Average equidistribution and statistical independence
                 properties of digital inversive pseudorandom numbers
                 over parts of the period",
  journal =      j-MATH-COMPUT,
  volume =       "71",
  number =       "238",
  pages =        "781--791",
  month =        apr,
  year =         "2002",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Sat Apr 20 13:53:53 MDT 2002",
  bibsource =    "http://www.ams.org/mcom/2002-71-238;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-01-01328-X;
                 http://www.ams.org/mcom/2002-71-238/S0025-5718-01-01328-X/S0025-5718-01-01328-X.dvi;
                 http://www.ams.org/mcom/2002-71-238/S0025-5718-01-01328-X/S0025-5718-01-01328-X.pdf;
                 http://www.ams.org/mcom/2002-71-238/S0025-5718-01-01328-X/S0025-5718-01-01328-X.ps;
                 http://www.ams.org/mcom/2002-71-238/S0025-5718-01-01328-X/S0025-5718-01-01328-X.tex;
                 http://www.jstor.org/stable/pdfplus/2698847.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Entacher:2002:ELA,
  author =       "Karl Entacher and Thomas Schell and Andreas Uhl",
  title =        "Efficient Lattice Assessment for {LCG} and {GLP}
                 Parameter Searches",
  journal =      j-MATH-COMPUT,
  volume =       "71",
  number =       "239",
  pages =        "1231--1242",
  month =        jul,
  year =         "2002",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Sat Dec 31 10:36:04 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib; JSTOR
                 database",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-01-01415-6;
                 http://www.ams.org/mcom/2002-71-239/S0025-5718-01-01415-6/S0025-5718-01-01415-6.dvi;
                 http://www.ams.org/mcom/2002-71-239/S0025-5718-01-01415-6/S0025-5718-01-01415-6.pdf;
                 http://www.ams.org/mcom/2002-71-239/S0025-5718-01-01415-6/S0025-5718-01-01415-6.ps;
                 http://www.ams.org/mcom/2002-71-239/S0025-5718-01-01415-6/S0025-5718-01-01415-6.tex;
                 http://www.jstor.org/stable/pdfplus/2698904.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Fahoome:2002:JRF,
  author =       "Gail F. Fahoome",
  title =        "{JMASM1: RANGEN 2.0 (Fortran 90\slash 95)}",
  journal =      j-J-MOD-APPL-STAT-METH,
  volume =       "1",
  number =       "1",
  pages =        "182--190",
  month =        "Winter",
  year =         "2002",
  CODEN =        "????",
  ISSN =         "1538-9472",
  bibdate =      "Wed Dec 17 08:08:09 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://tbf.coe.wayne.edu/jmasm/",
  abstract =     "Rangen 2.0 is a Fortran 90 module of subroutines used
                 to generate uniform and nonuniform pseudo-random
                 deviates. It includes uni1, a uniform pseudo-random
                 number generator, and nonuniform generator based on
                 uni1. The subroutines in Rangen 2.0 were written using
                 Essential Lahey Fortran 90, a proper subset of Fortran
                 90. It includes both source code for the subroutines
                 and a short description of each subroutine, its
                 purpose, and the arguments including data type and
                 usage.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Modern Applied Statistical Methods",
  keywords =     "Fortran subroutines; Pseudo-random number generators",
}

@InProceedings{Faure:2002:ARS,
  author =       "H. Faure and S. Tezuka",
  title =        "Another Random Scrambling of Digital $ (t, s)
                 $-sequences",
  crossref =     "Fang:2002:MCQ",
  pages =        "242--256",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:46:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Figotin:2002:ONT,
  author =       "A. Figotin and A. Gordon and S. Molchanov and J. Quinn
                 and N. Stavrakas",
  title =        "Occupancy Numbers in Testing Random Number
                 Generators",
  journal =      j-SIAM-J-APPL-MATH,
  volume =       "62",
  number =       "6",
  pages =        "1980--2011",
  month =        dec,
  year =         "2002",
  CODEN =        "SMJMAP",
  DOI =          "https://doi.org/10.1137/S0036139900366869",
  ISSN =         "0036-1399 (print), 1095-712X (electronic)",
  ISSN-L =       "0036-1399",
  bibdate =      "Tue Oct 22 17:37:32 MDT 2002",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SIAP/62/6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/36686",
  abstract =     "The classical occupancy problem where n balls are
                 placed in $N$ cells is used for testing of random
                 number generators. We show that the statistics of
                 appropriately chosen occupancy numbers are incompatible
                 with the statistics of many pseudorandom number
                 generators (PRNGs) even if they are truncated. More
                 than that, the incompatibility shows up on relatively
                 small samples long before the period of the PRNG is
                 reached. We introduce generalized Fermi--Dirac models
                 as idealized models for PRNGs. These models are used to
                 make educated guesses of how large the sample sizes
                 should be to detect the deficiencies of the PRNGs under
                 study. We use the developed occupancy tests together
                 with some other ones to examine the performance of
                 several widely used random number generators, including
                 {\tt random()} of the UNIX C library. We found that
                 {\tt random()} failed two of the conducted tests rather
                 badly. We also tested a true random number generator
                 based on $ \alpha $-decay which passed all our relevant
                 tests successfully.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Applied Mathematics",
  journal-URL =  "http://epubs.siam.org/siap",
  keywords =     "occupancy numbers; pseudorandom number generators;
                 random number generators; testing",
}

@Article{Fluhrer:2002:CSP,
  author =       "Scott R. Fluhrer",
  title =        "Cryptanalysis of the {SEAL 3.0} Pseudorandom Function
                 Family",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2355",
  pages =        "135--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:48 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550135.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2355/23550135.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Friedel:2002:FGR,
  author =       "I. Friedel and A. Keller",
  title =        "Fast Generation of Randomized Low-Discrepancy Point
                 Sets",
  crossref =     "Fang:2002:MCQ",
  pages =        "257--273",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:23:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Futschik:2002:EFE,
  author =       "Andreas Futschik",
  title =        "{Ist der Euro fair? Ergebnis einer empirischen
                 Untersuchung}. ({German}) [{Is} the euro fair?
                 {Results} of an empirical investigation]",
  journal =      "Austrian Journal of Statistics",
  volume =       "31",
  number =       "1",
  pages =        "35--40",
  month =        "????",
  year =         "2002",
  CODEN =        "????",
  ISSN =         "1026-597X",
  bibdate =      "Sat Sep 17 13:54:50 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Recently it has been claimed in the media that the
                 Euro is not a fair coin. Deviations of the probability
                 for ``head'' from $ 1 / 2 $ have been reported in
                 particular for the Belgian and the French Euro. To
                 address the issue, we present results from an empirical
                 point of view and discuss their statistical
                 implications.",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Article{Gangnon:2002:MDE,
  author =       "Ronald E. Gangnon and William N. King",
  title =        "Minimum Distance Estimation of the Distribution
                 Functions of Stochastically Ordered Random Variables",
  journal =      j-APPL-STAT,
  volume =       "51",
  number =       "4",
  pages =        "485--492",
  month =        "????",
  year =         "2002",
  CODEN =        "APSTAG",
  ISSN =         "0035-9254 (print), 1467-9876 (electronic)",
  ISSN-L =       "0035-9254",
  bibdate =      "Sat Jan 10 08:52:39 MST 2004",
  bibsource =    "http://www.blackwellpublishing.com/journal.asp?ref=0035-9254;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Statistics",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9876/issues",
}

@Article{Gennaro:2002:CPG,
  author =       "Rosario Gennaro and Daniele Micciancio",
  title =        "Cryptanalysis of a Pseudorandom Generator Based on
                 Braid Groups",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2332",
  pages =        "1--13",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:37 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320001.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2332/23320001.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Gilbert:2002:NRP,
  author =       "Henri Gilbert and Marine Minier",
  title =        "New Results on the Pseudorandomness of Some
                 Blockcipher Constructions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2355",
  pages =        "248--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:48 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550248.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2355/23550248.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Gleeson:2002:TRN,
  author =       "J. T. Gleeson",
  title =        "Truly random number generator based on turbulent
                 electroconvection",
  journal =      j-APPL-PHYS-LET,
  volume =       "81",
  number =       "11",
  pages =        "1949--1951",
  year =         "2002",
  CODEN =        "APPLAB",
  DOI =          "https://doi.org/10.1063/1.1507362",
  ISSN =         "0003-6951 (print), 1077-3118 (electronic), 1520-8842",
  ISSN-L =       "0003-6951",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?APL/81/1949/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Physics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4816218",
  keywords =     "convection; electrohydrodynamics; liquid crystal
                 devices; nematic liquid crystals; random number
                 generation; true random numbers from physical sources",
}

@Article{Golic:2002:SWM,
  author =       "Jovan Dj. Goli{\'c} and Mahmoud Salmasizadeh and Ed
                 Dawson",
  title =        "Statistical Weakness of Multiplexed Sequences",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "8",
  number =       "4",
  pages =        "420--433",
  month =        oct,
  year =         "2002",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.2001.0350",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:54:09 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579701903508",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Guimond:2002:PDP,
  author =       "Louis-S{\'e}bastien Guimond and Ji{\v{r}}{\'\i}
                 Patera",
  title =        "Proving the deterministic period breaking of linear
                 congruential generators using two tile quasicrystals",
  journal =      j-MATH-COMPUT,
  volume =       "71",
  number =       "237",
  pages =        "319--332",
  year =         "2002",
  CODEN =        "MCMPAF",
  DOI =          "https://doi.org/10.1090/S0025-5718-01-01331-X",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  MRclass =      "65C10 (68U99 82D25)",
  MRnumber =     "1863003 (2002j:65006)",
  MRreviewer =   "Harald Niederreiter",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/pdfplus/2698875.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InProceedings{Hernandez:2002:AGA,
  author =       "Julio C{\'e}sar Hern{\'a}ndez and Pedro Isasi and
                 Arturo Ribagorda",
  editor =       "M. H. Hamza",
  booktitle =    "{Proceedings of Applied Informatics (AI 2002),
                 February 18--21, 2002 Innsbruck, Austria}",
  title =        "An Application of Genetic Algorithms to the
                 Cryptanalysis of One Round {TEA}",
  publisher =    "Acta Press",
  address =      "Calgary, AB, Canada",
  pages =        "??--??",
  year =         "2002",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "",
  bibdate =      "Fri Jan 31 07:22:56 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.actapress.com/PaperInfo.aspx?PaperID=26972",
  acknowledgement = ack-nhfb,
  book-URL =     "http://www.actapress.com/Content_Of_Proceeding.aspx?ProceedingID=382",
}

@Article{Hernandez:2002:GCT,
  author =       "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a
                 Sierra and Pedro Isasi and Arturo Ribagorda",
  title =        "Genetic Cryptoanalysis of Two Rounds {TEA}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2331",
  pages =        "1024--1031",
  year =         "2002",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-47789-6_108",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Feb 01 16:44:05 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/0pa8nj982jewn9ev/",
  abstract =     "Distinguishing the output of a cryptographic primitive
                 such as a block cipher or a hash function from the
                 output of a random mapping seriously affects the
                 credibility of the primitive security, and defeats it
                 for many cryptographic applications. However, this is
                 usually a quite difficult task. In a previous work [1],
                 a new cryptoanalytic technique was presented and proved
                 useful in distinguishing a block cipher from a random
                 permutation in a completely automatic way. This
                 technique is based in the selection of the worst input
                 patterns for the block cipher with the aid of genetic
                 algorithms. The objective is to find which input
                 patters generate a significant deviation of the
                 observed output from the output we would expect from a
                 random permutation. In [1], this technique was applied
                 to the case of the block cipher TEA with 1 round. The
                 much harder problem of breaking TEA with 2 rounds is
                 successfully solved in this paper, where an efficient
                 distinguisher is also presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  remark =       "ICCS 2002",
}

@Article{Hertling:2002:SNN,
  author =       "Peter Hertling",
  title =        "Simply Normal Numbers to Different Bases",
  journal =      j-J-UCS,
  volume =       "8",
  number =       "2",
  pages =        "235--242",
  day =          "28",
  month =        feb,
  year =         "2002",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3217/jucs-008-02-0235",
  ISSN =         "0948-695X (print), 0948-6968 (electronic)",
  ISSN-L =       "0948-6968",
  bibdate =      "Tue Dec 16 10:06:04 MST 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jucs.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jucs.org/jucs_8_2/simply_normal_numbers_to",
  abstract =     "Let $ b \geq 2 $ be an integer. A real number is
                 called simply normal to base $b$ if in its
                 representation to base $b$ every digit appears with the
                 same asymptotic frequency. We answer the following
                 question for arbitrary integers $a$, $ b \geq 2$: if a
                 real number is simply normal to base $a$, does this
                 imply that it is also simply normal to base $b$ ? It
                 turns out that the answer is different from the well
                 known answers to the corresponding questions for the
                 related properties ``normality'', ``disjunctiveness'',
                 and ``randomness''.",
  acknowledgement = ack-nhfb,
  fjournal =     "J.UCS: Journal of Universal Computer Science",
  journal-URL =  "http://www.jucs.org/jucs",
  keywords =     "invariance properties; randomness",
}

@Article{Hormann:2002:FGO,
  author =       "Wolfgang H{\"o}rmann and Gerhard Derflinger",
  title =        "Fast generation of order statistics",
  journal =      j-TOMACS,
  volume =       "12",
  number =       "2",
  pages =        "83--93",
  month =        apr,
  year =         "2002",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Aug 7 12:05:43 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Iwata:2002:RSS,
  author =       "Tetsu Iwata and Tomonobu Yoshino and Tomohiro Yuasa
                 and Kaoru Kurosawa",
  title =        "Round Security and Super-Pseudorandomness of {MISTY}
                 Type Structure",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2355",
  pages =        "233--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:48 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550233.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2355/23550233.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Janke:2002:PRN,
  author =       "Wolfhard Janke",
  editor =       "Johannes Grotendorst and Dominik Marx and Alejandro
                 Muramatsu",
  booktitle =    "Quantum Simulations of Complex Many-Body Systems: From
                 Theory to Algorithms: Winter School, 25 February--1
                 March 2002, Rolduc Conference Centre, Kerkrade, The
                 Netherlands",
  title =        "Pseudo Random Numbers: Generation and Quality Checks",
  volume =       "10",
  publisher =    "John von Neumann Institute for Computing",
  address =      "J{\"u}lich, Germany",
  bookpages =    "xiii + 85",
  pages =        "447--??",
  year =         "2002",
  ISBN =         "3-00-009058-4",
  ISBN-13 =      "978-3-00-009058-5",
  LCCN =         "Q183.9 N492 v. 11",
  bibdate =      "Wed Feb 15 17:09:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www2.fz-juelich.de/nic-series/volume10/janke1.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "Box--Muller transformation; CDC/CRAY RANF generator
                 (combined LCG(44 485 709 377 909, 0, $2^{48}$) and
                 LCG(247 908 122 798 849, 0, $2^{48}$)); exponential
                 distribution generator; GGL generator (LCG(16 807, 0,
                 $2^{31} - 1$), also known as CONG or RAN0); lagged
                 Fibonacci (LF) generator; Marsaglia SUPER-DUPER
                 generator; NAG G05FAG generator (LCG($13^{13}$, 0,
                 $2^{59}$)); normal distribution generator; R250
                 generator (GFSR(250, 103, xor)); R250/521 (improved
                 R250); RAN3 generator (LF(55, 24, m, -)); RAND (LCG(69
                 069, 1, $2^{32}$)); RANLUX generator (RCARRY with
                 discards of blocks of random numbers); RANMAR generator
                 (combination of LF(97, 33, -) and arithmetic sequence
                 ($x_k = x_k - c$ if positive, else $x_k = x_k - c + d$,
                 with $c = 7 654 321 / 16 777 216$ and $d = 16 777 213
                 /16 777 216$)); RCARRY generator (Marsaglia/Zaman
                 subtract-with-borrow generator); shift register
                 generator (GFSR)",
  remark =       "This is a nice survey of some popular random number
                 generators, with discussions of their parameters,
                 periods, and why they fail in some Monte Carlo
                 simulations.",
  xxnote =       "Check pages: out of bookpages range??",
}

@InCollection{Jeruchim:2002:FRV,
  author =       "Michel C. Jeruchim and Philip Balaban and K. Sam
                 Shanmugan",
  booktitle =    "Simulation of Communication Systems: Modeling,
                 Methodology, and Techniques",
  title =        "Fundamentals of Random Variables and Random Processes
                 for Simulation",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  bookpages =    "xxvii + 907",
  pages =        "289--370",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/0-306-46971-5_7",
  ISBN =         "0-306-46267-2 (print), 0-306-46971-5 (electronic)",
  ISBN-13 =      "978-0-306-46267-2 (print), 978-0-306-46971-8
                 (electronic)",
  ISSN =         "1389-6938",
  LCCN =         "TK5102.5 S5515 2000",
  bibdate =      "Mon May 06 17:29:43 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Information Technology: Transmission, Processing, and
                 Storage",
  acknowledgement = ack-nhfb,
}

@InCollection{Jeruchim:2002:MCS,
  author =       "Michel C. Jeruchim and Philip Balaban and K. Sam
                 Shanmugan",
  booktitle =    "Simulation of Communication Systems: Modeling,
                 Methodology, and Techniques",
  title =        "{Monte Carlo} Simulation and Generation of Random
                 Numbers",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  bookpages =    "xxvii + 907",
  pages =        "371--406",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/0-306-46971-5_7",
  ISBN =         "0-306-46267-2 (print), 0-306-46971-5 (electronic)",
  ISBN-13 =      "978-0-306-46267-2 (print), 978-0-306-46971-8
                 (electronic)",
  ISSN =         "1389-6938",
  LCCN =         "TK5102.5 S5515 2000",
  bibdate =      "Mon May 06 17:29:43 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Information Technology: Transmission, Processing, and
                 Storage",
  acknowledgement = ack-nhfb,
}

@Article{Jones:2002:KTP,
  author =       "M. C. Jones",
  title =        "On {Khintchine}'s Theorem and its Place in Random
                 Variate Generation",
  journal =      j-AMER-STAT,
  volume =       "56",
  number =       "4",
  pages =        "304--??",
  month =        nov,
  year =         "2002",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Jan 8 07:06:53 MST 2004",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://oberon.ingentaselect.com/cgi-bin/linker?ini=asa&reqidx=/cw/asa/00031305/v56n4/s7/p304",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Karras:2002:SPB,
  author =       "D. A. Karras and V. Zorkadis",
  title =        "Strong Pseudorandom Bit Sequence Generators Using
                 Neural Network Techniques and Their Evaluation for
                 Secure Communications",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2557",
  pages =        "615--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Nov 30 20:58:15 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2557.htm;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.de/link/service/series/0558/bibs/2557/25570615.htm;
                 http://link.springer.de/link/service/series/0558/papers/2557/25570615.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Book{Kunchenko:2002:PPE,
  author =       "{\"e}I{\'\i}U. P. ({\"e}I{\'\i}Uri{\u\i} Petrovich)
                 Kunchenko",
  title =        "Polynomial parameter estimations of close to
                 {Gaussian} random variables",
  publisher =    "Shaker",
  address =      "Achen, Germany",
  pages =        "xiv + 396",
  year =         "2002",
  ISBN =         "3-8322-0032-0",
  ISBN-13 =      "978-3-8322-0032-9",
  ISSN =         "0945-0823",
  ISSN-L =       "0945-0823",
  LCCN =         "QA273 .K799 2003",
  bibdate =      "Tue Apr 29 20:39:05 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Berichte aus der Kommunikationstechnik",
  acknowledgement = ack-nhfb,
  subject =      "Random variables; Gaussian measures; Random
                 polynomials",
}

@Article{Kuo:2002:CCC,
  author =       "F. Y. Kuo and S. Joe",
  title =        "Component-by-Component Construction of Good Lattice
                 Rules with a Composite Number of Points",
  journal =      j-J-COMPLEXITY,
  volume =       "18",
  number =       "4",
  pages =        "943--976",
  month =        "????",
  year =         "2002",
  CODEN =        "JOCOEH",
  ISSN =         "0885-064X (print), 1090-2708 (electronic)",
  ISSN-L =       "0885-064X",
  bibdate =      "Fri Mar 09 11:48:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of complexity",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0885064X",
}

@InProceedings{LEcuyer:2002:CEG,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Panneton",
  title =        "Constructions of equidistributed generators based on
                 linear recurrences modulo 2",
  crossref =     "Fang:2002:MCQ",
  pages =        "318--330",
  year =         "2002",
  MRclass =      "65C10 (11K38)",
  MRnumber =     "1958863",
  bibdate =      "Fri Dec 30 15:07:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:2002:OOR,
  author =       "Pierre L'Ecuyer and Richard Simard and E. Jack Chen
                 and W. David Kelton",
  title =        "An object-oriented random-number package with many
                 long streams and substreams",
  journal =      j-OPER-RES,
  volume =       "50",
  number =       "6",
  pages =        "1073--1075",
  month =        dec,
  year =         "2002",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.50.6.1073.358",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Sun Dec 18 11:02:13 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://or.pubs/informs.org/pages/collect.html;
                 http://www.iro.umontreal.ca/~lecuyer;
                 http://www.jstor.org/stable/3088626",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
}

@InCollection{LEcuyer:2002:RAR,
  author =       "Pierre L'Ecuyer and Christiane Lemieux",
  title =        "Recent advances in randomized quasi-{Monte Carlo}
                 methods",
  crossref =     "Dror:2002:MUE",
  pages =        "419--474",
  year =         "2002",
  MRclass =      "65C05",
  MRnumber =     "1893290",
  bibdate =      "Fri Dec 30 15:00:34 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:2002:SST,
  author =       "Pierre L'Ecuyer and Richard Simard and Stefan
                 Wegenkittl",
  title =        "Sparse Serial Tests of Uniformity for Random Number
                 Generators",
  journal =      j-SIAM-J-SCI-COMP,
  volume =       "24",
  number =       "2",
  pages =        "652--668",
  month =        mar,
  year =         "2002",
  CODEN =        "SJOCE3",
  DOI =          "https://doi.org/10.1137/S1064827598349033",
  ISSN =         "1064-8275 (print), 1095-7197 (electronic)",
  ISSN-L =       "1064-8275",
  bibdate =      "Tue Oct 22 18:24:40 MDT 2002",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SISC/24/2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/34903",
  abstract =     "Different versions of the serial test for testing the
                 uniformity and independence of vectors of successive
                 values produced by a (pseudo)random number generator
                 are studied. These tests partition the t-dimensional
                 unit hypercube into $k$ cubic cells of equal volume,
                 generate n points (vectors) in this hypercube, count
                 how many points fall in each cell, and compute a test
                 statistic defined as the sum of values of some
                 univariate function f applied to these $k$ individual
                 counters. Both overlapping and nonoverlapping vectors
                 are considered. For different families of generators,
                 such as linear congruential, Tausworthe, nonlinear
                 inversive, etc., different ways of choosing these
                 functions and of choosing $k$ are compared, and
                 formulas are obtained for the (estimated) sample size
                 required to reject the null hypothesis of independent
                 uniform random variables, as a function of the period
                 length of the generator. For the classes of
                 alternatives that correspond to linear generators, the
                 most efficient tests turn out to have $ k \gg n $ (in
                 contrast to what is usually done or recommended in
                 simulation books) and to use overlapping vectors.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific Computing",
  journal-URL =  "http://epubs.siam.org/sisc",
}

@TechReport{LEcuyer:2002:TSL,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "{TestU01}: a Software Library in {ANSI C} for
                 Empirical Testing of Random Number Generators: Software
                 User's Guide",
  type =         "Web report",
  institution =  "D{\'e}partment d'Informatique et de Recherche
                 Op{\'e}rationelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, Qu{\'e}bec, Canada",
  year =         "2002",
  bibdate =      "Thu Aug 12 17:28:41 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.iro.umontreal.ca/~simardr/TestU01.zip;
                 http://www.iro.umontreal.ca/~simardr/testu01/tu01.html",
  acknowledgement = ack-nhfb,
}

@Misc{Leydold:2002:ULU,
  author =       "J. Leydold and W. H{\"o}rmann",
  title =        "{UNURAN} --- a Library for Universal Non-Uniform
                 Random Number Generators",
  howpublished = "Web software archive.",
  year =         "2002",
  bibdate =      "Fri Dec 30 15:15:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://statistik.wu-wien.ac.at/unuran",
  acknowledgement = ack-nhfb,
}

@InProceedings{Leydold:2002:VTD,
  author =       "J. Leydold and E. Janka and W. H{\"o}rmann",
  title =        "Variants of transformed density rejection and
                 correlation introduction",
  crossref =     "Fang:2002:MCQ",
  pages =        "345--356",
  year =         "2002",
  bibdate =      "Fri Dec 30 15:16:53 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Luo:2002:CGB,
  author =       "Ping Luo",
  title =        "A combined generator based on linear congruential
                 generators and its structural improvement",
  journal =      j-J-NUMER-METHODS-COMPUT-APPL,
  volume =       "23",
  number =       "1",
  pages =        "6--17",
  year =         "2002",
  CODEN =        "????",
  ISSN =         "1000-3266",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "1912938 (2003f:65015)",
  MRreviewer =   "Yao Chen Zhu",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal on Numerical Methods and Computer
                 Applications. Shuzhi Jisuan yu Jisuanji Yingyong",
}

@Article{Mahmoud:2002:ISR,
  author =       "Hosam Mahmoud and Tatsuie Tsukiji",
  title =        "On the internal structure of random recursive
                 circuits",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "142",
  number =       "1",
  pages =        "155--171",
  day =          "1",
  month =        may,
  year =         "2002",
  CODEN =        "JCAMDI",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Sat Feb 25 12:52:27 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042701004666",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Misc{Marsaglia:2002:RGB,
  author =       "George Marsaglia",
  title =        "Re: *good* 64-bit random-number generator",
  howpublished = "Posting to the {\tt sci.crypt.random-numbers} news
                 group",
  day =          "3",
  month =        sep,
  year =         "2002",
  bibdate =      "Sat Mar 08 15:04:15 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://groups.google.ws/group/comp.sys.sun.admin/browse_thread/thread/683ff52120e5b4d/b53ccad5aa5d6017",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:2002:SDP,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "Some Difficult-to-Pass Tests of Randomness",
  journal =      j-J-STAT-SOFT,
  volume =       "7",
  number =       "3",
  pages =        "1--8",
  year =         "2002",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Sun Nov 17 22:35:43 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/v07/i03;
                 http://www.jstatsoft.org/v07/i03/tuftests.c;
                 http://www.jstatsoft.org/v07/i03/tuftests.pdf;
                 http://www.jstatsoft.org/v07/i03/updates",
  abstract =     "We describe three tests of randomness --- tests that
                 many random number generators fail. In particular, all
                 congruential generators --- even those based on a prime
                 modulus --- fail at least one of the tests, as do many
                 simple generators, such as shift register and lagged
                 Fibonacci. On the other hand, generators that pass the
                 three tests seem to pass all the tests in the Diehard
                 Battery of Tests.\par Note that these tests concern the
                 randomness of a generator's output as a sequence of
                 independent, uniform 32-bit integers. For uses where
                 the output is converted to uniform variates in $ [0, 1)
                 $, potential flaws of the output as integers will
                 seldom cause problems after the conversion. Most
                 generators seem to be adequate for producing a set of
                 uniform reals in $ [0, 1) $, but several important
                 applications. notably in cryptography and number theory
                 --- for example, establishing probable primes,
                 complexity of factoring algorithms, random partitions
                 of large integers --- may require satisfactory
                 performance on the kinds of tests we describe here.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
}

@InProceedings{Martin:2002:ARN,
  author =       "P. Martin",
  editor =       "W. B. Langdon and E. Cantu-Paz and K. Mathias and R.
                 Roy and D. Davis R. Poli and K. Balakrishnan and V.
                 Honavar and G. Rudolph and J. Wegener and L. Bull and
                 M. A. Potter and A. C. Schultz and J. F. Miller and E.
                 Burke and N. Jonoska",
  booktitle =    "{GECCO-2002: 2002 Genetic and Evolutionary Computation
                 Conference: presentations in the evolutionary
                 computation in industry track: New York, New York, July
                 11--13, 2002}",
  title =        "An analysis of random number generators for a hardware
                 implementation of genetic programming using {FPGAs} and
                 {Handel-C}",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  bookpages =    "xxiii + 1401",
  pages =        "837--844",
  year =         "2002",
  ISBN =         "1-55860-878-8",
  ISBN-13 =      "978-1-55860-878-8",
  LCCN =         "QA76.6 I6231 2002",
  bibdate =      "Thu Feb 23 08:14:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  xxeditor =     "Lawrence `David' Davis; Rajkumar Roy",
}

@Book{Martinez:2002:CSH,
  author =       "Wendy L. Martinez and Angel R. Martinez",
  title =        "Computational Statistics Handbook with {MATLAB}",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xvii + 591",
  year =         "2002",
  ISBN =         "1-58488-229-8, 1-4200-3563-0 (e-book)",
  ISBN-13 =      "978-1-58488-229-9, 978-1-4200-3563-6 (e-book)",
  LCCN =         "QA276.4 .M272 2001",
  bibdate =      "Wed Nov 16 14:58:02 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$79.95, UK\pounds 53.99",
  acknowledgement = ack-nhfb,
  keywords =     "Matlab",
  subject =      "Mathematical statistics; Data processing; MATLAB",
  tableofcontents = "Preface \\
                 1: Introduction \\
                 What is Computational Statistics? \\
                 An Overview of the Book \\
                 MATLAB Code \\
                 Further Reading \\
                 2: Probability Concepts \\
                 Introduction \\
                 Probability \\
                 Conditional Probability and Independence \\
                 Expectation \\
                 Common Distributions \\
                 MATLAB Code \\
                 Further Reading \\
                 Exercises \\
                 3: Sampling Concepts \\
                 Introduction \\
                 Sampling Terminology and Concepts \\
                 Sampling Distributions \\
                 Parameter Estimation \\
                 Empirical Distribution Function \\
                 MATLAB Code \\
                 Further Reading \\
                 Exercises \\
                 4: Generating Random Variables \\
                 Introduction \\
                 General Techniques for Generating Random Variables \\
                 Generating Continuous Random Variable \\
                 Generating Discrete Random Variables \\
                 5: Exploratory Data Analysis \\
                 Introduction \\
                 Exploring Univariate Data \\
                 Exploring Bivariate and Trivariate Data \\
                 Exploring Multi-Dimensional Data \\
                 6: Monte Carlo Methods for Inferential Statistics \\
                 Introduction \\
                 Classical Inferential Statistics \\
                 Monte Carlo Methods for Inferential Statistics \\
                 Bootstrap Methods \\
                 Assessing Estimates of Functions \\
                 7: Data Partitioning \\
                 Introduction \\
                 Cross-Validation \\
                 Jackknife \\
                 Better Bootstrap Confidence Intervals \\
                 Jackknife-After-Bootstrap \\
                 8: Probability Density Estimation \\
                 Introduction \\
                 Histograms \\
                 Kernel Density Estimation \\
                 Finite Mixtures \\
                 Generating Random Variables \\
                 9: Statistical Pattern Recognition \\
                 Introduction \\
                 Bayes Classification \\
                 Evaluating the Classifier \\
                 Classification Trees \\
                 Clustering \\
                 10: Nonparametric Regression \\
                 Introduction \\
                 Smoothing \\
                 Kernel Methods \\
                 Regression Trees \\
                 11: Markov Chain Monte Carlo Methods \\
                 Introduction \\
                 Background \\
                 Metropolis-Hastings Algorithms \\
                 The Gibbs Sampler \\
                 Convergence Monitoring \\
                 12: Spatial Statistics \\
                 Introduction \\
                 Visualizing Spatial Point Processes \\
                 Exploring First Order and Second Order Properties \\
                 Modeling Spatial Point Processes \\
                 Simulating Spatial Point Processes \\
                 Appendices \\
                 A: Introduction to MATLAB \\
                 B: Index of Notation \\
                 C: Projection Pursuit Indexes \\
                 D: MATLAB Code for Trees \\
                 E: List of MATLAB Statistics Toolbox Functions \\
                 F: List of Computational Statistics Toolbox Functions
                 \\
                 G: Data Sets \\
                 References \\
                 Index",
}

@InProceedings{Matsumoto:2002:NTW,
  author =       "M. Matsumoto and T. Nishimura",
  title =        "A Nonempirical Test on the Weight of Pseudorandom
                 Number Generators",
  crossref =     "Fang:2002:MCQ",
  pages =        "381--395",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:50:16 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maurer:2002:IRS,
  author =       "U. M. Maurer",
  editor =       "G. Goos and J. Hartmanis and J. van Leeuwen",
  booktitle =    "{Advances in Cryptology: Eurocrypt 2002}",
  title =        "Indistinguishability of Random Systems",
  number =       "2332",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "110--132",
  year =         "2002",
  LCCN =         "QA76.9 A25 E87",
  bibdate =      "Fri Mar 9 11:51:23 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{McCullough:2002:ASP,
  author =       "B. D. McCullough and B. Wilson",
  title =        "On the accuracy of statistical procedures in
                 {Microsoft Excel 2000 and XP}",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "40",
  number =       "4",
  pages =        "27--37",
  day =          "28",
  month =        oct,
  year =         "2002",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/S0167-9473(02)00095-6",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:12:59 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947302000956",
  abstract =     "From the abstract: ``Microsoft attempted to fix errors
                 in the standard normal random number generator and the
                 inverse normal function, and in the former case
                 actually made the problem worse.''",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@InProceedings{McCullough:2002:DMF,
  author =       "B. D. McCullough",
  booktitle =    "{2001 proceedings: papers presented at the Annual
                 Meeting of the American Statistical Association, Joint
                 Statistical Meetings, Atlanta, Georgia, August 5--9,
                 2001}",
  title =        "Does {Microsoft} fix errors in {Excel}?",
  publisher =    "American Statistical Association",
  address =      "Alexandria, VA, USA",
  pages =        "??--??",
  year =         "2002",
  ISBN =         "1-931586-13-6",
  ISBN-13 =      "978-1-931586-13-9",
  LCCN =         "????",
  bibdate =      "Wed Feb 22 11:07:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.amstat.org/sections/SRMS/Proceedings/y2001/Proceed/00177.pdf",
  acknowledgement = ack-nhfb,
  pagecount =    "3",
  remark =       "From section 3 on random-number generators: ``Standard
                 nomarl random deviates should rarely exceed plus or
                 minus 4.0 Yet Excel 97 regularly produces standard
                 normal deviates of plus or minus 5,000,000.''",
}

@InCollection{McCullough:2002:RNG,
  author =       "B. D. McCullough",
  editor =       "Abdel H. El-Shaarawi and Walter W. Piegorsch",
  booktitle =    "Encyclopedia of Environmetrics",
  title =        "Random Number Generators",
  volume =       "3",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  bookpages =    "xxxix + 2502 (4 volumes)",
  pages =        "??--??",
  year =         "2002",
  DOI =          "https://doi.org/10.1002/9780470057339.var009",
  ISBN =         "0-470-05733-5, 0-471-89997-6",
  ISBN-13 =      "978-0-470-05733-9, 978-0-471-89997-6",
  LCCN =         "GE45.S73 E53 2002",
  bibdate =      "Thu Jan 05 12:08:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://onlinelibrary.wiley.com/doi/10.1002/9780470057339.var009/full",
  acknowledgement = ack-nhfb,
  onlinedate =   "15 September 2006",
}

@InProceedings{Mironov:2002:RSR,
  author =       "Ilya Mironov",
  editor =       "M. Yung",
  booktitle =    "Advances in Cryptology --- {CRYPTO 2002}",
  title =        "({Not} So) Random Shuffles of {RC4}",
  volume =       "2442",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "304--319",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/3-540-45708-9_20",
  bibdate =      "Sat Apr 05 13:08:55 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/chapter/10.1007/3-540-45708-9_20",
  acknowledgement = ack-nhfb,
}

@Article{Mita:2002:PBG,
  author =       "R. Mita and G. Palumbo and S. Pennisi and M. Poli",
  title =        "Pseudorandom bit generator based on dynamic linear
                 feedback topology",
  journal =      j-ELECT-LETTERS,
  volume =       "38",
  number =       "19",
  pages =        "1097--1098",
  day =          "12",
  month =        sep,
  year =         "2002",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:20020750",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:46 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1038612",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Moon:2002:IDC,
  author =       "Dukjae Moon and Kyungdeok Hwang and Wonil Lee and
                 Sangjin Lee and Jongin Lim",
  title =        "Impossible Differential Cryptanalysis of Reduced Round
                 {XTEA} and {TEA}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2365",
  pages =        "49--61",
  year =         "2002",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45325-3_34",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:52 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs2002b.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650049.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2365/23650049.pdf;
                 http://www.iacr.org/archive/fse2002/23650050/23650050.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Murray:2002:IYP,
  author =       "Mark R. V. Murray",
  title =        "An Implementation of the {Yarrow PRNG} for {FreeBSD}",
  crossref =     "USENIX:2002:PBF",
  pages =        "47--53",
  year =         "2002",
  bibdate =      "Tue Oct 15 12:37:27 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
  URL =          "http://www.usenix.org/publications/library/proceedings/bsdcon02/murray.html",
  acknowledgement = ack-nhfb,
  keywords =     "pseudo-random number generator",
}

@Article{Niederreiter:2002:ADI,
  author =       "Harald Niederreiter and Igor E. Shparlinski",
  title =        "On the Average Distribution of Inversive Pseudorandom
                 Numbers",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "8",
  number =       "4",
  pages =        "491--503",
  month =        oct,
  year =         "2002",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.2002.0358",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579702903588",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Niederreiter:2002:ICS,
  author =       "Harald Niederreiter and Arne Winterhof",
  title =        "Incomplete Character Sums and Polynomial Interpolation
                 of the Discrete Logarithm",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "8",
  number =       "2",
  pages =        "184--192",
  month =        apr,
  year =         "2002",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.2001.0334",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S107157970190334X",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Niederreiter:2002:RAT,
  author =       "Harald Niederreiter and Igor E. Shparlinski",
  title =        "Recent advances in the theory of nonlinear
                 pseudorandom number generators",
  crossref =     "Fang:2002:MCQ",
  pages =        "86--102",
  year =         "2002",
  bibdate =      "Fri Dec 30 15:25:58 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Misc{NIST:2002:ERN,
  author =       "{NIST}",
  title =        "Examples of Random Number Generators",
  howpublished = "World-Wide Web site.",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  year =         "2002",
  bibdate =      "Mon Dec 08 08:43:08 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/rng/rng6_2.html",
  acknowledgement = ack-nhfb,
}

@Book{Papoulis:2002:PRV,
  author =       "Athanasios Papoulis and S. Unnikrishna Pillai",
  title =        "Probability, random variables, and stochastic
                 processes",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "x + 852",
  year =         "2002",
  ISBN =         "0-07-366011-6, 0-07-112256-7",
  ISBN-13 =      "978-0-07-366011-0, 978-0-07-112256-6",
  LCCN =         "QA273 .P2 2002",
  bibdate =      "Tue Jan 17 09:42:38 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1011/2001044139-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1011/2001044139-t.html;
                 http://www.loc.gov/catdir/enhancements/fy1106/2001044139-b.html",
  acknowledgement = ack-nhfb,
  remark =       "See other editions
                 \cite{Papoulis:1965:PRV,Papoulis:1984:PRV,Papoulis:1991:PRV}.",
  subject =      "Probabilities; Random variables; Stochastic
                 processes",
  tableofcontents = "Preface \\
                 Part I. Probability and Random Variables 1 \\
                 Chapter 1 The Meaning of Probability 3 \\
                 Chapter 2 The Axioms of Probability 15 \\
                 Chapter 3 Repeated Trials 46 \\
                 Chapter 4 The Concept of a Random Variable 72 \\
                 Chapter 5 Functions of One Random Variable 123 \\
                 Chapter 6 Two Random Variables 169 \\
                 Chapter 7 Sequences of Random Variables 243 \\
                 Chapter 8 Statistics 303 \\
                 Part II. Stochastic Processes 371 \\
                 Chapter 9 General Concepts 373 \\
                 Chapter 10 Random Walks and Other Applications 435 \\
                 Chapter 11 Spectral Representation 499 \\
                 Chapter 12 Spectrum Estimation 523 \\
                 Chapter 13 Mean Square Estimation 580 \\
                 Chapter 14 Entropy 629 \\
                 Chapter 15 Markov Chains 695 \\
                 Chapter 16 Markov Processes and Queueing Theory 773 \\
                 Bibliography 835 \\
                 Index 837",
}

@Article{Philipp:2002:MTD,
  author =       "Walter Philipp and Robert Tichy",
  title =        "Metric Theorems for Distribution Measures of
                 Pseudorandom Sequences",
  journal =      j-MONAT-MATH,
  volume =       "135",
  number =       "4",
  pages =        "321--326",
  month =        apr,
  year =         "2002",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s006050200025",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 12:06:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Mauduit:2000:FPBa}.",
  URL =          "http://www.springerlink.com/content/61r9etxplcwmmfxn/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@InProceedings{Pirsic:2002:SIN,
  author =       "Gottlieb Pirsic",
  title =        "A Software Implementation of {Niederreiter--Xing}
                 Sequences",
  crossref =     "Fang:2002:MCQ",
  pages =        "434--445",
  year =         "2002",
  MRclass =      "65C10 (11K38 14H05)",
  MRnumber =     "1958872",
  bibdate =      "Fri Mar 09 11:35:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Raqab:2002:IGE,
  author =       "Mohammad Z. Raqab",
  title =        "Inferences for generalized exponential distribution
                 based on record statistics",
  journal =      j-J-STAT-PLANN-INFERENCE,
  volume =       "104",
  number =       "2",
  pages =        "339--350",
  day =          "1",
  month =        jun,
  year =         "2002",
  CODEN =        "JSPIDN",
  DOI =          "https://doi.org/10.1016/S0378-3758(01)00246-4",
  ISSN =         "0378-3758 (print), 1873-1171 (electronic)",
  ISSN-L =       "0378-3758",
  bibdate =      "Sat Jun 29 11:59:49 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatplanninference2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378375801002464",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Planning and Inference",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03783758",
}

@Article{Rukhin:2002:DNW,
  author =       "A. L. Rukhin",
  title =        "Distribution of the number of words with a prescribed
                 frequency and tests of randomness",
  journal =      j-ADV-APPL-PROB,
  volume =       "34",
  number =       "4",
  pages =        "775--797",
  year =         "2002",
  CODEN =        "AAPBBD",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Fri Mar 09 11:52:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00018678.html;
                 http://projecteuclid.org/euclid.aap/",
}

@InProceedings{Shackleford:2002:FIN,
  author =       "Barry Shackleford and Motoo Tanaka and Richard J.
                 Carter and Greg Snider",
  editor =       "Stephen Trimberger and Martine Schlag and others",
  booktitle =    "{FPGA 2002: Proceedings of the 2002 ACM\slash SIGDA
                 Tenth International Symposium on Field-Programmable
                 Gate Arrays, Monterey, California, USA: February
                 24--26, 2002}",
  title =        "{FPGA} implementation of neighborhood-of-four cellular
                 automata random number generators",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "viii + 258",
  pages =        "106--112",
  year =         "2002",
  DOI =          "https://doi.org/10.1145/503048.503064",
  ISBN =         "1-58113-452-5",
  ISBN-13 =      "978-1-58113-452-0",
  LCCN =         "TK7895.G36 I481 2002",
  bibdate =      "Thu Feb 23 16:31:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "ACM order number 480020.",
  abstract =     "Random number generators (RNGs) based upon
                 neighborhood-of-four cellular automata (CA) with
                 asymmetrical, non-local connections are explored. A
                 number of RNGs that pass Marsaglia's rigorous Diehard
                 suite of random number tests have been discovered. A
                 neighborhood size of four allows a single CA cell to be
                 implemented with a four-input lookup table and a
                 one-bit register which are common building blocks in
                 popular field programmable gate arrays (FPGAs). The
                 investigated networks all had periodic (wrap around)
                 boundary conditions with either 1-d, 2-d, or 3-d
                 interconnection topologies. Trial designs of 64-bit
                 networks using a Xilinx XCV1000-6 FPGA predict a
                 maximum clock rate of 214 MHz to 230 MHz depending upon
                 interconnection topology.",
  acknowledgement = ack-nhfb,
}

@Article{Shparlinski:2002:DDH,
  author =       "Igor E. Shparlinski",
  title =        "On the Distribution of the {Diffie--Hellman} Pairs",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "8",
  number =       "2",
  pages =        "131--141",
  month =        apr,
  year =         "2002",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.2000.0321",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 16:08:12 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579700903216",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Sugita:2002:RNI,
  author =       "Hiroshi Sugita",
  title =        "Robust numerical integration and pairwise independent
                 random variables",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "139",
  number =       "1",
  pages =        "1--8",
  day =          "1",
  month =        feb,
  year =         "2002",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(01)00394-6",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Mon Feb 27 17:51:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042701003946",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "discrete random Weyl sampling; pairwise independent
                 sampling; robust numerical integration",
}

@Article{Tan:2002:PPP,
  author =       "Chih Jeng Kenneth Tan",
  title =        "The {PLFG} parallel pseudo-random number generator",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "18",
  number =       "5",
  pages =        "693--698",
  month =        apr,
  year =         "2002",
  CODEN =        "FGSEVI",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Apr 10 10:40:39 MDT 2002",
  bibsource =    "http://www.elsevier.com/locate/issn/0167739X;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.elsevier.nlhttp://www.elsevier.com/gej-ng/10/19/19/60/36/36/abstract.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Tang:2002:CRN,
  author =       "Hui-Chin Tang",
  title =        "Combined random number generator via the generalized
                 {Chinese} remainder theorem",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "142",
  number =       "2",
  pages =        "377--388",
  day =          "15",
  month =        may,
  year =         "2002",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(01)00424-1",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 06:57:58 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042701004241",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "Chinese remainder theorem; combined generator;
                 multiple recursive generator; random number",
}

@Article{Tang:2002:LBS,
  author =       "Hui-Chin Tang and Chiang Kao",
  title =        "Lower bounds in spectral tests for vectors of
                 nonsuccessive values produced by multiple recursive
                 generator with some zero multipliers",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "43",
  number =       "8--9",
  pages =        "1153--1159",
  month =        apr # "\slash " # may,
  year =         "2002",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(02)80019-0",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:49:22 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122102800190",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Tang:2002:MDM,
  author =       "Hui-Chin Tang",
  title =        "Modified decomposition method for multiple recursive
                 random number generator",
  journal =      j-MATH-COMP-SIM,
  volume =       "59",
  number =       "5",
  pages =        "453--458",
  day =          "15",
  month =        jun,
  year =         "2002",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(01)00428-1",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475401004281",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@TechReport{Tezuka:2002:RGF,
  author =       "S. Tezuka",
  title =        "On Randomization of Generalized {Faure} Sequences",
  type =         "Report",
  number =       "RT-0494",
  institution =  "IBM Research, Tokyo Research Laboratory",
  address =      "Tokyo, Japan",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:53:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tsaban:2002:ELF,
  author =       "Boaz Tsaban and Uzi Vishne",
  title =        "Efficient Linear Feedback Shift Registers with Maximal
                 Period",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "8",
  number =       "2",
  pages =        "256--267",
  month =        apr,
  year =         "2002",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1006/ffta.2001.0339",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  MRclass =      "94A55",
  MRnumber =     "1894517 (2003i:94040)",
  bibdate =      "Fri Dec 30 15:54:09 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579701903399",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Umans:2002:PRG,
  author =       "Christopher Umans",
  title =        "Pseudo-random generators for all hardnesses",
  crossref =     "ACM:2002:PTF",
  pages =        "627--634",
  year =         "2002",
  DOI =          "https://doi.org/10.1145/509907.509997",
  bibdate =      "Tue Jan 13 06:21:05 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2002:HOL,
  author =       "Y. Wang and F. J. Hickernell",
  title =        "A Historical Overview of Lattice Point Sets",
  crossref =     "Fang:2002:MCQ",
  pages =        "158--167",
  year =         "2002",
  bibdate =      "Fri Mar 09 11:54:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Wang:2002:NCT,
  author =       "Yongge Wang",
  title =        "Note: a comparison of two approaches to
                 pseudorandomness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "276",
  number =       "1--2",
  pages =        "449--459",
  day =          "6",
  month =        apr,
  year =         "2002",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 25 16:46:36 MDT 2002",
  bibsource =    "http://www.elsevier.com/locate/issn/03043975;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
  URL =          "http://www.elsevier.com/gej-ng/10/41/16/247/27/49/abstract.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Wu:2002:BPR,
  author =       "Pei-Chi Wu and Kuo-Chan Huang and Shih-Ting Ouyang",
  title =        "Bit-parallel random number generation for discrete
                 uniform distributions",
  journal =      j-COMP-PHYS-COMM,
  volume =       "144",
  number =       "3",
  pages =        "252--260",
  month =        apr,
  year =         "2002",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/S0010-4655(02)00143-1",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:41 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465502001431",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Yaguchi:2002:CLP,
  author =       "Hirotake Yaguchi",
  title =        "Construction of a long-period nonalgebraic and
                 nonrecursive pseudorandom number generator",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "8",
  number =       "2",
  pages =        "203--213",
  month =        "????",
  year =         "2002",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2002.8.2.203",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "1916917 (2003k:65006)",
  MRreviewer =   "P. Neumann",
  bibdate =      "Mon Feb 27 10:56:29 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2002.8.issue-2/issue-files/mcma.2002.8.issue-2.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2002.8.issue-2/mcma.2002.8.2.203/mcma.2002.8.2.203.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@InProceedings{Yao:2002:CBR,
  author =       "Jian Yao and Guanrong Chen and Chaoyuan Yue and Yong
                 Zhao",
  editor =       "{IEEE}",
  booktitle =    "{ICCA. Final Program and Book of Abstracts. The 2002
                 International Conference on Control and Automation,
                 June 16--19, 2002, Xiamen, Fujian Province, China}",
  title =        "Chaos-based random number generators and their
                 application to multi-access secure communications",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "152--??",
  year =         "2002",
  ISBN =         "0-7803-7412-6",
  ISBN-13 =      "978-0-7803-7412-6",
  LCCN =         "TJ212.2 .I582 2002",
  bibdate =      "Thu Feb 23 09:04:13 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/servlet/opac?punumber=8706",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@PhdThesis{Aamodt:2003:CSP,
  author =       "Ken S. Aamodt",
  title =        "A cryptographically secure pseudorandom number
                 generator",
  type =         "{Ph.D.} thesis",
  school =       "Purdue University",
  address =      "West Lafayette, IN, USA",
  pages =        "147",
  month =        dec,
  year =         "2003",
  ISBN =         "0-542-33216-7",
  ISBN-13 =      "978-0-542-33216-6",
  bibdate =      "Thu Jan 19 17:01:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://catalog.lib.purdue.edu/Find/Record/1380784;
                 http://search.proquest.com/docview/305316022?accountid=14677",
  abstract =     "We investigate a cryptographically secure pseudorandom
                 number generator based on a Linear Feedback Shift
                 Register (LFSR). The statistical properties of the
                 generator are examined, as well as its resistance to
                 cryptographic analysis. LFSRs are known to produce bit
                 streams that have excellent statistical properties.
                 However, they can be predicted by monitoring their
                 outputs briefly. Many approaches have been tried to
                 modify an LFSR output to preserve its statistical
                 properties but make it unpredictable. These techniques
                 work in a `stream-wise' manner; for each bit output
                 from the LFSR, one bit is output from the composite
                 generator. All of these approaches have fallen to
                 cryptanalysis. The technique used in this project
                 processes the output of an LFSR with a hash function,
                 converting blocks of M bits into smaller blocks of N
                 bits. Since the hash function maps many input blocks
                 into any given output block, there is no way of
                 determining the LFSR state by knowing the value of an
                 output block. The resulting generator was analyzed
                 using standard statistical tests for randomness, such
                 as chi-square tests on the distribution of blocks of
                 bits, autocovariance of the output bit stream, and the
                 Marsaglia `Die-Hard Battery' of statistical tests. The
                 Lempel-Ziv data-compression algorithm was used on the
                 output stream to try to discover any structure. In
                 addition, a cryptographic analysis technique, the
                 Berlekamp-Massey algorithm, was used to determine the
                 difficulty of predicting the generator's output.",
  acknowledgement = ack-nhfb,
  advisor =      "Mark R. Bell",
}

@MastersThesis{Andem:2003:CTE,
  author =       "Vikram Reddy Andem",
  title =        "A Cryptanalysis of the {Tiny Encryption Algorithm}",
  type =         "Thesis ({Master of Science})",
  school =       "Department of Computer Science, University of
                 Alabama",
  address =      "Tuscaloosa, AL, USA",
  pages =        "viii + 60",
  year =         "2003",
  bibdate =      "Fri Jan 31 06:57:18 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.csshl.net/sites/default/files/downloadable/crypto/TEA_Cryptanalysis_-_VRAndem.pdf",
  acknowledgement = ack-nhfb,
}

@Misc{Anonymous:2003:DR,
  author =       "Anonymous",
  title =        "{\tt /dev/random}",
  howpublished = "Web site.",
  day =          "8",
  month =        jun,
  year =         "2003",
  bibdate =      "Sat Dec 24 11:48:39 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "From the site: ``Thus, in 1994 noted Linux kernel
                 hacker Theodore Ts'o wrote a driver for Linux, which
                 takes information about hard to predict events like
                 keyboard and mouse use, packet and disk drive timings,
                 and so on, and uses it to seed a cryptographically
                 secure random number generator. A process can then open
                 up the `file' {\tt /dev/random} (usually a character
                 device), and read out random bytes. The driver keeps an
                 estimate of how much entropy remains in the pool --- if
                 it goes below 0 then any reads will block until more
                 entropy is added.'' Also this: ``the actual driver is
                 implemented in drivers/char/random.c in the Linux
                 source tree.''",
  acknowledgement = ack-nhfb,
}

@Article{Barak:2003:TRN,
  author =       "Boaz Barak and Ronen Shaltiel and Eran Tromer",
  title =        "True Random Number Generators Secure in a Changing
                 Environment",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2779",
  pages =        "166--180",
  year =         "2003",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 4 18:12:50 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "CHES 2003; cryptography",
}

@TechReport{Beebe:2003:PRN,
  author =       "Nelson H. F. Beebe",
  title =        "Pseudo-random numbers: [mostly] a line [of code] at a
                 time",
  type =         "Lecture notes",
  institution =  inst-UTAH-MATH,
  address =      inst-UTAH-MATH:adr,
  pages =        "22",
  day =          "14",
  month =        jan,
  year =         "2003",
  bibdate =      "Mon Jan 06 17:33:51 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Boesgaard:2003:RNH,
  author =       "M. Boesgaard and M. Vesterager and T. Pedersen and J.
                 Christiansen and O. Scavenius",
  editor =       "Thomas Johansson",
  booktitle =    "Fast Software Encryption: {10th International
                 Workshop, FSE 2003, Lund, Sweden, February 24--26,
                 2003}",
  title =        "{Rabbit}: a New High-Performance Stream Cipher",
  volume =       "2887",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "307--329",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-3-540-39887-5_23",
  bibdate =      "Sat Apr 05 11:37:08 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Revised Papers 10.",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/chapter/10.1007/978-3-540-39887-5_23#citeas",
  acknowledgement = ack-nhfb,
}

@Article{Brent:2003:RNG,
  author =       "Richard P. Brent and Paul Zimmermann",
  title =        "Random number generators with period divisible by a
                 {Mersenne} prime",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2667",
  pages =        "1--10",
  year =         "2003",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-44839-X_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Dec 24 11:06:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  book-URL =     "http://link.springer.com/book/10.1007/3-540-44839-X",
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  remark =       "Proceedings of Computational Science and Its
                 Applications --- ICCSA 2003.",
}

@Article{Bucci:2003:HSO,
  author =       "M. Bucci and L. Germani and R. Luzzi and A. Trifiletti
                 and M. Varanonuovo",
  title =        "A high-speed oscillator-based truly random number
                 source for cryptographic applications on a smart card
                 {IC}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "52",
  number =       "4",
  pages =        "403--409",
  month =        apr,
  year =         "2003",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2003.1190581",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 5 08:52:46 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190581",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InProceedings{Courtois:2003:AAS,
  author =       "Nicolas T. Courtois",
  editor =       "Dan Boneh",
  booktitle =    "Advances in Cryptology -- {CRYPTO 2003}: {23rd Annual
                 International Cryptology Conference, Santa Barbara,
                 California, USA, August 17--21, 2003, Proceedings}",
  title =        "Fast Algebraic Attacks on Stream Ciphers with Linear
                 Feedback",
  volume =       "2003",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "176--194",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-3-540-45146-4_11",
  bibdate =      "Sat Apr 05 15:17:57 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/chapter/10.1007/978-3-540-45146-4_11#citeas",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: Check title and page numbers and authors",
  xxauthor =     "Nicolas T. Courtois and W. Meier",
  xxpages =      "345--359",
}

@Article{Crawford:2003:FWC,
  author =       "Diane Crawford and Simone Santini and Ralph Castain
                 and William F. Dowling and John Cook and Simon Dobson
                 and Peter J. Denning and Robert Dunham and Jef Raskin
                 and Dennis Tsichritzis",
  title =        "Forum: When Is a Computer More Like a Guitar than a
                 Washing Machine?; Corroboration the Only Way to
                 Determine {Web} Accuracy; How to Teach Critical
                 Thinking about {Web} Content; Create a Random Number
                 Service Based on the {Mersenne Twister}; Make Fair Uses
                 a Legal Requirement in {DRM} Systems; ``{The Missing
                 Customer}'' Redux; Enthusiasm, Drive, Wisdom, Patience
                 Not Tied to Age",
  journal =      j-CACM,
  volume =       "46",
  number =       "7",
  pages =        "11--13",
  month =        jul,
  year =         "2003",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Wed Sep 3 17:06:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
  keywords =     "Digital Rights Management (DRM)",
}

@Article{Deng:2003:SHD,
  author =       "Lih-Yuan Deng and Hongquan Xu",
  title =        "A system of high-dimensional, efficient, long-cycle
                 and portable uniform random number generators",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "299--309",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/945511.945513",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We propose a system of multiple recursive generators
                 of modulus $p$ and order $k$ where all nonzero
                 coefficients of the recurrence are equal. The advantage
                 of this property is that a single multiplication is
                 needed to compute the recurrence, so the generator
                 would run faster than the general case. For $ p =
                 2^{31} - 1 $, the most popular modulus used, we provide
                 tables of specific parameter values yielding maximum
                 period for recurrence of order $ k = 102 $ and $ 120 $.
                 For $ p = 2^{31} - 55719 $ and $ k = 1511 $, we have
                 found generators with a period length approximately $
                 10^{14100.5} $.",
  acknowledgement = ack-nhfb,
  annote =       "Best period is $ 2^{46841} \approx 10^{14100} $.",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  remark =       "The authors claim that for the special case of $ p =
                 2^{31} - 1 $, the operation $ z \bmod p $ can be
                 computed quickly with this C expression: \verb=(z & p)
                 + (z >> 31)=. However, that is wrong: it fails for
                 exactly three cases in 32-bit arithmetic: z =
                 0x7fffffff [wrong 0x7fffffff vs. correct 0], z =
                 0xfffffffe [wrong 0x7fffffff vs correct 0], and z =
                 0xffffffff [wrong 0x80000000 vs correct 1]. In 64-bit
                 arithmetic, which is needed for the products in an LCG
                 or an MCG, there are {\em many\/} failing cases.",
}

@Book{Devroye:2003:NUR,
  author =       "Luc Devroye",
  title =        "Non-Uniform Random Variate Generation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxii + 843",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-1-4613-8643-8",
  ISBN =         "1-4613-8645-4",
  ISBN-13 =      "978-1-4613-8645-2",
  LCCN =         "QA273.A1-274.9; QA274-274.9",
  bibdate =      "Tue Apr 29 18:44:55 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat2000.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Distribution (Probability theory)",
}

@Article{Dichtl:2003:HPO,
  author =       "Markus Dichtl",
  title =        "How to Predict the Output of a Hardware Random Number
                 Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2779",
  pages =        "181--188",
  year =         "2003",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 4 18:12:50 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "CHES 2003; cryptography",
}

@Article{Dwyer:2003:PRN,
  author =       "Gerald P. {Dwyer, Jr.} and K. B. Williams",
  title =        "Portable random number generators",
  journal =      j-J-ECON-DYN-CONTROL,
  volume =       "27",
  number =       "4",
  pages =        "645--650",
  month =        feb,
  year =         "2003",
  CODEN =        "JEDCDH",
  DOI =          "https://doi.org/10.1016/S0165-1889(01)00065-3",
  ISSN =         "0165-1889 (print), 1879-1743 (electronic)",
  ISSN-L =       "0165-1889",
  bibdate =      "Fri Jul 01 08:11:16 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0165188901000653",
  abstract =     "We present a random number generator that is useful
                 for serious computations and can be implemented easily
                 in any language that has 32-bit signed integers, for
                 example C, C++ and FORTRAN. This combination generator
                 has a cycle length that would take two millennia to
                 compute on widely used desktop computers. Based on an
                 extensive search, we provide parameter values better
                 than those previously available for this generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Economic Dynamics and Control",
  keywords =     "Congruential generators; Pseudorandom number
                 generators; Pseudorandom numbers; Random numbers",
}

@Article{Engel:2003:BLE,
  author =       "Hans-Andreas Engel and Christoph Leuenberger",
  title =        "{Benford}'s law for exponential random variables",
  journal =      j-STAT-PROB-LETT,
  volume =       "63",
  number =       "4",
  pages =        "361--365",
  day =          "15",
  month =        jul,
  year =         "2003",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/S0167-7152(03)00101-9",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "60E99 (60C05)",
  MRnumber =     "1996184 (2004d:60050)",
  MRreviewer =   "Ulrich M. Hirth",
  bibdate =      "Tue Nov 22 11:28:19 MST 2011",
  bibsource =    "http://www.sciencedirect.com/;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167715203001019",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
  keywords =     "Benford's Law",
}

@Article{Epstein:2003:DIT,
  author =       "Michael Epstein and Laszlo Hars and Raymond Krasinski
                 and Martin Rosner and Hao Zheng",
  title =        "Design and Implementation of a True Random Number
                 Generator Based on Digital Circuit Artifacts",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2779",
  pages =        "152--165",
  year =         "2003",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 4 18:12:50 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "CHES 2003; cryptography",
}

@Article{Galmes:2003:ACM,
  author =       "Sebasti{\`a} Galm{\'e}s and Ramon Puigjaner",
  title =        "An algorithm for computing the mean response time of a
                 single server queue with generalized on\slash off
                 traffic arrivals",
  journal =      j-SIGMETRICS,
  volume =       "31",
  number =       "1",
  pages =        "37--46",
  month =        jun,
  year =         "2003",
  CODEN =        "PEREDN",
  DOI =          "https://doi.org/10.1145/781027.781033",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu Jun 26 11:41:41 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  abstract =     "In this paper, an exact solution for the response time
                 distribution of a single server, infinite capacity,
                 discrete-time queue is presented. This queue is fed by
                 a flexible discrete-time arrival process, which follows
                 an on/off evolution. A workload variable is associated
                 with each arrival instant, which may correspond to the
                 service demand generated by a single arrival, or
                 represent the number of simultaneous arrivals (bulk
                 arrivals). Accordingly, the analysis focuses on two
                 types of queues: (On/Off)/G/1 and (Batch-On/Off)/D/1.
                 For both cases, a decomposition approach is carried
                 out, which divides the problem into two contributions:
                 the response time experienced by single bursts in
                 isolation, and the increase on the response time caused
                 by the unfinished work that propagates from burst to
                 burst. Particularly, the solution for the unfinished
                 work is derived from a Wiener--Hopf factorization of
                 random walks, which was already used in the analysis of
                 discrete GI/G/1 queues. Compared to other related
                 works, the procedure proposed in this paper is exact,
                 valid for any traffic intensity and has no constraints
                 on the distributions of the input random variables
                 characterizing the process: duration of on and off
                 periods, and workload. From the general solution, an
                 efficient and robust iterative algorithm for computing
                 the expected response time of both queues is developed,
                 which can provide results at any desired precision.
                 This algorithm is numerically evaluated for different
                 types of input distributions and proved against
                 simulation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "http://portal.acm.org/toc.cfm?id=J618",
  keywords =     "arrival process; Markov chain; queuing model; response
                 time; steady-state",
}

@Book{Gentle:2003:RNG,
  author =       "James E. Gentle",
  title =        "Random Number Generation and {Monte Carlo} Methods",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xv + 381",
  year =         "2003",
  ISBN =         "0-387-00178-6",
  ISBN-13 =      "978-0-387-00178-4",
  LCCN =         "QA298 .G46 2003",
  bibdate =      "Fri Dec 05 08:25:24 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$79.95",
  URL =          "http://www.science.gmu.edu/~jgentle/rngbk/",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface to Second Edition\\
                 Table of Contents\\
                 Chapter 1. Simulating Random Numbers from a Uniform
                 Distribution\\
                 Chapter 2. Quality of Random Number Generators\\
                 Chapter 3. Quasirandom Numbers\\
                 Chapter 4. Transformations of Uniform Deviates: General
                 Methods\\
                 Chapter 5. Simulating Random Numbers from Specific
                 Distributions\\
                 Chapter 6. Generation of Random Samples, Permutations,
                 and Stochastic Processes\\
                 Chapter 7. Monte Carlo Methods\\
                 Chapter 8. Software for Random Number Generation\\
                 Chapter 9. Monte Carlo Studies in Statistics\\
                 Bibliography\\
                 Author Index\\
                 Subject Index",
}

@Book{Gibbons:2003:NSI,
  author =       "Jean Dickinson Gibbons and Subhabrata Chakraborti",
  title =        "Nonparametric Statistical Inference",
  volume =       "168",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Fourth",
  pages =        "xxiv + 645",
  year =         "2003",
  ISBN =         "0-8247-4052-1",
  ISBN-13 =      "978-0-8247-4052-8",
  LCCN =         "QA278.8 .G498 2003",
  bibdate =      "Tue Jan 31 14:50:08 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  URL =          "http://www.e-streams.com/es0706/es0706\_3315.html;
                 http://www.loc.gov/catdir/enhancements/fy0647/2004266776-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Nonparametric statistics",
}

@Article{Goldreich:2003:SME,
  author =       "Oded Goldreich and Vered Rosen",
  title =        "On the Security of Modular Exponentiation with
                 Application to the Construction of Pseudorandom
                 Generators",
  journal =      j-J-CRYPTOLOGY,
  volume =       "16",
  number =       "2",
  pages =        "71--93",
  month =        mar,
  year =         "2003",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/s00145-002-0038-7",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  bibdate =      "Wed Nov 5 18:22:14 MST 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@TechReport{Gonnet:2003:RTT,
  author =       "G. Gonnet",
  title =        "Repeating Time Test for $ {U}(0, 1) $ Random Number
                 Generators",
  type =         "Technical Report",
  institution =  "Department of Computer Science, ETH Z{\"u}rich",
  address =      "Z{\"u}rich, Switzerland",
  year =         "2003",
  bibdate =      "Wed Apr 11 06:05:06 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.inf.ethz.ch/~gonnet/RepetitionTest",
  acknowledgement = ack-nhfb,
}

@Article{Goresky:2003:EMC,
  author =       "Mark Goresky and Andrew Klapper",
  title =        "Efficient multiply-with-carry random number generators
                 with maximal period",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "310--321",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In this (largely expository) article, we propose a
                 simple modification of the multiply-with-carry random
                 number generators of Marsaglia [1994] and Couture and
                 L'Ecuyer [1997]. The resulting generators are both
                 efficient (since they may be configured with a base b
                 which is a power of 2) and exhibit maximal period.
                 These generators are analyzed using a simple but
                 powerful algebraic technique involving $b$-adic
                 numbers.",
  acknowledgement = ack-nhfb,
  annote =       "Best period is $ 2^{2521} \approx 10^{758} $, but
                 appears to require arithmetic with multiword
                 integers.",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Grabner:2003:CGD,
  author =       "Peter J. Grabner and Arnold Knopfmacher and Helmut
                 Prodinger",
  title =        "Combinatorics of geometrically distributed random
                 variables: run statistics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "297",
  number =       "1--3",
  pages =        "261--270",
  day =          "17",
  month =        mar,
  year =         "2003",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Nov 5 08:45:32 MST 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Guimond:2003:SPI,
  author =       "Louis-S{\'e}bastien Guimond and Jan Patera and
                 Ji{\v{r}}{\'\i} Patera",
  title =        "Statistical properties and implementation of aperiodic
                 pseudorandom number generators",
  journal =      j-APPL-NUM-MATH,
  volume =       "46",
  number =       "3--4",
  pages =        "295--318",
  month =        sep,
  year =         "2003",
  CODEN =        "ANMAEL",
  ISSN =         "0168-9274 (print), 1873-5460 (electronic)",
  ISSN-L =       "0168-9274",
  bibdate =      "Sat Sep 6 10:45:26 MDT 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applnummath.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Numerical Mathematics: Transactions of IMACS",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01689274",
}

@Article{Gutierrez:2003:LNC,
  author =       "J. Gutierrez and I. E. Shparlinski and A. Winterhof",
  title =        "On the linear and nonlinear complexity profile of
                 nonlinear pseudorandom number generators",
  journal =      j-IEEE-TRANS-INF-THEORY,
  volume =       "49",
  number =       "1",
  pages =        "60--64",
  month =        jan,
  year =         "2003",
  CODEN =        "IETTAW",
  DOI =          "https://doi.org/10.1109/TIT.2002.806144",
  ISSN =         "0018-9448 (print), 1557-9654 (electronic)",
  ISSN-L =       "0018-9448",
  bibdate =      "Thu Jan 19 17:42:48 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Information Theory",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
}

@Article{Hellekalek:2003:EEC,
  author =       "Peter Hellekalek and Stefan Wegenkittl",
  title =        "Empirical evidence concerning {AES}",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "322--333",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://random.mat.sbg.ac.at/ftp/pub/publications/peter/aes_sub.ps;
                 http://random.mat.sbg.ac.at/~peter/slides_YACC04.pdf",
  abstract =     "AES, the Advanced Encryption Standard, is one of the
                 most important algorithms in modern cryptography.
                 Certain randomness properties of AES are of vital
                 importance for its security. At the same time, these
                 properties make AES an interesting candidate for a fast
                 nonlinear random number generator for stochastic
                 simulation. In this article, we address both of these
                 two aspects of AES. We study the performance of AES in
                 a series of statistical tests that are related to
                 cryptographic notions like confusion and diffusion. At
                 the same time, these tests provide empirical evidence
                 for the suitability of AES in stochastic simulation. A
                 substantial part of this article is devoted to the
                 strategy behind our tests and to their relation to
                 other important test statistics like Maurer's Universal
                 Test.",
  acknowledgement = ack-nhfb,
  annote =       "Best period is $ 2^{128} \approx 10^{38} $. From the
                 article: ``It appears that our test results are the
                 first detailed statistical results for AES in the
                 published literature. \ldots{}\par AES has been
                 evaluated using the NIST package (see NIST [2001a]). In
                 principle, we consider this type of testing necessary
                 and valuable. However, up to now, AES has only been
                 tested using relatively small sample sizes.
                 Furthermore, the exact test procedure and the
                 parameters that were used have not been published.
                 There are no refereed publications on this topic.
                 \ldots{} \par 4. FINDINGS\par AES performed very well.
                 The empirical results support the hypothesis that AES
                 is not only an excellent cryptographic algorithm, but
                 also a very interesting nonlinear random number
                 generator for stochastic simulation.\par We were unable
                 to find any statistical weaknesses. Most of the
                 $p$-values were completely uncritical, no systematic
                 trends popped up in the tests.\par \ldots{} \par The
                 results indicate that AES pseudorandom numbers are
                 indistinguishable from real random numbers with respect
                 to bit-vectors up to length 16 and with respect to the
                 distribution of 0's and 1's in bit-vectors up to length
                 256.\par From the results for DIFF we conclude that AES
                 is able to compensate for an extreme lack of 1's in the
                 plaintext, and hence provides excellent diffusion in
                 this case. The results for KCOUNT provide some
                 confidence that the key schedule used for generating
                 the internal keys for the encryption rounds in AES does
                 a good job. Similar keys do not yield correlated output
                 sequences.''",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@InProceedings{Hernandez:2003:FED,
  author =       "Julio C{\'e}sar Hern{\'a}ndez and Pedro Isasi",
  editor =       "{IEEE}",
  booktitle =    "{The 2003 Congress on Evolutionary Computation, 2003.
                 CEC '03}",
  title =        "Finding efficient distinguishers for cryptographic
                 mappings, with an application to the block cipher
                 {TEA}",
  volume =       "3",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "2189--2193",
  year =         "2003",
  DOI =          "https://doi.org/10.1109/CEC.2003.1299943",
  ISBN =         "0-7803-7804-0",
  ISBN-13 =      "978-0-7803-7804-9",
  LCCN =         "",
  bibdate =      "Fri Jan 31 07:31:10 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1299943",
  acknowledgement = ack-nhfb,
}

@Article{Hill:2003:UPO,
  author =       "David R. C. Hill",
  title =        "{URNG}: a portable optimization technique for software
                 applications requiring pseudo-random numbers",
  journal =      j-SIM-MODEL-PRACT-THEORY,
  volume =       "1",
  number =       "4",
  pages =        "643--654",
  day =          "15",
  month =        dec,
  year =         "2003",
  CODEN =        "SMPTCA",
  DOI =          "https://doi.org/10.1016/j.simpat.2003.08.007",
  ISSN =         "1569-190X (print), 1878-1462 (electronic)",
  ISSN-L =       "1569-190X",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1569190X03001011",
  acknowledgement = ack-nhfb,
  fjournal =     "Simulation Modelling Practice and Theory",
  keywords =     "unrolled random number generator (URNG)",
}

@Article{Hitchcock:2003:HMH,
  author =       "David B. Hitchcock",
  title =        "A History of the {Metropolis--Hastings} Algorithm",
  journal =      j-AMER-STAT,
  volume =       "57",
  number =       "4",
  pages =        "254--257",
  month =        nov,
  year =         "2003",
  CODEN =        "ASTAAJ",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Jan 8 07:07:00 MST 2004",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/amstat2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://oberon.ingentaselect.com/cgi-bin/linker?ini=asa&reqidx=/cw/asa/00031305/v57n4/s7/p254;
                 http://www.jstor.org/stable/30037292",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Hormann:2003:CRV,
  author =       "Wolfgang H{\"o}rmann and Josef Leydold",
  title =        "Continuous random variate generation by fast numerical
                 inversion",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "347--362",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  URL =          "http://statistik.wu-wien.ac.at/unuran/",
  abstract =     "The inversion method for generating nonuniform random
                 variates has some advantages compared to other
                 generation methods, since it monotonically transforms
                 uniform random numbers into non-uniform random
                 variates. Hence, it is the method of choice in the
                 simulation literature. However, except for some simple
                 cases where the inverse of the cumulative distribution
                 function is a simple function we need numerical
                 methods. Often inversion by ``brute force'' is used,
                 applying either very slow iterative methods or linear
                 interpolation of the CDF and huge tables. But then the
                 user has to accept unnecessarily large errors or
                 excessive memory requirements, that slow down the
                 algorithm. In this article, we demonstrate that with
                 Hermite interpolation of the inverse CDF we can obtain
                 very small error bounds close to machine precision.
                 Using our adaptive interval splitting method, this
                 accuracy is reached with moderately sized tables that
                 allow for a fast and simple generation procedure.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  remark =       "From the article: ``we have written this article to
                 demonstrate that numerical inversion can be realized in
                 a simple, accurate and fast algorithm utilizing tables
                 of moderate size. It has fairly short code and is
                 implemented in our freely available UNU.RAN library
                 (see Leydold and H{\"o}rmann [2002]).\par

                 To test the correctness of an inversion algorithm, it
                 is not necessary to make statistical tests. It is
                 enough to compute the maximal and the average $u$-error
                 $ |u - F(x)| $ obtained in a large sample of uniformly
                 distributed $u$ values.\par

                 The generation speed is for all distributions (much)
                 faster than using iterative methods and about the same
                 as generating an exponential random variate.''.",
}

@Misc{Intel:2003:IRN,
  author =       "{Intel Corporation}",
  title =        "The {Intel} Random Number Generator",
  howpublished = "World-Wide Web document.",
  year =         "2003",
  bibdate =      "Mon Dec 08 09:38:29 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://developer.intel.com/design/chipsets/rng/docs.htm",
  acknowledgement = ack-nhfb,
}

@Article{Joe:2003:RAI,
  author =       "Stephen Joe and Frances Y. Kuo",
  title =        "Remark on {Algorithm 659}: {Implementing} {Sobol}'s
                 quasirandom sequence generator",
  journal =      j-TOMS,
  volume =       "29",
  number =       "1",
  pages =        "49--57",
  month =        mar,
  year =         "2003",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Fri Mar 28 08:17:55 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://doi.acm.org/10.1145/641876.641879",
  abstract =     "An algorithm to generate Sobol' sequences to
                 approximate integrals in up to 40 dimensions has been
                 previously given by Bratley and Fox in Algorithm 659.
                 Here, we provide more primitive polynomials and
                 ``direction numbers'' so as to allow the generation of
                 Sobol' sequences to approximate integrals in up to 1111
                 dimensions. The direction numbers given generate Sobol'
                 sequences that satisfy Sobol's so-called Property A.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "algorithms; Low-discrepancy sequences; primitive
                 polynomials; quasirandom sequences; Sobol' sequences",
  subject =      "G. Mathematics of Computing G.1 NUMERICAL ANALYSIS
                 G.1.4 Quadrature and Numerical Differentiation
                 Subjects: Multidimensional (multiple) quadrature",
}

@Article{Kocarev:2003:CPR,
  author =       "Ljupco Kocarev and Goce Jakimoski and Zarko Tasev",
  title =        "Chaos and Pseudo-Randomness",
  journal =      j-LECT-NOTES-CONTROL-INF-SCI,
  volume =       "292",
  pages =        "682--685",
  year =         "2003",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/978-3-540-44986-7_11",
  ISSN =         "0170-8643 (print), 1610-7411 (electronic)",
  ISSN-L =       "0170-8643",
  bibdate =      "Wed Dec 21 08:30:54 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We discuss the effect on finite machine implementation
                 of chaotic system on randomness. We show that the most
                 significant bit even for fully developed chaotic
                 systems implemented with high precision (using 1000-bit
                 arithmetics) is not random. We propose chaos-based
                 pseudo-random bit generators and discuss their
                 efficient software implementation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Control and Information Sciences",
}

@Article{LEcuyer:2003:CGC,
  author =       "Pierre L'Ecuyer and Jacinthe Granger-Pich{\'e}",
  title =        "Combined generators with components from different
                 families",
  journal =      j-MATH-COMP-SIM,
  volume =       "62",
  number =       "3--6",
  pages =        "395--404",
  month =        mar,
  year =         "2003",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(02)00234-3",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Fri Dec 30 14:46:26 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "3rd IMACS Seminar on Monte Carlo Methods---MCM 2001
                 (Salzburg)",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475402002343",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{Lemieux:2003:RPL,
  author =       "Christiane Lemieux and Pierre L'Ecuyer",
  title =        "Randomized Polynomial Lattice Rules for Multivariate
                 Integration and Simulation",
  journal =      j-SIAM-J-SCI-COMP,
  volume =       "24",
  number =       "5",
  pages =        "1768--1789",
  month =        sep,
  year =         "2003",
  CODEN =        "SJOCE3",
  DOI =          "https://doi.org/10.1137/S1064827501393782",
  ISSN =         "1064-8275 (print), 1095-7197 (electronic)",
  ISSN-L =       "1064-8275",
  MRclass =      "65C05 (65D30)",
  MRnumber =     "1978160 (2004e:65009)",
  MRreviewer =   "Fred J. Hickernell",
  bibdate =      "Wed Aug 20 06:34:28 MDT 2003",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SISC/24/5;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/39378",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific Computing",
  journal-URL =  "http://epubs.siam.org/sisc",
}

@Article{Li:2003:ULD,
  author =       "Xueqing Li and Wenping Wang and Ralph R. Martin and
                 Adrian Bowyer",
  title =        "Using low-discrepancy sequences and the {Crofton}
                 formula to compute surface areas of geometric models",
  journal =      j-CAD,
  volume =       "35",
  number =       "9",
  pages =        "771--782",
  month =        aug,
  year =         "2003",
  CODEN =        "CAIDA5",
  DOI =          "https://doi.org/10.1016/S0010-4485(02)00100-8",
  ISSN =         "0010-4485 (print), 1879-2685 (electronic)",
  ISSN-L =       "0010-4485",
  bibdate =      "Wed Feb 08 09:05:17 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010448502001008",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Aided Design",
}

@Article{Lodwick:2003:EVC,
  author =       "Weldon A. Lodwick and K. David Jamison",
  title =        "Estimating and Validating the Cumulative Distribution
                 of a Function of Random Variables: Toward the
                 Development of Distribution Arithmetic",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "9",
  number =       "2",
  pages =        "127--141",
  month =        apr,
  year =         "2003",
  CODEN =        "RCOMF8",
  DOI =          "https://doi.org/10.1023/A:1023090317875",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  bibdate =      "Mon Feb 6 07:42:02 MST 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1385-3139&volume=9&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/rc.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=1385-3139&volume=9&issue=2&spage=127",
  acknowledgement = ack-nhfb # "\slash " # ack-rbk # "\slash " # ack-vk,
  fjournal =     "Reliable Computing = Nadezhnye vychisleniia",
  journal-URL =  "http://link.springer.com/journal/11155",
}

@Article{Louchard:2003:ARS,
  author =       "Guy Louchard and Helmut Prodinger",
  title =        "Ascending runs of sequences of geometrically
                 distributed random variables: a probabilistic
                 analysis",
  journal =      j-THEOR-COMP-SCI,
  volume =       "304",
  number =       "1--3",
  pages =        "59--86",
  day =          "28",
  month =        jul,
  year =         "2003",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Nov 5 08:45:44 MST 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@InCollection{Maaranen:2003:UQR,
  author =       "Heikki Maaranen and Kaisa Miettinen and Marko M.
                 M{\"a}kel{\"a}",
  title =        "Using Quasi Random Sequences in Genetic Algorithms",
  crossref =     "Rudnicki:2003:OIP",
  pages =        "33--44",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-94-017-2494-4_4",
  bibdate =      "Sat Jul 3 14:01:27 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Marsaglia:2003:EKD,
  author =       "George Marsaglia and Wai Wan Tsang and Jingbo Wang",
  title =        "Evaluating {Kolmogorov}'s Distribution",
  journal =      j-J-STAT-SOFT,
  volume =       "8",
  number =       "18",
  pages =        "1--4",
  year =         "2003",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Tue Dec 16 17:06:19 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/v08/i18;
                 http://www.jstatsoft.org/v08/i18/k.pdf",
  abstract =     "Kolmogorov's goodness-of-fit measure, $ D_n $, for a
                 sample CDF has consistently been set aside for methods
                 such as the $ D_n^+ $ or $ D_n^- $; of Smirnov,
                 primarily, it seems, because of the difficulty of
                 computing the distribution of $ D_n $. As far as we
                 know, no easy way to compute that distribution has ever
                 been provided in the 70+ years since Kolmogorov's
                 fundamental paper. We provide one here, a C procedure
                 that provides $ \mbox {Pr}(D_n < d) $ with 13--15 digit
                 accuracy for $n$ ranging from $2$ to at least $ 16000
                 $. We assess the (rather slow) approach to limiting
                 form, and because computing time can become excessive
                 for probabilities $ > 0.999 $ with $n$'s of several
                 thousand, we provide a quick approximation that gives
                 accuracy to the 7th digit for such cases.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
}

@Article{Marsaglia:2003:RNG,
  author =       "George Marsaglia",
  title =        "Random Number Generators",
  journal =      j-J-MOD-APPL-STAT-METH,
  volume =       "2",
  number =       "1",
  pages =        "2--13",
  month =        may,
  year =         "2003",
  CODEN =        "????",
  ISSN =         "1538-9472",
  bibdate =      "Wed Dec 17 08:26:46 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://stat.fsu.edu/pub/diehard/;
                 http://tbf.coe.wayne.edu/jmasm/;
                 http://www.csis.hku.hk/~diehard/",
  abstract =     "The author discusses some promising new random number
                 generators, as well as formulates the mathematical
                 basis that makes them random variables in the same
                 sense as more familiar ones in probability and
                 statistics, emphasizing his view that randomness exists
                 only in the sense of mathematics. He discusses the need
                 for adequate seeds that provide the axioms for that
                 mathematical basis, and gives examples from Law and
                 Gaming, where inadequacies have led to difficulties. He
                 also describes new versions of the widely used Diehard
                 Battery of Tests of Randomness.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Modern Applied Statistical Methods",
  keywords =     "Random number generator, Diehard Test",
  remark =       "This paper contains a nice survey of recommended
                 generators, a recipe for recovering the multiplier and
                 addend of linear congruential generators (p. 4,
                 ``Cracking a Congruential RNG''), information on a
                 direct floating-point RNG, and discussion of the new
                 revision of the Diehard Test Suite.",
}

@Article{Marsaglia:2003:TOS,
  author =       "George Marsaglia",
  title =        "Technical opinion: Seeds for random number generators:
                 Techniques for choosing seeds for social and scientific
                 applications of random number generators",
  journal =      j-CACM,
  volume =       "46",
  number =       "5",
  pages =        "90--93",
  month =        may,
  year =         "2003",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Wed Sep 3 17:06:36 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Marsaglia:2003:XR,
  author =       "George Marsaglia",
  title =        "Xorshift {RNGs}",
  journal =      j-J-STAT-SOFT,
  volume =       "8",
  number =       "14",
  pages =        "1--6",
  year =         "2003",
  CODEN =        "JSSOBK",
  DOI =          "https://doi.org/10.18637/jss.v008.i14",
  ISSN =         "1548-7660",
  ISSN-L =       "1548-7660",
  bibdate =      "Tue Dec 16 17:06:19 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  note =         "See \cite{Brent:2004:NMX} for corrections and the
                 equivalence of xorshift generators and the
                 well-understood linear feedback shift register
                 generators. See also
                 \cite{Salmon:2011:PRN,Saito:2012:DCS,Steele:2014:FSP}
                 for the failure of Marsaglia's {\tt xorwow()} generator
                 from this paper. See
                 \cite{Panneton:2005:XRN,Vigna:2016:EEM} for detailed
                 analysis.",
  URL =          "http://www.jstatsoft.org/v08/i14;
                 http://www.jstatsoft.org/v08/i14/xorshift.pdf",
  abstract =     "Description of a class of simple, extremely fast
                 random number generators (RNGs) with periods $ 2^k - 1
                 $ for $ k = 32, 64, 96, 128, 160, 192 $. These RNGs
                 seem to pass tests of randomness very well.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
}

@Article{Matsumoto:2003:SDT,
  author =       "Makoto Matsumoto and Takuji Nishimura",
  title =        "Sum-discrepancy test on pseudorandom number
                 generators",
  journal =      j-MATH-COMP-SIM,
  volume =       "434",
  number =       "1",
  pages =        "431--442",
  day =          "3",
  month =        mar,
  year =         "2003",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(02)00227-6",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475402002276",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
}

@Article{McNichol:2003:HTM,
  author =       "Tom McNichol",
  title =        "How two math geeks with a lava lamp and a webcam are
                 about to unleash chaos on the {Internet}",
  journal =      j-WIRED,
  volume =       "11",
  number =       "8",
  pages =        "??--??",
  month =        aug,
  year =         "2003",
  CODEN =        "WREDEM",
  ISSN =         "1059-1028 (print), 1078-3148 (electronic)",
  ISSN-L =       "1059-1028",
  bibdate =      "Sat Aug 23 07:53:02 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.lavarnd.org;
                 http://www.wired.com/wired/archive/11.08/random.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Wired",
  journal-URL =  "http://www.wired.com",
  keywords =     "lavarand (US Patent 5,732,138: Method for seeding a
                 pseudo-random number generator with a cryptographic
                 hash of a digitization of a chaotic system); LavaRnd",
}

@Article{Meidl:2003:LCP,
  author =       "Wilfried Meidl and Arne Winterhof",
  title =        "On the linear complexity profile of explicit nonlinear
                 pseudorandom numbers",
  journal =      j-INFO-PROC-LETT,
  volume =       "85",
  number =       "1",
  pages =        "13--18",
  day =          "16",
  month =        jan,
  year =         "2003",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Jan 26 08:44:30 MST 2004",
  bibsource =    "http://www.sciencedirect.com/science/journal/00200190;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Misc{Mertens:2003:EPR,
  author =       "Stephan Mertens and Heiko Bauke",
  title =        "Entropy of pseudo random number generators",
  howpublished = "Web document",
  month =        "????",
  year =         "2003",
  bibdate =      "Sat Sep 17 14:05:15 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/cond-mat/0305319",
  abstract =     "Since the work of Ferrenberg et al. [Physical Review
                 Letters 69, (1992); \cite{Ferrenberg:1992:MCS}] some
                 pseudo random number generators are known to yield
                 wrong results in cluster Monte Carlo simulations. In
                 this contribution the fundamental mechanism behind this
                 failure is discussed. Almost all random number
                 generators calculate a new pseudo random number $ x_i $
                 from preceding values, $ x_i = f(x_{i - 1}, x_{i - 2},
                 \ldots {}, x_{i - q}) $. Failure of these generators in
                 cluster Monte Carlo simulations and related experiments
                 can be attributed to the low entropy of the production
                 rule $ f() $ conditioned on the statistics of the input
                 values $ x_{i - 1}, \ldots {}, x_{i - q} $. Being a
                 measure only of the arithmetic operations in the
                 generator rule, the conditional entropy is independent
                 of the lag in the recurrence or the period of the
                 sequence. In that sense it measures a more profound
                 quality of a random number generator than empirical
                 tests with their limited horizon.",
  acknowledgement = ack-nhfb,
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@TechReport{Mether:2003:HCL,
  author =       "Max Mether",
  title =        "The history of the central limit theorem",
  type =         "Class notes",
  institution =  "Systems Analysis Laboratory, Helsinki University of
                 Technology",
  address =      "Helsinki, Finland",
  pages =        "25",
  day =          "6",
  month =        nov,
  year =         "2003",
  bibdate =      "Wed Aug 04 11:48:08 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Myers:2003:EAS,
  author =       "Steven Myers",
  title =        "Efficient Amplification of the Security of Weak
                 Pseudo-Random Function Generators",
  journal =      j-J-CRYPTOLOGY,
  volume =       "16",
  number =       "1",
  pages =        "1--24",
  month =        jan,
  year =         "2003",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/s00145-002-0007-1",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  bibdate =      "Wed Nov 5 18:22:14 MST 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@Article{Neal:2003:SS,
  author =       "Radford M. Neal",
  title =        "Slice sampling",
  journal =      j-ANN-STAT,
  volume =       "31",
  number =       "3",
  pages =        "705--767",
  month =        jun,
  year =         "2003",
  CODEN =        "ASTSC7",
  ISSN =         "0090-5364 (print), 2168-8966 (electronic)",
  ISSN-L =       "0090-5364",
  bibdate =      "Wed Jun 4 06:40:54 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annstat2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://projecteuclid.org/euclid.aos/1056562461",
  acknowledgement = ack-nhfb,
  fjournal =     "Annals of Statistics",
  journal-URL =  "http://projecteuclid.org/all/euclid.aos/",
}

@Article{Neuenschwander:2003:GRN,
  author =       "Daniel Neuenschwander and Hansmartin Zeuner",
  title =        "Generating random numbers of prescribed distribution
                 using physical sources",
  journal =      j-STAT-COMPUT,
  volume =       "13",
  number =       "1",
  pages =        "5--11",
  month =        feb,
  year =         "2003",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1023/A:1021999708104",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  bibdate =      "Sat Jan 31 12:22:09 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://link.springer.com/article/10.1023/A%3A1021999708104",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
}

@Article{Niederreiter:2003:EGE,
  author =       "Harald Niederreiter",
  title =        "The Existence of Good Extensible Polynomial Lattice
                 Rules",
  journal =      j-MONAT-MATH,
  volume =       "139",
  number =       "4",
  pages =        "297--307",
  month =        "????",
  year =         "2003",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s00605-002-0530-z",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  MRclass =      "11K45 (65C05 65D30)",
  MRnumber =     "2001711 (2004j:11087)",
  MRreviewer =   "Henri Faure",
  bibdate =      "Fri Mar 09 12:00:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@TechReport{Nisan:2003:HVR,
  author =       "Noam Nisan and Avi Wigderson",
  title =        "Hardness vs. Randomness",
  type =         "Report",
  institution =  "Institute of Computer Science Hebrew University of
                 Jerusalem",
  address =      "Jerusalem, Israel",
  pages =        "20",
  day =          "25",
  month =        nov,
  year =         "2003",
  bibdate =      "Wed Apr 10 09:03:21 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/NOAM/HARDNESS/final.pdf",
  abstract =     "We present a simple new construction of a pseudorandom
                 bit generator, based on the constant depth generators
                 of [N]. It stretches a short string of truly random
                 bits into a long string that looks random to any
                 algorithm from a complexity class C (e.g. P, NC,
                 PSPACE, \ldots) using an arbitrary function that is
                 hard for C.\par

                 This construction reveals an equivalence between the
                 problem of proving lower bounds and the problem of
                 generating good pseudorandom sequences.\par

                 Our construction has many consequences. The most direct
                 one is that efficient deterministic simulation of
                 randomized algorithms is possible under much weaker
                 assumptions than previously known. The efficiency of
                 the simulations depends on the strength of the
                 assumptions, and may achieve P = BPP. We believe that
                 our results are very strong evidence that the gap
                 between randomized and deterministic complexity is not
                 large.\par

                 Using the known lower bounds for constant depth
                 circuits, our construction yields an unconditionally
                 proven pseudorandom generator for constant depth
                 circuits. As an application of this generator we
                 characterize the power of NP with a random oracle",
  acknowledgement = ack-nhfb,
  remark =       "This is one of the papers cited in the 2023 Alan M.
                 Turing Award to Avi Wigderson.",
}

@Article{Owen:2003:VAS,
  author =       "Art B. Owen",
  title =        "Variance with alternative scramblings of digital
                 nets",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "363--378",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@InCollection{Papadimitrioul:2003:FSS,
  author =       "G. I. Papadimitrioul and B. Sadoun and C. Papazoglou",
  editor =       "Mohammad S. Obaidat and Georgios I. Papadimitriou",
  booktitle =    "Applied System Simulation: Methodologies and
                 Applications",
  title =        "Fundamentals of System Simulation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  bookpages =    "vi + 515",
  pages =        "9--39",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-1-4419-9218-5_2",
  ISBN =         "1-4419-9218-9",
  ISBN-13 =      "978-1-4419-9218-5",
  LCCN =         "????",
  bibdate =      "Fri Mar 09 08:11:47 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Applied system simulation; output analysis; random
                 number generation; random variate generation;
                 simulation experimentation; simulation programming
                 languages and packages",
}

@Article{PeytonJones:2003:RNa,
  author =       "Simon {Peyton Jones}",
  title =        "12 Rational Numbers",
  journal =      j-J-FUNCT-PROGRAM,
  volume =       "13",
  number =       "1",
  pages =        "149--152",
  month =        jan,
  year =         "2003",
  CODEN =        "JFPRES",
  DOI =          "https://doi.org/10.1017/S0956796803001412",
  ISSN =         "0956-7968 (print), 1469-7653 (electronic)",
  ISSN-L =       "0956-7968",
  bibdate =      "Tue Jul 11 18:02:31 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.cambridge.org/core/product/AC5742F18F56DDBC1A1F9E0183B8A215",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Funct. Program.",
  fjournal =     "Journal of Functional Programming",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=JFP",
  onlinedate =   "28 January 2003",
  pagecount =    "6",
  remark =       "Special Issue: The Journals of Functional Programming.
                 Haskell 98 II The Haskell 98 Libraries.",
  tableofcontents = "27.1 The RandomGen class, and the StdGen generator
                 / 236 \\
                 27.2 The Random class / 239 \\
                 27.3 The global random number generator / 240",
}

@Article{PeytonJones:2003:RNb,
  author =       "Simon {Peyton Jones}",
  title =        "27 Random Numbers",
  journal =      j-J-FUNCT-PROGRAM,
  volume =       "13",
  number =       "1",
  pages =        "235--240",
  month =        jan,
  year =         "2003",
  CODEN =        "JFPRES",
  DOI =          "https://doi.org/10.1017/S0956796803002910",
  ISSN =         "0956-7968 (print), 1469-7653 (electronic)",
  ISSN-L =       "0956-7968",
  bibdate =      "Thu Jul 13 06:32:58 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.cambridge.org/core/product/E141AFF92D015912D4A5CC313B0D6A9F",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Funct. Program.",
  fjournal =     "Journal of Functional Programming",
  journal-URL =  "https://www.cambridge.org/core/journals/journal-of-functional-programming",
  onlinedate =   "28 January 2003",
}

@Article{Pitman:2003:IDL,
  author =       "Jim Pitman and Marc Yor",
  title =        "Infinitely Divisible Laws Associated with Hyperbolic
                 Functions",
  journal =      j-CAN-J-MATH,
  volume =       "55",
  number =       "??",
  pages =        "292--330",
  month =        "????",
  year =         "2003",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-2003-014-x",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:39:11 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v55/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The infinitely divisible distributions on {\bf R}$^+$
                 of random variables C$_t$, S$_t$ and T$_t$ with Laplace
                 transforms ({frac1}{\cosh \sqrt{2\lambda}})$^t$,
                 (frac{\sqrt{2\lambda}}{\sinh \sqrt{2\lambda}})$^t$, and
                 (frac{\tanh \sqrt{2\lambda}}{\sqrt{2\lambda}})$^t$
                 respectively are characterized for various t > 0 in a
                 number of different ways: by simple relations between
                 their moments and cumulants, by corresponding relations
                 between the distributions and their L{\'e}vy measures,
                 by recursions for their Mellin transforms, and by
                 differential equations satisfied by their Laplace
                 transforms. Some of these results are interpreted
                 probabilistically via known appearances of these
                 distributions for t=1 or 2 in the description of the
                 laws of various functionals of Brownian motion and
                 Bessel processes, such as the heights and lengths of
                 excursions of a one-dimensional Brownian motion. The
                 distributions of C$_1$ and S$_2$ are also known to
                 appear in the Mellin representations of two important
                 functions in analytic number theory, the Riemann zeta
                 function and the Dirichlet L-function associated with
                 the quadratic character modulo 4. Related families of
                 infinitely divisible laws, including the \gamma,
                 logistic and generalized hyperbolic secant
                 distributions, are derived from S$_t$ and C$_t$ by
                 operations such as Brownian subordination, exponential
                 tilting, and weak limits, and characterized in various
                 ways.",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Book{Reid:2003:SSE,
  author =       "Jason Reid",
  title =        "Secure Shell in the Enterprise",
  publisher =    pub-SUN-MICROSYSTEMS-PRESS,
  address =      pub-SUN-MICROSYSTEMS-PRESS:adr,
  pages =        "xxiii + 198",
  year =         "2003",
  ISBN =         "0-13-142900-0 (paperback)",
  ISBN-13 =      "978-0-13-142900-0 (paperback)",
  LCCN =         "QA76.76.O63 R448 2003",
  bibdate =      "Wed Jan 21 05:22:59 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$39.00",
  series =       "Sun blueprints",
  acknowledgement = ack-nhfb,
  idnumber =     "537",
  subject =      "Solaris (Computer file); Operating systems
                 (Computers); UNIX Shells; Computer networks; Security
                 measures",
  tableofcontents = "Acknowledgements / iii \\
                 Preface / xix \\
                 Introducing the Secure Protocols / 1 \\
                 Security History and Protocols / 1 \\
                 Secure Protocols / 2 \\
                 Authentication / 2 \\
                 Integrity / 4 \\
                 Confidentiality / 5 \\
                 Cryptographic Protocols / 5 \\
                 Security Policy / 8 \\
                 Tools / 9 \\
                 Kerberos / 9 \\
                 IPsec / 11 \\
                 Virtual Private Networks / 11 \\
                 Secure Shell / 12 \\
                 Determining Which Tool to Use / 13 \\
                 Tool Decision Example A / 14 \\
                 Tool Decision Example B / 14 \\
                 Secure Shell Choices / 15 \\
                 Solaris Secure Shell Software / 15 \\
                 OpenSSH / 15 \\
                 Noncommercial Implementations / 15 \\
                 Commercial Variants / 16 \\
                 Determining Which Secure Shell Software to Use / 17 \\
                 Secure Shell Software Decision Example A / 17 \\
                 Secure Shell Software Decision Example B / 17 \\
                 Consequences / 18 \\
                 Building OpenSSH / 19 \\
                 Components / 19 \\
                 Before Building OpenSSH / 20 \\
                 Static Versus Dynamic Libraries / 20 \\
                 Install Versus Build Location / 21 \\
                 About $PATH / 21 \\
                 Checking MD5 Hashes and GNU Privacy Guard Signatures /
                 21 \\
                 Component Descriptions / 21 \\
                 Solaris OE Build Machine / 22 \\
                 Solaris OE Release / 22 \\
                 Metaclusters / 22 \\
                 Gzip / 23 \\
                 Compilers / 23 \\
                 Perl / 24 \\
                 Zlib / 24 \\
                 To Build Zlib / 24 \\
                 Entropy Sources / 26 \\
                 OpenSSH Internal Entropy Collection / 27 \\
                 Kernel-Level Random Number Generators / 28 \\
                 AND Irand / 28 \\
                 SUNWski / 28 \\
                 Entropy-Gathering Daemon / 28 \\
                 Pseudorandom Number Generator Daemon / 29 \\
                 Recommendations / 29 \\
                 Building PRNGD Software / 29 \\
                 To Build PRNGD With the Forte C Compiler / 29 \\
                 To Build PRNGD With the GNU C Compiler / 30 \\
                 Manually Installing PRNGD / 30 \\
                 To Install PRNGD / 31 \\
                 Running PRNGD / 32 \\
                 To Start the PRNGD Manually / 32 \\
                 To Stop the PRNGD Manually / 32 \\
                 Testing the Entropy Source / 32 \\
                 Checking /dev/random / 32 \\
                 Checking PRNGD / 33 \\
                 TCP Wrappers / 33 \\
                 Building TCP Wrappers / 34 \\
                 To Build TCP Wrappers / 34 \\
                 To Install TCP Wrappers / 34 \\
                 OpenSSL / 35 \\
                 To Build and Test OpenSSL / 36 \\
                 To Install OpenSSL / 36 \\
                 OpenSSH / 37 \\
                 Configuring OpenSSH / 37 \\
                 To Obtain the List of Arguments in the configure Script
                 / 37 \\
                 To Configure OpenSSH / 39 \\
                 Building OpenSSH / 40 \\
                 To Build OpenSSH / 40 \\
                 Configuring the Secure Shell / 41 \\
                 Configuration Details / 41 \\
                 Mechanics of Configuration Files / 42 \\
                 Recommendations / 43 \\
                 Server Recommendations / 43 \\
                 Protocol Support / 43 \\
                 Network Access / 43 \\
                 Keep-Alives / 44 \\
                 Data Compression / 44 \\
                 Privilege Separation / 45 \\
                 Login Grace Time / 45 \\
                 Password and Public Key Authentication / 45 \\
                 Superuser (root) Logins / 46 \\
                 Banners, Mail, and Message-of-the-Day / 46 \\
                 Connection and X11 Forwarding / 46 \\
                 User Access Control Lists / 47 \\
                 User File Permissions / 48 \\
                 UseLogin Keyword / 48 \\
                 Legacy Support / 49 \\
                 Client Recommendations / 49 \\
                 Host Option Assignment / 49 \\
                 Data Compression / 50 \\
                 Keep-Alives / 50 \\
                 Protocol Support / 50 \\
                 rlogin and rsh / 50 \\
                 Server Identity / 51 \\
                 User Identity / 51 \\
                 Deploying Secure Shell / 53 \\
                 OpenSSH Deployment / 53 \\
                 OpenSSH Packaging / 54 \\
                 To Generate the OBSDssh Package / 54 \\
                 MD5 Hashes / 55 \\
                 To Generate the OpenSSH Package MD5 Hash / 55 \\
                 Solaris Security Toolkit / 55 \\
                 Solaris Secure Shell Software Deployment / 56 \\
                 Custom Configuration File Distribution / 57 \\
                 Solaris Fingerprint Database / 58 \\
                 Integrating Secure Shell / 59 \\
                 Secure Shell Scripts / 59 \\
                 rsh(1) Versus ssh(1) / 60 \\
                 rcp(1) Versus scp(1) / 60 \\
                 telnet(1) Versus ssh(1) / 61 \\
                 Automated Logins / 62 \\
                 Host Keys / 63 \\
                 Proxies / 64 \\
                 Role-Based Access Control / 65 \\
                 To Use RBAC to Restrict a User to Only Copying Files /
                 66 \\
                 Port Forwarding / 68 \\
                 To Secure WebNFS Mounts With Port Forwarding / 69 \\
                 Insecure Service Disablement / 70 \\
                 To Disable Insecure Services / 70 \\
                 Managing Keys and Identities / 71 \\
                 Host Keys / 71 \\
                 User Identities / 73 \\
                 To Create an Identity / 74 \\
                 To Register an Identity / 75 \\
                 To Revoke an Identity / 75 \\
                 Agents / 75 \\
                 Common Desktop Environment Support / 77 \\
                 Removing Agents / 78 \\
                 Agent Risks / 79 \\
                 Auditing / 81 \\
                 Auditing Overview and Basic Procedures / 81 \\
                 To Configure Auditing to Audit a Systemwide Event / 82
                 \\
                 To Configure Auditing to Audit Commands Run by a
                 Particular User / 83 \\
                 To Enable Auditing / 83 \\
                 To Audit the System / 84 \\
                 To Audit a User / 84 \\
                 To Disable Auditing / 85 \\
                 OpenSSH / 86 \\
                 cron(1M) / 86 \\
                 Patching / 87 \\
                 Logging / 87 \\
                 To Enable Secure Shell Logging / 88 \\
                 Measuring Performance / 91 \\
                 Bandwidth Performance / 91 \\
                 Interactive Sessions / 92 \\
                 File Transfers / 92 \\
                 Symmetric Cipher Performance / 93 \\
                 Identity Generation / 94 \\
                 Performance Problems / 97 \\
                 Slow Connections / 97 \\
                 Slow Client Startup / 97 \\
                 Slow Server Startup / 98 \\
                 Sizing / 98 \\
                 Examining Case Studies / 101 \\
                 A Simple Virtual Private Network / 101 \\
                 To Set Up the Destination Side / 102 \\
                 To Set Up the Originating Side / 102 \\
                 To Initiate the Link / 102 \\
                 Linking Networks Through a Bastion Host / 103 \\
                 To Set Up the Destination Side / 104 \\
                 To Set Up the Originating Side / 104 \\
                 Resolving Problems and Finding Solutions / 105 \\
                 Problems / 105 \\
                 Server Does Not Produce Log File Output / 105 \\
                 Public Key Authentication Is Not Working / 106 \\
                 Trusted Host Authentication Is Not Working / 106 \\
                 X Forwarding Is Not Working / 106 \\
                 Wildcards and Shell Variables Fail on the scp(1)
                 Command Line / 107 \\
                 Superuser (root) Is Unable to Log In / 107 \\
                 Startup Performance Is Slow / 107 \\
                 Protocol 1 Clients Are Unable to Connect to Solaris
                 Secure Shell Systems / 108 \\
                 Privilege Separation Does Not Work in the Solaris
                 Secure Shell Software / 108 \\
                 cron(1M) Is Broken / 108 \\
                 Message-of-the-Day Is Displayed Twice / 109 \\
                 Problem Reports / 109 \\
                 OpenSSH / 109 \\
                 Solaris Secure Shell Software / 109 \\
                 Patches / 109 \\
                 OpenSSH / 110 \\
                 Solaris Secure Shell Software / 110 \\
                 Solutions / 110 \\
                 Debugging a Secure Shell Connection / 110 \\
                 Understanding Differences in OpenSSH and Solaris Secure
                 Shell Software / 111 \\
                 Integrating Solaris Secure Shell and SEAM (Kerberos) /
                 111 \\
                 Forcing Remote X11 Users to Use Secure Shell Sessions /
                 111 \\
                 Determining the Server Version String / 111 \\
                 Altering the Server Version String / 112 \\
                 CERT Advisory CA-2002-18 / 112 \\
                 Secure Shell Usage / 113 \\
                 Client Usage / 113 \\
                 Connecting to a Host / 114 \\
                 Executing a Command on a Remote Host / 114 \\
                 Copying a File / 114 \\
                 Using Identity Keys / 115 \\
                 Generating an Identity / 115 \\
                 Registering an Identity / 116 \\
                 Using the Identity / 116 \\
                 Using Agents / 116 \\
                 Setting Up Agents / 117 \\
                 Loading Agents / 117 \\
                 Listing Agent Identities / 117 \\
                 Removing Agent Identities / 118 \\
                 Stopping the Agent / 118 \\
                 Forwarding Ports / 118 \\
                 Setting Up Local Forwarding / 119 \\
                 Setting Up Remote Forwarding / 120 \\
                 Enabling X Forwarding / 120 \\
                 Checking the $DISPLAY Variable / 121 \\
                 Using Proxies / 121 \\
                 Locating Client Configuration Files / 121 \\
                 Server Usage / 122 \\
                 Starting the Server / 122 \\
                 Stopping the Server / 122 \\
                 Locating Server Configuration Files / 123 \\
                 Generating New Server Host Keys / 124 \\
                 Supporting TCP Wrappers / 124 \\
                 Server Configuration Options / 127 \\
                 Client Configuration Options / 143 \\
                 Performance Test Methodology / 155 \\
                 Bandwidth Performance / 155 \\
                 Identity Generation / 156 \\
                 Symmetric Cipher Performance / 157 \\
                 Scripts and Configuration Files / 159 \\
                 Init Script / 159 \\
                 Automatic Installation / 159 \\
                 Manual Installation / 159 \\
                 To Manually Install the init Script / 160 \\
                 Contact / 160 \\
                 Init Script Sample / 161 \\
                 Code Example for Packaging Script / 166 \\
                 Usage / 167 \\
                 Contact / 167 \\
                 Packaging Script Sample / 168 \\
                 Code Example for PRNGD Sanity Check / 174 \\
                 Server Configuration Files / 176 \\
                 DMZ-Bastion Host Server / 176 \\
                 Legacy Support / 177 \\
                 Workstation Server / 178 \\
                 Client Configurations / 179 \\
                 Remote Worker Configuration File / 179 \\
                 Workstation Configuration File / 180 \\
                 Resources / 181 \\
                 Solaris Secure Shell Software Documentation / 181 \\
                 OpenSSH Documentation / 182 \\
                 Software / 182 \\
                 Bibliography / 185 \\
                 Sun BluePrints OnLine Articles / 185 \\
                 External Articles / 186 \\
                 Books / 187 \\
                 Bug Reports / 189 \\
                 FAQs / 189 \\
                 Man Pages / 189 \\
                 Presentations / 190 \\
                 Security Information / 190 \\
                 Index / 191",
}

@Article{Rieck:2003:CTR,
  author =       "James R. Rieck",
  title =        "A Comparison of Two Random Number Generators for the
                 {Birnbaum--Saunders} Distribution",
  journal =      j-COMMUN-STAT-THEORY-METH,
  volume =       "32",
  number =       "5",
  pages =        "929--934",
  year =         "2003",
  CODEN =        "CSTMDC",
  DOI =          "https://doi.org/10.1081/STA-120019953",
  ISSN =         "0361-0926 (print), 1532-415X (electronic)",
  ISSN-L =       "0361-0926",
  bibdate =      "Wed Jan 27 05:41:35 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/communstattheorymeth2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications in Statistics: Theory and Methods",
  journal-URL =  "http://www.tandfonline.com/loi/lsta20",
}

@Misc{Roberts:2003:ADR,
  author =       "Iain Roberts",
  title =        "{AIX 5.2} {\tt /dev/random} and {\tt /dev/urandom}
                 devices",
  howpublished = "Web site",
  day =          "25",
  month =        apr,
  year =         "2003",
  bibdate =      "Sat Dec 24 11:33:38 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://lists.gnupg.org/pipermail/gnupg-devel/2003-April/019954.html;
                 http://www.counterpane.com/yarrow.html",
  acknowledgement = ack-nhfb,
  keywords =     "Yarrow engine",
  remark =       "From the Web site: ``The API for accessing the PRNG is
                 quite simple. An application just has to open the {\tt
                 /dev/random} or {\tt /dev/urandom} file and read the
                 required number of bytes of the special device. The
                 {\tt /dev/random} and {\tt /dev/urandom} have different
                 behaviors when the pool of entropy is exhausted or
                 requires reseeding. The {\tt /dev/random} device will
                 have the reading application block until more entropy
                 is gathered. The {\tt /dev/urandom} device will behave
                 the same as {\tt /dev/random}, but when entropy is
                 exhausted it will fall back and generate entropy using
                 a software algorithm. The level of randomness of the
                 numbers generated by the software algorithm is not as
                 high as the entropy gathered from the running
                 system.''",
}

@Article{Sarkar:2003:CSC,
  author =       "Palash Sarkar",
  title =        "Computing Shifts in 90/150 cellular automata
                 sequences",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "9",
  number =       "2",
  pages =        "175--186",
  month =        apr,
  year =         "2003",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1016/S1071-5797(03)00002-9",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 16:08:12 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579703000029",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Seznec:2003:HUL,
  author =       "Andr{\'e} Seznec and Nicolas Sendrier",
  title =        "{HAVEGE}: a user-level software heuristic for
                 generating empirically strong random numbers",
  journal =      j-TOMACS,
  volume =       "13",
  number =       "4",
  pages =        "334--346",
  month =        oct,
  year =         "2003",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Fri Oct 31 05:50:26 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Random numbers with high cryptographic quality are
                 needed to enhance the security of cryptography
                 applications. Software heuristics for generating
                 empirically strong random number sequences rely on
                 entropy gathering by measuring unpredictable external
                 events. These generators only deliver a few bits per
                 event. This limits them to being used as seeds for
                 pseudorandom generators. General-purpose processors
                 feature a large number of hardware mechanisms that aim
                 to improve performance: caches, branch predictors,
                 \ldots{}. The state of these components is not
                 architectural (i.e., the result of an ordinary
                 application does not depend on it). It is also volatile
                 and cannot be directly monitored by the user. On the
                 other hand, every operating system interrupt modifies
                 thousands of these binary volatile states. In this
                 article, we present and analyze HAVEGE (HArdware
                 Volatile Entropy Gathering and Expansion), a new
                 user-level software heuristic to generate practically
                 strong random numbers on general-purpose computers. The
                 hardware clock cycle counter of the processor can be
                 used to gather part of the entropy\slash uncertainty
                 introduced by operating system interrupts in the
                 internal states of the processor. Then, we show how
                 this entropy gathering technique can be combined with
                 pseudorandom number generation in HAVEGE. Since the
                 internal state of HAVEGE includes thousands of internal
                 volatile hardware states, it seems impossible even for
                 the user itself to reproduce the generated sequences.",
  acknowledgement = ack-nhfb,
  annote =       "From the article: ``On current PCs and workstations,
                 the HAVEG algorithms collects several tens of thousands
                 of empirically strong random bits, on average, per
                 every operating system interrupt, that is, HAVEG is
                 three to four orders of magnitude more efficient than
                 previous software entropy gathering techniques.\par
                 \ldots{}\par \ldots{} on all the target platforms of
                 HAVEGE in 2002 [Seznec and Sendrier 2002], the HAVEG
                 algorithm illustrated in Figure 1 allows to gather at
                 least 8K--64K random bits in average per operating
                 system interrupt (from 8K on Itanium/Linux to 64K on
                 Solaris/UltraSparc II). That is, at least three to four
                 orders of magnitude more than the `entropy' gathered by
                 previously available entropy-gathering techniques.\par
                 \ldots{}\par In average on Pentium III, 920 million $
                 \pm 5 \% $ cycles were needed to collect 32 Mbytes of
                 random numbers, while on the UltraSparc II, 500 million
                 $ \pm 5 \% $ cycles were sufficient. This throughput is
                 in the same range as the throughput of standard
                 pseudorandom number generators.''\par Thus, it seems
                 that this algorithm deserves careful consideration for
                 use in {\tt /dev/random} and {\tt /dev/urandom}
                 pseudodevices in Unix systems, since the former in
                 particular on several platforms can be rapidly drained
                 of data, causing very long input waits (e.g., two days
                 to read 10MB of data.)",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Sobol:2003:MCR,
  author =       "I. M. Sobol and E. E. Myshetskaya",
  title =        "Modelling correlated random variables",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "9",
  number =       "1",
  pages =        "67--76",
  month =        jan,
  year =         "2003",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1163/156939603322587470",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "62D05",
  MRnumber =     "1987418 (2004d:62037)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2003.9.issue-1/issue-files/mcma.2003.9.issue-1.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2003.9.issue-1/156939603322587470/156939603322587470.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Soubusta:2003:ERQ,
  author =       "Jan Soubusta and Ondrej Haderka and Martin Hendrych
                 and Pavel Pavlicek",
  editor =       "Jerzy Nowak and Marek Zajac and Jan Masajada",
  title =        "Experimental realization of quantum random number
                 generator",
  journal =      j-PROC-SPIE,
  volume =       "5259",
  number =       "1",
  pages =        "7--13",
  year =         "2003",
  CODEN =        "PSISDG",
  DOI =          "https://doi.org/10.1117/12.545053",
  ISSN =         "0277-786X (print), 1996-756X (electronic)",
  ISSN-L =       "0277-786X",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "13th Polish-Czech-Slovak Conference on Wave and
                 Quantum Aspects of Contemporary Optics.",
  URL =          "http://link.aip.org/link/?PSI/5259/7/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the SPIE --- The International Society
                 for Optical Engineering",
  keywords =     "true random numbers from physical sources",
}

@Article{Srinivasan:2003:TPR,
  author =       "Ashok Srinivasan and Michael Mascagni and David
                 Ceperley",
  title =        "Testing parallel random number generators",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "29",
  number =       "1",
  pages =        "69--94",
  month =        jan,
  year =         "2003",
  CODEN =        "PACOEJ",
  DOI =          "https://doi.org/10.1016/S0167-8191(02)00163-1",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Wed Dec 24 09:07:23 MST 2003",
  bibsource =    "http://www.sciencedirect.com/science/journal/01678191;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167819102001631",
  acknowledgement = ack-nhfb,
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
}

@Article{Stipcevic:2003:NDR,
  author =       "Mario Stip{\v{c}}evi{\'c}",
  title =        "Non-deterministic random bit generator based on
                 electronics noise",
  journal =      "arXiv.org",
  volume =       "??",
  number =       "??",
  pages =        "??",
  month =        sep,
  year =         "2003",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Thu Jan 05 10:52:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/physics/0309010v2",
  acknowledgement = ack-nhfb,
}

@Article{Sugita:2003:DRW,
  author =       "Hiroshi Sugita",
  title =        "Dynamic random {Weyl} sampling for drastic reduction
                 of randomness in {Monte Carlo} integration",
  journal =      j-MATH-COMP-SIM,
  volume =       "62",
  number =       "3--6",
  pages =        "529--537",
  day =          "3",
  month =        mar,
  year =         "2003",
  CODEN =        "MCSIDR",
  DOI =          "https://doi.org/10.1016/S0378-4754(02)00231-8",
  ISSN =         "0378-4754 (print), 1872-7166 (electronic)",
  ISSN-L =       "0378-4754",
  bibdate =      "Mon Feb 27 18:00:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378475402002318",
  abstract =     "To reduce randomness drastically in Monte Carlo (MC)
                 integration, we propose a pairwise independent
                 sampling, the dynamic random Weyl sampling (DRWS). DRWS
                 is applicable even if the length of random bits to
                 generate a sample may vary. The algorithm of DRWS is so
                 simple that it works very fast, even though the
                 pseudo-random generator, the source of randomness,
                 might be slow. In particular, we can use a
                 cryptographically secure pseudo-random generator for
                 DRWS to obtain the most reliable numerical integration
                 method for complicated functions.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics and Computers in Simulation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784754",
  keywords =     "dynamic random Weyl sampling (DRWS)",
}

@Article{Tang:2003:SDA,
  author =       "Hui-Chin Tang",
  title =        "Simulated division with approximate factoring for the
                 multiple recursive generator with both unrestricted
                 multiplier and non-{Mersenne} prime modulus",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "46",
  number =       "8--9",
  pages =        "1173--1181",
  month =        oct # "\slash " # nov,
  year =         "2003",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:49:33 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122103902094",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Tang:2003:SPM,
  author =       "Hui-Chin Tang",
  title =        "Symmetry properties of multiple recursive random
                 number generators in full period and spectral test",
  journal =      j-APPL-MATH-COMP,
  volume =       "142",
  number =       "2--3",
  pages =        "291--303",
  day =          "10",
  month =        oct,
  year =         "2003",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/S0096-3003(02)00303-X",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Fri Jan 9 08:41:06 MST 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Multiple recursive $k$-th order random number
                 generators (MRG) of the form $$ X_n \equiv a_1 X_{n -
                 1} + a_2 X_{n - 2} + \ldots + a_k X_{n - k} (\text
                 {mod} m) $$ are considered for $ n \ge k $, where $m$
                 is the modulus usually chosen to be the largest prime
                 number that fits in a computer word. The main problem
                 is to find an optimal (ideal) vector of multipliers
                 among those which produce random numbers of full
                 period, using the spectral test as a criterion. Every
                 MRG is associated with another MRG $$ Y_n \equiv - a_1
                 Y_{n - 1} + ( - 1)^2 a_2 Y_{n - 2} + \ldots + ( - 1)^k
                 a_k Y_{n - k} (\text {mod} m), $$ which attains a full
                 period of $ m^k - 1 $ provided that so does the
                 original MRG for the cases where either $k$ is even or
                 $ (m - 1) $ is a multiple of $4$. This is one symmetry
                 property which is proven. The other one is that the
                 respective spectral values of both generators are
                 equal. It allows to reduce by half the computational
                 effort required in testing full period and spectral
                 test.",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  identifier =   "01957155",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
  reviewer =     "J. Kaupu\v{z}s (Riga)",
}

@TechReport{Tsang:2003:TCT,
  author =       "W. W. Tsang and L. C. K. Hui and K. P. Chow and C. F.
                 Chong",
  title =        "Tuning the Collision Test for Stringency",
  type =         "Report",
  institution =  "The University of Hong Kong",
  address =      "Hong Kong, China",
  day =          "15",
  month =        apr,
  year =         "2003",
  bibdate =      "Tue Apr 17 07:54:28 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.279;
                 http://www.cs.hku.hk/cisc/projects/va/tuning.pdf",
  abstract =     "The collision test is one of the most important
                 statistical tests for random number generators. It
                 simulates the throwing of balls randomly into urns. A
                 problem in applying this test is to determine the
                 number of urns, $m$, and the number of balls, $n$, so
                 that the test is among the most stringent possible on a
                 computer available for testing. Our studies showed that
                 for a fixed $m$, $n$ shall be determined subject to
                 maximizing the variance of the number of collisions.
                 With this rule, the stringency of the resulting test
                 increases as $m$ increases. And the test of $ m \geq
                 2^{23} $ flunked a recorded number of generators,
                 including congruential generators, shift-register
                 generators, additive generators of lags less than $ 40
                 $, subtract-with-borrow generators of lags less than $
                 24 $, and a combination of a congruential and a
                 shift-register generator.",
  acknowledgement = ack-nhfb,
  remark =       "From page 2: ``The Mersenne Twister
                 \cite{Matsumoto:1998:MTD} passed alright, so did the
                 KISS generator \cite{Marsaglia:1999:RNC}''. Six of 18
                 generators tested passed.",
}

@InProceedings{Tsoi:2003:CFB,
  author =       "K. H. Tsoi and K. H. Leung and Philip H. W. Leong",
  editor =       "Kenneth L. Pocek and Jeffrey M. Arnold",
  booktitle =    "{FCCM 2003: 11th Annual IEEE Symposium on
                 Field-Programmable Custom Computing Machines:
                 proceedings: 9--11 April, 2003, Napa, California}",
  title =        "Compact {FPGA}-based True and Pseudo Random Number
                 Generators",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "51--61",
  year =         "2003",
  DOI =          "https://doi.org/10.1109/FPGA.2003.1227241",
  ISBN =         "0-7695-1979-2",
  ISBN-13 =      "978-0-7695-1979-1",
  ISSN =         "1082-3409",
  LCCN =         "TK7895.G36 I35 2003",
  bibdate =      "Wed Feb 22 16:18:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
  pagecount =    "11",
  remark =       "This paper contains results of tests of randomness of
                 physical devices, and clearly shows
                 clock-rate-dependent failure, demonstrating the need
                 for further cleanup of their bit streams.",
}

@Article{Tu:2003:GRI,
  author =       "Shu-Ju Tu and Ephraim Fischbach",
  title =        "Geometric random inner products: a family of tests for
                 random number generators",
  journal =      j-PHYS-REV-E,
  volume =       "67",
  number =       "1",
  pages =        "016113",
  month =        "????",
  year =         "2003",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.67.016113",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Mon Jan 16 15:23:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://pre.aps.org/abstract/PRE/v67/i1/e016113",
  abstract =     "We present a computational scheme, GRIP (geometric
                 random inner products), for testing the quality of
                 random number generators. The GRIP formalism utilizes
                 geometric probability techniques to calculate the
                 average scalar products of random vectors distributed
                 in geometric objects, such as circles and spheres. We
                 show that these average scalar products define a family
                 of geometric constants which can be used to evaluate
                 the quality of random number generators. We explicitly
                 apply the GRIP tests to several random number
                 generators frequently used in Monte Carlo simulations,
                 and demonstrate a statistical property for good random
                 number generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  keywords =     "GRIP (geometric random inner products) test; uniform
                 distribution on the $n$-dimensional sphere",
  pagecount =    "7",
}

@Article{Umans:2003:PRG,
  author =       "Christopher Umans",
  title =        "Pseudo-random generators for all hardnesses",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "67",
  number =       "2",
  pages =        "419--440",
  month =        sep,
  year =         "2003",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/S0022-0000(03)00046-1",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Sat Mar 17 07:22:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022000003000461",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
  onlinedate =   "11 June 2003",
}

@Article{Vavriv:2003:RNG,
  author =       "D. D. Vavriv",
  editor =       "Visarath In and Ljupco Kocarev and Stefano Boccaletti
                 and Bruce J. Gluckman and Jurgen Kurths and Thomas L.
                 Carroll",
  title =        "Random Number Generators on the Basis of Systems with
                 Chaotic Behavior",
  journal =      j-AIP-CONF-PROC,
  volume =       "676",
  number =       "1",
  pages =        "373--373",
  year =         "2003",
  CODEN =        "APCPCS",
  DOI =          "https://doi.org/10.1063/1.1612254",
  ISSN =         "0094-243X (print), 1551-7616 (electronic), 1935-0465",
  ISSN-L =       "0094-243X",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?APC/676/373/1",
  acknowledgement = ack-nhfb,
  fjournal =     "AIP Conference Proceedings",
  journal-URL =  "http://scitation.aip.org/content/aip/proceeding/aipcp",
  keywords =     "chaos; cryptography; random number generation;
                 sequences",
}

@Article{Al-Subaihi:2004:SCM,
  author =       "Ali A. Al-Subaihi",
  title =        "Simulating Correlated Multivariate Pseudorandom
                 Numbers",
  journal =      j-J-STAT-SOFT,
  volume =       "9",
  number =       "4",
  pages =        "1--20",
  month =        "????",
  year =         "2004",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Sat Dec 04 09:18:40 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/counter.php?id=85&url=v09/i04/paper.pdf&ct=1",
  accepted =     "2004-02-29",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  submitted =    "2003-01-04",
}

@Article{Alekhnovich:2004:PGP,
  author =       "Michael Alekhnovich and Eli Ben-Sasson and Alexander
                 A. Razborov and Avi Wigderson",
  title =        "Pseudorandom Generators in Propositional Proof
                 Complexity",
  journal =      j-SIAM-J-COMPUT,
  volume =       "34",
  number =       "1",
  pages =        "67--88",
  month =        feb,
  year =         "2004",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/S0097539701389944",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Sat Apr 16 10:19:30 MDT 2005",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/34/1;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  URL =          "http://epubs.siam.org/sam-bin/dbq/article/38994",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Book{Altman:2004:NIS,
  author =       "Micah Altman and Jeff Gill and Michael McDonald",
  title =        "Numerical Issues in Statistical Computing for the
                 Social Scientist",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 323",
  year =         "2004",
  DOI =          "https://doi.org/10.1002/0471475769",
  ISBN =         "0-471-23633-0, 0-471-47574-2 (e-book), 0-471-47576-9
                 (e-book)",
  ISBN-13 =      "978-0-471-23633-7, 978-0-471-47574-3 (e-book),
                 978-0-471-47576-7 (e-book)",
  LCCN =         "QA276.4 .A398 2004",
  bibdate =      "Thu Oct 17 17:33:39 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyage",
  abstract =     "At last --- a social scientist's guide through the
                 pitfalls of modern statistical computing. Addressing
                 the current deficiency in the literature on statistical
                 methods as they apply to the social and behavioral
                 sciences, \booktitle{Numerical Issues in Statistical
                 Computing for the Social Scientist} seeks to provide
                 readers with a unique practical guidebook to the
                 numerical methods underlying computerized statistical
                 calculations specific to these fields. The authors
                 demonstrate that knowledge of these numerical methods
                 and how they are used in statistical packages is
                 essential for making accurate inferences.",
  acknowledgement = ack-nhfb,
  subject =      "Estad{\'i}stica; Inform{\`a}tica; Ci{\`e}ncies
                 socials; M{\`e}todes estad{\'i}stics",
  tableofcontents = "1: Introduction: Consequences of Numerical
                 Inaccuracy / 1 \\
                 1.1: Importance of Understanding Computational
                 Statistics / 1 \\
                 1.2: Brief History: Duhem to the Twenty-First Century /
                 3 \\
                 1.3: Motivating Example: Rare Events Counts Models / 6
                 \\
                 2: Sources of Inaccuracy in Statistical Computation /
                 12 \\
                 2.1.1: Revealing Example: Computing the Coefficient
                 Standard Deviation / 12 \\
                 2.1.2: Some Preliminary Conclusions / 13 \\
                 2.2: Fundamental Theoretical Concepts / 15 \\
                 2.2.1: Accuracy and Precision / 15 \\
                 2.2.2: Problems, Algorithms, and Implementations / 15
                 \\
                 2.3: Accuracy and Correct Inference / 18 \\
                 2.3.1: Brief Digression: Why Statistical Inference Is
                 Harder in Practice Than It Appears / 20 \\
                 2.4: Sources of Implementation Errors / 21 \\
                 2.4.1: Bugs, Errors, and Annoyances / 22 \\
                 2.4.2: Computer Arithmetic / 23 \\
                 2.5: Algorithmic Limitations / 29 \\
                 2.5.1: Randomized Algorithms / 30 \\
                 2.5.2: Approximation Algorithms for Statistical
                 Functions / 31 \\
                 2.5.3: Heuristic Algorithms for Random Number
                 Generation / 32 \\
                 2.5.4: Local Search Algorithms / 39 \\
                 3: Evaluating Statistical Software / 44 \\
                 3.1.1: Strategies for Evaluating Accuracy / 44 \\
                 3.1.2: Conditioning / 47 \\
                 3.2: Benchmarks for Statistical Packages / 48 \\
                 3.2.1: NIST Statistical Reference Datasets / 49 \\
                 3.2.2: Benchmarking Nonlinear Problems with StRD / 51
                 \\
                 3.2.3: Analyzing StRD Test Results / 53 \\
                 3.2.4: Empirical Tests of Pseudo-Random Number
                 Generation / 54 \\
                 3.2.5: Tests of Distribution Functions / 58 \\
                 3.2.6: Testing the Accuracy of Data Input and Output /
                 60 \\
                 3.3: General Features Supporting Accurate and
                 Reproducible Results / 63 \\
                 3.4: Comparison of Some Popular Statistical Packages /
                 64 \\
                 3.5: Reproduction of Research / 65 \\
                 3.6: Choosing a Statistical Package / 69 \\
                 4: Robust Inference / 71 \\
                 4.3: Sensitivity Tests / 73 \\
                 4.3.1: Sensitivity to Alternative Implementations and
                 Algorithms / 73 \\
                 4.3.2: Perturbation Tests / 75 \\
                 4.3.3: Tests of Global Optimality / 84 \\
                 4.4: Obtaining More Accurate Results / 91 \\
                 4.4.1: High-Precision Mathematical Libraries / 92 \\
                 4.4.2: Increasing the Precision of Intermediate
                 Calculations / 93 \\
                 4.4.3: Selecting Optimization Methods / 95 \\
                 4.5: Inference for Computationally Difficult Problems /
                 103 \\
                 4.5.1: Obtaining Confidence Intervals with Ill-Behaved
                 Functions / 104 \\
                 4.5.2: Interpreting Results in the Presence of Multiple
                 Modes / 106 \\
                 4.5.3: Inference in the Presence of Instability / 114
                 \\
                 5: Numerical Issues in Markov Chain Monte Carlo
                 Estimation / 118 \\
                 5.2: Background and History / 119 \\
                 5.3: Essential Markov Chain Theory / 120 \\
                 5.3.1: Measure and Probability Preliminaries / 120 \\
                 5.3.2: Markov Chain Properties / 121 \\
                 5.3.3: The Final Word (Sort of) / 125 \\
                 5.4: Mechanics of Common MCMC Algorithms / 126 \\
                 5.4.1: Metropolis--Hastings Algorithm / 126 \\
                 5.4.2: Hit-and-Run Algorithm / 127 \\
                 5.4.3: Gibbs Sampler / 128 \\
                 5.5: Role of Random Number Generation / 129 \\
                 5.5.1: Periodicity of Generators and MCMC Effects / 130
                 \\
                 5.5.2: Periodicity and Convergence / 132 \\
                 5.5.3: Example: The Slice Sampler / 135 \\
                 5.5.4: Evaluating WinBUGS / 137 \\
                 5.6: Absorbing State Problem / 139 \\
                 5.7: Regular Monte Carlo Simulation / 140 \\
                 5.8: So What Can Be Done? / 141 \\
                 6: Numerical Issues Involved in Inverting Hessian
                 Matrices / Jeff Gill, Gary King / 143 \\
                 6.2: Means versus Modes / 145 \\
                 6.3: Developing a Solution Using Bayesian Simulation
                 Tools / 147 \\
                 6.4: What Is It That Bayesians Do? / 148 \\
                 6.5: Problem in Detail: Noninvertible Hessians / 149
                 \\
                 6.6: Generalized Inverse/Generalized Cholesky Solution
                 / 151 \\
                 6.7: Generalized Inverse / 151 \\
                 6.7.1: Numerical Examples of the Generalized Inverse /
                 154 \\
                 6.8: Generalized Cholesky Decomposition / 155 \\
                 6.8.1: Standard Algorithm / 156 \\
                 6.8.2: Gill--Murray Cholesky Factorization / 156 \\
                 6.8.3: Schnabel--Eskow Cholesky Factorization / 158 \\
                 6.8.4: Numerical Examples of the Generalized Cholesky
                 Decomposition / 158 \\
                 6.9: Importance Sampling and Sampling Importance
                 Resampling / 160 \\
                 6.9.1: Algorithm Details / 160 \\
                 6.9.2: SIR Output / 162 \\
                 6.9.3: Relevance to the Generalized Process / 163 \\
                 6.10: Public Policy Analysis Example / 163 \\
                 6.10.1: Texas / 164 \\
                 6.10.2: Florida / 168 \\
                 6.11: Alternative Methods / 171 \\
                 6.11.1: Drawing from the Singular Normal / 171 \\
                 6.11.2: Aliasing / 173 \\
                 6.11.3: Ridge Regression / 173 \\
                 6.11.4: Derivative Approach / 174 \\
                 6.11.5: Bootstrapping / 174 \\
                 6.11.6: Respecification (Redux) / 175 \\
                 7: Numerical Behavior of King's EI Method / 177 \\
                 7.2: Ecological Inference Problem and Proposed
                 Solutions / 179 \\
                 7.3: Numeric Accuracy in Ecological Inference / 180 \\
                 7.3.1: Case Study 1: Examples from King (1997) / 182
                 \\
                 7.3.2: Nonlinear Optimization / 186 \\
                 7.3.3: Pseudo-Random Number Generation / 187 \\
                 7.3.4: Platform and Version Sensitivity / 188 \\
                 7.4: Case Study 2: Burden and Kimball (1998) / 189 \\
                 7.4.1: Data Perturbation / 191 \\
                 7.4.2: Option Dependence / 194 \\
                 7.4.3: Platform Dependence / 195 \\
                 7.4.4: Discussion: Summarizing Uncertainty / 196 \\
                 8: Some Details of Nonlinear Estimation / B. D.
                 McCullough / 199 \\
                 8.2: Overview of Algorithms / 200 \\
                 8.3: Some Numerical Details / 204 \\
                 8.4: What Can Go Wrong? / 206 \\
                 8.5: Four Steps / 210 \\
                 8.5.1 Step 1: Examine the Gradient / 211 \\
                 8.5.2 Step 2: Inspect the Trace / 211 \\
                 8.5.3 Step 3: Analyze the Hessian / 212 \\
                 8.5.4 Step 4: Profile the Objective Function / 212 \\
                 8.6: Wald versus Likelihood Inference / 215 \\
                 9: Spatial Regression Models / James P. LeSage / 219
                 \\
                 9.2: Sample Data Associated with Map Locations / 219
                 \\
                 9.2.1: Spatial Dependence / 219 \\
                 9.2.2: Specifying Dependence Using Weight Matrices /
                 220 \\
                 9.2.3: Estimation Consequences of Spatial Dependence /
                 222 \\
                 9.3: Maximum Likelihood Estimation of Spatial Models /
                 223 \\
                 9.3.1: Sparse Matrix Algorithms / 224 \\
                 9.3.2: Vectorization of the Optimization Problem / 225
                 \\
                 9.3.3: Trade-offs between Speed and Numerical Accuracy
                 / 226 \\
                 9.3.4: Applied Illustrations / 228 \\
                 9.4: Bayesian Spatial Regression Models / 229 \\
                 9.4.1: Bayesian Heteroscedastic Spatial Models / 230
                 \\
                 9.4.2: Estimation of Bayesian Spatial Models / 231 \\
                 9.4.3: Conditional Distributions for the SAR Model /
                 232 \\
                 9.4.4: MCMC Sampler / 234 \\
                 9.4.5: Illustration of the Bayesian Model / 234 \\
                 10: Convergence Problems in Logistic Regression / Paul
                 Allison / 238 \\
                 10.2: Overview of Logistic Maximum Likelihood
                 Estimation / 238 \\
                 10.3: What Can Go Wrong? / 240 \\
                 10.4: Behavior of the Newton--Raphson Algorithm under
                 Separation / 243 \\
                 10.4.1: Specific Implementations / 244 \\
                 10.4.2: Warning Messages / 244 \\
                 10.4.3: False Convergence / 246 \\
                 10.4.4: Reporting of Parameter Estimates and Standard
                 Errors / 247 \\
                 10.4.5: Likelihood Ratio Statistics / 247 \\
                 10.5: Diagnosis of Separation Problems / 247 \\
                 10.6: Solutions for Quasi-Complete Separation / 248 \\
                 10.6.1: Deletion of Problem Variables / 248 \\
                 10.6.2: Combining Categories / 248 \\
                 10.6.3: Do Nothing and Report Likelihood Ratio
                 Chi-Squares / 249 \\
                 10.6.4: Exact Inference / 249 \\
                 10.6.5: Bayesian Estimation / 250 \\
                 10.6.6: Penalized Maximum Likelihood Estimation / 250
                 \\
                 10.7: Solutions for Complete Separation / 251 \\
                 10.8: Extensions / 252 \\
                 11: Recommendations for Replication and Accurate
                 Analysis / 253 \\
                 11.1: General Recommendations for Replication / 253 \\
                 11.1.1: Reproduction, Replication, and Verification /
                 254 \\
                 11.1.2: Recreating Data / 255 \\
                 11.1.3: Inputting Data / 256 \\
                 11.1.4: Analyzing Data / 257 \\
                 11.2: Recommendations for Producing Verifiable Results
                 / 259 \\
                 11.3: General Recommendations for Improving the Numeric
                 Accuracy of Analysis / 260 \\
                 11.4: Recommendations for Particular Statistical Models
                 / 261 \\
                 11.4.1: Nonlinear Least Squares and Maximum Likelihood
                 / 261 \\
                 11.4.2: Robust Hessian Inversion / 262 \\
                 11.4.3: MCMC Estimation / 263 \\
                 11.4.4: Logistic Regression / 265 \\
                 11.4.5: Spatial Regression / 266 \\
                 Where Do We Go from Here? / 266 \\
                 Bibliography / 267 \\
                 Author Index / 303 \\
                 Subject Index / 315",
}

@Misc{Anonymous:2004:RNG,
  author =       "Anonymous",
  title =        "Random Numbers Generation using Quantum Physics",
  howpublished = "idQuantique white paper.",
  year =         "2004",
  bibdate =      "Tue Jan 31 15:18:10 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.idquantique.com/products/files/quantis-whitepaper.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Misc{Anonymous:2004:TRR,
  author =       "Anonymous",
  title =        "True randomness on request",
  howpublished = "Web site.",
  month =        may,
  year =         "2004",
  bibdate =      "Sat Dec 24 11:04:45 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.randomnumber.info",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Bauke:2004:PRC,
  author =       "Heiko Bauke and Stephan Mertens",
  title =        "Pseudo Random Coins Show More Heads Than Tails",
  journal =      j-J-STAT-PHYS,
  volume =       "114",
  number =       "3--4",
  pages =        "1149--1169",
  month =        feb,
  year =         "2004",
  CODEN =        "JSTPSB",
  DOI =          "https://doi.org/10.1023/B:JOSS.0000012521.67853.9a",
  ISSN =         "0022-4715 (print), 1572-9613 (electronic)",
  ISSN-L =       "0022-4715",
  bibdate =      "Thu Aug 28 19:02:35 MDT 2014",
  bibsource =    "http://link.springer.com/journal/10955;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0022-4715&volume=114&issue=3;
                 https://www.math.utah.edu/pub/tex/bib/jstatphys2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/cond-mat/0307138;
                 http://link.springer.com/article/10.1023/B%3AJOSS.0000012521.67853.9a",
  abstract =     "Tossing a coin is the most elementary Monte Carlo
                 experiment. In a computer the coin is replaced by a
                 pseudo random number generator. It can be shown
                 analytically and by exact enumerations that popular
                 random number generators are not capable of imitating a
                 fair coin: pseudo random coins show more heads than
                 tails. This bias explains the empirically observed
                 failure of some random number generators in random walk
                 experiments. It can be traced down to the special role
                 of the value zero in the algebra of finite fields.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Physics",
  journal-URL =  "http://link.springer.com/journal/10955",
  keywords =     "Monte-Carlo simulation; random number generator;
                 random walk; shift register sequences",
  remark =       "Cite as arXiv:cond-mat/0307138v2",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@Misc{Beebe:2004:CJR,
  author =       "Nelson H. F. Beebe",
  title =        "Comments on the {Java Random} class",
  howpublished = "Web document",
  day =          "24",
  month =        mar,
  year =         "2004",
  bibdate =      "Thu Feb 09 08:58:20 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This document examines Java support for random
                 numbers, comments on its deficiencies and
                 inefficiencies, and reports the results of two test
                 suites.",
  URL =          "https://www.math.utah.edu/~beebe/java/random/",
  acknowledgement = ack-nhfb,
  lastaccess =   "09 February 2012",
}

@Misc{Bellare:2004:CBG,
  author =       "M. Bellare and P. Rogaway",
  title =        "Code-based game-playing proofs and the security of
                 triple encryption",
  howpublished = "Cryptology ePrint Archive report 2004/331",
  year =         "2004",
  bibdate =      "Tue Mar 18 10:50:08 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://eprint.iacr.org/2004/331",
  acknowledgement = ack-nhfb,
}

@Misc{Blacher:2004:SCA,
  author =       "R. Blacher",
  title =        "Solution compl{\`e}te au probl{\`e}me des nombres
                 al{\'e}atoires. ({French}) [{Complete} solution to the
                 problem of random numbers]",
  year =         "2004",
  bibdate =      "Fri Feb 05 09:44:09 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Presented at Journ{\'e}es Statistiques de
                 Montpellier.",
  URL =          "http://www.agro-montpellier.fr/sfds/CD/textes/blacher1.pdf",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Book{Borwein:2004:MEP,
  author =       "Jonathan M. Borwein and David H. Bailey",
  title =        "Mathematics by Experiment: Plausible Reasoning in the
                 {21st Century}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "x + 288",
  year =         "2004",
  ISBN =         "1-56881-211-6",
  ISBN-13 =      "978-1-56881-211-3",
  LCCN =         "QA76.95 .B67 2003",
  bibdate =      "Fri Oct 17 10:38:25 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
  remark =       "Due to an unfortunate error, some of the citations in
                 the book point to the wrong item in the Bibliography.
                 Here is how to find the correct citation number:
                 [1]--[85]: Citation number is correct; [86, page 100]:
                 [86]; [86, page 2]: [87]; [87]--[156]: Add one to
                 citation number; [157]: [159]; [158, page 139]: [158];
                 [158, page 97]: [160]; [159]--[196]: Add two to
                 citation number",
  remark-2 =     "Chapter 4 is titled ``Normal numbers'', and contains
                 an extensive discussion of the question of randomness
                 in digits of fundamental constants.",
}

@Article{Brent:2004:NMX,
  author =       "Richard P. Brent",
  title =        "Note on {Marsaglia}'s Xorshift Random Number
                 Generators",
  journal =      j-J-STAT-SOFT,
  volume =       "11",
  number =       "5",
  pages =        "1--5",
  year =         "2004",
  CODEN =        "JSSOBK",
  DOI =          "https://doi.org/10.18637/jss.v011.i05",
  ISSN =         "1548-7660",
  ISSN-L =       "1548-7660",
  bibdate =      "Sat Dec 04 09:18:40 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  note =         "See
                 \cite{Marsaglia:2003:XR,Panneton:2005:XRN,Vigna:2016:EEM}.
                 This article shows the equivalence of xorshift
                 generators and the well-understood linear feedback
                 shift register generators.",
  URL =          "http://www.jstatsoft.org/counter.php?id=101&url=v11/i05/v11i05.pdf&ct=1",
  accepted =     "2004-08-25",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  submitted =    "2004-07-07",
}

@Article{Brown:2004:TRV,
  author =       "Timothy C. Brown",
  title =        "Transforming a Random Variable to a Prescribed
                 Distribution: An Application to School-Based
                 Assessment",
  journal =      j-J-APPL-PROBAB,
  volume =       "41A",
  pages =        "239--252",
  year =         "2004",
  CODEN =        "JPRBAM",
  DOI =          "https://doi.org/10.2307/3215980",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Mon May 5 06:50:36 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i361397;
                 https://www.math.utah.edu/pub/tex/bib/japplprobab.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/3215980",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html",
}

@Book{Bucklew:2004:IRE,
  author =       "James Antonio Bucklew",
  title =        "Introduction to Rare Event Simulation",
  volume =       "??",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 260",
  year =         "2004",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/978-1-4757-4078-3",
  ISBN =         "0-387-20078-9, 1-4419-1893-0, 1-4757-4078-6 (e-book)",
  ISBN-13 =      "978-0-387-20078-1, 978-1-4419-1893-2,
                 978-1-4757-4078-3 (e-book)",
  ISSN =         "0172-7397",
  ISSN-L =       "0172-7397",
  LCCN =         "QA273.67 .B84 2004",
  bibdate =      "Thu Jun 19 06:41:19 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/probstat2000.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  series =       "Springer Series in Statistics",
  URL =          "http://link.springer.com/book/10.1007/978-1-4757-4078-3",
  abstract =     "This book presents a unified theory of rare event
                 simulation and the variance reduction technique known
                 as importance sampling from the point of view of the
                 probabilistic theory of large deviations. This
                 perspective allows us to view a vast assortment of
                 simulation problems from a unified single perspective.
                 It gives a great deal of insight into the fundamental
                 nature of rare event simulation. Until now, this area
                 has a reputation among simulation practitioners of
                 requiring a great deal of technical and probabilistic
                 expertise. This text keeps the mathematical
                 preliminaries to a minimum with the only prerequisite
                 being a single large deviation theory result that is
                 given and proved in the text. Large deviation theory is
                 a burgeoning area of probability theory and many of the
                 results in it can be applied to simulation problems.
                 Rather than try to be as complete as possible in the
                 exposition of all possible aspects of the available
                 theory, the book concentrates on demonstrating the
                 methodology and the principal ideas in a fairly simple
                 setting. The book contains over 50 figures and detailed
                 simulation case studies covering a wide variety of
                 application areas including statistics,
                 telecommunications, and queueing systems. James A.
                 Bucklew holds the rank of Professor with appointments
                 in the Department of Electrical and Computer
                 Engineering and in the Department of Mathematics at the
                 University of Wisconsin-Madison. He is a Fellow of the
                 Institute of Electrical and Electronics Engineers and
                 the author of Large Deviation Techniques in Decision,
                 Simulation, and Estimation.",
  acknowledgement = ack-nhfb,
  remark =       "Most volumes in this series are unnumbered.",
  series-URL =   "http://link.springer.com/bookseries/692",
  subject =      "large deviations; statistics; computer communication
                 networks; computer simulation; engineering mathematics;
                 telecommunication",
  tableofcontents = "Random Number Generation \\
                 Stochastic Models \\
                 Large Deviation Theory \\
                 Importance Sampling \\
                 The Large Deviation Theory of Importance Sampling
                 Estimators \\
                 The Large Deviation Theory of Conditional Importance
                 Sampling Estimators \\
                 The Large Deviations of Bias Point Selection \\
                 Chernoff's Bound and Asymptotic Expansions \\
                 Gaussian Systems \\
                 Universal Simulation Distributions \\
                 Rare Event Simulation for Level Crossing and Queueing
                 Models \\
                 Blind Simulation \\
                 The (Over- Under) Biasing Problem in Importance
                 Sampling \\
                 Tools and Techniques for Importance Sampling",
  xxpages =      "xi + 262",
}

@Article{Conflitti:2004:MDS,
  author =       "Alessandro Conflitti and Igor E. Shparlinski",
  title =        "On the multidimensional distribution of the subset sum
                 generator of pseudorandom numbers",
  journal =      j-MATH-COMPUT,
  volume =       "73",
  number =       "246",
  pages =        "1005--1011",
  month =        apr,
  year =         "2004",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Wed Aug 11 08:23:05 MDT 2004",
  bibsource =    "http://www.ams.org/mcom/2004-73-246;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01563-1/home.html;
                 http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01563-1/S0025-5718-03-01563-1.dvi;
                 http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01563-1/S0025-5718-03-01563-1.pdf;
                 http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01563-1/S0025-5718-03-01563-1.ps;
                 http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01563-1/S0025-5718-03-01563-1.tex;
                 http://www.jstor.org/stable/pdfplus/4099816.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Article{Demirtas:2004:PRN,
  author =       "Hakan Demirtas",
  title =        "Pseudo-Random Number Generation in {R} For Commonly
                 Used Multivariate Distributions",
  journal =      j-J-MOD-APPL-STAT-METH,
  volume =       "3",
  number =       "2",
  pages =        "485--497",
  month =        nov,
  year =         "2004",
  CODEN =        "????",
  DOI =          "https://doi.org/10.22237/jmasm/1099268340",
  ISSN =         "1538-9472",
  ISSN-L =       "1538-9472",
  bibdate =      "Sat Jan 18 09:25:12 MST 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jmodapplstatmeth.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
  URL =          "https://jmasm.com/index.php/jmasm/article/view/159",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Mod. Appl. Stat. Methods (JMASM)",
  fjournal =     "Journal of Modern Applied Statistical Methods",
  journal-URL =  "https://jmasm.com/",
}

@InProceedings{Deng:2004:GMP,
  author =       "Lih-Yuan Deng",
  title =        "Generalized {Mersenne} prime number and its
                 application to random number generation",
  crossref =     "Niederreiter:2004:MCQ",
  pages =        "167--180",
  year =         "2004",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "2076932",
  bibdate =      "Thu Mar 15 16:48:02 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Dorfer:2004:CFE,
  author =       "Gerhard Dorfer and Wilfried Meidl and Arne Winterhof",
  title =        "Counting functions and expected values for the lattice
                 profile at $n$",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "10",
  number =       "4",
  pages =        "636--652; 1 of 1",
  month =        oct,
  year =         "2004",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1016/j.ffa.2004.01.004",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579704000061",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Espejo:2004:ANR,
  author =       "Mariano Ruiz Espejo and Miguel Delgado Pineda",
  title =        "Automatic nonuniform random variate generation",
  journal =      j-COMP-STAT,
  volume =       "19",
  number =       "4",
  pages =        "659--660",
  month =        dec,
  year =         "2004",
  CODEN =        "CSTAEB",
  DOI =          "https://doi.org/10.1007/BF02753917",
  ISSN =         "0943-4062 (print), 1613-9658 (electronic)",
  ISSN-L =       "0943-4062",
  bibdate =      "Thu Jun 18 16:19:31 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/article/10.1007/BF02753917",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Stat.",
  fjournal =     "Computational Statistics",
  journal-URL =  "http://link.springer.com/journal/180",
}

@InProceedings{Feige:2004:SIR,
  author =       "Uriel Feige",
  title =        "On sums of independent random variables with unbounded
                 variance, and estimating the average degree in a
                 graph",
  crossref =     "ACM:2004:PAA",
  pages =        "594--603",
  year =         "2004",
  bibdate =      "Wed Apr 5 05:59:11 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fung:2004:AIH,
  author =       "E. Fung and K. Leung and N. Parimi and M. Purnaprajna
                 and V. C. Gaudet",
  editor =       "{IEEE}",
  booktitle =    "{2004 IEEE Workshop on Signal Processing Systems
                 Design and Implementation proceedings: October 13--15,
                 2004, Crowne Plaza Hotel, Austin, Texas, USA}",
  title =        "{ASIC} implementation of a high speed {WGNG} for
                 communication channel emulation [white {Gaussian} noise
                 generator]",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "x + 366",
  pages =        "304--309",
  year =         "2004",
  DOI =          "https://doi.org/10.1109/SIPS.2004.1363067",
  ISBN =         "0-7803-8504-7",
  ISBN-13 =      "978-0-7803-8504-7",
  LCCN =         "TK5102.9 .I3394 2004",
  bibdate =      "Thu Nov 24 08:16:12 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/1363067/",
  acknowledgement = ack-nhfb,
  remark =       "IEEE catalog number 04TH8751.",
}

@Article{Goubin:2004:CLF,
  author =       "Louis Goubin and Christian Mauduit and Andr{\'a}s
                 S{\'a}rk{\"o}zy",
  title =        "Construction of large families of pseudorandom binary
                 sequences",
  journal =      j-J-NUMBER-THEORY,
  volume =       "106",
  number =       "1",
  pages =        "56--69",
  month =        may,
  year =         "2004",
  CODEN =        "JNUTA9",
  DOI =          "https://doi.org/10.1016/j.jnt.2003.12.002",
  ISSN =         "0022-314X (print), 1096-1658 (electronic)",
  ISSN-L =       "0022-314X",
  bibdate =      "Wed Jul 15 08:48:08 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jnumbertheory2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022314X04000137",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Number Theory",
  fjournal =     "Journal of Number Theory",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0022314X",
}

@Article{Guan:2004:PNG,
  author =       "Sheng-Uei Guan and Shu Zhang",
  title =        "Pseudorandom number generation based on controllable
                 cellular automata",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "20",
  number =       "4",
  pages =        "627--641",
  day =          "3",
  month =        may,
  year =         "2004",
  CODEN =        "FGSEVI",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jul 15 08:00:45 MDT 2005",
  bibsource =    "http://www.sciencedirect.com/science/journal/0167739X;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Gupta:2004:DBG,
  author =       "Rameshwar D. Gupta and Debasis Kundu",
  title =        "Discriminating between gamma and generalized
                 exponential distributions",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "74",
  number =       "2",
  pages =        "107--121",
  year =         "2004",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/0094965031000114359",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:12:20 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Book{Gutmann:2004:CSA,
  author =       "Peter Gutmann",
  title =        "Cryptographic Security Architecture: Design and
                 Verification",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 320",
  year =         "2004",
  ISBN =         "0-387-95387-6",
  ISBN-13 =      "978-0-387-95387-8",
  LCCN =         "QA76.9.A25 G88 2002",
  bibdate =      "Mon Oct 20 17:55:18 2003",
  bibsource =    "http://www.springer-ny.com/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Haldir:2004:HCL,
  author =       "R. Haldir",
  title =        "How to crack a Linear Congruential Generator",
  type =         "Report",
  day =          "22",
  month =        dec,
  year =         "2004",
  bibdate =      "Sat Mar 10 09:54:43 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Web document.",
  URL =          "http://www.reteam.org/papers/e59.pdf",
  acknowledgement = ack-nhfb,
  remark =       "The PDF file contains C code that uses Shoup's NTL
                 library (http://www.shoup.net/ntl/) to solve linear
                 congruences to recover parameters. However, the job
                 could likely be done with symbolic-algebra systems with
                 much less code.",
}

@Article{Hernandez:2004:STN,
  author =       "Julio C. Hernandez and Jos{\'e} Mar{\'\i}a Sierra and
                 Andre Seznec",
  title =        "The {SAC} Test: a New Randomness Test, with Some
                 Applications to {PRNG} Analysis",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2004",
  pages =        "960--967",
  year =         "2004",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-540-24707-4_108",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Feb 01 16:40:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/an44921nlaa5bf0g/",
  abstract =     "A new statistical test for randomness, the SAC test,
                 is presented, together with its results over some
                 well-known generators in the literature. These results
                 are analyzed and some possible applications of the
                 test, as for measuring the strength of cryptographic
                 primitives including block ciphers, stream ciphers and
                 pseudorandom number generators, especially during the
                 design and analysis phase, are detailed. Finally, the
                 source code for the SAC test is provided, which proves
                 some of its other advantages: it is easy to implement,
                 and very fast so well-suited for practical
                 applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Hong:2004:DCT,
  author =       "Seokhie Hong and Deukjo Hong and Youngdai Ko and
                 Donghoon Chang and Wonil Lee and Sangjin Lee",
  title =        "Differential Cryptanalysis of {TEA} and {XTEA}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2971",
  pages =        "402--417",
  year =         "2004",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-540-24691-6_30",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Feb 01 16:53:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/n4exvw35x7g8t6pb/",
  abstract =     "TEA and XTEA are simple block ciphers consisting of
                 exclusive-or, addition, and shift. Although their round
                 functions are very simple and guarantee a little
                 security, large number of 64 rounds have made them
                 secure enough. It seems that the best result for TEA is
                 the related-key attack [3], but it is less reasonable
                 than such attacks for one key as differential and
                 linear attacks. Impossible differential attacks on
                 12-round TEA and 14-round XTEA are best results except
                 for related-key attack [5]. We suggest differential and
                 truncated differential attacks on TEA and XTEA better
                 than them. Our best results on TEA and XTEA are attacks
                 on 17-round TEA and 23-round XTEA.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "Block cipher; differential cryptanalysis; TEA;
                 truncated differential cryptanalysis; XTEA",
}

@Book{Hormann:2004:ANR,
  author =       "Wolfgang H{\"o}rmann and Josef Leydold and Gerhard
                 Derflinger",
  title =        "Automatic Nonuniform Random Variate Generation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 441",
  year =         "2004",
  ISBN =         "3-540-40652-2",
  ISBN-13 =      "978-3-540-40652-5",
  LCCN =         "QA273 .H777 2004",
  bibdate =      "Sat Jul 5 10:16:09 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics and computing, 1431-8784",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/2003066410-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2003066410-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Random variables",
}

@Article{Jeske:2004:TAM,
  author =       "Daniel R. Jeske and Todd Blessinger",
  title =        "Tunable Approximations for the Mean and Variance of
                 the Maximum of Heterogeneous Geometrically Distributed
                 Random Variables",
  journal =      j-AMER-STAT,
  volume =       "58",
  number =       "4",
  pages =        "322--327",
  month =        nov,
  year =         "2004",
  CODEN =        "ASTAAJ",
  DOI =          "https://doi.org/10.1198/000313004X5509",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Aug 26 21:48:26 MDT 2010",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@TechReport{Kim:2004:CNS,
  author =       "S. J. Kim and K. Umeno and A. Hasegawa",
  title =        "Corrections of the {NIST Statistical Test Suite} for
                 Randomness",
  type =         "Technical Report",
  number =       "2004/018",
  institution =  "Cryptology ePrint Archive",
  address =      "????",
  year =         "2004",
  bibdate =      "Tue Jan 31 15:13:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kim:2004:CRN,
  author =       "Tae Soo Kim and Joung Nam Lee and Jong Hyouk Kim",
  title =        "On the combinations of random number generators and
                 empirical tests",
  journal =      j-ADV-APPL-STAT,
  volume =       "4",
  number =       "2",
  pages =        "155--166",
  month =        aug,
  year =         "2004",
  CODEN =        "????",
  ISSN =         "0972-3617",
  ISSN-L =       "0972-3617",
  MRclass =      "62G10 (11K45 65C10)",
  MRnumber =     "2137963",
  bibdate =      "Wed Aug 16 12:27:05 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/advapplstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.pphmj.com/abstract/428.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "Advances and Applications in Statistics",
  journal-URL =  "http://www.pphmj.com/journals/contents/adas.htm",
}

@Article{Knight:2004:PDU,
  author =       "W. Knight",
  title =        "Prize draw uses heat for random numbers",
  journal =      j-NEW-SCIENTIST,
  volume =       "15",
  number =       "??",
  pages =        "54--??",
  day =          "17",
  month =        aug,
  year =         "2004",
  CODEN =        "NWSCAL",
  ISSN =         "0262-4079 (print), 1364-8500 (electronic)",
  ISSN-L =       "0262-4079",
  bibdate =      "Sat Dec 24 11:13:27 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.newscientist.com/article/dn6289-prize-draw-uses-heat-for-random-numbers.html;
                 http://www.newscientist.com/news/news.jsp?id=ns99996289",
  acknowledgement = ack-nhfb,
  fjournal =     "New Scientist",
  journal-URL =  "http://www.sciencedirect.com/science/journal/02624079",
  keywords =     "true random numbers from physical sources",
  remark =       "From the article: ``ERNIE 4 is capable of producing
                 one million random numbers per hour. By contrast, the
                 first ERNIE machine, which used a gas neon diode as its
                 source of randomness, could only generate 2000 numbers
                 per hour.''",
}

@Article{LEcuyer:2004:DLR,
  author =       "Pierre L'Ecuyer and Ren{\'e}e Touzin",
  title =        "On the {Deng--Lin} random number generators and
                 related methods",
  journal =      j-STAT-COMPUT,
  volume =       "14",
  number =       "1",
  pages =        "5--9",
  month =        jan,
  year =         "2004",
  CODEN =        "STACE3",
  DOI =          "https://doi.org/10.1023/B:STCO.0000009417.88960.81",
  ISSN =         "0960-3174 (print), 1573-1375 (electronic)",
  ISSN-L =       "0960-3174",
  MRnumber =     "2019901",
  bibdate =      "Sat Jan 31 12:22:09 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=961292.961302;
                 http://link.springer.com/article/10.1023/B%3ASTCO.0000009417.88960.81",
  abstract =     "We study the structure and point out weaknesses of
                 recently proposed random number generators based on
                 special types of linear recurrences with small
                 coefficients, which allow fast implementations. Our
                 theoretical analysis is complemented by the results of
                 simple empirical statistical tests that the generators
                 fail decisively. Directions for improvement and
                 alternative generators are also pointed out.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics and Computing",
  journal-URL =  "http://link.springer.com/journal/11222",
  keywords =     "efficient generator; lattice structure; multiple
                 recursive generator (MRG); statistical test of
                 randomness",
}

@InProceedings{LEcuyer:2004:PIL,
  author =       "Pierre L'Ecuyer",
  title =        "Polynomial integration lattices",
  crossref =     "Niederreiter:2004:MCQ",
  pages =        "73--98",
  year =         "2004",
  bibdate =      "Fri Dec 30 14:42:03 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:2004:RNGa,
  author =       "Pierre L'Ecuyer",
  title =        "Random number generation",
  crossref =     "Gentle:2004:HCS",
  chapter =      "II.2",
  pages =        "35--70",
  year =         "2004",
  MRclass =      "65C10 (60C05)",
  MRnumber =     "2090138",
  bibdate =      "Sun Dec 18 09:29:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{LEcuyer:2004:RNGb,
  author =       "Pierre L'Ecuyer",
  title =        "Random Number Generation and {Quasi-Monte Carlo}",
  crossref =     "Teugels:2004:EAS",
  pages =        "1363--1369",
  year =         "2004",
  bibdate =      "Fri Mar 09 11:58:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lee:2004:ECB,
  author =       "Po-Han Lee and Yi Chen and Soo-Chang Pei and Yih-Yuh
                 Chen",
  title =        "Evidence of the correlation between positive
                 {Lyapunov} exponents and good chaotic random number
                 sequences",
  journal =      j-COMP-PHYS-COMM,
  volume =       "160",
  number =       "3",
  pages =        "187--203",
  day =          "15",
  month =        jul,
  year =         "2004",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2004.04.001",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:27 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465504001663",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Lee:2004:GNG,
  author =       "Dong-U Lee and Wayne Luk and John D. Villasenor and P.
                 Y. K. Cheung",
  title =        "A {Gaussian} noise generator for hardware-based
                 simulations",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "53",
  number =       "12",
  pages =        "1523--1534",
  month =        dec,
  year =         "2004",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2004.106",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 5 08:12:47 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1347079",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Lee:2004:RNG,
  author =       "Lap-Piu Lee and Kwok-Wo Wong",
  title =        "A random number generator based on elliptic curve
                 operations",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "47",
  number =       "2--3",
  pages =        "217--226",
  month =        jan # "\slash " # feb,
  year =         "2004",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:49:35 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122104900181",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@InProceedings{Liu:2004:SLD,
  author =       "Kwong-Ip Liu and Fred J. Hickernell",
  editor =       "Jiannong Cao and Minyi Guo and Francis Lau and
                 Laurence T. Yang",
  booktitle =    "{Parallel and Distributed Processing and Applications:
                 Second International Symposium, ISPA 2004, Hong Kong,
                 China, December 13--15, 2004. Proceedings}",
  title =        "A scalable low discrepancy point generator for
                 parallel computing",
  volume =       "3358",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "2004",
  DOI =          "https://doi.org/10.1007/978-3-540-30566-8_31",
  ISBN =         "3-540-24128-0, 3-540-30566-1",
  ISBN-13 =      "978-3-540-24128-7, 978-3-540-30566-8",
  LCCN =         "QA76.58 .I88 2004",
  bibdate =      "Fri Mar 02 18:34:30 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "http://www.springerlink.com/content/bc8n7emh9rcehny8/",
  acknowledgement = ack-nhfb,
}

@Misc{Luke:2004:DMT,
  author =       "Sean Luke",
  title =        "Documentation for the {Mersenne Twister} in {Java}",
  howpublished = "Web site.",
  month =        oct,
  year =         "2004",
  bibdate =      "Wed May 13 15:49:46 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.gmu.edu/~sean/research/mersenne",
  acknowledgement = ack-nhfb,
}

@Article{Maigne:2004:PMC,
  author =       "Lydia Maigne and David Hill and Pascal Calvat and
                 Vincent Breton and Romain Reuillon and Delphine Lazaro
                 and Yannick Legre and Denise Donnarieix",
  title =        "Parallelization of {Monte Carlo} Simulations and
                 Submission to a Grid Environment",
  journal =      j-PARALLEL-PROCESS-LETT,
  volume =       "14",
  number =       "2",
  pages =        "177--??",
  month =        jun,
  year =         "2004",
  CODEN =        "PPLTEE",
  ISSN =         "0129-6264",
  bibdate =      "Thu Jan 06 09:42:32 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ppl/;
                 https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Parallel Processing Letters",
  journal-URL =  "http://www.worldscientific.com/loi/ppl",
}

@Article{Marsaglia:2004:BURa,
  author =       "George Marsaglia and Wai Wan Tsang",
  title =        "The 64-bit universal {RNG}",
  journal =      j-STAT-PROB-LETT,
  volume =       "66",
  number =       "2",
  pages =        "183--187",
  year =         "2004",
  CODEN =        "SPLTDC",
  DOI =          "https://doi.org/10.1016/j.spl.2003.11.001",
  ISSN =         "0167-7152 (print), 1879-2103 (electronic)",
  ISSN-L =       "0167-7152",
  MRclass =      "65C10",
  MRnumber =     "2 029 733",
  bibdate =      "Thu Dec 22 07:42:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  URL =          "http://www.doornik.com/research/randomdouble.pdf",
  ZMnumber =     "02041513",
  abstract =     "We describe a random number generator that produces
                 uniform $ [0, 1) $ variates directly, as 64-bit
                 floating point numbers, without the customary floating
                 of integers. Using only subtraction and tests on
                 magnitude, the method is readily implemented and
                 should, given the same seed values, produce exactly the
                 same random numbers with most programming languages.
                 The resulting numbers have a very long period ($
                 \approx 2^{202} $ or $ 10^{61} $ ) and apparently
                 excellent randomness---supported by extensive
                 testing.",
  acknowledgement = ack-nhfb,
  fjournal =     "Statistics \& Probability Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01677152",
  keywords =     "64-bit floating point; Random number generators;
                 Seeds",
  ZMclass =      "62-99 Statistics",
}

@Article{Marsaglia:2004:FGD,
  author =       "George Marsaglia and Wai Wan Tsang and Jingbo Wang",
  title =        "Fast Generation of Discrete Random Variables",
  journal =      j-J-STAT-SOFT,
  volume =       "11",
  number =       "3",
  pages =        "1--8",
  month =        "????",
  year =         "2004",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Sat Dec 04 09:18:40 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/counter.php?id=99&url=v11/i03/discrete.pdf&ct=1",
  accepted =     "2004-07-12",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  submitted =    "2004-06-05",
  xxpages =      "1--11",
}

@Article{Martin:2004:ICF,
  author =       "Greg Martin and Carl Pomerance",
  title =        "The iterated {Carmichael} $ \lambda $-function and the
                 number of cycles of the power generator",
  journal =      "arxiv.org",
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "16",
  month =        jun,
  year =         "2004",
  bibdate =      "Thu Jan 19 18:09:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/math/0406335",
  acknowledgement = ack-nhfb,
  keyword =      "Blum--Blum--Shub generator",
}

@Article{Mascagni:2004:PLC,
  author =       "Michael Mascagni and Hongmei Chi",
  title =        "Parallel linear congruential generators with
                 {Sophie-Germain} moduli",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "30",
  number =       "11",
  pages =        "1217--1231",
  year =         "2004",
  CODEN =        "PACOEJ",
  DOI =          "https://doi.org/10.1016/j.parco.2004.08.002",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "2104538 (2005g:11141)",
  MRreviewer =   "Gottlieb Pirsic",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
}

@Article{Mascagni:2004:PPM,
  author =       "Michael Mascagni and Ashok Srinivasan",
  title =        "Parameterizing parallel multiplicative
                 lagged-{Fibonacci} generators",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "30",
  number =       "7",
  pages =        "899--916",
  month =        jul,
  year =         "2004",
  CODEN =        "PACOEJ",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Sun Nov 7 05:53:53 MST 2004",
  bibsource =    "http://www.sciencedirect.com/science/journal/01678191;
                 https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
}

@Article{Mauduit:2004:CPB,
  author =       "Christian Mauduit and Jo{\"e}l Rivat and Andr{\'a}s
                 S{\'a}rk{\"o}zy",
  title =        "Construction of Pseudorandom Binary Sequences Using
                 Additive Characters",
  journal =      j-MONAT-MATH,
  volume =       "141",
  number =       "3",
  pages =        "197--208",
  month =        mar,
  year =         "2004",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s00605-003-0112-8",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 12:06:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/tlp6lmgh680vawkf/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{McCullough:2004:BRB,
  author =       "B. D. McCullough",
  title =        "Book Review: {{\booktitle{Random Number Generation and
                 Monte Carlo Methods}} by James E. Gentle}",
  journal =      j-TECHNOMETRICS,
  volume =       "46",
  number =       "2",
  pages =        "252--253",
  month =        may,
  year =         "2004",
  CODEN =        "TCMTA2",
  DOI =          "https://doi.org/10.1198/tech.2004.s796;
                 https://doi.org/10.2307/25470813",
  ISSN =         "0040-1706 (print), 1537-2723 (electronic)",
  ISSN-L =       "0040-1706",
  bibdate =      "Sat Jun 21 15:54:11 MDT 2014",
  bibsource =    "http://www.jstor.org/journals/00401706.html;
                 http://www.jstor.org/stable/i25470796;
                 http://www.tandf.co.uk/journals/titles/00401706.html;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics2000.bib",
  URL =          "http://www.jstor.org/stable/25470813",
  acknowledgement = ack-nhfb,
  fjournal =     "Technometrics",
  journal-URL =  "http://www.jstor.org/journals/00401706.html;
                 http://www.tandfonline.com/loi/utch20",
}

@Article{McCullough:2004:FSE,
  author =       "B. D. McCullough",
  title =        "Fixing statistical errors in spreadsheet software: the
                 cases of {Gnumeric} and {Excel}",
  journal =      "Statistical Software Newsletter",
  volume =       "??",
  number =       "??",
  pages =        "1--10",
  month =        "????",
  year =         "2004",
  CODEN =        "????",
  ISSN =         "0173-5896",
  bibdate =      "Wed Feb 22 11:09:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.csdassn.org/reportdetail.cfm?ID=508;
                 http://www.csdassn.org/software/reports.cfm;
                 http://www.csdassn.org/software_reports/gnumeric.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Statist. Software Newslett.",
  fjournal =     "Statistical Software Newsletter",
  remark =       "ssncsda.org Web site no longer online (22 February
                 2012), and no snapshots in http://www.archive.org. One
                 library catalog says that the newsletter was absorbed
                 by the journal \booktitle{Computational statistics &
                 data analysis}.",
  xxURL =        "http://www.ssncsda.org/reports",
}

@Article{McIvor:2004:IMM,
  author =       "C. McIvor and M. McLoone and J. V. McCanny",
  title =        "Improved {Montgomery} modular inverse algorithm",
  journal =      j-ELECT-LETTERS,
  volume =       "40",
  number =       "18",
  pages =        "1110--1112",
  day =          "2",
  month =        sep,
  year =         "2004",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:20045610",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Wed Dec 28 18:13:01 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1335002",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Mertens:2004:EPR,
  author =       "Stephan Mertens and Heiko Bauke",
  title =        "Entropy of pseudo-random-number generators",
  journal =      j-PHYS-REV-E,
  volume =       "69",
  number =       "5",
  pages =        "055702--055702",
  month =        may,
  year =         "2004",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.69.055702",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.69.055702",
  abstract =     "Since the work of Ferrenberg et al. [Phys. Rev. Lett.
                 {\bf 69} 3382 (1992)] some pseudo-random-number
                 generators are known to yield wrong results in cluster
                 Monte Carlo simulations. In this contribution the
                 fundamental mechanism behind this failure is discussed.
                 Almost all random-number generators calculate a new
                 pseudo-random-number $ x_i $ from preceding values, $
                 x_i = f(x_{i - 1}, x_{i - 2}, \ldots {}, x_{i q}) $.
                 Failure of these generators in cluster Monte Carlo
                 simulations and related experiments can be attributed
                 to the low entropy of the production rule $ f() $
                 conditioned on the statistics of the input values $
                 x_{i - 1}, \ldots {}, x_{i - q} $. Being a measure only
                 of the arithmetic operations in the generator rule, the
                 conditional entropy is independent of the lag in the
                 recurrence or the period of the sequence. In that sense
                 it measures a more profound quality of a random-number
                 generator than empirical tests with their limited
                 horizon.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  pagecount =    "4",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
  xxnumber =     "5 (part 2)",
}

@Article{Nagahara:2004:MSM,
  author =       "Yuichi Nagahara",
  title =        "A method of simulating multivariate nonnormal
                 distributions by the {Pearson} distribution system and
                 estimation",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "47",
  number =       "1",
  pages =        "1--29",
  day =          "1",
  month =        aug,
  year =         "2004",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/j.csda.2003.10.008",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947303002421",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Ossola:2004:SED,
  author =       "Giovanni Ossola and Alan D. Sokal",
  title =        "Systematic errors due to linear congruential
                 random-number generators with the {Swendsen--Wang}
                 algorithm: a warning",
  journal =      j-PHYS-REV-E,
  volume =       "70",
  number =       "2",
  pages =        "027701",
  month =        aug,
  year =         "2004",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.70.027701",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Thu Dec 29 09:07:31 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.70.027701",
  abstract =     "We show that linear congruential pseudo-random-number
                 generators can cause systematic errors in Monte Carlo
                 simulations using the Swendsen--Wang algorithm, if the
                 lattice size is a multiple of a very large power of 2
                 and one random number is used per bond. These
                 systematic errors arise from correlations within a
                 single bond-update half-sweep. The errors can be
                 eliminated (or at least radically reduced) by updating
                 the bonds in a random order or in an aperiodic manner.
                 It also helps to use a generator of large modulus
                 (e.g., 60 or more bits).",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  pagecount =    "4",
  remark-corr =  "See \cite{Kalle:1984:PRN, Berdnicov:1991:MCS,
                 Ferrenberg:1992:MCS, Grassberger:1993:CGR,
                 Kankaala:1993:BLC, Selke:1993:CFM, Coddington:1994:ARN,
                 Holian:1994:PNG, Vattulainen:1994:PTR,
                 Compagner:1995:OCR, Schmid:1995:EMC,
                 Vattulainen:1995:CSS, Vattulainen:1995:PMT,
                 Bromley:1996:QNG, Coddington:1997:RNG, Shchur:1997:CMC,
                 Shchur:1997:SDR, DSouza:1998:SBD, Gammel:1998:HRR,
                 Resende:1998:URN, Mertens:2003:EPR, Bauke:2004:PRC,
                 Mertens:2004:EPR, Ossola:2004:SED} for examples of
                 generator correlations causing Monte Carlo simulations
                 in physics to converge to the wrong answer.",
}

@PhdThesis{Panneton:2004:CEP,
  author =       "Fran{\c{c}}ois Panneton",
  title =        "Construction d'ensembles de points bas{\'e}e sur des
                 r{\'e}currences lin{\'e}aires dans un corps fini de
                 caract{\'e}ristique $2$ pour la simulation {Monte
                 Carlo} et l'int{\'e}gration quasi-{Monte Carlo}.
                 ({French}) [{Construction} of point sets based on
                 linear recurrences in a finite body of characteristic
                 $2$ for {Monte Carlo} simulation and quasi-{Monte
                 Carlo} integration]",
  type =         "Th{\`e}se ({Ph.D.})",
  school =       "D{\'e}partement d'informatique et de recherche
                 op{\'e}rationnelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, QC, Canada",
  pages =        "xxiv + 363",
  year =         "2004",
  ISBN =         "0-494-00111-9",
  ISBN-13 =      "978-0-494-00111-0",
  LCCN =         "????",
  bibdate =      "Fri Mar 09 12:05:19 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Th{\`e}se pr{\'e}sent{\'e}e {\`a} la Facult{\'e} des
                 {\'e}tudes sup{\'e}rieures en vue de l'obtention du
                 grade de Philosophiae Doctor (Ph.D.) en informatique",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@InCollection{Panneton:2004:RNG,
  author =       "Fran{\c{c}}ois Panneton and Pierre L'Ecuyer",
  title =        "Random number generators based on linear recurrences
                 in {$ F_{2^w} $}",
  crossref =     "Niederreiter:2004:MCQ",
  pages =        "367--378",
  year =         "2004",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "2076946",
  bibdate =      "Fri Dec 30 15:27:47 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Peitgen:2004:CGH,
  author =       "Heinz-Otto Peitgen and H. (Hartmut) J{\"u}rgens and
                 Dietmar Saupe",
  title =        "The Chaos Game: How Randomness Creates Deterministic
                 Shapes",
  crossref =     "Peitgen:2004:CFN",
  chapter =      "7",
  pages =        "277--327",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/0-387-21823-8_7",
  bibdate =      "Fri Mar 09 08:30:57 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Rasulov:2004:QSB,
  author =       "Abdujabor Rasulov and Aneta Karaivanova and Michael
                 Mascagni",
  title =        "Quasirandom Sequences in Branching Random Walks",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "10",
  number =       "3--4",
  pages =        "551--558",
  month =        dec,
  year =         "2004",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2004.10.3-4.551",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C05 (65C10 65N99)",
  MRnumber =     "2105081",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2004.10.issue-3/issue-files/mcma.2004.10.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2004.10.issue-3-4/mcma.2004.10.3-4.551/mcma.2004.10.3-4.551.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Ryabko:2004:BSN,
  author =       "B. Ya. Ryabko and A. I. Pestunov",
  title =        "{``Book Stack''} as a new statistical test for random
                 numbers",
  journal =      j-PROBL-INF-TRANSM,
  volume =       "40",
  number =       "1",
  pages =        "66--71",
  month =        jan,
  year =         "2004",
  CODEN =        "PRITA9",
  DOI =          "https://doi.org/10.1023/B:PRIT.0000024881.86267.b5",
  ISSN =         "0032-9460 (print), 1608-3253 (electronic)",
  ISSN-L =       "0032-9460",
  bibdate =      "Fri Mar 09 12:10:12 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/rxr43187v7p21265/",
  abstract =     "A new statistical test is proposed for testing the
                 hypothesis $ H_0 $ that symbols of an alphabet are
                 generated with equal probabilities against the
                 alternative hypothesis $ H_1 $, the negation of $ H_0
                 $. The new method is applied to testing generators of
                 pseudorandom numbers. It is experimentally demonstrated
                 that the method makes it possible to detect deviations
                 from randomness for many generators which `withstand'
                 previously known statistical tests.",
  acknowledgement = ack-nhfb,
  fjournal =     "Problems of Information Transmission",
}

@Article{Ryabko:2004:NTR,
  author =       "B. Ya. Ryabko and V. S. Stognienko and Y. I. Shokin",
  title =        "A new test for randomness and its application to some
                 cryptographic problems",
  journal =      j-J-STAT-PLANN-INFERENCE,
  volume =       "123",
  number =       "2",
  pages =        "365--376",
  day =          "1",
  month =        jul,
  year =         "2004",
  CODEN =        "JSPIDN",
  DOI =          "https://doi.org/10.1016/S0378-3758(03)00149-6",
  ISSN =         "0378-3758 (print), 1873-1171 (electronic)",
  ISSN-L =       "0378-3758",
  bibdate =      "Fri Mar 09 12:13:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378375803001496",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Planning and Inference",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03783758",
  keywords =     "adaptive chi-square test",
}

@Article{Rybakov:2004:SPL,
  author =       "A. S. Rybakov",
  title =        "Spectral properties of a linear congruential generator
                 in special cases",
  journal =      "Diskret. Mat.",
  volume =       "16",
  number =       "2",
  pages =        "54--78",
  year =         "2004",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1163/1569392031905584",
  ISSN =         "0234-0860",
  MRclass =      "11K99",
  MRnumber =     "2084569 (2006i:11091)",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Diskretnaya Matematika",
}

@Article{Rybakov:2004:SVL,
  author =       "A. S. Rybakov",
  title =        "The shortest vectors of lattices connected with a
                 linear congruential generator",
  journal =      "Diskret. Mat.",
  volume =       "16",
  number =       "4",
  pages =        "88--109",
  year =         "2004",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1163/1569392042572203",
  ISSN =         "0234-0860",
  MRclass =      "11H06 (11A07)",
  MRnumber =     "2141148 (2006b:11070)",
  MRreviewer =   "Igor Wigman",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Diskretnaya Matematika",
}

@Article{Schmuland:2004:CLT,
  author =       "Byron Schmuland and Wei Sun",
  title =        "A {Central Limit Theorem} and {Law of the Iterated
                 Logarithm} for a Random Field with Exponential Decay of
                 Correlations",
  journal =      j-CAN-J-MATH,
  volume =       "56",
  number =       "??",
  pages =        "209--224",
  month =        "????",
  year =         "2004",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-2004-010-6",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:39:11 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v56/;
                 https://www.math.utah.edu/pub/tex/bib/canjmath2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "In [6], Walter Philipp wrote that {``\ldots{} the law
                 of the iterated logarithm holds for any process for
                 which the Borel-Cantelli Lemma, the central limit
                 theorem with a reasonably good remainder and a certain
                 maximal inequality are valid.''} Many authors [1], [2],
                 [4], [5], [9] have followed the plan in proving the law
                 of the iterated logarithm for sequences (or fields) of
                 dependent random variables. We carry on this tradition
                 by proving the law of the iterated logarithm for a
                 random field whose correlations satisfy an exponential
                 decay condition like the one obtained by Spohn [8] for
                 certain Gibbs measures. These do not fall into the
                 phi-mixing or strong mixing cases established in the
                 literature, but are needed for our investigations [7]
                 into diffusions on configuration space. The proofs are
                 all obtained by patching together standard results from
                 [5], [9] while keeping a careful eye on the
                 correlations.",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{Sezgin:2004:MSS,
  author =       "F. Sezgin",
  title =        "A method of systematic search for optimal multipliers
                 in congruential random number generators",
  journal =      j-BIT-NUM-MATH,
  volume =       "44",
  number =       "1",
  pages =        "135--149",
  month =        jan,
  year =         "2004",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1023/B:BITN.0000025085.88778.75",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "65C10 (11K45)",
  MRnumber =     "MR2057366 (2005e:65005)",
  bibdate =      "Wed Jan 4 15:06:06 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=44&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/bit.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=44&issue=1&spage=135",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT. Numerical Mathematics",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@Article{Sugita:2004:SPR,
  author =       "Hiroshi Sugita",
  title =        "Security of Pseudo-random Generator and {Monte Carlo}
                 Method",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "10",
  number =       "3--4",
  pages =        "609--615",
  month =        dec,
  year =         "2004",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2004.10.3-4.609",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "94A60 (65C10)",
  MRnumber =     "2105086",
  bibdate =      "Mon Feb 27 10:56:29 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2004.10.issue-3/issue-files/mcma.2004.10.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2004.10.issue-3-4/mcma.2004.10.3-4.609/mcma.2004.10.3-4.609.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Article{Szczepanski:2004:BRN,
  author =       "J. Szczepanski and E. Wajnryb and J. M. Amig{\'o} and
                 Maria V. Sanchez-Vives and M. Slater",
  title =        "Biometric random number generators",
  journal =      j-COMPUT-SECUR,
  volume =       "23",
  number =       "1",
  pages =        "77--84",
  month =        feb,
  year =         "2004",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Mon Sep 23 09:45:54 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.sciencedirect.com/science/article/pii/S0167404804000641",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Tang:2004:SGM,
  author =       "Hui-Chin Tang and Chiang Kao",
  title =        "Searching for Good Multiple Recursive Random Number
                 Generators via a Genetic Algorithm",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "16",
  number =       "3",
  pages =        "284--290",
  month =        "Summer",
  year =         "2004",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.1030.0039",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  bibdate =      "Fri Mar 09 13:10:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@Article{Tirler:2004:EKR,
  author =       "G{\"u}nter Tirler and Peter Dalgaard and Wolfgang
                 H{\"o}rmann and Josef Leydold",
  title =        "An error in the {Kinderman--Ramage} method and how to
                 fix it",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "47",
  number =       "3",
  pages =        "433--440",
  day =          "1",
  month =        oct,
  year =         "2004",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/j.csda.2003.11.019",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 08 14:25:49 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Kinderman:1976:CGN,Kinderman:1990:CCG}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947303002937",
  abstract =     "An error in the Gaussian random variate generator by
                 Kinderman and Ramage is described that results in the
                 generation of random variates with an incorrect
                 distribution. An additional statement that corrects the
                 original algorithm is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Tonon:2004:URS,
  author =       "Fulvio Tonon",
  title =        "On the Use of Random Set Theory to Bracket the Results
                 of {Monte Carlo} Simulations",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "10",
  number =       "2",
  pages =        "107--137",
  month =        apr,
  year =         "2004",
  CODEN =        "RCOMF8",
  DOI =          "https://doi.org/10.1023/B:REOM.0000015849.35108.9c",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  bibdate =      "Mon Feb 6 07:42:05 MST 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1385-3139&volume=10&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/rc.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=1385-3139&volume=10&issue=2&spage=107",
  acknowledgement = ack-nhfb # "\slash " # ack-rbk # "\slash " # ack-vk,
  fjournal =     "Reliable Computing = Nadezhnye vychisleniia",
  journal-URL =  "http://link.springer.com/journal/11155",
}

@InProceedings{Tsang:2004:TCT,
  author =       "W. W. Tsang and C. F. Chong and K. P. Chow and L. C.
                 K. Hui and C. W. Tso",
  editor =       "Vladimir Estivill-Castro",
  booktitle =    "{Proceedings of the Twenty-Seventh Australasian
                 Computer Science Conference (ACSC2004) Dunedin, NZ,
                 January 2004}",
  title =        "Tuning the Collision Test for Power",
  volume =       "26",
  publisher =    "Australian Computer Society",
  address =      "Sydney, Australia",
  bookpages =    "xvi + 388",
  pages =        "23--30",
  year =         "2004",
  ISBN =         "1-920682-05-8",
  ISBN-13 =      "978-1-920682-05-7",
  LCCN =         "QA75.5 .A88 2004",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Conferences in research and practice in information
                 technology",
  abstract =     "The collision test is an important statistical test
                 for rejecting poor random number generators. The test
                 simulates the throwing of balls randomly into urns. A
                 problem in applying this test is to determine the
                 number of urns, $m$, and the number of balls, $n$, so
                 that the test is among the most powerful possible on a
                 computer. The problem was tackled empirically. A set of
                 canonical congruential generators with increasing
                 periods was first implemented. The stringency of a test
                 against congruential generators is measured as the
                 number of canonical generators the test rejects.
                 Experiments were then conducted to measure the
                 stringencies of the collision tests for various $ (m,
                 n) $ values. The results reveal that for a fixed $m$,
                 the stringency of a test reaches maximum when $ m < n 2
                 m $. Moreover, the stringency increases as $m$
                 increases. Similar results were observed when the
                 experiments were repeated on lagged Fibonacci
                 generators and on shift-register generators. Further
                 investigation showed that the variance of the number of
                 collisions reaches maximum together with the
                 stringencies, at $ n = |1.256431 m| $. Eighteen
                 well-known generators were tested against the collision
                 tests with $ m = ?, ?, ?? $, up to ??. Many generators
                 failed starting from some points along the way,
                 including congruential generators, shift-register
                 generators, lagged Fibonacci generators of lags less
                 than 40, subtract-with-borrow generators of lags less
                 than 24, and a combined generator.",
  acknowledgement = ack-nhfb,
}

@Article{Tuffin:2004:RQM,
  author =       "Bruno Tuffin",
  title =        "Randomization of Quasi-{Monte Carlo} Methods for Error
                 Estimation: Survey and Normal Approximation",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "10",
  number =       "3--4",
  pages =        "617--628",
  month =        dec,
  year =         "2004",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1515/mcma.2004.10.3-4.617",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C05",
  MRnumber =     "2105087",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2004.10.issue-3/issue-files/mcma.2004.10.issue-3.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2004.10.issue-3-4/mcma.2004.10.3-4.617/mcma.2004.10.3-4.617.xml",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@Misc{Walker:2004:HGR,
  author =       "J. Walker",
  title =        "{HotBits}: Genuine random numbers, generated by
                 radioactive decay",
  howpublished = "Fourmilab Switzerland Web site.",
  month =        apr,
  year =         "2004",
  bibdate =      "Sat Dec 24 11:15:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.fourmilab.ch/hotbits/",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@InCollection{Witkovsky:2004:MAT,
  author =       "Viktor Witkovsk{\'y}",
  booktitle =    "{COMPSTAT} 2004---{Proceedings} in {Computational}
                 {Statistics}",
  title =        "{Matlab} algorithm {TDIST}: the distribution of a
                 linear combination of {Student}'s {$T$} random
                 variables",
  publisher =    "Physica",
  address =      "Heidelberg",
  pages =        "1995--2002",
  year =         "2004",
  MRclass =      "Database Expansion Item",
  MRnumber =     "MR2173230",
  bibdate =      "Tue Mar 30 16:16:22 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:2004:NSC,
  author =       "Hongjun Wu",
  editor =       "B. Roy and W. Meier",
  booktitle =    "Proceedings of {FSE 2004}",
  title =        "A New Stream Cipher {HC-256}",
  volume =       "3017",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "226--244",
  year =         "2004",
  bibdate =      "Sat Apr 05 12:59:24 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  URL =          "https://iacr.org/archive/fse2004/30170226/30170226.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yang:2004:CBF,
  author =       "Hsing-Tsung Yang and Jing-Reng Huang and Tsin-Yuan
                 Chang",
  editor =       "{IEEE}",
  booktitle =    "{Proceedings. The 2004 IEEE Asia-Pacific Conference on
                 Circuits and Systems, 6--9 December, 2004, Tayih Landis
                 Hotel, Tainan, Taiwan}",
  title =        "A chaos-based fully digital {120 MHz} pseudo random
                 number generator",
  volume =       "1",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "????",
  pages =        "357--360",
  year =         "2004",
  DOI =          "https://doi.org/10.1109/APCCAS.2004.1412769",
  ISBN =         "0-7803-8660-4",
  ISBN-13 =      "978-0-7803-8660-0",
  LCCN =         "TK5101.A1 I1187 2004; TK454.2 .I195 2004",
  bibdate =      "Thu Feb 23 09:06:38 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/servlet/opac?punumber=9700",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Misc{Anonymous:2005:EES,
  author =       "Anonymous",
  title =        "{eSTREAM} --- The {Ecrypt Stream Cipher Project}: The
                 {eSTREAM} Portfolio Page",
  howpublished = "Web site",
  year =         "2005",
  bibdate =      "Sat Apr 05 12:11:50 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ecrypt.eu.org/stream/",
  acknowledgement = ack-nhfb,
}

@Article{Arnault:2005:DPN,
  author =       "F. Arnault and T. P. Berger",
  title =        "Design and properties of a new pseudorandom generator
                 based on a filtered {FCSR} automaton",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "54",
  number =       "11",
  pages =        "1374--1383",
  month =        nov,
  year =         "2005",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2005.181",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 4 16:17:19 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1514417",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InProceedings{Balakirsky:2005:GFA,
  author =       "Vladimir B. Balakirsky",
  title =        "Generating functions associated with random binary
                 sequences consisting of runs of lengths $1$ and $2$",
  crossref =     "Helleseth:2005:STA",
  pages =        "323--338",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11423461_24",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/seta/seta2004.html#NiederreiterW04;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  ZMnumber =     "Zbl 1145.94412",
  acknowledgement = ack-nhfb,
}

@Book{Banks:2005:DES,
  author =       "Jerry Banks and John S. Carson and Barry L. Nelson and
                 David M. Nicol",
  title =        "Discrete-Event System Simulation",
  publisher =    "Pearson/Prentice-Hall",
  address =      "Upper Saddle River, NJ, USA",
  edition =      "Fourth",
  pages =        "xvi + 608",
  year =         "2005",
  ISBN =         "0-13-129342-7, 0-13-144679-7",
  ISBN-13 =      "978-0-13-129342-7, 978-0-13-144679-3",
  LCCN =         "T57.62 .D53 2005",
  bibdate =      "Thu Jan 5 14:58:48 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 jenson.stanford.edu:2210/unicorn;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Prentice-Hall international series in industrial and
                 systems engineering",
  acknowledgement = ack-nhfb,
  tableofcontents = "\\
                 1: Introduction \\
                 2: Simulation Examples \\
                 3: General Principles \\
                 4: Simulation Software \\
                 5: Statistical Models in Simulation \\
                 6: Queueing Models \\
                 7: Random-number Generation \\
                 8: Random-variate Generation \\
                 9: Input Modeling \\
                 10: V and V \\
                 11: Output Analysis for a Single Model \\
                 12: Comparing Multiple Designs \\
                 13: Simulation of Mfg. and MH Systems \\
                 14: Simulation of Computer Systems \\
                 15: Simulation of Communication Systems",
}

@InProceedings{Barak:2005:MAP,
  author =       "B. Barak and S. Halevi",
  title =        "A Model and Architecture for Pseudo-Random Generation
                 with Applications to {{\tt /dev/random}}",
  crossref =     "Meadows:2005:CPA",
  pages =        "203--212",
  year =         "2005",
  DOI =          "https://doi.org/10.1145/1102120.1102148",
  bibdate =      "Mon Apr 03 07:57:43 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We present a formal model and a simple architecture
                 for robust pseudorandom generation that ensures
                 resilience in the face of an observer with partial
                 knowledge/control of the generator's entropy source.
                 Our model and architecture have the following
                 properties:Resilience. The generator's output looks
                 random to an observer with no knowledge of the internal
                 state. This holds even if that observer has complete
                 control over data that is used to refresh the internal
                 state. Forward security. Past output of the generator
                 looks random to an observer, even if the observer
                 learns the internal state at a later time. Backward
                 security/Break-in recovery. Future output of the
                 generator looks random, even to an observer with
                 knowledge of the current state, provided that the
                 generator is refreshed with data of sufficient entropy.
                 Architectures such as above were suggested before. This
                 work differs from previous attempts in that we present
                 a formal model for robust pseudo-random generation, and
                 provide a formal proof within this model for the
                 security of our architecture. To our knowledge, this is
                 the first attempt at a rigorous model for this problem.
                 Our formal modeling advocates the separation of the
                 entropy extraction phase from the output generation
                 phase. We argue that the former is
                 information-theoretic in nature, and could therefore
                 rely on combinatorial and statistical tools rather than
                 on cryptography. On the other hand, we show that the
                 latter can be implemented using any standard
                 (non-robust) cryptographic PRG. We also discuss the
                 applicability of our architecture for applications such
                 as /dev/(u)random in Linux and pseudorandom generation
                 on smartcards.",
  acknowledgement = ack-nhfb,
}

@Article{Beliakov:2005:CLR,
  author =       "Gleb Beliakov",
  title =        "Class library {{\tt ranlip}} for multivariate
                 nonuniform random variate generation",
  journal =      j-COMP-PHYS-COMM,
  volume =       "170",
  number =       "1",
  pages =        "93--108",
  day =          "15",
  month =        jul,
  year =         "2005",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2005.03.105",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 23:42:00 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465505002596",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Beliakov:2005:UNR,
  author =       "Gleb Beliakov",
  title =        "Universal nonuniform random vector generator based on
                 acceptance-rejection",
  journal =      j-TOMACS,
  volume =       "15",
  number =       "3",
  pages =        "205--232",
  month =        jul,
  year =         "2005",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/1103323.1103325",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Wed Dec 7 07:02:19 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The acceptance/rejection approach is widely used in
                 universal nonuniform random number generators. Its key
                 part is an accurate approximation of a given
                 probability density from above by a hat function. This
                 article uses a piecewise constant hat function, whose
                 values are overestimates of the density on the elements
                 of the partition of the domain. It uses a sawtooth
                 overestimate of Lipschitz continuous densities, and
                 then examines all local maximizers of such an
                 overestimate. The method is applicable to multivariate
                 multimodal distributions. It exhibits relatively short
                 preprocessing time and fast generation of random
                 variates from a very large class of distributions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  keywords =     "PRNG (pseudo-random number generator)",
}

@InProceedings{Benony:2005:CPC,
  author =       "Vincent B{\'e}nony and Fran{\c{c}}ois Recher and
                 {\'E}ric Wegrzynowski and Caroline Fontaine",
  title =        "Cryptanalysis of a particular case of {Klimov--Shamir}
                 pseudo-random generator",
  crossref =     "Helleseth:2005:STA",
  pages =        "149--168",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11423461_23",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/seta/seta2004.html#NiederreiterW04;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Blackburn:2005:PNP,
  author =       "Simon R. Blackburn and Domingo Gomez-Perez and Jaime
                 Gutierrez and Igor E. Shparlinski",
  title =        "Predicting nonlinear pseudorandom number generators",
  journal =      j-MATH-COMPUT,
  volume =       "74",
  number =       "251",
  pages =        "1471--1494",
  month =        jul,
  year =         "2005",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Aug 2 10:37:19 MDT 2005",
  bibsource =    "http://www.ams.org/mcom/2005-74-251;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/home.html;
                 http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.dvi;
                 http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.pdf;
                 http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.ps;
                 http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.tex;
                 http://www.jstor.org/stable/pdfplus/4100190.pdf",
  abstract =     "Let $p$ be a prime and let $a$ and $b$ be elements of
                 the finite field $ \mathbb {F}_p $ of $p$ elements. The
                 inversive congruential generator (ICG) is a sequence $
                 (u_n) $ of pseudorandom numbers defined by the relation
                 $ u_{n + 1} \equiv a u_n^{-1} + b \bmod p $. We show
                 that if sufficiently many of the most significant bits
                 of several consecutive values $ u_n $ of the ICG are
                 given, one can recover the initial value $ u_0 $ (even
                 in the case where the coefficients $a$ and $b$ are not
                 known). We also obtain similar results for the
                 quadratic congruential generator (QCG), $ v_{n + 1}
                 \equiv f(v + n) \bmod p $, where $ f \in \mathbb
                 {F}_p[X] $. This suggests that for cryptographic
                 applications ICG and QCG should be used with great
                 care. Our results are somewhat similar to those known
                 for the linear congruential generator (LCG), $ x_{n +
                 1} \equiv a x_n + b \bmod p $, but they apply only to
                 much longer bit strings. We also estimate limits of
                 some heuristic approaches, which still remain much
                 weaker than those known for LCG.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InProceedings{Bogdanov:2005:PGL,
  author =       "Andrej Bogdanov",
  title =        "Pseudorandom generators for low degree polynomials",
  crossref =     "ACM:2005:SPA",
  pages =        "21--30",
  year =         "2005",
  bibdate =      "Wed Apr 5 05:59:22 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Calvayrac:2005:RNG,
  author =       "Florent Calvayrac",
  title =        "Random number generators and the {Metropolis}
                 algorithm: application to various problems in physics
                 and mechanics as an introduction to computational
                 physics",
  journal =      j-EUR-J-PHYS,
  volume =       "26",
  number =       "5",
  pages =        "S31",
  year =         "2005",
  CODEN =        "EJPHD4",
  DOI =          "https://doi.org/10.1088/0143-0807/26/5/S04",
  ISSN =         "0143-0807 (print), 1361-6404 (electronic)",
  ISSN-L =       "0143-0807",
  bibdate =      "Wed Feb 22 09:03:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://stacks.iop.org/0143-0807/26/i=5/a=S04",
  abstract =     "We present known and new applications of pseudo random
                 numbers and of the Metropolis algorithm to phenomena of
                 physical and mechanical interest, such as the search of
                 simple clusters isomers with interactive visualization,
                 or vehicle motion planning. The progression towards
                 complicated problems was used with first-year graduate
                 students who wrote most of the programs presented here.
                 We argue that the use of pseudo random numbers in
                 simulation and extrema research programs in teaching
                 numerical methods in physics allows one to get quick
                 programs and physically meaningful and demonstrative
                 results without recurring to the advanced numerical
                 analysis methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "European Journal of Physics",
  journal-URL =  "http://iopscience.iop.org/0143-0807/",
}

@Article{Castro:2005:NRG,
  author =       "Julio C{\'e}sar Hern{\'a}ndez Castro and Pedro Isasi
                 Vi{\~n}uela",
  title =        "New results on the genetic cryptanalysis of {TEA} and
                 reduced-round versions of {XTEA}",
  journal =      j-NEW-GEN-COMP,
  volume =       "23",
  number =       "3",
  pages =        "233--243",
  year =         "2005",
  CODEN =        "NGCOE5",
  DOI =          "https://doi.org/10.1007/BF03037657",
  ISSN =         "0288-3635 (print), 1882-7055 (electronic)",
  ISSN-L =       "0288-3635",
  bibdate =      "Wed Feb 01 16:35:39 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/e018uh040400kh87/",
  abstract =     "Recently, a quick and simple way of creating very
                 efficient distinguishers for cryptographic primitives
                 such as block ciphers or hash functions, was presented
                 and proved useful by the authors. In this paper, this
                 cryptanalytic attack (named genetic cryptanalysis after
                 its use of genetic algorithms) is shown to be
                 successful when applied over reduced-round versions of
                 the block cipher XTEA. Efficient distinguishers for
                 XTEA are proposed for up to 4 cycles (8 rounds).
                 Additionally, a variant of this genetic attack is also
                 introduced, and their results over the block cipher TEA
                 presented, which are the most powerful published to
                 date.",
  acknowledgement = ack-nhfb,
  fjournal =     "New Generation Computing",
  journal-URL =  "https://dl.acm.org/loi/newg",
  keywords =     "block ciphers; cryptanalysis; distinguishers; TEA;
                 XTEA",
}

@Article{Contini:2005:SAA,
  author =       "Scott Contini and Igor E. Shparlinski",
  editor =       "Colin Boyd and Juan Manuel Gonz{\'a}lez Nieto",
  title =        "On {Stern}'s Attack Against Secret Truncated Linear
                 Congruential Generators",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "3574",
  bookpages =    "xiii + 586",
  pages =        "180--206",
  year =         "2005",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11506157_5",
  ISBN =         "3-540-26547-3",
  ISBN-13 =      "978-3-540-26547-4",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.9.A25 A278 2005",
  bibdate =      "Wed Dec 21 08:25:19 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 jenson.stanford.edu:2210/unicorn",
  note =         "Information Security and Privacy 10th Australasian
                 Conference, ACISP 2005, Brisbane, Australia, July 4--6,
                 2005. Proceedings.",
  URL =          "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3574",
  abstract =     "In 1987, Stern \cite{Stern:1987:SLC} showed how the
                 parameters for secret truncated linear congruential
                 generators could be derived in polynomial time. Here,
                 we present a modification to that algorithm which makes
                 it simpler, more robust, and require less data. We then
                 present a more careful analysis of the algorithm, and
                 establish some limits of its applicability. Thus,
                 secret truncated linear congruential generators may not
                 necessarily be insecure for properly chosen parameters.
                 Unfortunately, as in the original algorithm, all the
                 results remain heuristic, however we present results of
                 numerical experiments which support our conclusions.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InProceedings{Crowley:2005:TDC,
  author =       "P. Crowley",
  editor =       "????",
  booktitle =    "Workshop Record of {SASC 2006}: Stream Ciphers
                 Revisited",
  title =        "Truncated Differential Cryptanalysis of Five Rounds of
                 {Salsa20}",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "2005",
  bibdate =      "Sat Apr 05 12:08:13 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "eSTREAM Technical Report 2005/073",
  URL =          "https://eprint.iacr.org/2005/375",
  acknowledgement = ack-nhfb,
}

@Article{Damgaard:2005:CRM,
  author =       "Ivan Damg{\aa}rd and Yuval Ishai",
  title =        "Constant-Round Multiparty Computation Using a
                 Black-Box Pseudorandom Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "3621",
  pages =        "378--??",
  year =         "2005",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11535218_23",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Apr 3 08:32:34 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Demirtas:2005:JPR,
  author =       "Hakan Demirtas",
  title =        "{JMASM 16}: Pseudo-Random Number Generation in {R} For
                 Some Univariate Distributions",
  journal =      j-J-MOD-APPL-STAT-METH,
  volume =       "4",
  number =       "1",
  pages =        "300--311",
  month =        may,
  year =         "2005",
  CODEN =        "????",
  DOI =          "https://doi.org/10.22237/jmasm/1114907220",
  ISSN =         "1538-9472",
  ISSN-L =       "1538-9472",
  bibdate =      "Sat Jan 18 09:25:12 MST 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jmodapplstatmeth.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
  URL =          "https://jmasm.com/index.php/jmasm/article/view/190",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Mod. Appl. Stat. Methods (JMASM)",
  fjournal =     "Journal of Modern Applied Statistical Methods",
  journal-URL =  "https://jmasm.com/",
}

@Article{Deng:2005:EPM,
  author =       "Lih-Yuan Deng",
  title =        "Efficient and portable multiple recursive generators
                 of large order",
  journal =      j-TOMACS,
  volume =       "15",
  number =       "1",
  pages =        "1--13",
  month =        jan,
  year =         "2005",
  CODEN =        "ATMCEZ",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Apr 14 10:37:25 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Dodge:2005:RNG,
  author =       "Yadolah Dodge and Giuseppe Melfi",
  title =        "Random number generators and rare events in the
                 continued fraction of $ \pi $",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "75",
  number =       "3",
  pages =        "189--197",
  year =         "2005",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949650410001687181",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:12:26 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/00949650410001687181",
  abstract =     "Failure of pseudo-random number generators in
                 producing reliable random numbers as described by Knuth
                 (Knuth, D. E., 1981, The Art of Computer Programming,
                 Vol. 2, Addison-Wesley) gave birth to a new generation
                 of random number generators such as billions of
                 decimals of $ \pi $. To show that these decimals
                 satisfy all criterion of being random, Bailey and
                 Crandall (Bailey, D. B. and Crandall, R. E., 2003,
                 Random generators and normal numbers, to appear in
                 Experimental Mathematics) provided a proof toward the
                 normality of $ \pi $.\par

                 In this article, we try to show similar results by
                 considering the continued fraction of $ \pi $, which
                 appears random as opposed to other supposed normal
                 numbers whose continued fractions are not random at
                 all. For this purpose, we analyze the continued
                 fraction of $ \pi $ and discuss the randomness of its
                 partial quotients. Some statistical tests are performed
                 to check whether partial quotients follow the Khinchin
                 distribution. Finally, we discuss rare elements in the
                 continued fraction of $ \pi $.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "11 Oct 2011",
}

@Misc{Eastlake:2005:RRR,
  author =       "D. {Eastlake, 3rd} and J. Schiller and S. Crocker",
  title =        "{RFC 4086}: Randomness Recommendations for Security",
  month =        jun,
  year =         "2005",
  bibdate =      "Tue Jan 31 15:41:15 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Status: BEST CURRENT PRACTICE. Obsoletes RFC1750",
  URL =          "ftp://ftp.internic.net/rfc/rfc4086.txt;
                 https://www.math.utah.edu/pub/rfc/rfc4086.txt",
  acknowledgement = ack-nhfb,
  format =       "TXT=114321 bytes",
  online =       "yes",
  status =       "BEST CURRENT PRACTICE",
}

@Article{Elsner:2005:IRN,
  author =       "Ulrich Elsner",
  title =        "The influence of random number generators on graph
                 partitioning algorithms",
  journal =      j-ELECTRON-TRANS-NUMER-ANAL,
  volume =       "21",
  pages =        "125--133",
  year =         "2005",
  CODEN =        "????",
  ISSN =         "1068-9613 (print), 1097-4067 (electronic)",
  ISSN-L =       "1068-9613",
  bibdate =      "Mon Sep 6 12:28:29 MDT 2010",
  bibsource =    "http://etna.mcs.kent.edu/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://etna.mcs.kent.edu/vol.21.2005/pp125-133.dir/pp125-133.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Transactions on Numerical Analysis",
  journal-URL =  "http://etna.mcs.kent.edu/",
}

@Article{Entacher:2005:BLP,
  author =       "K. Entacher and T. Schell and A. Uhl",
  title =        "Bad Lattice Points",
  journal =      j-COMPUTING,
  volume =       "75",
  number =       "4",
  pages =        "281--295",
  month =        aug,
  year =         "2005",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-004-0105-z",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "11-04; 68W40; Primary 11Y40; Secondary 11K45",
  bibdate =      "Tue Jul 8 22:32:46 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=75&issue=4;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See erratum \cite{Anonymous:2006:E}.",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=75&issue=4&spage=281",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "good lattice points; lattice rules; Monte Carlo and
                 quasi-Monte-Carlo methods; random number generation;
                 spectral test",
}

@Article{Falcioni:2005:PMC,
  author =       "Massimo Falcioni and Luigi Palatella and Simone
                 Pigolotti and Angelo Vulpiani",
  title =        "Properties making a chaotic system a good pseudo
                 random number generator",
  journal =      j-PHYS-REV-E,
  volume =       "72",
  number =       "1",
  pages =        "016220",
  month =        jul,
  year =         "2005",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.72.016220",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.72.016220",
  abstract =     "We discuss the properties making a deterministic
                 algorithm suitable to generate a pseudo random sequence
                 of numbers: high value of Kolmogorov--Sinai entropy,
                 high dimensionality of the parent dynamical system, and
                 very large period of the generated sequence. We propose
                 the multidimensional Anosov symplectic (cat) map as a
                 pseudo random number generator. We show what chaotic
                 features of this map are useful for generating pseudo
                 random numbers and investigate numerically which of
                 them survive in the discrete state version of the map.
                 Testing and comparisons with other generators are
                 performed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  pagecount =    "10",
  xxnumber =     "1 (part 2)",
}

@Article{Gennaro:2005:IPR,
  author =       "Rosario Gennaro",
  title =        "An Improved Pseudo-Random Generator Based on the
                 Discrete Logarithm Problem",
  journal =      j-J-CRYPTOLOGY,
  volume =       "18",
  number =       "2",
  pages =        "91--110",
  month =        apr,
  year =         "2005",
  CODEN =        "JOCREQ",
  DOI =          "https://doi.org/10.1007/s00145-004-0215-y",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  ISSN-L =       "0933-2790",
  bibdate =      "Tue Jul 5 06:57:14 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0933-2790&volume=18&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/jcryptology.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0933-2790&volume=18&issue=2&spage=91",
  abstract =     "Under the assumption that solving the discrete
                 logarithm problem modulo an $n$-bit safe prime $p$ is
                 hard even when the exponent is a small $c$-bit number,
                 we construct a new pseudo-random bit generator. This
                 new generator outputs $ n - c - 1 $ bits per
                 exponentiation with a $c$-bit exponent and is among the
                 fastest generators based on hard number-theoretic
                 problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Cryptology",
  journal-URL =  "http://link.springer.com/journal/145",
}

@Article{Gerlovina:2005:ABL,
  author =       "V. Gerlovina and V. Nekrutkin",
  title =        "Asymptotical behavior of linear congruential
                 generators",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "11",
  number =       "2",
  pages =        "135--162",
  year =         "2005",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1163/156939605777585971",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "11K45 (65C10)",
  MRnumber =     "2152632 (2006h:11094)",
  MRreviewer =   "Vladimir S. Anashin",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
}

@InProceedings{Gong:2005:TGR,
  author =       "Guang Gong and Kishan Chand Gupta and Martin Hell and
                 Yassir Nawaz",
  editor =       "Dengguo Feng and Dongdai Lin and Moti Yung",
  booktitle =    "Information Security and Cryptology: {First SKLOIS
                 Conference, CISC 2005, Beijing, China, December 15--17,
                 2005, Proceedings}",
  title =        "Towards a General {RC4}-Like Keystream Generator",
  volume =       "3822",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "162--174",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11599548_14",
  bibdate =      "Sat Apr 05 11:55:23 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@TechReport{Gonnet:2005:MRG,
  author =       "G. Gonnet and M. Gil and W. P. Petersen",
  title =        "Multiple Recursive Generators \& The Repetition Test",
  type =         "Technical Report",
  number =       "476",
  institution =  "Department of Computer Science, ETH Z{\"u}rich",
  address =      "Z{\"u}rich, Switzerland",
  year =         "2005",
  bibdate =      "Wed Apr 11 06:03:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Gonzalez:2005:SCM,
  author =       "C. M. Gonz{\'a}lez and H. A. Larrondo and O. A.
                 Rosso",
  title =        "Statistical complexity measure of pseudorandom bit
                 generators",
  journal =      j-PHYSICA-A,
  volume =       "354",
  number =       "??",
  pages =        "281--300",
  day =          "15",
  month =        aug,
  year =         "2005",
  CODEN =        "PHYADX",
  DOI =          "https://doi.org/10.1016/j.physa.2005.02.054",
  ISSN =         "0378-4371 (print), 1873-2119 (electronic)",
  ISSN-L =       "0378-4371",
  bibdate =      "Thu Feb 16 06:47:50 MST 2012",
  bibsource =    "http://www.sciencedirect.com/science/journal/03784371;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378437105001779",
  acknowledgement = ack-nhfb,
  fjournal =     "Physica A. Statistical Mechanics and its
                 Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784371",
}

@Article{Gubernatis:2005:MRM,
  author =       "J. E. Gubernatis",
  title =        "{Marshall Rosenbluth} and the {Metropolis} algorithm",
  journal =      j-PHYS-PLASMAS,
  volume =       "057303",
  pages =        "5",
  month =        may,
  year =         "2005",
  CODEN =        "PHPAEN",
  DOI =          "https://doi.org/10.1063/1.1887186",
  ISSN =         "1070-664X (print), 1089-7674 (electronic), 1527-2419",
  ISSN-L =       "1070-664X",
  bibdate =      "Tue Mar 20 21:54:23 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The 1953 publication, ``Equation of State Calculations
                 by Very Fast Computing Machines'' by N. Metropolis, A.
                 W. Rosenbluth and M. N. Rosenbluth, and M. Teller and
                 E. Teller [J. Chem. Phys. 21, 1087 (1953)] marked the
                 beginning of the use of the Monte Carlo method for
                 solving problems in the physical sciences. The method
                 described in this publication subsequently became known
                 as the Metropolis algorithm, undoubtedly the most
                 famous and most widely used Monte Carlo algorithm ever
                 published. As none of the authors made subsequent use
                 of the algorithm, they became unknown to the large
                 simulation physics community that grew from this
                 publication and their roles in its development became
                 the subject of mystery and legend. At a conference
                 marking the 50th anniversary of the 1953 publication,
                 Marshall Rosenbluth gave his recollections of the
                 algorithm's development. The present paper describes
                 the algorithm, reconstructs the historical context in
                 which it was developed, and summarizes Marshall's
                 recollections.",
  acknowledgement = ack-nhfb,
  fjournal =     "Physics of Plasmas",
  journal-URL =  "http://scitation.aip.org/content/aip/journal/pop",
}

@Article{Hahn:2005:CLM,
  author =       "T. Hahn",
  title =        "{{\sc Cuba}} --- a library for multidimensional
                 numerical integration",
  journal =      j-COMP-PHYS-COMM,
  volume =       "168",
  number =       "2",
  pages =        "78--95",
  day =          "1",
  month =        jun,
  year =         "2005",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2005.01.010",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 22:00:28 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465505000792",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Hamano:2005:DSD,
  author =       "K. Hamano",
  title =        "The Distribution of the Spectrum for the {Discrete
                 Fourier Transform Test} included in {SP800-22}",
  journal =      "IEICE Transactions on Fundamentals of Electronics,
                 Communications and Computer Sciences",
  volume =       "E88",
  number =       "1",
  pages =        "67--73",
  month =        jan,
  year =         "2005",
  bibdate =      "Tue Jan 31 15:14:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hess:2005:LCM,
  author =       "Florian Hess and Igor E. Shparlinski",
  title =        "On the Linear Complexity and Multidimensional
                 Distribution of Congruential Generators over Elliptic
                 Curves",
  journal =      j-DESIGNS-CODES-CRYPTOGR,
  volume =       "35",
  number =       "1",
  pages =        "111--117",
  month =        apr,
  year =         "2005",
  CODEN =        "DCCREC",
  DOI =          "https://doi.org/10.1007/s10623-003-6153-0",
  ISSN =         "0925-1022 (print), 1573-7586 (electronic)",
  ISSN-L =       "0925-1022",
  bibdate =      "Sat Apr 16 09:44:28 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0925-1022;
                 https://www.math.utah.edu/pub/tex/bib/designscodescryptogr.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Designs, codes, and cryptography",
  journal-URL =  "http://link.springer.com/journal/10623",
}

@Article{Hill:2005:RDS,
  author =       "Theodore P. Hill and Klaus Sch{\"u}rger",
  title =        "Regularity of digits and significant digits of random
                 variables",
  journal =      j-STOCH-PROC-APPL,
  volume =       "115",
  number =       "10",
  pages =        "1723--1743",
  month =        oct,
  year =         "2005",
  CODEN =        "STOPB7",
  DOI =          "https://doi.org/10.1016/j.spa.2005.05.003",
  ISSN =         "0304-4149 (print), 1879-209X (electronic)",
  ISSN-L =       "0304-4149",
  bibdate =      "Tue Nov 22 11:28:19 MST 2011",
  bibsource =    "http://www.sciencedirect.com/;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304414905000657",
  acknowledgement = ack-nhfb,
  fjournal =     "Stochastic Processes and Their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03044149",
  keywords =     "Benford's Law; digit-regular random variable;
                 floating-point numbers; law of least significant
                 digits; nonleading digits; normal numbers; significant
                 digits; significant-digit-regular random variable;
                 trailing digits",
}

@InProceedings{Hong:2005:NAT,
  author =       "Jin Hong and Palash Sarkar",
  editor =       "Bimal Roy",
  booktitle =    "Advances in Cryptology--{ASIACRYPT 2005}: {11th
                 International Conference on the Theory and Application
                 of Cryptology and Information Security, Chennai, India,
                 December 4--8, 2005, Proceedings}",
  title =        "New Applications of Time Memory Data Tradeoffs",
  volume =       "11",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "353--372",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11593447_19",
  bibdate =      "Sat Apr 05 12:18:04 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Horan:2005:NRN,
  author =       "D. M. Horan and R. A. Guinee",
  title =        "A novel random number generator based on pseudonoise
                 sequences",
  journal =      "IEE Conference Publications",
  volume =       "2005",
  number =       "CP511",
  pages =        "431--436",
  year =         "2005",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1049/cp:20050349",
  ISSN =         "????",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/abstract/IEECPS/v2005/iCP511/p431/s1",
  acknowledgement = ack-nhfb,
  keywords =     "classical linear feedback shift register;
                 cryptanalytic attacks; cryptographic applications;
                 keystream generation; maximal length sequence;
                 pseudonoise sequences; random number generator;
                 statistical tests",
}

@Article{Kang:2005:ETP,
  author =       "Mihyun Kang",
  title =        "Efficiency test of pseudorandom number generators
                 using random walks",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "174",
  number =       "1",
  pages =        "165--177",
  day =          "1",
  month =        feb,
  year =         "2005",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/j.cam.2004.04.005",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 08:09:06 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042704001864",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
}

@Manual{Keller:2005:NRR,
  author =       "Sharon S. Keller",
  title =        "{NIST}-Recommended Random Number Generator Based on
                 {ANSI X9.31 Appendix A.2.4} Using the 3-Key {Triple
                 DES} and {AES} Algorithms",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  pages =        "4",
  day =          "31",
  month =        jan,
  year =         "2005",
  bibdate =      "Thu Apr 30 08:10:57 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/cryptval/rng/931rngext.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "computer security; cryptography",
}

@InCollection{Kemp:2005:PRN,
  author =       "C. D. Kemp",
  title =        "Pseudo-Random Number Generator",
  crossref =     "Armitage:2005:EB",
  pages =        "??--??",
  year =         "2005",
  DOI =          "https://doi.org/10.1002/0470011815.b2a14029",
  bibdate =      "Mon Jan 16 11:59:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Konuma:2005:DEH,
  author =       "Shiro Konuma and Shuichi Ichikawa",
  title =        "Design and evaluation of hardware pseudo-random number
                 generator {MT19937}",
  journal =      "{IEICE} Transactions on Information and Systems",
  volume =       "88-D",
  number =       "12",
  pages =        "2876--2879",
  month =        "????",
  year =         "2005",
  ISSN =         "0916-8532 (print), 1745-1361 (electronic)",
  ISSN-L =       "0916-8532",
  bibdate =      "Thu Nov 24 08:32:37 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://search.ieice.org/bin/summary.php?id=e88-d_12_2876",
  abstract =     "MT19937 is a kind of Mersenne Twister, which is a
                 pseudo-random number generator. This study presents new
                 designs for a MT19937 circuit suitable for custom
                 computing machinery for high-performance scientific
                 simulations. Our designs can generate multiple random
                 numbers per cycle (multi-port design). The estimated
                 throughput of a 52-port design was 262 Gbps, which is
                 115 times higher than the software on a Pentium 4 (2.53
                 GHz) processor. Multi-port designs were proven to be
                 more cost-effective than using multiple single-port
                 designs. The initialization circuit can be included
                 without performance loss in exchange for a slight
                 increase of logic scale.",
  acknowledgement = ack-nhfb,
}

@Article{Kung:2005:SGT,
  author =       "Chingjing Kung",
  title =        "Searching for good two-term multiple recursive random
                 number generators using a backpropagation algorithm",
  journal =      j-J-INF-OPTIM-SCI,
  volume =       "26",
  number =       "3",
  pages =        "527--534",
  year =         "2005",
  CODEN =        "JIOSDC",
  ISSN =         "0252-2667",
  bibdate =      "Wed Feb 15 16:48:11 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We describe an approximation algorithm for the problem
                 of finding the maximum spectral value in a full period
                 two-term multiple recursive generator (MRG). This
                 algorithm is based on the principle of the
                 backpropagation algorithm and random search. A
                 well-designed backpropagation algorithm is developed by
                 an extensive set of computational comparisons of
                 various parameters of the algorithm. Using this
                 algorithm, a random search is conducted. Computational
                 experiences show that our algorithm can find larger
                 spectral value and shorter running time than
                 forward/backwards method for the full period two-term
                 MRG of order three. An application to the full period
                 two-term MRG of order four is also discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Information \& Optimization Sciences",
  identifier =   "05059467",
}

@Article{Larrondo:2005:ISC,
  author =       "H. A. Larrondo and C. M. Gonz{\'a}lez and M. T.
                 Mart{\'\i}n and A. Plastino and O. A. Rosso",
  title =        "Intensive statistical complexity measure of
                 pseudorandom number generators",
  journal =      j-PHYSICA-A,
  volume =       "356",
  number =       "1",
  pages =        "133--138",
  day =          "1",
  month =        oct,
  year =         "2005",
  CODEN =        "PHYADX",
  DOI =          "https://doi.org/10.1016/j.physa.2005.05.025",
  ISSN =         "0378-4371 (print), 1873-2119 (electronic)",
  ISSN-L =       "0378-4371",
  bibdate =      "Thu Feb 16 06:47:50 MST 2012",
  bibsource =    "http://www.sciencedirect.com/science/journal/03784371;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S037843710500467X",
  acknowledgement = ack-nhfb,
  fjournal =     "Physica A. Statistical Mechanics and its
                 Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03784371",
}

@InProceedings{LEcuyer:2005:FRN,
  author =       "Pierre L'Ecuyer and Fran{\c{c}}ois Panneton",
  editor =       "Michael K{\"u}hl and others",
  booktitle =    "{WSC'05: Proceedings of the 2005 Winter Simulation
                 Conference: Hilton at the Walt Disney World Resort,
                 Orlando, Florida, USA, December 4--7, 2005}",
  title =        "Fast random number generators based on linear
                 recurrences modulo 2: overview and comparison",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "110--119",
  year =         "2005",
  ISBN =         "0-7803-9519-0",
  ISBN-13 =      "978-0-7803-9519-0",
  LCCN =         "QA76.9.C65 W56 2005; T57.62",
  bibdate =      "Fri Jan 6 09:46:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 05CH37732.",
  series =       "WSC '05",
  URL =          "http://dl.acm.org/citation.cfm?id=1162708.1162732",
  abstract =     "Random number generators based on linear recurrences
                 modulo 2 are among the fastest long-period generators
                 currently available. The uniformity and independence of
                 the points they produce, over their entire period
                 length, can be measured by theoretical figures of merit
                 that are easy to compute, and those having good values
                 for these figures of merit are statistically reliable
                 in general. Some of these generators can also provide
                 disjoint streams and substreams efficiently. In this
                 paper, we review the most interesting construction
                 methods for these generators, examine their theoretical
                 and empirical properties, and make comparisons.",
  acknowledgement = ack-nhfb,
  acmid =        "1162732",
  location =     "Orlando, Florida",
  pagecount =    "10",
}

@Article{LEcuyer:2005:PSR,
  author =       "Pierre L'Ecuyer and Josef Leydold",
  title =        "\pkg{rstream}: Streams of random numbers for
                 stochastic simulation",
  journal =      j-R-NEWS,
  volume =       "5",
  number =       "2",
  pages =        "16--20",
  month =        nov,
  year =         "2005",
  CODEN =        "????",
  ISSN =         "1609-3631",
  ISSN-L =       "1609-3631",
  bibdate =      "Thu Aug 13 09:25:10 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/rjournal.bib",
  URL =          "http://CRAN.R-project.org/doc/Rnews/",
  acknowledgement = ack-r-project,
  fjournal =     "R News: the Newsletter of the R Project",
  journal-URL =  "http://journal.r-project.org/",
  pdf =          Rnews2005-2,
}

@Article{Lee:2005:HGN,
  author =       "Dong-U Lee and Wayne Luk and John D. Villasenor and
                 Guanglie Zhang and Philip H. W. Leong",
  title =        "A hardware {Gaussian} noise generator using the
                 {Wallace} method",
  journal =      j-IEEE-TRANS-VLSI-SYST,
  volume =       "18",
  number =       "8",
  pages =        "911--920",
  month =        aug,
  year =         "2005",
  CODEN =        "IEVSE9",
  DOI =          "https://doi.org/10.1109/TVLSI.2005.853615",
  ISSN =         "1063-8210 (print), 1557-9999 (electronic)",
  ISSN-L =       "1063-8210",
  bibdate =      "Thu Nov 24 08:36:30 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/1512179/",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Very Large Scale Integration
                 (VLSI) Systems",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/issues?punumber=92",
}

@Article{Leong:2005:CIZ,
  author =       "Philip H. W. Leong and Ganglie Zhang and Dong-U",
  title =        "A Comment on the Implementation of the Ziggurat
                 Method",
  journal =      j-J-STAT-SOFT,
  volume =       "12",
  number =       "7",
  pages =        "1--44",
  month =        "????",
  year =         "2005",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Wed May 18 11:18:51 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Marsaglia:2000:ZMG}.",
  URL =          "http://www.jstatsoft.org/counter.php?id=114&url=v12/i07&ct=2;
                 http://www.jstatsoft.org/counter.php?id=114&url=v12/i07/v12i07.pdf&ct=1",
  abstract =     "We show that the short period of the uniform random
                 number generator in the published implementation of
                 Marsaglia and Tsang's Ziggurat method for generating
                 random deviates can lead to poor distributions.
                 Changing the uniform random number generator used in
                 its implementation fixes this issue.",
  accepted =     "2005-02-08",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  submitted =    "2005-02-08",
}

@Article{Li:2005:ADA,
  author =       "Qiong Li and Sheng Ping Jin and Ding Fang Chen",
  title =        "Algorithm and discrepancy analysis of compound
                 inversive congruential pseudo-random numbers",
  journal =      "J. Math. (Wuhan)",
  volume =       "25",
  number =       "2",
  pages =        "171--174",
  year =         "2005",
  CODEN =        "????",
  ISSN =         "0255-7797",
  MRclass =      "65C10 (60C05)",
  MRnumber =     "2123461",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Mathematics. Shuxue Zazhi",
}

@PhdThesis{Li:2005:SEP,
  author =       "Huajiang Li",
  title =        "A System of Efficient and Portable Multiple Recursive
                 Generators of Large Order",
  type =         "{Ph.D.} dissertation",
  school =       "Department of Mathematics, University of Memphis",
  address =      "Memphis, TN 38152, USA",
  pages =        "x + 100",
  year =         "2005",
  LCCN =         "QA 3.6 .L5 S97 2005",
  bibdate =      "Fri Mar 09 15:02:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2005:ULC,
  author =       "Chung-Chih Li and Bo Sun",
  editor =       "Gongzhu Hu",
  booktitle =    "{Computers and their applications: proceedings of the
                 ISCA 20th international conference; New Orleans,
                 Louisiana, USA, March 16--18, 2005}",
  title =        "Using Linear Congruential Generators for Cryptographic
                 Purposes",
  publisher =    "International Society for Computers and Their
                 Applications",
  address =      "Cary, NC, USA",
  bookpages =    "vi + 499",
  pages =        "13--19",
  year =         "2005",
  ISBN =         "1-880843-54-4",
  ISBN-13 =      "978-1-880843-54-3",
  LCCN =         "QA76.76.A65 I83 2005",
  bibdate =      "Tue Mar 06 06:57:02 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/cata/cata2005.html#LiS05;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Liang:2005:NPR,
  author =       "Heng Liang and Qinghua Liu and Fengshan Bai",
  title =        "A Note on a Pseudo-Random Number Generator for
                 Personal Computers",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "49",
  number =       "2--3",
  pages =        "331--333",
  month =        jan # "\slash " # feb,
  year =         "2005",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/j.camwa.2004.05.012",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Feb 08 08:44:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122105000374",
  abstract =     "A combined random number generator by Wichmann and
                 Hill is studied in this note. Statistical and numerical
                 computations show that a good initial value for this
                 generator is not so easy to obtain, and hence the use
                 of such generator seems dubious.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  remark =       "This paper is a study of the combined generator from
                 \cite{Wichmann:1982:SAA}.",
}

@Article{Lim:2005:EMT,
  author =       "Daihyun Lim and Damith C. Ranasinghe and Srinivas
                 Devadas and Behnam Jamali and Derek Abbott and Peter H.
                 Cole",
  editor =       "Alexander A. Balandin and Fran{\c{c}}ois Danneville
                 and M. Jamal Deen and Daniel M. Fleetwood",
  title =        "Exploiting metastability and thermal noise to build a
                 reconfigurable hardware random number generator",
  journal =      j-PROC-SPIE,
  volume =       "5844",
  number =       "1",
  pages =        "294--309",
  year =         "2005",
  CODEN =        "PSISDG",
  DOI =          "https://doi.org/10.1117/12.620306",
  ISSN =         "0277-786X (print), 1996-756X (electronic)",
  ISSN-L =       "0277-786X",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Noise in Devices and Circuits III.",
  URL =          "http://link.aip.org/link/?PSI/5844/294/1",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the SPIE --- The International Society
                 for Optical Engineering",
  keywords =     "true random numbers from physical sources",
  location =     "Austin, TX, USA",
}

@Article{Louchard:2005:MRU,
  author =       "Guy Louchard",
  title =        "Monotone runs of uniformly distributed integer random
                 variables: a probabilistic analysis",
  journal =      j-THEOR-COMP-SCI,
  volume =       "346",
  number =       "2--3",
  pages =        "358--387",
  day =          "28",
  month =        nov,
  year =         "2005",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Mar 29 06:48:51 MDT 2011",
  bibsource =    "http://www.sciencedirect.com/science/journal/03043975;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2005.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Marsaglia:2005:MGF,
  author =       "George Marsaglia",
  title =        "Monkeying with the Goodness-of-Fit Test",
  journal =      j-J-STAT-SOFT,
  volume =       "14",
  number =       "13",
  pages =        "1--4",
  day =          "20",
  month =        sep,
  year =         "2005",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Mon Dec 12 11:09:58 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/counter.php?id=138&url=v14/i13&ct=2;
                 http://www.jstatsoft.org/counter.php?id=138&url=v14/i13/v14i13.pdf&ct=1",
  abstract =     "The familiar $ \sumP (\textrm {OBS} - \textrm {EXP})^2
                 / \textrm {EXP} $ goodness-of-fit measure is commonly
                 used to test whether an observed sequence came from the
                 realization of $n$ independent identically distributed
                 (iid) discrete random variables. It can be quite
                 effective for testing for identical distribution, but
                 is not suited for assessing independence, as it pays no
                 attention to the order in which output values are
                 received.\par

                 This note reviews a way to adjust or tamper, that is,
                 monkey-with the classical test to make it test for
                 independence as well as identical distribution in
                 short, to test for both the i's in iid, using monkey
                 tests similar to those in the Diehard Battery of Tests
                 of Randomness (Marsaglia 1995).",
  accepted =     "2005-09-20",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  keywords =     "$\chi^2$; goodness of fit; monkey tests; overlapping
                 m-tuples",
  submitted =    "2005-05-01",
}

@Article{Marsaglia:2005:RPO,
  author =       "George Marsaglia",
  title =        "On the Randomness of Pi and Other Decimal Expansions",
  journal =      "{InterStat}: statistics on the {Internet}",
  pages =        "17",
  month =        oct,
  year =         "2005",
  CODEN =        "????",
  ISSN =         "1941-689X",
  bibdate =      "Wed Jun 22 10:34:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://interstat.statjournals.net/INDEX/Oct05.html;
                 http://interstat.statjournals.net/YEAR/2005/articles/0510005.pdf",
  abstract =     "Tests of randomness much more rigorous than the usual
                 frequency-of-digit counts are applied to the decimal
                 expansions of $ \pi $, $e$ and $ \sqrt {2} $, using the
                 Diehard Battery of Tests adapted to base 10 rather than
                 the original base 2. The first $ 10^9 $ digits of $ \pi
                 $, $e$ and $ \sqrt {2} $ seem to pass the Diehard tests
                 very well. But so do the decimal expansions of most
                 rationals $ k / p $ with large primes $p$. Over the
                 entire set of tests, only the digits of $ \sqrt {2} $
                 give a questionable result: the monkey test on 5-letter
                 words. Its significance is discussed in the text.\par
                 Three specific $ k / p $ are used for comparison. The
                 cycles in their decimal expansions are developed in
                 reverse order by the multiply-with-carry (MWC) method.
                 They do well in the Diehard tests, as do many fast and
                 simple MWC RNGs that produce base-$b$ `digits' of the
                 expansions of $ k / p $ for $ b = 2^{32} $ or $ b =
                 2^{32} - 1 $. Choices of primes $p$ for such MWC RNGs
                 are discussed, along with comments on their
                 implementation.",
  abstract-2 =   "Extensive tests of randomness used to distinguish good
                 from not-so-good random number generators are applied
                 to the digits of $\pi$, $e$ and $\sqrt{2}$, as well as
                 to rationals $k / p$ for large primes $p$. They seem to
                 pass these tests as well as some of the best RNGs, and
                 could well serve in their stead if the digits could be
                 easily and quickly produced in the computer---and they
                 can, at least for rationals $k / p$. Simple and fast
                 methods are developed to produce, in reverse order, for
                 large primes $p$ and general bases $b$, the periodic
                 cycles of the base-$b$ expansions of $k / p$. Specific
                 choices provide high quality, fast and simple RNGs with
                 periods thousands of orders of magnitude greater than
                 what are currently viewed as the longest. Also included
                 are historical references to decimal expansions and
                 their relation to current, often wrong, website
                 discussions on the randomness of $\pi$.",
  acknowledgement = ack-nhfb,
  keywords =     "Diehard Tests; Pi; Random Number Generators; Tests of
                 Randomness",
}

@Article{McCullough:2005:ASP,
  author =       "B. D. McCullough and Berry Wilson",
  title =        "On the accuracy of statistical procedures in
                 {Microsoft Excel 2003}",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "49",
  number =       "4",
  pages =        "1244--1252",
  day =          "15",
  month =        jun,
  year =         "2005",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/j.csda.2004.06.016",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:05:32 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947304002026",
  abstract =     "Some of the problems that rendered Excel 97, Excel
                 2000 and Excel 2002 unfit for use as a statistical
                 package have been fixed in Excel 2003, though some have
                 not. Additionally, in fixing some errors, Microsoft
                 introduced other errors. Excel's new and improved
                 random number generator, at default, is supposed to
                 produce uniform numbers on the interval (0,1); but it
                 also produces negative numbers. Excel 2003 is an
                 improvement over previous versions, but not enough has
                 been done that its use for statistical purposes can be
                 recommended.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@TechReport{Nawaz:2005:BRL,
  author =       "Yassir Nawaz and Kishan Chand Gupta and Guang Gong",
  title =        "A 32-Bit {RC4}-Like Keystream Generator",
  institution =  "Cryptology ePrint Archive",
  pages =        "175--188 (??)",
  year =         "2005",
  bibdate =      "Sat Apr 05 13:13:49 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://eprint.iacr.org/2005/175",
  abstract =     "In this paper we propose a new 32-bit RC4 like
                 keystream generator. The proposed generator produces 32
                 bits in each iteration and can be implemented in
                 software with reasonable memory requirements. Our
                 experiments show that this generator is 3.2 times
                 faster than [the] original 8-bit RC4. It has a huge
                 internal state and offers higher resistance against
                 state recovery attacks than the original 8-bit RC4. We
                 analyze the randomness properties of the generator
                 using a probabilistic approach. The generator is
                 suitable for high speed software encryption.",
  acknowledgement = ack-nhfb,
  remark =       "This generator is weak: see \cite{Wu:2005:CBR}.",
}

@Article{Niederreiter:2005:CNS,
  author =       "H. Niederreiter",
  title =        "Constructions of $ (t, m, s) $-Nets and $ (t, s)
                 $-Sequences",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "11",
  number =       "3",
  pages =        "578--600",
  month =        aug,
  year =         "2005",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1016/j.ffa.2005.01.001",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Mar 09 12:21:44 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579705000043",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@InProceedings{Niederreiter:2005:DSN,
  author =       "Harald Niederreiter and Arne Winterhof",
  title =        "On the Distribution of Some New Explicit Nonlinear
                 Congruential Pseudorandom Numbers",
  crossref =     "Helleseth:2005:STA",
  pages =        "266--274",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11423461_19",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/seta/seta2004.html#NiederreiterW04;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Niederreiter:2005:ESD,
  author =       "Harald Niederreiter and Arne Winterhof",
  title =        "Exponential sums and the distribution of inversive
                 congruential pseudorandom numbers with power of two
                 modulus",
  journal =      j-INT-J-NUMBER-THEORY,
  volume =       "1",
  number =       "3",
  pages =        "431--438",
  month =        sep,
  year =         "2005",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1142/S1793042105000261",
  ISSN =         "1793-0421 (print), 1793-7310 (electronic)",
  ISSN-L =       "1793-7310",
  MRclass =      "11K38 (11K45 11L07)",
  MRnumber =     "2175100 (2006f:11092)",
  MRreviewer =   "Igor E. Shparlinski",
  bibdate =      "Thu Dec 22 06:50:44 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ijnt.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S1793042105000261",
  abstract =     "Niederreiter and Shparlinski obtained a nontrivial
                 discrepancy bound for sequences of inversive
                 congruential pseudorandom numbers with odd prime-power
                 modulus. Because of technical difficulties they had to
                 leave open the case of greatest practical interest,
                 namely where the modulus is a power of 2. In the
                 present paper we successfully treat this case by using
                 recent advances in the theory of exponential sums.",
  acknowledgement = ack-nhfb,
  ajournal =     "Int. J. Number Theory",
  fjournal =     "International Journal of Number Theory (IJNT)",
  journal-URL =  "https://www.worldscientific.com/worldscinet/ijnt",
}

@Article{Panneton:2005:XRN,
  author =       "Fran{\c{c}}ois Panneton and Pierre L'Ecuyer",
  title =        "On the xorshift random number generators",
  journal =      j-TOMACS,
  volume =       "15",
  number =       "4",
  pages =        "346--361",
  month =        oct,
  year =         "2005",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/1113316.1113319",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Thu Feb 16 10:42:56 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  note =         "See
                 \cite{Marsaglia:2003:XR,Brent:2004:NMX,Vigna:2016:EEM}.",
  abstract =     "G. Marsaglia recently introduced a class of very fast
                 xorshift random number generators, whose implementation
                 uses three ``xorshift'' operations. They belong to a
                 large family of generators based on linear recurrences
                 modulo 2, which also includes shift-register
                 generators, the Mersenne twister, and several others.
                 In this article, we analyze the theoretical properties
                 of xorshift generators, search for the best ones with
                 respect to the equidistribution criterion, and test
                 them empirically. We find that the vast majority of
                 xorshift generators with only three xorshift
                 operations, including those having good
                 equidistribution, fail several simple statistical
                 tests. We also discuss generators with more than three
                 xorshifts.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@Article{Raqab:2005:BIG,
  author =       "Mohamed Z. Raqab and Mohamed T. Madi",
  title =        "{Bayesian} inference for the generalized exponential
                 distribution",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "75",
  number =       "10",
  pages =        "841--852",
  year =         "2005",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/00949650412331299166",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Apr 22 09:12:29 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Book{Redei:2005:JNS,
  author =       "Mikl{\'o}s R{\'e}dei",
  title =        "{John von Neumann} selected letters",
  volume =       "27",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xxv + 301",
  year =         "2005",
  ISBN =         "0-8218-3776-1 (hardcover)",
  ISBN-13 =      "978-0-8218-3776-4 (hardcover)",
  ISSN =         "0899-2428",
  LCCN =         "QA29.V66 A4 2005",
  bibdate =      "Tue Jun 14 10:15:46 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "History of mathematics",
  abstract =     "John von Neumann was perhaps the most influential
                 mathematician of the twentieth century, especially if
                 his broad influence outside mathematics is included.
                 The present volume is the first substantial collection
                 of (previously mainly unpublished) letters written by
                 von Neumann to colleagues, friends, government
                 officials, and others. The letters give us a glimpse of
                 the thinking of John von Neumann about mathematics,
                 physics, computer science, science management,
                 education, consulting, politics, and war. Readers of
                 quite diverse backgrounds will find much of interest in
                 this first-hand look at one of the towering figures of
                 twentieth century science.",
  acknowledgement = ack-nhfb,
  author-dates = "1903--1957",
  remark =       "From \cite[ref. 40, page 61]{Haigh:2014:EXM}, ``Von
                 Neumann talks about the `square and take the middle
                 digits' approach to generating pseudorandom numbers,
                 and testing the resulting distribution, in letters to
                 A. S. Householder (3 Feb. 1948) and C. C. Hurd (3 Dec.
                 1948),'', this volume, pp. 141--142, 144--145.",
  subject =      "von Neumann, John; Correspondence; Mathematicians;
                 United States; Mathematics",
  subject-dates = "1903--1957",
  tableofcontents = "Introductory comments \\
                 Letter to N. Aronszajn \\
                 Letters to F. Aydelotte \\
                 Letter to E. F. Beckenbach \\
                 Letter to H. Bethe \\
                 Letters to G. Birkhoff \\
                 Letter to W. J. E. Blaschke \\
                 Letter to R. S. Burington \\
                 Letters to V. Bush \\
                 Letter to R. Carnap \\
                 Letter to W. Cattell \\
                 Letter to T. M. Cherry \\
                 Letter to H. Cirker \\
                 Letter to H. Crocker \\
                 Letter to M. R. Davie \\
                 Letter to W. E. Deming \\
                 Letter to J. L. Destouches \\
                 Letter to P. A. M. Dirac \\
                 Letters to J. Dixmier \\
                 Letter to P. A. Dodd \\
                 Letter to W. M. DuMond \\
                 Letter to R. E. Duncan \\
                 Letter to editor of Evening Star \\
                 Letter to R. Farquharso \\
                 Letter to A. Flexner \\
                 Letter to R. O. Fornaguera \\
                 Letter to N. H. Goldsmith \\
                 Letter to W. H. Gottschalk (and Hans Rademacher) \\
                 Letters to K. G{\"o}del \\
                 Letter to G. Haberler \\
                 Letters to I. Halperin \\
                 Letter to G. B. Harrison \\
                 Letter to M. de Horvat \\
                 Letter to A. S. Householder \\
                 Letters to C. C. Hurd \\
                 Letter to K. Husimi \\
                 Letters to P. Jordan \\
                 Letters to I. Kaplansky \\
                 Letter to C. E. Kemble \\
                 Letter to J. R. Killian \\
                 Letters to H. D. Kloosterman \\
                 Letter to H. Kuhn \\
                 Letter to J. Lederberg \\
                 Letter to W. E. Lingelbach \\
                 Letter to S. MacLane \\
                 Letter to J. C. C. McKinsey \\
                 Letter to M. M. Mitchell \\
                 Letter to T. V. Moore \\
                 Letter to O. Morgenstern \\
                 Letters to M. Morse \\
                 Letter to E. Nagel \\
                 Letter to J. R. Oppenheimer \\
                 Letters to R. Ortvay \\
                 Letter to W Overbeck \\
                 Letter to H. H. Rankin \\
                 Letter to H. P. Robertson \\
                 Letter to E. Schr{\"o}dinger \\
                 Letter to E. Segr{\`e} \\
                 Letters to F. B. Silsbee \\
                 Letter to L. Spitzer \\
                 Letters to M. Stone \\
                 Letters to L. L. Strauss \\
                 Letter to J. Stroux \\
                 Letter to T. Tannaka \\
                 Letter to E. Teller \\
                 Letters to L. B. Tuckerman \\
                 Letters to S. Ulam \\
                 Letter to E. R. van Kampen \\
                 Letters to O. Veblen \\
                 Letters to N. Wiener \\
                 Letter to H. Wold \\
                 Notes on addresses of von Neumann's letters \\
                 Bibliography",
}

@Article{Ryabko:2005:NTA,
  author =       "B. Y. Ryabko and V. A. Monarev and Y. I. Shokin",
  title =        "A New Type of Attack on Block Ciphers",
  journal =      j-PROBL-INF-TRANSM,
  volume =       "41",
  number =       "4",
  pages =        "385--394",
  month =        "????",
  year =         "2005",
  CODEN =        "PRITA9",
  ISSN =         "0032-9460 (print), 1608-3253 (electronic)",
  ISSN-L =       "0032-9460",
  bibdate =      "Fri Mar 09 12:26:31 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Problems of Information Transmission",
}

@Article{Ryabko:2005:UIT,
  author =       "B. Ya. Ryabko and V. A. Monarev",
  title =        "Using information theory approach to randomness
                 testing",
  journal =      j-J-STAT-PLANN-INFERENCE,
  volume =       "133",
  number =       "1",
  pages =        "95--110",
  month =        jul,
  year =         "2005",
  CODEN =        "JSPIDN",
  DOI =          "https://doi.org/10.1016/j.jspi.2004.02.010",
  ISSN =         "0378-3758 (print), 1873-1171 (electronic)",
  ISSN-L =       "0378-3758",
  bibdate =      "Fri Mar 09 12:24:33 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0378375804001144",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Planning and Inference",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03783758",
}

@Article{Saitoh:2005:GPR,
  author =       "Y. Saitoh and J. Hori and T. Kiryu",
  title =        "Generation of Physical Random Number Using
                 Frequency-Modulated {LC} Oscillation Circuit with Shot
                 Noise",
  journal =      "Electron Comm. Jpn.",
  volume =       "3",
  number =       "388",
  pages =        "12--??",
  month =        "????",
  year =         "2005",
  DOI =          "????",
  bibdate =      "Sat Nov 29 14:00:40 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "????",
  acknowledgement = ack-nhfb,
}

@Article{Schreck:2005:DDG,
  author =       "Erhard Schreck and Wolfgang Ertel",
  title =        "Disk drive generates high speed real random numbers",
  journal =      j-MICROSYS-TECH,
  volume =       "11",
  number =       "8--10",
  pages =        "616--622",
  month =        aug,
  year =         "2005",
  CODEN =        "MCTCEF",
  DOI =          "https://doi.org/10.1007/s00542-005-0532-6",
  ISSN =         "0946-7076 (print), 1432-1858 (electronic)",
  ISSN-L =       "0946-7076",
  bibdate =      "Fri Mar 09 07:58:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/w758310x8v52640r/",
  acknowledgement = ack-nhfb,
  fjournal =     "Microsystem Technologies: Sensors, Actuators, Systems
                 Integration",
  keywords =     "true random numbers from physical sources",
  remark =       "The authors describe a patent-pending algorithm for
                 generating random numbers from Maxtor disk drives at
                 rates up to 835Kbits/s.",
}

@Article{Shaltiel:2005:SEA,
  author =       "Ronen Shaltiel and Christopher Umans",
  title =        "Simple extractors for all min-entropies and a new
                 pseudorandom generator",
  journal =      j-J-ACM,
  volume =       "52",
  number =       "2",
  pages =        "172--216",
  month =        mar,
  year =         "2005",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/1059513.1059516",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 25 11:15:54 MDT 2005",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A ``randomness extractor'' is an algorithm that given
                 a sample from a distribution with sufficiently high
                 min-entropy and a short random seed produces an output
                 that is statistically indistinguishable from uniform.
                 (Min-entropy is a measure of the amount of randomness
                 in a distribution.) We present a simple, self-contained
                 extractor construction that produces good extractors
                 for all min-entropies. Our construction is algebraic
                 and builds on a new polynomial-based approach
                 introduced by Ta-Shma et al. [2001b]. Using our
                 improvements, we obtain, for example, an extractor with
                 output length $ m = k / (\log n) O(1 / \alpha) $ and
                 seed length $ (1 + \alpha) \log n $ for an arbitrary $
                 0 < \alpha 1 $, where $n$ is the input length, and $k$
                 is the min-entropy of the input distribution.A
                 ``pseudorandom generator'' is an algorithm that given a
                 short random seed produces a long output that is
                 computationally indistinguishable from uniform. Our
                 technique also gives a new way to construct
                 pseudorandom generators from functions that require
                 large circuits. Our pseudorandom generator construction
                 is not based on the Nisan-Wigderson generator [Nisan
                 and Wigderson 1994], and turns worst-case hardness
                 directly into pseudorandomness. The parameters of our
                 generator match those in Impagliazzo and Wigderson
                 [1997] and Sudan et al. [2001] and in particular are
                 strong enough to obtain a new proof that $ P = \hbox
                 {BPP} $ if $E$ requires exponential size circuits.Our
                 construction also gives the following improvements over
                 previous work:---We construct an optimal ``hitting set
                 generator'' that stretches $ O(\log n) $ random bits
                 into $ s(1) $ pseudorandom bits when given a function
                 on $ \log n $ bits that requires circuits of size $s$.
                 This yields a quantitatively optimal hardness versus
                 randomness tradeoff for both RP and BPP and solves an
                 open problem raised in Impagliazzo et al. [1999].---We
                 give the first construction of pseudorandom generators
                 that fool nondeterministic circuits when given a
                 function that requires large nondeterministic circuits.
                 This technique also give a quantitatively optimal
                 hardness versus randomness tradeoff for AM and the
                 first hardness amplification result for
                 nondeterministic circuits.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InProceedings{Sidorenko:2005:CSB,
  author =       "A. Sidorenko and B. Schoenmakers",
  title =        "Concrete security of the {Blum--Blum--Shub}
                 pseudorandom generator",
  crossref =     "Smart:2005:CCI",
  pages =        "355--375",
  year =         "2005",
  bibdate =      "Tue Mar 18 11:37:08 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Smith:2005:AAM,
  author =       "J. Cole Smith and Sheldon H. Jacobson",
  title =        "An Analysis of the Alias Method for Discrete
                 Random-Variate Generation",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "17",
  number =       "3",
  pages =        "321--327",
  month =        "Summer",
  year =         "2005",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.1030.0063",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  bibdate =      "Fri Jan 06 17:42:17 2012",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@InProceedings{Stoklosa:2005:CIC,
  author =       "Janusz Stoklosa and Jaroslaw Bubicz",
  editor =       "Hamid R. Arabnia and Liwen He and Youngsong Mun",
  booktitle =    "{Proceedings of the 2005 International Conference on
                 Security and Management, SAM '05: Las Vegas, Nevada,
                 USA, June 20-23, 2005}",
  title =        "Compound inversive congruential generator as a source
                 of keys for stream ciphers",
  publisher =    "CSREA Press",
  address =      "Las Vegas, NV, USA",
  bookpages =    "528",
  pages =        "473--478",
  year =         "2005",
  ISBN =         "1-932415-82-3",
  ISBN-13 =      "978-1-932415-82-7",
  LCCN =         "TK5105.59 .I57 2005",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/csreaSAM/csreaSAM2005.html#StoklosaB05;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Tang:2005:EER,
  author =       "Hui-Chin Tang",
  title =        "Effective and efficient restriction on producing the
                 multipliers for the multiple recursive random number
                 generator",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "47",
  number =       "8--9",
  pages =        "1309--1315",
  day =          "16",
  month =        apr # "\slash " # may,
  year =         "2004",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/S0898-1221(04)90124-1",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:49:37 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122104901241",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Tang:2005:MLC,
  author =       "Hui-Chin Tang",
  title =        "Modulus of linear congruential random number
                 generator",
  journal =      j-QUAL-QUANT,
  volume =       "39",
  number =       "4",
  pages =        "413--422",
  month =        aug,
  year =         "2005",
  CODEN =        "QQEJAV",
  DOI =          "https://doi.org/10.1007/s11135-004-6788-6",
  ISSN =         "0033-5177 (print), 1573-7845 (electronic)",
  ISSN-L =       "0033-5177",
  bibdate =      "Wed Feb 15 16:32:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/h051r275k8615v75/",
  acknowledgement = ack-nhfb,
  fjournal =     "Quality \& Quantity",
  remark =       "From the abstract: ``This paper considers the problem
                 of empirically analyzing the linear congruential
                 generators (LCGs) with ten largest prime moduli smaller
                 than $ 2^{31} $. For each modulus, a computer
                 exhaustive search is conducted to find the 20 good
                 multipliers with respect to spectral value for the full
                 period LCGs. ''",
}

@Article{Tang:2005:RMR,
  author =       "Hui-Chin Tang",
  title =        "Reverse multiple recursive random number generators",
  journal =      j-EUR-J-OPER-RES,
  volume =       "164",
  number =       "2",
  pages =        "402--405",
  day =          "16",
  month =        jul,
  year =         "2005",
  CODEN =        "EJORDT",
  DOI =          "https://doi.org/10.1016/j.ejor.2003.10.047",
  ISSN =         "0377-2217 (print), 1872-6860 (electronic)",
  ISSN-L =       "0377-2217",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377221704000396",
  abstract =     "Every multiple recursive generator (MRG) has an
                 associated reverse MRG that generates the same sequence
                 but in reverse order. An explicit formula for the
                 recurrence of this reverse MRG is derived based on
                 finite field arithmetic. These two MRGs are equal in
                 both periodicity and spectral value. This property
                 could be exploited to reduce the number of candidates
                 when searching for good MRG parameters.",
  acknowledgement = ack-nhfb,
  fjournal =     "European Journal of Operational Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03772217",
}

@Article{Terpstra:2005:SIC,
  author =       "Jeff T. Terpstra",
  title =        "Some Illustrative Classroom Examples Regarding Sums of
                 Discrete Random Variables With Finite Support",
  journal =      j-AMER-STAT,
  volume =       "59",
  number =       "3",
  pages =        "258--265",
  month =        aug,
  year =         "2005",
  CODEN =        "ASTAAJ",
  DOI =          "https://doi.org/10.1198/000313005X54234",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Aug 26 21:48:26 MDT 2010",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Topuzoglu:2005:LCP,
  author =       "Alev Topuzoglu and Arne Winterhof",
  title =        "On the linear complexity profile of nonlinear
                 congruential pseudorandom number generators of higher
                 orders",
  journal =      j-APPL-ALGEBRA-ENG-COMMUN-COMPUT,
  volume =       "16",
  number =       "4",
  pages =        "219--228",
  year =         "2005",
  CODEN =        "AAECEW",
  DOI =          "https://doi.org/10.1007/s00200-005-0181-0",
  ISSN =         "0938-1279 (print), 1432-0622 (electronic)",
  ISSN-L =       "0938-1279",
  bibdate =      "Tue Mar 6 06:55:21 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/aaecc/aaecc16.html#TopuzogluW05;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Applicable algebra in engineering, communication and
                 computing",
}

@Article{Tu:2005:SRD,
  author =       "Shu-Ju Tu and Ephraim Fischbach",
  title =        "A Study on the Randomness of the Digits of $ \pi $",
  journal =      j-INT-J-MOD-PHYS-C,
  volume =       "16",
  number =       "2",
  pages =        "281--294",
  month =        feb,
  year =         "2005",
  CODEN =        "IJMPEO",
  DOI =          "https://doi.org/10.1142/S0129183105007091",
  ISSN =         "0129-1831 (print), 1793-6586 (electronic)",
  ISSN-L =       "0129-1831",
  bibdate =      "Wed Jun 22 11:19:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "The statistical analysis in this work is flawed; see
                 \cite{Marsaglia:2005:RPO,Marsaglia:2006:RCS}",
  URL =          "http://www.worldscinet.com/ijmpc/16/1602/S01291831051602.html",
  abstract =     "We apply a newly-developed computational method,
                 Geometric Random Inner Products (GRIP), to quantify the
                 randomness of number sequences obtained from the
                 decimal digits of $ \pi $. Several members from the
                 GRIP family of tests are used, and the results from $
                 \pi $ are compared to those calculated from other
                 random number generators. These include a recent
                 hardware generator based on an actual physical process,
                 turbulent electroconvection. We find that the decimal
                 digits of $ \pi $ are in fact good candidates for
                 random number generators and can be used for practical
                 scientific and engineering computations.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Modern Physics C [Physics and
                 Computers]",
  journal-URL =  "http://www.worldscientific.com/loi/ijmpc",
}

@TechReport{Wichmann:2005:GGP,
  author =       "B. A. Wichmann and I. D. Hill",
  title =        "Generating good pseudo-random numbers",
  type =         "Report",
  institution =  "National Physical Laboratory",
  address =      "Teddington, UK",
  day =          "5",
  month =        dec,
  year =         "2005",
  bibdate =      "Wed Feb 08 10:24:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://resource.npl.co.uk/docs/science_technology/scientific_computing/ssfm/documents/wh_rng_version096.zip",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wiese:2005:IPN,
  author =       "Kay C. Wiese and Andrew Hendriks and Alain Deschenes
                 and Belgacem {Ben Youssef}",
  title =        "The Impact of Pseudorandom Number Quality on
                 {P-RnaPredict}, a Parallel Genetic Algorithm for {RNA}
                 Secondary Structure Prediction",
  crossref =     "Beyer:2005:GEC",
  pages =        "479--480",
  year =         "2005",
  DOI =          "https://doi.org/10.1145/1068009.1068089",
  bibdate =      "Mon Mar 5 22:02:35 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005lbp/papers/52-wiese.pdf",
  abstract =     "We present a parallel version of RnaPredict, a genetic
                 algorithm (GA) for RNA secondary structure prediction.
                 The research presented here builds on previous work and
                 examines the impact of three different pseudorandom
                 number generators (PRNGs) on the GA's performance. The
                 three generators tested are the C standard library PRNG
                 RAND, a parallelised multiplicative congruential
                 generator (MCG), and a parallelized Mersenne Twister
                 (MT). A fully parallel version of RnaPredict using the
                 Message Passing Interface (MPI) was implemented. The
                 PRNG comparison tests were performed with known
                 structures that are 118, 122, 543, and 556 nucleotides
                 in length. The effects of the PRNGs are investigated
                 and the predicted structures are compared to known
                 structures",
  acknowledgement = ack-nhfb,
}

@Article{Wiese:2005:PRP,
  author =       "Kay C. Wiese and Andrew Hendriks and Alain Deschenes
                 and Belgacem {Ben Youssef}",
  title =        "{P-RnaPredict} --- a parallel evolutionary algorithm
                 for {RNA} folding: effects of pseudorandom number
                 quality",
  journal =      "IEEE Transactions on Nanobioscience",
  volume =       "4",
  number =       "3",
  pages =        "219--227",
  month =        sep,
  year =         "2005",
  DOI =          "https://doi.org/10.1109/TNB.2005.853656",
  ISSN =         "1536-1241",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Wu:2005:CBR,
  author =       "Hongjin Wu",
  title =        "Cryptanalysis of a 32-Bit {RC4}-Like Stream Cipher",
  type =         "Paper",
  number =       "2005/219",
  institution =  "Cryptology ePrint Archive",
  address =      "????",
  year =         "2005",
  bibdate =      "Sat Apr 05 13:00:59 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Nawaz:2005:BRL}.",
  URL =          "https://eprint.iacr.org/2005/219",
  abstract =     "Nawaz, Gupta and Gong recently proposed a 32-bit
                 RC4-like stream cipher. In this paper, we show that the
                 keystream generated from their stream cipher is not
                 random. The keystream can be distinguished from random
                 with only about 100 outputs (3200 bits) in 2
                 milliseconds on Intel Centrino 1.6GHz processor.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2005:ZBH,
  author =       "Guanglie Zhang and Philip H. W. Leong and Dong-U Lee
                 and John D. Villasenor and Ray C. C. Cheung and Wayne
                 Luk",
  editor =       "{IEEE}",
  booktitle =    "{2005 International Conference on Field Programmable
                 Logic and Applications(FPL): Tampere Hall, Tampere,
                 Finland, August 24--26, 2005}",
  title =        "Ziggurat-based hardware {Gaussian} random number
                 generator",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "xxxii + 756",
  pages =        "275--280",
  year =         "2005",
  DOI =          "https://doi.org/10.1109/FPL.2005.1515734",
  ISBN =         "0-7803-9362-7",
  ISBN-13 =      "978-0-7803-9362-2",
  LCCN =         "TK7895.G36 I33 2005",
  bibdate =      "Thu Nov 24 09:19:55 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/1515734/;
                 http://www.ee.usyd.edu.au/people/philip.leong/UserFiles/File/papers/zig_fpl05.pdf;
                 https://courses.cs.washington.edu/courses/cse591n/07wi/papers/fpl05_dul98.pdf",
  acknowledgement = ack-nhfb,
  remark =       "IEEE Catalog Number 05EX1155.",
}

@Article{Zuquete:2005:EHQ,
  author =       "Andr{\'e} Z{\'u}quete",
  title =        "An efficient high quality random number generator for
                 multi-programmed systems",
  journal =      j-J-COMP-SECUR,
  volume =       "13",
  number =       "2",
  pages =        "243--263",
  month =        mar,
  year =         "2005",
  CODEN =        "JCSIET",
  DOI =          "https://doi.org/10.3233/JCS-2005-13202",
  ISSN =         "0926-227X (print), 1875-8924 (electronic)",
  ISSN-L =       "0926-227X",
  bibdate =      "Tue May 24 06:22:44 MDT 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=1077819.1077821",
  abstract =     "This document presents an efficient, high quality
                 random number generator for multi-programmed
                 environments, in particular for UNIX\slash Linux and
                 Windows systems. The algorithm uses a system's notion
                 of the time, given by a high-precision real-time
                 counter, to obtain random bits, and a combination of
                 system calls to reduce the correlation between
                 consecutive random bits. The combination of system
                 calls introduces variable and unpredictable real-time
                 gaps in the execution of the generator. We present a
                 rationale for such variation and unpredictability, and
                 we show that in fact they exist even when the generator
                 runs in an adverse scenario, i.e., a lightly loaded
                 system. We also show how the generator resists several
                 attacks attempting to guess or control the values it
                 produces. The quality of the generator is evaluated
                 both in terms of its performance and the randomness of
                 the byte sequences it produces. Comparing against other
                 similar generators, CryptoLib and librand, our
                 generator produces equally good random byte sequences,
                 but its performance increases with the speed of the
                 processor, while the performance of CryptoLib and
                 librand is rather constant for each operating system,
                 independently of the processor were it runs.",
  acknowledgement = ack-nhfb,
  acmid =        "1077821",
  fjournal =     "Journal of Computer Security",
  journal-URL =  "http://content.iospress.com/journals/journal-of-computer-security",
  keywords =     "operating systems; Pentium processors; random number
                 generators; time samples",
  pagecount =    "21",
}

@PhdThesis{Aistleitner:2006:NZG,
  author =       "Christoph Aistleitner",
  title =        "{Normale Zahlen}. ({German}) [{Normal} Numbers]",
  type =         "Diplomarbeit",
  school =       "Technische Universit{\"a}t Wien",
  address =      "Vienna, Austria",
  day =          "23",
  month =        jan,
  year =         "2006",
  bibdate =      "Tue Feb 07 11:23:04 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.geometrie.tuwien.ac.at/drmota/Diplomarbeit_Aistleitner.ps",
  acknowledgement = ack-nhfb,
  advisor =      "Michael Drmota",
  language =     "German",
}

@Article{Alon:2006:MPF,
  author =       "N. Alon and Y. Kohayakawa and C. Mauduit and C. G.
                 Moreira and V. R{\"o}dl",
  title =        "Measures of Pseudorandomness for Finite Sequences:
                 Minimal Values",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "15",
  number =       "1--2",
  pages =        "1--29",
  month =        jan,
  year =         "2006",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548305007170",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  bibdate =      "Mon Jul 7 18:11:00 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=15&issueId=01",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=CPC",
}

@Article{Aly:2006:LCP,
  author =       "Hassan Aly and Arne Winterhof",
  title =        "On the Linear Complexity Profile of Nonlinear
                 Congruential Pseudorandom Number Generators with
                 {Dickson} Polynomials",
  journal =      j-DESIGNS-CODES-CRYPTOGR,
  volume =       "39",
  number =       "2",
  pages =        "155--162",
  month =        may,
  year =         "2006",
  CODEN =        "DCCREC",
  DOI =          "https://doi.org/10.1007/s10623-005-3190-x",
  ISSN =         "0925-1022 (print), 1573-7586 (electronic)",
  ISSN-L =       "0925-1022",
  MRclass =      "11K45; 94A55; 94A60",
  bibdate =      "Wed Jul 9 09:32:44 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=39&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=39&issue=2&spage=155",
  acknowledgement = ack-nhfb,
  fjournal =     "Designs, codes, and cryptography",
  journal-URL =  "http://link.springer.com/journal/10623",
  keywords =     "cryptography; Dickson polynomials; linear complexity
                 profile; nonlinear congruential generator",
}

@Article{Anonymous:2006:E,
  author =       "Anonymous",
  title =        "Erratum",
  journal =      j-COMPUTING,
  volume =       "77",
  number =       "1",
  pages =        "129--129",
  month =        feb,
  year =         "2006",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-005-0156-9",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jul 8 22:32:47 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=77&issue=1;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Entacher:2005:BLP}.",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=77&issue=1&spage=129",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Barak:2006:ERU,
  author =       "Boaz Barak and Russell Impagliazzo and Avi Wigderson",
  title =        "Extracting Randomness Using Few Independent Sources",
  journal =      j-SIAM-J-COMPUT,
  volume =       "36",
  number =       "4",
  pages =        "1095--1118",
  month =        "????",
  year =         "2006",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Tue May 18 08:21:37 MDT 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/36/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Barash:2006:POE,
  author =       "L. Barash and L. N. Shchur",
  title =        "Periodic orbits of the ensemble of {Sinai--Arnold} cat
                 maps and pseudorandom number generation",
  journal =      j-PHYS-REV-E,
  volume =       "73",
  number =       "3",
  pages =        "036701--036701",
  month =        mar,
  year =         "2006",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.73.036701",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.73.036701",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  pagecount =    "15",
  xxnumber =     "3 Pt 2",
}

@Manual{Barker:2006:RRN,
  author =       "Elaine Barker and John Kelsey",
  title =        "Recommendation for Random Number Generation Using
                 Deterministic Random Bit Generators",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  pages =        "viii + 123",
  year =         "2006",
  bibdate =      "Wed Sep 06 07:05:25 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/publications/nistpubs/800-90/SP800-90_DRBG-June2006-final.pdf",
  acknowledgement = ack-nhfb,
}

@Article{BenAtti:2006:BMA,
  author =       "Nadia {Ben Atti} and Gema M. Diaz-Toca and Henri
                 Lombardi",
  title =        "The {Berlekamp--Massey} Algorithm Revisited",
  journal =      "Applicable Algebra in Engineering, Communication, and
                 Computing",
  volume =       "17",
  number =       "1",
  pages =        "75--82",
  month =        apr,
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/s00200-005-0190-z",
  ISSN =         "0938-1279 (print), 1432-0622 (electronic)",
  ISSN-L =       "0938-1279",
  bibdate =      "Mon Jun 27 21:49:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We propose a slight modification of the
                 Berlekamp-Massey Algorithm for obtaining the minimal
                 polynomial of a given linearly recurrent sequence. Such
                 a modification enables to explain it in a simpler way
                 and to adapt it to lazy evaluation.",
  acknowledgement = ack-nhfb,
}

@Article{Berkovitz:2006:EHR,
  author =       "Joseph Berkovitz and Roman Frigg and Fred Kronz",
  title =        "The ergodic hierarchy, randomness and {Hamiltonian}
                 chaos",
  journal =      j-STUD-HIST-PHILOS-MOD-PHYS,
  volume =       "37",
  number =       "4",
  pages =        "661--691",
  month =        dec,
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.shpsb.2006.02.003",
  ISSN =         "1355-2198 (print), 1879-2502 (electronic)",
  ISSN-L =       "1355-2198",
  bibdate =      "Thu Nov 3 06:18:28 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/shps-b.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1355219806000700",
  acknowledgement = ack-nhfb,
  ajournal =     "Stud. Hist. Philos. Mod. Phys.",
  fjournal =     "Studies in History and Philosophy of Modern Physics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13552198",
}

@Article{Brent:2006:FRR,
  author =       "Richard P. Brent",
  title =        "Fast and Reliable Random Number Generators for
                 Scientific Computing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "3732",
  pages =        "1--10",
  year =         "2006",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11558958_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sun Apr 26 12:57:04 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Fast and reliable pseudo-random number generators are
                 required for simulation and other applications in
                 Scientific Computing. We outline the requirements for
                 good uniform random number generators, and describe a
                 class of generators having very fast vector/parallel
                 implementations with excellent statistical properties.
                 We also discuss the problem of initialising random
                 number generators, and consider how to combine two or
                 more generators to give a better (though usually
                 slower) generator.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  remark =       "From the paper's list of criteria for choice of a
                 generator: ``Long Period: A good rule of thumb is to
                 use at most $ \rho^{1 / 2} $ numbers [where $ \rho $ is
                 the generator period]. In fact, there are reasons,
                 related to the birthday spacings test [28], for using
                 at most $ \rho^{1 / 3} $ numbers.''",
}

@Article{Brent:2006:SLP,
  author =       "Richard Peirce Brent",
  title =        "Some long-period random number generators using shifts
                 and xors",
  journal =      j-ANZIAM-J,
  volume =       "48",
  number =       "??",
  pages =        "C188--C202 (2009)",
  year =         "2006",
  CODEN =        "AJNOA2",
  DOI =          "https://doi.org/10.21914/anziamj.v48i0.40",
  ISSN =         "1446-1811 (print), 1446-8735 (electronic)",
  ISSN-L =       "1446-1811",
  MRclass =      "65C10",
  MRnumber =     "3113574",
  bibdate =      "Fri Apr 26 15:20:54 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/1004.3115;
                 https://journal.austms.org.au/ojs/index.php/ANZIAMJ/article/view/40;
                 https://maths-people.anu.edu.au/~brent/pd/rpb224.pdf;
                 https://maths-people.anu.edu.au/~brent/random.html",
  abstract =     "Marsaglia recently introduced a class of xorshift
                 random number generators (RNGs) with periods $ 2^n - 1
                 $ for $n$ = 32, 64, etc. Here we give a generalisation
                 of Marsaglia's xorshift generators in order to obtain
                 fast and high-quality RNGs with extremely long periods.
                 RNGs based on primitive trinomials may be
                 unsatisfactory because a trinomial has very small
                 weight. In contrast, our generators can be chosen so
                 that their minimal polynomials have large weight
                 (number of nonzero terms). A computer search using
                 Magma has found good generators for $n$ a power of two
                 up to 4096. These have been implemented in a free
                 software package {\tt xorgens}.",
  acknowledgement = ack-nhfb,
  fjournal =     "The ANZIAM Journal. The Australian \& New Zealand
                 Industrial and Applied Mathematics Journal",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=ANZ",
  remark =       "Generalization of Marsaglia's xorshift generators to
                 obtain fast generators with extremely long periods $
                 2^n 1 $ for $ n = 32, 64, \ldots {}, 2^{4096} $.",
}

@Article{Cools:2006:CEL,
  author =       "Ronald Cools and Frances Y. Kuo and Dirk Nuyens",
  title =        "Constructing Embedded Lattice Rules for Multivariate
                 Integration",
  journal =      j-SIAM-J-SCI-COMP,
  volume =       "28",
  number =       "6",
  pages =        "2162--2188",
  month =        jan,
  year =         "2006",
  CODEN =        "SJOCE3",
  ISSN =         "1064-8275 (print), 1095-7197 (electronic)",
  ISSN-L =       "1064-8275",
  bibdate =      "Wed May 19 10:43:45 MDT 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SISC/28/6;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Scientific Computing",
  journal-URL =  "http://epubs.siam.org/sisc",
}

@Article{Creutzig:2006:BRW,
  author =       "Jakob Creutzig",
  title =        "Book Review: {W. H{\"o}rmann, J. Leydold, G.
                 Derflinger: \booktitle{Automatic nonuniform random
                 variate generation}}",
  journal =      j-METRIKA,
  volume =       "64",
  number =       "2",
  pages =        "247--248",
  month =        oct,
  year =         "2006",
  CODEN =        "MTRKA8",
  DOI =          "https://doi.org/10.1007/s00184-006-0087-2",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Mon Feb 2 16:28:25 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metrika.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/accesspage/article/10.1007/s00184-006-0087-2",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika",
  journal-URL =  "http://link.springer.com/journal/184",
}

@InCollection{Devroye:2006:NRV,
  author =       "Luc Devroye",
  title =        "Chapter 4: Nonuniform Random Variate Generation",
  crossref =     "Henderson:2006:S",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "83--121",
  year =         "2006",
  DOI =          "https://doi.org/10.1016/S0927-0507(06)13004-2",
  bibdate =      "Tue Feb 14 09:46:03 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0927050706130042",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dick:2006:WSD,
  author =       "J. Dick and H. Niederreiter and F. Pillichshammer",
  title =        "Weighted Star Discrepancy of Digital Nets in Prime
                 Bases",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "77--96",
  year =         "2006",
  bibdate =      "Fri Mar 09 12:28:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dickinson:2006:EEL,
  author =       "A. Dickinson",
  title =        "Explaining Effective Low-Dimensionality",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "97--112",
  year =         "2006",
  bibdate =      "Fri Mar 09 12:28:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{El-Mahassni:2006:DNC,
  author =       "Edwin D. El-Mahassni and Igor E. Shparlinski and Arne
                 Winterhof",
  title =        "Distribution of Nonlinear Congruential Pseudorandom
                 Numbers Modulo Almost Squarefree Integers",
  journal =      j-MONAT-MATH,
  volume =       "148",
  number =       "4",
  pages =        "297--307",
  month =        aug,
  year =         "2006",
  CODEN =        "MNMTA2",
  DOI =          "https://doi.org/10.1007/s00605-005-0355-7",
  ISSN =         "0026-9255 (print), 1436-5081 (electronic)",
  ISSN-L =       "0026-9255",
  bibdate =      "Mon Feb 27 12:06:51 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/a57353180vx75415/",
  acknowledgement = ack-nhfb,
  fjournal =     "Monatshefte f{\"u}r Mathematik",
  journal-URL =  "http://link.springer.com/journal/605",
}

@Article{Evans:2006:DOS,
  author =       "Diane L. Evans and Lawrence M. Leemis and John H.
                 Drew",
  title =        "The Distribution of Order Statistics for Discrete
                 Random Variables with Applications to Bootstrapping",
  journal =      j-INFORMS-J-COMPUT,
  volume =       "18",
  number =       "1",
  pages =        "19--30",
  month =        "Winter",
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1287/ijoc.1040.0105",
  ISSN =         "1091-9856 (print), 1526-5528 (electronic)",
  ISSN-L =       "1091-9856",
  bibdate =      "Fri Jan 06 17:43:30 2012",
  bibsource =    "http://joc.journal.informs.org/search;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "INFORMS Journal on Computing",
  journal-URL =  "http://pubsonline.informs.org/journal/ijoc",
}

@InProceedings{Faure:2006:SCR,
  author =       "H. Faure",
  title =        "Selection Criteria for (Random) Generation of Digital
                 $ (0, s) $-Sequences",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "113--126",
  year =         "2006",
  bibdate =      "Fri Mar 09 12:28:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Feige:2006:SIR,
  author =       "Uriel Feige",
  title =        "On Sums of Independent Random Variables with Unbounded
                 Variance and Estimating the Average Degree in a Graph",
  journal =      j-SIAM-J-COMPUT,
  volume =       "35",
  number =       "4",
  pages =        "964--984",
  month =        "????",
  year =         "2006",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Tue May 18 08:21:24 MDT 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/35/4;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@MastersThesis{Finnigin:2006:CPN,
  author =       "Kevin M. Finnigin",
  title =        "Cryptanalysis of Pseudorandom Number Generators in
                 Wireless Sensor Networks",
  type =         "{Master}'s thesis",
  school =       "Department of Electrical and Computer Engineering, Air
                 Force Institute of Technology",
  address =      "Wright-Patterson AFB, OH, USA",
  year =         "2006",
  bibdate =      "Fri May 13 06:41:39 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "This work presents a brute-force attack on an elliptic
                 curve cryptosystem implemented on UC Berkeley's TinyOS
                 operating system for wireless sensor networks. The
                 attack exploits the short period of the pseudorandom
                 number generator (PRNG) used by the cryptosystem to
                 generate private keys. The attack assumes a laptop is
                 listening promiscuously to network traffic for key
                 messages and requires only the sensor node's public key
                 and network address to discover the private key.
                 Experimental results show that roughly 50\% of the
                 address space leads to a private key compromise in 25
                 minutes on average. Furthermore, approximately 32\% of
                 the address space leads to a compromise in 17 minutes
                 on average, 11\% in 6 minutes, and the remaining 7\% in
                 2 minutes or less. Two alternatives to the PRNG are
                 examined that mitigate the brute-force attack. The
                 alternatives are implemented on the Mica2 mote and
                 examined to determine CPU cycles for execution and
                 memory requirements. The recommended PRNG requires 73
                 CPU cycles in the worst case and uses 66 bytes of
                 memory. The period of the PRNG is uniform for all mote
                 addresses and theoretically requires 6.6 years on
                 average for a key compromise for the attack used in
                 this thesis.",
  acknowledgement = ack-nhfb,
}

@Article{Galperin:2006:SSU,
  author =       "E. A. Galperin and I. Galperin",
  title =        "Small sample uniformity in random number generation",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "52",
  number =       "1--2",
  pages =        "95--108",
  month =        jul,
  year =         "2006",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/j.camwa.2006.08.007",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Wed Mar 1 21:49:53 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0898122106001842",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@InProceedings{Gammel:2006:LFN,
  author =       "Berndt M. Gammel and Rainer G{\"o}ttfert",
  title =        "Linear Filtering of Nonlinear Shift-Register
                 Sequences",
  crossref =     "Ytrehus:2006:CCI",
  pages =        "354--370",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/11779360_28",
  bibdate =      "Mon Jun 27 22:43:21 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Gennaro:2006:RC,
  author =       "Rosario Gennaro",
  title =        "Randomness in Cryptography",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "4",
  number =       "2",
  pages =        "64--67",
  month =        mar # "\slash " # apr,
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/MSP.2006.49",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Apr 3 07:36:16 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security and Privacy",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/security",
}

@Article{Gil:2006:RTP,
  author =       "Manuel Gil and Gaston H. Gonnet and Wesley P.
                 Petersen",
  title =        "A Repetition Test for Pseudo-Random Number
                 Generators",
  journal =      j-MONTE-CARLO-METHODS-APPL,
  volume =       "12",
  number =       "5--6",
  pages =        "385--393",
  month =        "????",
  year =         "2006",
  CODEN =        "MCMAC6",
  DOI =          "https://doi.org/10.1163/156939606779329017",
  ISSN =         "0929-9629 (print), 1569-3961 (electronic)",
  ISSN-L =       "0929-9629",
  MRclass =      "65C10",
  MRnumber =     "2286644 (2007j:65005)",
  bibdate =      "Wed Feb 29 09:27:54 MST 2012",
  bibsource =    "http://www.degruyter.com/view/j/mcma.2006.12.issue-5/issue-files/mcma.2006.12.issue-5.xml;
                 https://www.math.utah.edu/pub/tex/bib/mcma.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.degruyter.com/view/j/mcma.2006.12.issue-5/156939606779329017/156939606779329017.xml;
                 http://www.inf.ethz.ch/personal/gonnet/RepetitionTest.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Monte Carlo Methods and Applications",
  journal-URL =  "http://www.degruyter.com/view/j/mcma",
  remark =       "The authors analyze random number generation as a
                 selection-with-replacement problem, and show that, when
                 the number of possible random numbers is $ n = 2^w $,
                 where $w$ is the storage width in bits, then the first
                 repetition is expected when $ O(\sqrt {\pi n / 2}) $
                 random values have been selected, and propose this as a
                 test of random-number generators. LCGs and MCGs never
                 repeat until their period is reached, and their periods
                 are almost always chosen to be maximal, or nearly so;
                 consequently, such generators always fail the
                 repetition test: indeed, they follow a
                 selection-without-replacement algorithm. The authors
                 apply their test to implementations of 11 popular
                 generators: {\tt ran3} \cite{Press:1992:NRF}, {\tt
                 rcarry} (subtract-with-borrow \cite{James:1990:RPN}),
                 {\tt ranlux} \cite{Luscher:1994:PHQ}, {\tt ziff98}
                 (four-tap GFSR \cite{Ziff:1998:FTS}), {\tt mt19937}
                 (three variants of Mersenne Twister
                 \cite{Matsumoto:1998:MTD}), {\tt ecuyer93} (fifth-order
                 MRG \cite{LEcuyer:1993:SGM}), {\tt ecuyer96} (combined
                 MRG \cite{LEcuyer:1996:MEC}), {\tt taus88}
                 \cite{Tausworthe:1965:RNG,LEcuyer:1996:MEC}, and {\tt
                 ghg} (lagged Fibonacci with different coefficients
                 \cite{Gonnet:2005:MRG}). Source code for the test is
                 available at the second author's Web site (see URL in
                 this entry).",
}

@Article{Gomez-Perez:2006:ESD,
  author =       "Domingo Gomez-Perez and Jaime Gutierrez and Igor E.
                 Shparlinski",
  title =        "Exponential sums with {Dickson} polynomials",
  journal =      j-FINITE-FIELDS-APPL,
  volume =       "12",
  number =       "1",
  pages =        "16--25",
  month =        jan,
  year =         "2006",
  CODEN =        "FFTAFM",
  DOI =          "https://doi.org/10.1016/j.ffa.2004.08.001",
  ISSN =         "1071-5797 (print), 1090-2465 (electronic)",
  ISSN-L =       "1071-5797",
  bibdate =      "Fri Dec 30 15:47:45 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1071579704000401",
  acknowledgement = ack-nhfb,
  fjournal =     "Finite Fields and their Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10715797",
}

@Article{Goodman:2006:SRN,
  author =       "Joseph K. Goodman and Julie R. Irwin",
  title =        "Special random numbers: Beyond the illusion of
                 control",
  journal =      j-ORG-BEHAV-HUM-DECIS-PROCESS,
  volume =       "99",
  number =       "2",
  pages =        "161--174",
  month =        mar,
  year =         "2006",
  CODEN =        "OBDPFO",
  DOI =          "https://doi.org/10.1016/j.obhdp.2005.08.004",
  ISSN =         "0749-5978 (print), 1095-9920 (electronic)",
  ISSN-L =       "0749-5978",
  bibdate =      "Tue Feb 14 09:54:52 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0749597805001123",
  acknowledgement = ack-nhfb,
  fjournal =     "Organizational Behavior and Human Decision Processes",
}

@TechReport{Gutterman:2006:ALR,
  author =       "Zvi Gutterman and Benny Pinkas and Tzachy Reinman",
  title =        "Analysis of the {Linux} Random Number Generator",
  type =         "Report",
  institution =  "The Hebrew University of Jerusalem and University of
                 Haifa",
  address =      "Jerusalem and Haifa, Israel",
  pages =        "18",
  day =          "6",
  month =        mar,
  year =         "2006",
  bibdate =      "Sat Dec 24 11:30:48 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.pinkas.net/PAPERS/gpr06.pdf",
  abstract =     "Linux is the most popular open source project. The
                 Linux random number generator is part of the kernel of
                 all Linux distributions and is based on generating
                 randomness from entropy of operating system events. The
                 output of this generator is used for almost every
                 security protocol, including TLS/SSL key generation,
                 choosing TCP sequence numbers, and file system and
                 email encryption. Although the generator is part of an
                 open source project, its source code (about 2500 lines
                 of code) is poorly documented, and patched with
                 hundreds of code patches.\par We used dynamic and
                 static reverse engineering to learn the operation of
                 this generator. This paper presents a description of
                 the underlying algorithms and exposes several security
                 vulnerabilities. In particular, we show an attack on
                 the forward security of the generator which enables an
                 adversary who exposes the state of the generator to
                 compute previous states and outputs. In addition we
                 present a few cryptographic flaws in the design of the
                 generator, as well as measurements of the actual
                 entropy collected by it, and a critical analysis of the
                 use of the generator in Linux distributions on
                 disk-less devices.",
  acknowledgement = ack-nhfb,
}

@Article{Hanley:2006:PFR,
  author =       "James A. Hanley and Dana Teltsch",
  title =        "The {PDF} of a Function of a Random Variable",
  journal =      j-AMER-STAT,
  volume =       "60",
  number =       "1",
  pages =        "61--67",
  month =        feb,
  year =         "2006",
  CODEN =        "ASTAAJ",
  DOI =          "https://doi.org/10.1198/000313006X89947",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Thu Aug 26 21:48:26 MDT 2010",
  bibsource =    "http://www.amstat.org/publications/tas/;
                 https://www.math.utah.edu/pub/tex/bib/amstat.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://www.tandfonline.com/loi/utas20",
}

@Article{Hars:2006:MIA,
  author =       "Laszlo Hars",
  title =        "Modular Inverse Algorithms Without Multiplications for
                 Cryptographic Applications",
  journal =      j-EURASIP-J-EMBED-SYS,
  volume =       "2006",
  pages =        "1--13",
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1155/ES/2006/32192",
  ISSN =         "1687-3955 (print), 1687-3963 (electronic)",
  ISSN-L =       "1687-3955",
  bibdate =      "Wed Dec 28 09:54:06 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Article ID 32192.",
  URL =          "http://downloads.hindawi.com/journals/es/2006/032192.pdf",
  abstract =     "Hardware and algorithmic optimization techniques are
                 presented to the left-shift, right-shift, and the
                 traditional Euclidean-modular inverse algorithms.
                 Theoretical arguments and extensive simulations
                 determined the resulting expected running time. On many
                 computational platforms these turn out to be the
                 fastest known algorithms for moderate operand lengths.
                 They are based on variants of Euclidean-type extended
                 GCD algorithms. On the considered computational
                 platforms for operand lengths used in cryptography, the
                 fastest presented modular inverse algorithms need about
                 twice the time of modular multiplications, or even
                 less. Consequently, in elliptic curve cryptography
                 delaying modular divisions is slower (affine
                 coordinates are the best) and the RSA and ElGamal
                 cryptosystems can be accelerated.",
  acknowledgement = ack-nhfb,
  fjournal =     "EURASIP Journal on Embedded Systems",
  remark =       "This paper gives four variants of shift algorithms for
                 computing the extended binary Euclidean algorithm for
                 the greatest common denominator and modular inverse.
                 Unfortunately, the algorithms are in pseudocode, and
                 some contain references to undefined variables. I was
                 able to get only the first to work after transcribing
                 it to the C language.",
  xxCODEN =      "????",
}

@InProceedings{Hartinger:2006:NUL,
  author =       "J. Hartinger and R. Kainhofer",
  title =        "Non-uniform low-discrepancy sequence generation and
                 integration of singular integrands",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "163--179",
  year =         "2006",
  bibdate =      "Sat May 11 12:59:15 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hechenleitner:2006:PSG,
  author =       "Bernhard Hechenleitner and Karl Entacher",
  title =        "A parallel search for good lattice points using
                 {LLL}-spectral tests",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "189",
  number =       "1--2",
  pages =        "424--441",
  day =          "1",
  month =        may,
  year =         "2006",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/j.cam.2005.03.058",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Tue Dec 27 08:09:06 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042705001652",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  remark =       "Proceedings of The 11th International Congress on
                 Computational and Applied Mathematics",
}

@Article{Hong:2006:DRN,
  author =       "Jinkeun Hong and Kihong Kim and Dongcheul Son",
  title =        "The Design of Random Number Generator in an Embedded
                 Crypto Module",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "4331",
  pages =        "990--999",
  year =         "2006",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11942634_101",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Mar 09 08:32:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "{Proceedings of Frontiers of High Performance
                 Computing and Networking --- ISPA 2006 Workshops.}",
  URL =          "http://www.springerlink.com/content/m76315733120854t/",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "true random numbers from physical sources",
  remark =       "The authors discuss the difficulty of getting an
                 unbiased, stable, and fast random bit stream from a
                 hardware generator.",
}

@Article{Indyk:2006:SDP,
  author =       "Piotr Indyk",
  title =        "Stable distributions, pseudorandom generators,
                 embeddings, and data stream computation",
  journal =      j-J-ACM,
  volume =       "53",
  number =       "3",
  pages =        "307--323",
  month =        may,
  year =         "2006",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/1147954.1147955",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Aug 23 06:38:20 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InProceedings{Joe:2006:CGR,
  author =       "S. Joe",
  title =        "Construction of Good Rank-1 Lattice Rules Based on the
                 Weighted Star Discrepancy",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "181--196",
  year =         "2006",
  bibdate =      "Fri Mar 09 12:28:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kossovsky:2006:TBU,
  author =       "Alex Ely Kossovsky",
  title =        "Towards a Better Understanding of the Leading Digits
                 Phenomena",
  journal =      "CoRR",
  year =         "2006",
  CODEN =        "????",
  ISSN =         "????",
  bibdate =      "Mon Nov 21 06:46:43 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://arxiv.org/abs/math/0612627",
  abstract =     "This article on leading digits (Benford's Law)
                 contains the following: (I) An attempt at a
                 comprehensive account on the leading digits phenomena,
                 incorporating many of its existing explanations,
                 proofs, and differing points of view. (II) The finding
                 that leading digits of random numbers derived from a
                 chain of distributions that are linked via parameter
                 selection are logarithmic in the limit as the number of
                 sequences approaches infinity, and that empirically
                 only around 5 or 6 sequences of such a distribution
                 chain are needed to obtain results that are close
                 enough to the logarithmic (i.e., rapid convergence).
                 (III) An outright exact logarithmic behavior for a
                 2-sequence chain whenever parametrical density is
                 exactly logarithmic. (IV) An account on the existence
                 of singularities in exponential growth rates with
                 regards to the leading digits distributions of their
                 series. (V) An account on several distributions that
                 are intrinsically logarithmic or approximately so. (VI)
                 A conceptual justification of Flehinger's iterated
                 averaging scheme --- an algorithm that was presented
                 without any clear motivation. (VII) A note on the close
                 relationship of Flehinger's scheme and the chain of
                 distribution to Hill's super distribution. (VIII) A
                 conceptual argument justifying the scale invariance
                 principle --- a principle invoked in derivations of
                 Benford's law. (IX) A note on the intimate connection
                 between one-sided tail to the right in density
                 distributions and logarithmic leading digit behavior.",
  acknowledgement = ack-nhfb,
}

@Book{Kuipers:2006:UDS,
  author =       "Lauwerens Kuipers and Harald Niederreiter",
  title =        "Uniform distribution of sequences",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xviii + 390",
  year =         "2006",
  ISBN =         "0-486-45019-8 (paperback)",
  ISBN-13 =      "978-0-486-45019-3 (paperback)",
  LCCN =         "QA292 .K84 2006",
  bibdate =      "Sat Nov 12 15:42:53 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0625/2005056064-d.html;
                 http://www.loc.gov/catdir/toc/fy0612/2005056064.html",
  acknowledgement = ack-nhfb,
  remark =       "Originally published in \cite{Kuipers:1974:UDS}.",
  subject =      "Sequences (Mathematics); Uniform distribution
                 (Probability theory)",
}

@Article{Kundu:2006:JCW,
  author =       "Debasis Kundu and Anubhav Manglick and Rameshwar D.
                 Gupta",
  title =        "{JMASM 22}: a Convenient Way of Generating Normal
                 Random Variables Using Generalized Exponential
                 Distribution",
  journal =      j-J-MOD-APPL-STAT-METH,
  volume =       "5",
  number =       "1",
  pages =        "266--272",
  month =        may,
  year =         "2006",
  CODEN =        "????",
  DOI =          "https://doi.org/10.22237/jmasm/1146457260",
  ISSN =         "1538-9472",
  ISSN-L =       "1538-9472",
  bibdate =      "Sat Jan 18 09:25:12 MST 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jmodapplstatmeth.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://jmasm.com/index.php/jmasm/article/view/242",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Mod. Appl. Stat. Methods (JMASM)",
  fjournal =     "Journal of Modern Applied Statistical Methods",
  journal-URL =  "https://jmasm.com/",
}

@Article{Kung:2006:BML,
  author =       "Ching-Jing Kung",
  title =        "32-bit multipliers for linear congruential random
                 number generators",
  journal =      j-J-DISCR-MATH-SCI-CRYPTO,
  volume =       "9",
  number =       "3",
  pages =        "441--448",
  year =         "2006",
  CODEN =        "????",
  ISSN =         "0972-0529",
  ISSN-L =       "0972-0529",
  MRclass =      "11K45 (94A60)",
  MRnumber =     "2314763 (2007m:11105)",
  bibdate =      "Thu Feb 16 16:28:50 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Discrete Mathematical Sciences and
                 Cryptography",
}

@Article{Lamenca-Martinez:2006:LNP,
  author =       "Carlos Lamenca-Martinez and Julio Cesar
                 Hernandez-Castro and Juan M. Estevez-Tapiador and
                 Arturo Ribagorda",
  title =        "{Lamar}: a New Pseudorandom Number Generator Evolved
                 by Means of Genetic Programming",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "4193",
  pages =        "850--859",
  year =         "2006",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11844297_86",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Feb 01 16:33:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/content/c60q42qt2m035685/",
  abstract =     "Pseudorandom number generation is a key component of
                 many Computer Science algorithms, including
                 mathematical modeling, stochastic processes, Monte
                 Carlo simulations, and most cryptographic primitives
                 and protocols. To date, multiple approaches that use
                 Evolutionary Computation (EC) techniques have been
                 proposed for designing useful Pseudorandom Number
                 Generators (PRNGs) for certain non-cryptographic
                 applications. However, none of the proposals have been
                 secure nor efficient enough to be of interest for the
                 much more demanding crypto world. In this work, we
                 present a general scheme, which uses Genetic
                 Programming (GP), for the automatic design of
                 crypto-quality PRNGs by evolving highly nonlinear and
                 extremely efficient functions. A new PRNG named Lamar
                 and obtained using this scheme is proposed, whose C
                 code and preliminary security analysis are provided.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Book{Law:2006:SMA,
  author =       "Averill M. Law",
  title =        "Simulation modeling and analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "xix + 768",
  year =         "2006",
  ISBN =         "0-07-298843-6 (hardcover), 0-07-125519-2 (paperback),
                 0-07-329441-1, 0-07-110336-8, 0-07-110051-2",
  ISBN-13 =      "978-0-07-298843-7 (hardcover), 978-0-07-125519-6
                 (paperback), 978-0-07-329441-4, 978-0-07-110336-7,
                 978-0-07-110051-9",
  LCCN =         "QA76.9.C65 L38 2005",
  bibdate =      "Mon Jan 2 16:39:26 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "McGraw-Hill series in industrial engineering and
                 management science",
  URL =          "http://catdir.loc.gov/catdir/toc/ecip0611/2006010073.html",
  acknowledgement = ack-nhfb,
  remark =       "See \cite{Law:1982:SMA,Law:1991:SMA,Law:2000:SMA} for
                 other editions.",
  subject =      "Digital computer simulation",
  tableofcontents = "1. Basic Simulation Modeling \\
                 2. Modeling Complex Systems \\
                 3. Simulation Software \\
                 4. Review of Basic Probability and Statistics \\
                 5. Building Valid, Credible, and Appropriately Detailed
                 Simulation Models \\
                 6. Selecting Input Probability Distributions \\
                 7. Random-Number Generators \\
                 8. Generating Random Variates \\
                 9. Output Data Analysis for a Single System \\
                 10. Comparing Alternative System Configurations \\
                 11. Variance-Reduction Techniques \\
                 12. Experimental Design and Optimization \\
                 13. Simulation of Manufacturing Systems",
}

@InCollection{LEcuyer:2006:CUR,
  author =       "Pierre L'Ecuyer",
  title =        "Chapter 3: {Uniform} Random Number Generation",
  crossref =     "Henderson:2006:S",
  pages =        "55--81",
  month =        jan,
  year =         "2006",
  DOI =          "https://doi.org/10.1016/S0927-0507(06)13003-0",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0927050706130030",
  acknowledgement = ack-nhfb,
}

@Article{LEcuyer:2006:ISB,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "Inverting the symmetrical beta distribution",
  journal =      j-TOMS,
  volume =       "32",
  number =       "4",
  pages =        "509--520",
  month =        dec,
  year =         "2006",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/1186785.1186786",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Sat Apr 14 09:48:57 MDT 2007",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "We propose a fast algorithm for computing the inverse
                 symmetrical beta distribution. Four series (two around
                 $ x = 0 $ and two around $ x = 1 / 2 $ ) are used to
                 approximate the distribution function, and its inverse
                 is found via Newton's method. This algorithm can be
                 used to generate beta random variates by inversion and
                 is much faster than currently available general
                 inversion methods for the beta distribution. It turns
                 out to be very useful for generating gamma processes
                 efficiently via bridge sampling.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
}

@TechReport{LEcuyer:2006:TSL,
  author =       "Pierre L'Ecuyer and Richard Simard",
  title =        "{{\tt TestU01}}, a Software Library in {ANSI C} for
                 Empirical Testing of Random Number Generators",
  type =         "Report",
  number =       "??",
  institution =  "D{\'e}partement d Informatique et de Recherche
                 Operationnelle, Universit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, QC, Canada",
  pages =        "????",
  year =         "2006",
  bibdate =      "Mon Jun 27 21:40:51 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Lee:2006:HGN,
  author =       "Dong-U Lee and John D. Villasenor and Wayne Luk and
                 Philip H. W. Leong",
  title =        "A hardware {Gaussian} noise generator using the
                 {Box--Muller} method and its error analysis",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "55",
  number =       "6",
  pages =        "659--671",
  month =        jun,
  year =         "2006",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2006.81",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Mon Jul 4 15:35:54 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1628955",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@InProceedings{Lee:2006:IBH,
  author =       "Dong-U Lee and Ray C. C. Cheung and John D. Villasenor
                 and Wayne Luk",
  editor =       "George A. Constantinides",
  booktitle =    "{2006 IEEE International Conference on Field
                 Programmable Technology: December 13-15, 2006, Bangkok,
                 Thailand: proceedings}",
  title =        "Inversion-based hardware {Gaussian} random number
                 generator: A case study of function evaluation via
                 hierarchical segmentation",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "xiv + 389",
  pages =        "33--40",
  year =         "2006",
  DOI =          "https://doi.org/10.1109/FPT.2006.270388",
  ISBN =         "0-7803-9728-2",
  ISBN-13 =      "978-0-7803-9728-6",
  LCCN =         "TK7895.G36 I33 2006",
  bibdate =      "Thu Nov 24 08:33:58 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/4042413/",
  acknowledgement = ack-nhfb,
}

@Article{Maffre:2006:WKT,
  author =       "Samuel Maffre",
  title =        "A Weak Key Test for Braid Based Cryptography",
  journal =      j-DESIGNS-CODES-CRYPTOGR,
  volume =       "39",
  number =       "3",
  pages =        "347--373",
  month =        jun,
  year =         "2006",
  CODEN =        "DCCREC",
  DOI =          "https://doi.org/10.1007/s10623-005-5382-9",
  ISSN =         "0925-1022 (print), 1573-7586 (electronic)",
  ISSN-L =       "0925-1022",
  MRclass =      "20F36; 94A60",
  bibdate =      "Wed Jul 9 09:32:55 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0925-1022&volume=39&issue=3;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0925-1022&volume=39&issue=3&spage=347",
  acknowledgement = ack-nhfb,
  fjournal =     "Designs, codes, and cryptography",
  journal-URL =  "http://link.springer.com/journal/10623",
  keywords =     "Braid groups; Conjugacy problem; Cryptanalysis; Random
                 generator; Weak key test",
}

@Article{Marsaglia:2006:RCS,
  author =       "George Marsaglia",
  title =        "Refutation of claims such as {``Pi is less random than
                 we thought''}",
  journal =      "{InterStat}: statistics on the {Internet}",
  day =          "23",
  month =        jan,
  year =         "2006",
  CODEN =        "????",
  ISSN =         "1941-689X",
  bibdate =      "Tue Jun 21 19:08:05 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://interstat.statjournals.net/YEAR/2006/articles/0601001.pdf",
  abstract =     "In article by Tu and Fischman in a Physics journal
                 \cite{Tu:2005:SRD} has led to worldwide reports that Pi
                 is less random than we thought, or that Pi is not the
                 best random number generator, or that Pi seems good but
                 not the best. A careful examination of the Tu and
                 Fischman procedure shows that it is needlessly
                 complicated and can be reduced to study of the average
                 value of $ (U_2 - U_1) (U_2 - U_3) $ for uniform
                 variates U produced by a RNG, (but not on their
                 distribution). The authors' method of assigning a
                 letter grade, A+, A, B, C, D, E to a sample mean, based
                 on its distance from the expected value, suggests
                 naivety in the extreme. Application, in the present
                 article, to the first 960 million digits of the
                 expansion of Pi shows that they perform as well as
                 other RNGs on not only the average for $ (U_2 - U_1)
                 (U_2 - U_3) $, but on the more difficult test for their
                 distribution, consistent with results previously shown
                 in this journal that Pi does quite well on far more
                 extensive and difficult-to-pass tests of randomness.",
  acknowledgement = ack-nhfb,
  keywords =     "Diehard Tests; LSTests of Randomness; Pi; Random
                 Number Generators",
}

@Article{Matsumoto:2006:PNG,
  author =       "M. Matsumoto and M. Saito and H. Haramoto and T.
                 Nishimura",
  title =        "Pseudorandom Number Generation: Impossibility and
                 Compromise",
  journal =      j-J-UCS,
  volume =       "12",
  number =       "6",
  pages =        "672--690",
  month =        "????",
  year =         "2006",
  CODEN =        "????",
  ISSN =         "0948-6968",
  ISSN-L =       "0948-6968",
  bibdate =      "Thu Dec 22 06:43:17 2011",
  bibsource =    "http://www.jucs.org/jucs;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jucs.org/jucs_12_6/pseudorandom_number_generation_impossibility",
  abstract =     "Pseudorandom number generators are widely used in the
                 area of simulation. Defective generators are still
                 widely used in standard library programs, although
                 better pseudorandom number generators such as the
                 Mersenne Twister are freely available.\par This
                 manuscript gives a brief explanation on pseudorandom
                 number generators for Monte Carlo simulation. The
                 existing definitions of pseudorandomness are not
                 satisfactorily practical, since the generation of
                 sequences satisfying the definitions is sometimes
                 impossible, sometimes rather slow. As a compromise, to
                 design a fast and reliable generator, some mathematical
                 indices are used as measures of pseudorandomness, such
                 as the period and the higher-dimensional
                 equidistribution property. There is no rigorous
                 justification for the use of these indices as measures
                 of pseudorandomness, but experiences show their
                 usefulness in choosing pseudorandom number
                 generators.",
  acknowledgement = ack-nhfb,
  fjournal =     "J.UCS: Journal of Universal Computer Science",
  journal-URL =  "http://www.jucs.org/jucs",
  keywords =     "Mersenne Twister; Monte Carlo methods; pseudorandom
                 number generation; random number generation;
                 simulation",
}

@Article{Matsumoto:2006:UPN,
  author =       "Makoto Matsumoto",
  title =        "To the users of pseudorandom number generators---from
                 a developer of {Mersenne Twister}",
  journal =      "J. Japan Statist. Soc.",
  volume =       "35",
  number =       "2, {Japanese} Issue",
  pages =        "165--180",
  year =         "2006",
  CODEN =        "????",
  ISSN =         "0389-5602",
  MRnumber =     "2328564",
  bibdate =      "Thu Dec 22 06:43:26 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Japan Statistical Society (Nihon
                 T{\^o}kei Gakkai Kaih{\^o})",
  remark =       "Two journal issues per year published in English, one
                 in Japanese.",
}

@Article{McCullough:2006:RT,
  author =       "B. D. McCullough",
  title =        "A Review of {TESTU01}",
  journal =      j-J-APPL-ECONOMETRICS,
  volume =       "21",
  number =       "5",
  pages =        "677--682",
  month =        jul # "\slash " # aug,
  year =         "2006",
  CODEN =        "JAECET",
  ISSN =         "0883-7252 (print), 1099-1255 (electronic)",
  ISSN-L =       "0883-7252",
  bibdate =      "Wed Feb 08 10:18:37 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstor.org/stable/25146455",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Applied Econometrics",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/10991255;
                 https://www.jstor.org/journal/japplecon",
}

@Article{Miller:2006:MCL,
  author =       "S. J. Miller and M. J. Nigrini",
  title =        "The {Modulo 1 Central Limit Theorem} and {Benford's
                 Law} for Products",
  journal =      "International Journal of Algebra",
  volume =       "3",
  number =       "3",
  pages =        "119--130",
  month =        jul,
  year =         "2006",
  CODEN =        "????",
  ISSN =         "1312-8868",
  bibdate =      "Tue Nov 15 06:34:24 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://adsabs.harvard.edu/abs/2006math......7686M;
                 http://arxiv.org/abs/math/0607686",
  abstract =     "We derive a necessary and sufficient condition for the
                 sum of $M$ independent continuous random variables
                 modulo $1$ to converge to the uniform distribution in $
                 L^1 ([0, 1]) $, and discuss generalizations to discrete
                 random variables. A consequence is that if $ X_1,
                 \ldots {}, X_M $ are independent continuous random
                 variables with densities $ f_1, \ldots {}, f_M $, for
                 any base $B$ as $ M \to \infty $ for many choices of
                 the densities the distribution of the digits of $ X_1 *
                 \cdots {} * X_M $ converges to Benford's law base $B$.
                 The rate of convergence can be quantified in terms of
                 the Fourier coefficients of the densities, and provides
                 an explanation for the prevalence of Benford behavior
                 in many diverse systems.",
  acknowledgement = ack-nhfb,
  eprint =       "arXiv:math/0607686",
  keywords =     "Mathematics - Probability, Mathematics - Classical
                 Analysis and ODEs, 60F05, 60F25, 11K06 (Primary),
                 42A10, 42A61, 62E15 (Secondary)",
}

@Misc{Mueller:2006:SMG,
  author =       "Maik Mueller and Michael Freidrich and Klaus Kiefer
                 and Ralf Miko and Juergen Schneider",
  title =        "System and method for generating pseudo-random
                 numbers",
  howpublished = "United States Patent 7,894,602.",
  day =          "31",
  month =        mar,
  year =         "2006",
  bibdate =      "Tue Dec 27 16:54:57 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http:www.google.com/patents/US7894602",
  abstract =     "A process and system for generating a pseudo-random
                 number is presented. Input data having entropy is
                 gathered in an Entropy Pool and transformed once by a
                 cryptographic hash function. The transformed data forms
                 the internal state of the pseudo-random number
                 generator. The generator forms the output by applying a
                 second cryptographic hash function to this internal
                 state. Finally, the generator updates the internal
                 state by inputting the current internal state and data
                 from the Entropy Pool into a third cryptographic hash
                 function. The output of the third hash function forms
                 the new internal state of the pseudo-random number
                 generator.",
  acknowledgement = ack-nhfb,
}

@Article{Nau:2006:RN,
  author =       "Richard W. Nau",
  title =        "A random number",
  journal =      j-SIGCSE,
  volume =       "38",
  number =       "3",
  pages =        "345--345",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/1140123.1140254",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:57:28 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
  abstract =     "This pedagogical tip presents a physical means for
                 generating a random number --- that turns out to be not
                 so random after all.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
  keywords =     "cyclic numbers; perfect shuffle",
}

@Article{Nuyens:2006:FAC,
  author =       "Dirk Nuyens and Ronald Cools",
  title =        "Fast algorithms for component-by-component
                 construction of rank-$1$ lattice rules in
                 shift-invariant reproducing kernel {Hilbert} spaces",
  journal =      j-MATH-COMPUT,
  volume =       "75",
  number =       "254",
  pages =        "903--920",
  month =        apr,
  year =         "2006",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  ISSN-L =       "0025-5718",
  bibdate =      "Tue Jul 8 06:24:12 MDT 2008",
  bibsource =    "http://www.ams.org/mcom/2006-75-254;
                 https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.ams.org/mcom/2006-75-254/S0025-5718-06-01785-6/home.html;
                 http://www.ams.org/mcom/2006-75-254/S0025-5718-06-01785-6/S0025-5718-06-01785-6.dvi;
                 http://www.ams.org/mcom/2006-75-254/S0025-5718-06-01785-6/S0025-5718-06-01785-6.pdf;
                 http://www.ams.org/mcom/2006-75-254/S0025-5718-06-01785-6/S0025-5718-06-01785-6.ps",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematics of Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@InProceedings{Nuyens:2006:FCCa,
  author =       "D. Nuyens and R. Cools",
  title =        "Fast Component-by-Component Construction, a Reprise
                 for Different Kernels",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "373--387",
  year =         "2006",
  bibdate =      "Fri Mar 09 12:28:00 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Nuyens:2006:FCCb,
  author =       "Dirk Nuyens and Ronald Cools",
  title =        "Fast component-by-component construction of rank-$1$
                 lattice rules with a non-prime number of points",
  journal =      j-J-COMPLEXITY,
  volume =       "22",
  number =       "1",
  pages =        "4--28",
  month =        feb,
  year =         "2006",
  CODEN =        "JOCOEH",
  DOI =          "https://doi.org/10.1016/j.jco.2005.07.002",
  ISSN =         "0885-064X (print), 1090-2708 (electronic)",
  ISSN-L =       "0885-064X",
  bibdate =      "Fri Mar 9 09:33:53 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0885064X05000658",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of complexity",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0885064X",
  keywords =     "analysis of algorithms; fast component-by-component
                 construction; numerical integration; quadrature and
                 cubature formulas; quasi-Monte Carlo; rank-1 lattices",
}

@InProceedings{Panneton:2006:IDH,
  author =       "F. Panneton and P. L'Ecuyer",
  title =        "Infinite-dimensional highly-uniform point sets defined
                 via linear recurrences in {$ \mathbb {F}_{2^w} $}",
  crossref =     "Niederreiter:2006:MCQ",
  pages =        "419--429",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/3-540-31186-6_25",
  MRclass =      "65C05 (65D30)",
  MRnumber =     "2208722 (2006j:65010)",
  bibdate =      "Mon Dec 26 10:42:55 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Panneton:2006:ILP,
  author =       "Fran{\c{c}}ois Panneton and Pierre L'Ecuyer and Makoto
                 Matsumoto",
  title =        "Improved long-period generators based on linear
                 recurrences modulo $2$",
  journal =      j-TOMS,
  volume =       "32",
  number =       "1",
  pages =        "1--16",
  month =        mar,
  year =         "2006",
  CODEN =        "ACMSCU",
  DOI =          "https://doi.org/10.1145/1132973.1132974",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  MRclass =      "94A45 (65C10)",
  MRnumber =     "2272349 (2007h:94033)",
  MRreviewer =   "Ioannis Kontoyiannis",
  bibdate =      "Fri May 26 06:32:19 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toms/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Fast uniform random number generators with extremely
                 long periods have been defined and implemented based on
                 linear recurrences modulo $2$. The twisted GFSR and the
                 Mersenne twister are famous recent examples. Besides
                 the period length, the statistical quality of these
                 generators is usually assessed via their
                 equidistribution properties. The huge-period generators
                 proposed so far are not quite optimal in this respect.
                 In this article, we propose new generators of that form
                 with better equidistribution and ``bit-mixing''
                 properties for equivalent period length and speed. The
                 state of our new generators evolves in a more chaotic
                 way than for the Mersenne twister. We illustrate how
                 this can reduce the impact of persistent dependencies
                 among successive output values, which can be observed
                 in certain parts of the period of gigantic generators
                 such as the Mersenne twister.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software (TOMS)",
  journal-URL =  "http://portal.acm.org/toc.cfm?idx=J782",
  keywords =     "WELL (Well-Equidistributed Long-period Linear)
                 generator",
}

@Article{Polack:2006:CHR,
  author =       "Jean-Dominique Polack",
  title =        "Are concert halls random number generators?",
  journal =      j-J-ACOUST-SOC-AM,
  volume =       "120",
  number =       "5",
  pages =        "3101--3101",
  month =        "????",
  year =         "2006",
  CODEN =        "JASMAN",
  ISSN =         "0001-4966",
  ISSN-L =       "0001-4966",
  bibdate =      "Mon Jan 16 16:20:21 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://asadl.org/jasa/resource/1/jasman/v120/i5/p3101_s4",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Acoustical Society of America",
  journal-URL =  "http://scitation.aip.org/content/asa/journal/jasa",
}

@Article{Purczynski:2006:FGF,
  author =       "Jan Purczy{\'n}ski and Przemys{\l}aw W{\l}odarski",
  title =        "On fast generation of fractional {Gaussian} noise",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "50",
  number =       "10",
  pages =        "2537--2551",
  day =          "20",
  month =        jun,
  year =         "2006",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/j.csda.2005.04.021",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 22 11:41:05 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947305001003",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Rinehart:2006:PRN,
  author =       "Nicole J. Rinehart and John L. Bradshaw and Simon A.
                 Moss and Avril V. Brereton and Bruce J. Tonge",
  title =        "Pseudo-random number generation in children with
                 high-functioning autism and {Asperger}'s disorder:
                 further evidence for a dissociation in executive
                 functioning?",
  journal =      "Autism : the international journal of research and
                 practice",
  volume =       "10",
  number =       "1",
  pages =        "70--85",
  month =        jan,
  year =         "2006",
  DOI =          "https://doi.org/10.1177/1362361306062011",
  ISSN =         "1362-3613",
  bibdate =      "Fri Jun 7 11:13:15 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Autism: the international journal of research and
                 practice",
}

@Book{Ripley:2006:SS,
  author =       "Brian D. Ripley",
  title =        "Stochastic Simulation",
  publisher =    pub-WI,
  address =      pub-WI:adr,
  pages =        "xi + 237",
  year =         "2006",
  ISBN =         "0-470-00960-8",
  ISBN-13 =      "978-0-470-00960-4",
  LCCN =         "QA76.9.C65 R57 2006",
  bibdate =      "Thu Jan 5 13:54:59 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  series =       "Wiley series in probability and statistics",
  abstract =     "This book is a comprehensive guide to simulation
                 methods with explicit recommendations of methods and
                 algorithms. It covers both the technical aspects of the
                 subject, such as the generation of random numbers,
                 non-uniform variates and stochastic processes, and the
                 use of simulation. Supported by the relevant
                 mathematical theory, the text contains a great deal of
                 unpublished research material, including coverage of
                 the analysis of shift-register generators, sensitivity
                 analysis of normal variate generators, analysis of
                 simulation output and more.",
  acknowledgement = ack-nhfb,
  subject =      "Digital computer simulation; Stochastic processes;
                 Computersimulation; Stochastischer Prozess;
                 Stochastisches Modell",
}

@Misc{Rose:2006:CSP,
  author =       "Gregory Gordon Rose and Alexander Gantman and Lu
                 Xiao",
  title =        "Cryptographically secure pseudo-random number
                 generator",
  howpublished = "United States Patent 8,019,802.",
  day =          "23",
  month =        aug,
  year =         "2006",
  bibdate =      "Tue Dec 27 16:54:57 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http:www.google.com/patents/US8019802",
  abstract =     "A cryptographically secure pseudo-random number
                 generator is configured to obtain one or more
                 unpredictable sources of entropy that provide a seed. A
                 current internal state of the number generator is
                 modified as a function of the current internal state
                 and the seed to accumulate entropy. The modified
                 internal state may be obtained by using non-linear
                 feedback shift register operations on the internal
                 state and the seed. A pseudo-random number is then
                 generated based on the modified internal state of the
                 number generator. The one or more unpredictable sources
                 of entropy may be combined into the seed. The internal
                 state of the number generator may be continually
                 modified with additional seeds obtained from the one or
                 more unpredictable sources and the current internal
                 state. Additionally, the internal state of the number
                 generator may be modified on demand with a new seed
                 received from a calling application.",
  acknowledgement = ack-nhfb,
}

@Article{Rubin:2006:EGE,
  author =       "Herman Rubin and Brad C. Johnson",
  title =        "Efficient generation of exponential and normal
                 deviates",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "76",
  number =       "6",
  pages =        "509--518",
  month =        jun,
  year =         "2006",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/10629360500108004",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 07 08:34:38 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/10629360500108004",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
  onlinedate =   "01 Feb 2007",
  remark =       "Extension of prior work
                 \cite{Kronmal:1981:VAR,Kronmal:1982:CVA}, and
                 comparisons with ziggurat method
                 \cite{Marsaglia:2000:ZMG}.",
}

@Article{Rybakov:2006:LES,
  author =       "A. S. Rybakov",
  title =        "Letter to the editors: {``Spectral properties of a
                 linear congruential generator in special cases''
                 (Russian) [Diskret. Mat. {\bf 16} (2004), no. 2,
                 54--78; MR2084569]}",
  journal =      "Diskret. Mat.",
  volume =       "18",
  number =       "1",
  pages =        "158",
  year =         "2006",
  CODEN =        "????",
  ISSN =         "0234-0860",
  MRclass =      "11K99",
  MRnumber =     "2254742",
  bibdate =      "Wed Dec 21 07:59:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Diskretnaya Matematika",
}

@Article{Schanze:2006:EDT,
  author =       "Thomas Schanze",
  title =        "An exact {$D$}-dimensional {Tsallis} random number
                 generator for generalized simulated annealing",
  journal =      j-COMP-PHYS-COMM,
  volume =       "175",
  number =       "11--12",
  pages =        "708--712",
  day =          "1--15",
  month =        dec,
  year =         "2006",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2006.07.012",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465506002980",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Schmidt:2006:BRJ,
  author =       "Volker Schmidt",
  title =        "Book Review: {James E. Gentle: \booktitle{Random
                 number generation and Monte Carlo methods}}",
  journal =      j-METRIKA,
  volume =       "64",
  number =       "2",
  pages =        "251--252",
  month =        oct,
  year =         "2006",
  CODEN =        "MTRKA8",
  DOI =          "https://doi.org/10.1007/s00184-006-0089-0",
  ISSN =         "0026-1335 (print), 1435-926X (electronic)",
  ISSN-L =       "0026-1335",
  bibdate =      "Mon Feb 2 16:28:25 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/metrika.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/accesspage/article/10.1007/s00184-006-0089-0",
  acknowledgement = ack-nhfb,
  fjournal =     "Metrika",
  journal-URL =  "http://link.springer.com/journal/184",
}

@InBook{Schroeder:2006:RNG,
  author =       "Manfred R. Schroeder",
  title =        "Random Number Generators",
  crossref =     "Schroeder:2006:NTS",
  chapter =      "27",
  pages =        "287--292",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/3-540-26598-8_27",
  bibdate =      "Fri Mar 09 08:39:46 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sezgin:2006:DLP,
  author =       "F. Sezgin",
  title =        "Distribution of Lattice Points",
  journal =      j-COMPUTING,
  volume =       "78",
  number =       "2",
  pages =        "173--193",
  month =        oct,
  year =         "2006",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-006-0173-3",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "11A55; 65C10; 65Y05; 68Q22",
  bibdate =      "Tue Jul 8 22:32:47 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=78&issue=2;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=78&issue=2&spage=173",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "bad lattice points; good lattice points; lattice
                 rules; linear congruential generators; random number;
                 spectral test",
}

@InProceedings{Simka:2006:MTR,
  author =       "M. Simka and V. Fischer and M. Drutarovsky and J.
                 Fayolle",
  booktitle =    "{ISCAS 2006: 2006 IEEE International Symposium on
                 Circuits and Systems: Circuits and systems: at
                 crossroads of life and technology: proceedings: May
                 21--24: Kos International Convention Centre (KICC),
                 Island of Kos, Greece}",
  title =        "Model of a True Random Number Generator Aimed at
                 Cryptographic Application",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "5619--5623",
  year =         "2006",
  DOI =          "https://doi.org/10.1109/ISCAS.2006.1693909",
  ISBN =         "0-7803-9390-2",
  ISBN-13 =      "978-0-7803-9390-5",
  LCCN =         "TK454 .I15 2006",
  bibdate =      "Tue Jan 31 15:54:54 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "IEEE catalog number 06CH37717C.",
  URL =          "http://www.ieeexplore.ieee.org/xpl/RecentCon.jsp?punumber=11145",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Skoge:2006:PHH,
  author =       "Monica Skoge and Aleksandar Donev and Frank H.
                 Stillinger and Salvatore Torquato",
  title =        "Packing hyperspheres in high-dimensional {Euclidean}
                 spaces",
  journal =      j-PHYS-REV-E,
  volume =       "74",
  number =       "4",
  pages =        "041127",
  month =        oct,
  year =         "2006",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.74.041127",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Wed Feb 29 20:59:25 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aps.org/doi/10.1103/PhysRevE.74.041127",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
  keywords =     "parking-lot test; sphere packing",
  pagecount =    "11",
}

@Article{Steinfeld:2006:PSE,
  author =       "Ron Steinfeld and Josef Pieprzyk and Huaxiong Wang",
  title =        "On the Provable Security of an Efficient {RSA}-Based
                 Pseudorandom Generator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "4284",
  pages =        "194--209",
  year =         "2006",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/11935230_13",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Mar 13 08:42:37 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/11935230_13.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/11935230",
  book-URL =     "http://www.springerlink.com/content/978-3-540-49476-8",
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Tang:2006:EAT,
  author =       "Hui-Chin Tang",
  title =        "An exhaustive analysis of two-term multiple recursive
                 random number generators with efficient multipliers",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "192",
  number =       "2",
  pages =        "411--416",
  month =        aug,
  year =         "2006",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/j.cam.2005.06.001",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  bibdate =      "Fri Jan 6 09:56:55 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=1148032.1148047",
  abstract =     "This paper presents results of an exhaustive computer
                 search for the maximum spectral value in full period
                 two-term kth-order multiple recursive generators (MRGs)
                 with efficient multipliers. For orders $ k = 2, 3,
                 \ldots {}, 7 $, we provide a table of $k$ th-order MRGs
                 with largest spectral values. These MRGs not only have
                 the best spectral values found so far but also can be
                 implemented efficiently by applying the approximate
                 factoring method.",
  acknowledgement = ack-nhfb,
  acmid =        "1148047",
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "approximate factoring, multiple recursive generator,
                 random number, spectral test",
  pagecount =    "6",
  remark =       "From page 351 of the paper: ``Two exhaustive searches
                 took more than a year of CPU time on a 266 MHz Pentium
                 II PC\ldots{}.'' Tables on pages 352--353 give
                 recommended first- and second-order LCG parameters for
                 modulus $ M = 2^{31} - 1 $.",
}

@Article{Tang:2006:TAF,
  author =       "Hui-Chin Tang",
  title =        "Theoretical analyses of forward and backward
                 heuristics of multiple recursive random number
                 generators",
  journal =      j-EUR-J-OPER-RES,
  volume =       "174",
  number =       "3",
  pages =        "1760--1768",
  day =          "1",
  month =        nov,
  year =         "2006",
  CODEN =        "EJORDT",
  DOI =          "https://doi.org/10.1016/j.ejor.2005.03.041",
  ISSN =         "0377-2217 (print), 1872-6860 (electronic)",
  ISSN-L =       "0377-2217",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377221705003887",
  acknowledgement = ack-nhfb,
  fjournal =     "European Journal of Operational Research",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03772217",
}

@InProceedings{Thomas:2006:NUR,
  author =       "David B. Thomas and Wayne Luk",
  editor =       "Koen Bertels and Philip Leong and Eduardo Boemo",
  booktitle =    "{International Conference on Field Programmable Logic
                 and Applications, 2006: FPL '06, 28--30 August 2006,
                 Madrid, Spain: proceedings}",
  title =        "Non-uniform random number generation through piecewise
                 linear approximations",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  bookpages =    "xl + 975",
  pages =        "1--6",
  year =         "2006",
  DOI =          "https://doi.org/10.1109/FPL.2006.311219",
  ISBN =         "1-4244-0312-X",
  ISBN-13 =      "978-1-4244-0312-7",
  LCCN =         "TK7895.G36 I48 2006",
  bibdate =      "Thu Nov 24 09:15:25 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/4100981/",
  acknowledgement = ack-nhfb,
}

@Article{Wang:2006:SQR,
  author =       "P. X. Wang and G. L. Long and Y. S. Li",
  title =        "Scheme for a quantum random number generator",
  journal =      j-J-APPL-PHYS,
  volume =       "100",
  number =       "5",
  pages =        "056107",
  year =         "2006",
  CODEN =        "JAPIAU",
  DOI =          "https://doi.org/10.1063/1.2338830",
  ISSN =         "0021-8979 (print), 1089-7550 (electronic), 1520-8850",
  ISSN-L =       "0021-8979",
  bibdate =      "Mon Jan 16 15:57:34 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://link.aip.org/link/?JAP/100/056107/1",
  acknowledgement = ack-nhfb,
  eid =          "056107",
  fjournal =     "Journal of Applied Physics",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4915369",
  keywords =     "laser beams; optical beam splitters; optical prisms;
                 quantum optics; quantum theory; random number
                 generation; random sequences; true random numbers from
                 physical sources",
  pagecount =    "3",
}

@Article{Wichmann:2006:GGP,
  author =       "B. A. Wichmann and I. D. Hill",
  title =        "Generating good pseudo-random numbers",
  journal =      j-COMPUT-STAT-DATA-ANAL,
  volume =       "51",
  number =       "3",
  pages =        "1614--1622",
  day =          "1",
  month =        dec,
  year =         "2006",
  CODEN =        "CSDADW",
  DOI =          "https://doi.org/10.1016/j.csda.2006.05.019",
  ISSN =         "0167-9473 (print), 1872-7352 (electronic)",
  ISSN-L =       "0167-9473",
  bibdate =      "Wed Feb 8 07:02:04 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "This work extends a widely-used generator
                 \cite{Wichmann:1982:SAA} developed for 16-bit
                 arithmetic to a new four-part combination generator for
                 32-bit arithmetic with a period of $ 2^{121} \approx
                 10^{36} $.",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167947306001836",
  abstract =     "A widely used pseudo-random number generator has been
                 shown to be inadequate by today's standards. In
                 producing a revised generator, extensive use has been
                 made of a test package TestU01 for random number
                 generators. Using this, criteria have been devised for
                 the revised generator --- also other high-quality
                 generators have been identified. Facilities have been
                 devised to allow the new generator to be used in a
                 highly parallel environment, which is likely to be a
                 feature of many future applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Statistics \& Data Analysis",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01679473",
}

@Article{Wu:2006:PUM,
  author =       "Pei-Chi Wu and Kuo-Chan Huang",
  title =        "Parallel use of multiplicative congruential random
                 number generators",
  journal =      j-COMP-PHYS-COMM,
  volume =       "175",
  number =       "1",
  pages =        "25--29",
  month =        jul,
  year =         "2006",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2004.08.009",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Thu Dec 29 21:19:40 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465506001007",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Xu:2006:CFG,
  author =       "P. Xu and Y. L. Wong and T. K. Horiuchi and P. A.
                 Abshire",
  title =        "Compact floating-gate true random number generator",
  journal =      j-ELECT-LETTERS,
  volume =       "42",
  number =       "23",
  pages =        "1346--1347",
  day =          "9",
  month =        nov,
  year =         "2006",
  CODEN =        "ELLEAK",
  DOI =          "https://doi.org/10.1049/el:20062472",
  ISSN =         "0013-5194 (print), 1350-911X (electronic)",
  ISSN-L =       "0013-5194",
  bibdate =      "Fri Dec 30 16:39:35 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4027820",
  acknowledgement = ack-nhfb,
  book-URL =     "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
  fjournal =     "Electronics Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2220",
}

@Article{Atman:2007:ATA,
  author =       "Micah Atman and Jeff Gill and Michael P. McDonald",
  title =        "{\tt accuracy}: Tools for Accurate and Reliable
                 Statistical Computing",
  journal =      j-J-STAT-SOFT,
  volume =       "21",
  number =       "1",
  pages =        "1--30",
  month =        jul,
  year =         "2007",
  CODEN =        "JSSOBK",
  ISSN =         "1548-7660",
  bibdate =      "Fri Jul 4 10:54:16 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.jstatsoft.org/v21/i01",
  abstract =     "Most empirical social scientists are surprised that
                 low-level numerical issues in software can have
                 deleterious effects on the estimation process.
                 Statistical analyses that appear to be perfectly
                 successful can be invalidated by concealed numerical
                 problems. We have developed a set of tools, contained
                 in {\tt accuracy}, a package for R and S-PLUS, to
                 diagnose problems stemming from numerical and
                 measurement error and to improve the accuracy of
                 inferences. The tools included in {\tt accuracy}
                 include a framework for gauging the computational
                 stability of model results, tools for comparing model
                 results, optimization diagnostics, and tools for
                 collecting entropy for true random numbers
                 generation.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Software",
  journal-URL =  "http://www.jstatsoft.org/",
  pubdates =     "Submitted 2006-02-28; Accepted 2007-06-25",
}

@InProceedings{Aumasson:2007:BR,
  author =       "Jean-Philippe Aumasson",
  editor =       "????",
  booktitle =    "{State of the Art of Stream Ciphers Workshop (SASC
                 2007), eSTREAM, ECRYPT Stream Cipher Project, Report}",
  title =        "On a Bias of {Rabbit}",
  volume =       "29",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "2007",
  bibdate =      "Sat Apr 05 11:24:06 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://www.aumasson.jp/data/papers/Aum07.pdf;
                 https://www.researchgate.net/publication/252292685_On_a_bias_of_Rabbit",
  abstract =     "This paper demonstrates the existence of a non-null
                 bias in the keystream generated by the synchronous
                 stream cipher Rabbit, a candidate to the eSTREAM
                 project, from the observation that the core function is
                 strongly unbalanced. The keystream bias is greater than
                 2?124.5 for certain bits, and this leads to a
                 distinguisher requiring about 2247 128-bit samples of
                 keystream derived from random keys and random IV's,
                 which remains much higher than the cost of exhaustive
                 key search.",
  acknowledgement = ack-nhfb,
}

@Manual{Barker:2007:RRN,
  author =       "Elaine B. Barker and John M. Kelsey",
  title =        "Recommendation for random number generation using
                 deterministic random bit generators (revised)",
  type =         "{NIST} Special Publication",
  number =       "800-90",
  organization = pub-NIST,
  address =      pub-NIST:adr,
  pages =        "viii + 124",
  month =        mar,
  year =         "2007",
  bibdate =      "Tue Apr 19 13:35:20 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://csrc.nist.gov/publications/nistpubs/800-90/SP800-90revised_March2007.pdf;
                 https://www.nist.gov/publications/recommendation-random-number-generation-using-deterministic-random-bit-generators-2",
  abstract =     "This Recommendation specifies mechanisms for the
                 generation of random bits using deterministic methods.
                 The methods provided are based on either hash
                 functions, block cipher algorithms or number theoretic
                 problems.",
  acknowledgement = ack-nhfb,
  keywords =     "deterministic random bit generator (DRBG); entropy;
                 hash function; random number generator",
}

@Article{Bauke:2007:RNL,
  author =       "Heiko Bauke and Stephan Mertens",
  title =        "Random numbers for large-scale distributed {Monte
                 Carlo} simulations",
  journal =      j-PHYS-REV-E,
  volume =       "75",
  number =       "6(part 2)",
  pages =        "066701",
  month =        jun,
  year =         "2007",
  CODEN =        "PLEEE8",
  DOI =          "https://doi.org/10.1103/PhysRevE.75.066701",
  ISSN =         "1539-3755 (print), 1550-2376 (electronic)",
  ISSN-L =       "1539-3755",
  bibdate =      "Fri Feb 24 12:14:42 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://pre.aps.org/abstract/PRE/v75/i6/e066701",
  acknowledgement = ack-nhfb,
  fjournal =     "Physical Review E (Statistical physics, plasmas,
                 fluids, and related interdisciplinary topics)",
  journal-URL =  "http://pre.aps.org/browse",
}

@Article{Becher:2007:TUA,
  author =       "Ver{\'o}nica Becher and Santiago Figueira and Rafael
                 Picchi",
  title =        "{Turing}'s unpublished algorithm for normal numbers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "377",
  number =       "1--3",
  pages =        "126--138",
  day =          "31",
  month =        may,
  year =         "2007",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Mar 29 08:55:46 MDT 2011",
  bibsource =    "http://www.sciencedirect.com/science/journal/03043975;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2005.bib",
  abstract =     "In an unpublished manuscript, Alan Turing gave a
                 computable construction to show that absolutely normal
                 real numbers between 0 and 1 have Lebesgue measure 1;
                 furthermore, he gave an algorithm for computing
                 instances in this set. We complete his manuscript by
                 giving full proofs and correcting minor errors. While
                 doing this, we recreate Turing's ideas as accurately as
                 possible. One of his original lemmas remained unproved,
                 but we have replaced it with a weaker lemma that still
                 allows us to maintain Turing's proof idea and obtain
                 his result.",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "algorithm for normal numbers; computable absolutely
                 normal numbers; Turing's unpublished manuscript",
}

@Article{Bhatnagar:2007:ANB,
  author =       "Shalabh Bhatnagar",
  title =        "Adaptive {Newton-based} multivariate smoothed
                 functional algorithms for simulation optimization",
  journal =      j-TOMACS,
  volume =       "18",
  number =       "1",
  pages =        "2:1--2:35",
  month =        dec,
  year =         "2007",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/1315575.1315577",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Mon Jun 16 16:53:03 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  abstract =     "In this article, we present three smoothed functional
                 (SF) algorithms for simulation optimization. While one
                 of these estimates only the gradient by using a finite
                 difference approximation with two parallel simulations,
                 the other two are adaptive Newton-based stochastic
                 approximation algorithms that estimate both the
                 gradient and Hessian. One of the Newton-based
                 algorithms uses only one simulation and has a one-sided
                 estimate in both the gradient and Hessian, while the
                 other uses two-sided estimates in both quantities and
                 requires two simulations. For obtaining gradient and
                 Hessian estimates, we perturb each parameter component
                 randomly using independent and identically distributed
                 (i.i.d) Gaussian random variates.\par

                 The earlier SF algorithms in the literature only
                 estimate the gradient of the objective function. Using
                 similar techniques, we derive two unbiased SF-based
                 estimators for the Hessian and develop suitable
                 three-timescale stochastic approximation procedures for
                 simulation optimization. We present a detailed
                 convergence analysis of our algorithms and show
                 numerical experiments with parameters of dimension 50
                 on a setting involving a network of M / G /1 queues
                 with feedback. We compare the performance of our
                 algorithms with related algorithms in the literature.
                 While our two-simulation Newton-based algorithm shows
                 the best results overall, our one-simulation algorithm
                 shows better performance compared to other
                 one-simulation algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  keywords =     "Gaussian perturbations; Newton-based algorithms;
                 simulation optimization; smoothed functional
                 algorithms; three-timescale stochastic approximation",
}

@Article{Brent:2007:SLP,
  author =       "Richard Pierce Brent",
  title =        "Some long-period random number generators using shifts
                 and xors",
  journal =      j-ANZIAM-J,
  volume =       "48",
  number =       "??",
  pages =        "C188--C202",
  month =        "????",
  year =         "2007",
  CODEN =        "AJNOA2",
  ISSN =         "1446-1811 (print), 1446-8735 (electronic)",
  ISSN-L =       "1446-1811",
  bibdate =      "Sun Dec 18 09:09:42 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Proceedings of the Computational Techniques and
                 Applications Conference.",
  URL =          "http://journal.austms.org.au/ojs/index.php/ANZIAMJ/article/view/40/79",
  abstract =     "Marsaglia recently introduced a class of `xorshift'
                 random number generators with periods $ 2^n - 1 $ for $
                 n = 32, 64, \ldots $. Here Marsaglia's xorshift
                 generators are generalised to obtain fast and high
                 quality random number generators with extremely long
                 periods. Whereas random number generators based on
                 primitive trinomials may be unsatisfactory, because a
                 trinomial has very small weight, these new generators
                 can be chosen so that their minimal polynomials have a
                 large number of non-zero terms and, hence, a large
                 weight. A computer search using Magma found good random
                 number generators for $n$ a power of two up to 4096.
                 These random number generators are implemented in a
                 free software package {\tt xorgens}.",
  acknowledgement = ack-nhfb,
  fjournal =     "The ANZIAM Journal",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=ANZ",
}

@InProceedings{Brown:2007:SAN,
  author =       "Daniel R. L. Brown and Kristian Gj{\o}steen",
  title =        "A security analysis of the {NIST SP 800-90} elliptic
                 curve random number generator",
  crossref =     "Menezes:2007:ACC",
  pages =        "466--481",
  year =         "2007",
  bibdate =      "Fri Jan 6 09:50:45 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=1777777.1777815",
  abstract =     "An elliptic curve random number generator (ECRNG) has
                 been approved in a NIST standard and proposed for ANSI
                 and SECG draft standards. This paper proves that, if
                 three conjectures are true, then the ECRNG is secure.
                 The three conjectures are hardness of the elliptic
                 curve decisional Diffie--Hellman problem and the
                 hardness of two newer problems, the $x$-logarithm
                 problem and the truncated point problem. The
                 $x$-logarithm problem is shown to be hard if the
                 decisional Diffie-Hellman problem is hard, although the
                 reduction is not tight. The truncated point problem is
                 shown to be solvable when the minimum amount of bits
                 allowed in NIST standards are truncated, thereby making
                 it insecure for applications such as stream ciphers.
                 Nevertheless, it is argued that for nonce and key
                 generation this distinguishability is harmless.",
  acknowledgement = ack-nhfb,
  acmid =        "1777815",
  keywords =     "elliptic curve cryptography, random number
                 generation",
  location =     "Santa Barbara, CA, USA",
  pagecount =    "16",
}

@Article{Cheung:2007:HGA,
  author =       "Ray C. C. Cheung and Dong-U Lee and Wayne Luk and John
                 D. Villasenor",
  title =        "Hardware generation of arbitrary random number
                 distributions from uniform distributions via the
                 inversion method",
  journal =      j-IEEE-TRANS-VLSI-SYST,
  volume =       "15",
  number =       "8",
  pages =        "952--962",
  month =        aug,
  year =         "2007",
  CODEN =        "IEVSE9",
  DOI =          "https://doi.org/10.1109/TVLSI.2007.900748",
  ISSN =         "1063-8210 (print), 1557-9999 (electronic)",
  ISSN-L =       "1063-8210",
  bibdate =      "Thu Nov 24 08:04:19 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/4276772/",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Very Large Scale Integration
                 (VLSI) Systems",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/issues?punumber=92",
}

@Article{Chiu:2007:CKC,
  author =       "Sung Nok Chiu",
  title =        "Correction to {Koen}'s critical values in testing
                 spatial randomness",
  journal =      j-J-STAT-COMPUT-SIMUL,
  volume =       "77",
  number =       "11",
  pages =        "1001--1004",
  month =        nov,
  year =         "2007",
  CODEN =        "JSCSAJ",
  DOI =          "https://doi.org/10.1080/10629360600989147",
  ISSN =         "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
  ISSN-L =       "0094-9655",
  bibdate =      "Tue Feb 7 07:55:24 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See \cite{Koen:1991:ACB}.",
  URL =          "http://www.tandfonline.com/doi/abs/10.1080/10629360600989147",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Statistical Computation and Simulation",
  journal-URL =  "http://www.tandfonline.com/loi/gscs20",
}

@Article{Cowles:2007:BRB,
  author =       "Mary Kathryn Cowles",
  title =        "Book review: {{\booktitle{Automatic Nonuniform Random
                 Variate Generation}}}",
  journal =      j-J-AM-STAT-ASSOC,
  volume =       "102",
  number =       "479",
  pages =        "1079--1080",
  month =        sep,
  year =         "2007",
  CODEN =        "JSTNAL",
  DOI =          "https://doi.org/10.1198/jasa.2007.s210",
  ISSN =         "0162-1459 (print), 1537-274X (electronic)",
  ISSN-L =       "0162-1459",
  bibdate =      "Thu Aug 26 11:26:31 MDT 2010",
  bibsource =    "http://www.amstat.org/publications/jasa/;
                 https://www.math.utah.edu/pub/tex/bib/jamstatassoc2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the American Statistical Association",
  journal-URL =  "http://www.tandfonline.com/loi/uasa20",
}

@Book{Delfs:2007:ICP,
  author =       "Hans Delfs and Helmut Knebl",
  title =        "Introduction to Cryptography: Principles and
                 Applications",
  volume =       "1",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 367",
  year =         "2007",
  DOI =          "https://doi.org/10.1007/3-540-49244-5",
  ISBN =         "3-540-49243-7 (hardcover), 3-540-49244-5",
  ISBN-13 =      "978-3-540-49243-6 (hardcover), 978-3-540-49244-3",
  ISSN =         "1619-7100 (print), 2197-845X (electronic)",
  ISSN-L =       "1619-7100",
  LCCN =         "QA76.9A25 D44 2007; QA76.9.D35",
  bibdate =      "Sat Jun 10 08:34:43 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Information Security and Cryptography",
  URL =          "http://www.springerlink.com/content/gm2886",
  abstract =     "In the first part, this book covers the key concepts
                 of cryptography on an undergraduate level, from
                 encryption and digital signatures to cryptographic
                 protocols. Essential techniques are demonstrated in
                 protocols for key exchange, user identification,
                 electronic elections and digital cash. In the second
                 part, more advanced topics are addressed, such as the
                 bit security of one-way functions and computationally
                 perfect pseudorandom bit generators. The security of
                 cryptographic schemes is a central topic. Typical
                 examples of provably secure encryption and signature
                 schemes and their security proofs are given. Though
                 particular attention is given to the mathematical
                 foundations, no special background in mathematics is
                 presumed. The necessary algebra, number theory and
                 probability theory are included in the appendix. Each
                 chapter closes with a collection of exercises.",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography; Computer networks;
                 Security measures; Cryptography; Security measures;
                 Computer security; Informatique; Security measures;
                 Computer security; Cryptography; Coding theory; Data
                 encryption (Computer science); Data protection; Data
                 structures (Computer science); Number theory; Coding
                 theory; Data encryption (Computer science); Data
                 protection; Data structures (Computer science); Number
                 theory.",
  tableofcontents = "1. Introduction \\
                 2. Symmetric-key encryption \\
                 3. Public-key cryptography \\
                 4. Cryptographic protocols \\
                 5. Probabilistic algorithms \\
                 6. One-way functions and the basic assumptions \\
                 7. Bit security of one-way functions \\
                 8. One-way functions and pseudorandomness \\
                 9. Provably secure encryption \\
                 10. Provably secure digital signatures \\
                 A. Algebra and number theory \\
                 B. Probabilities and information theory \\
                 References \\
                 Index",
}

@Article{Doornik:2007:CHP,
  author =       "Jurgen A. Doornik",
  title =        "Conversion of high-period random numbers to floating
                 point",
  journal =      j-TOMACS,
  volume =       "17",
  number =       "1",
  pages =        "3:1--3:5",
  month =        jan,
  year =         "2007",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/1189756.1189759",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Sat Apr 14 09:34:46 MDT 2007",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Conversion of unsigned 32-bit random integers to
                 double precision floating point is discussed. It is
                 shown that the standard practice can be unnecessarily
                 slow and inflexible. It is argued that simulation
                 experiments could benefit from making better use of the
                 available precision.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}

@TechReport{Dorrendorf:2007:CRNa,
  author =       "Leo Dorrendorf and Zvi Gutterman and Benny Pinkas",
  title =        "Cryptanalysis of the Random Number Generator of the
                 {Windows} Operating System",
  type =         "Technical report",
  number =       "2007/419",
  institution =  "Cryptology ePrint Archive, International Association
                 for Cryptologic Research",
  address =      "San Jose, CA, USA",
  year =         "2007",
  bibdate =      "Fri Nov 16 16:07:16 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://eprint.iacr.org/2007/419",
  abstract =     "The pseudo-random number generator (PRNG) used by the
                 Windows operating system is the most commonly used
                 PRNG. The pseudo-randomness of the output of this
                 generator is crucial for the security of almost any
                 application running in Windows. Nevertheless, its exact
                 algorithm was never published.\par We examined the
                 binary code of a distribution of Windows 2000, which is
                 still the second most popular operating system after
                 Windows XP. (This investigation was done without any
                 help from Microsoft.) We reconstructed, for the first
                 time, the algorithm used by the pseudo-random number
                 generator (namely, the function CryptGenRandom). We
                 analyzed the security of the algorithm and found a
                 non-trivial attack: given the internal state of the
                 generator, the previous state can be computed in $
                 O(2^{23}) $ work (this is an attack on the
                 forward-security of the generator, an $ O(1) $ attack
                 on backward security is trivial). The attack on
                 forward-security demonstrates that the design of the
                 generator is flawed, since it is well known how to
                 prevent such attacks.\par We also analyzed the way in
                 which the generator is run by the operating system, and
                 found that it amplifies the effect of the attacks: The
                 generator is run in user mode rather than in kernel
                 mode, and therefore it is easy to access its state even
                 without administrator privileges. The initial values of
                 part of the state of the generator are not set
                 explicitly, but rather are defined by whatever values
                 are present on the stack when the generator is called.
                 Furthermore, each process runs a different copy of the
                 generator, and the state of the generator is refreshed
                 with system generated entropy only after generating 128
                 KBytes of output for the process running it. The result
                 of combining this observation with our attack is that
                 learning a single state may reveal 128 Kbytes of the
                 past and future output of the generator.\par The
                 implication of these findings is that a buffer overflow
                 attack or a similar attack can be used to learn a
                 single state of the generator, which can then be used
                 to predict all random values, such as SSL keys, used by
                 a process in all its past and future operation. This
                 attack is more severe and more efficient than known
                 attacks, in which an attacker can only learn SSL keys
                 if it is controlling the attacked machine at the time
                 the keys are used.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dorrendorf:2007:CRNb,
  author =       "Leo Dorrendorf and Zvi Gutterman and Benny Pinkas",
  editor =       "Rebecca N. Wright and Paul F. Syverson and David
                 Evans",
  booktitle =    "{CCS '07: proceedings of the 14th ACM Conference on
                 Computer and Communications Security: Alexandria,
                 Virginia, USA, October 29--November 2, 2007}",
  title =        "Cryptanalysis of the Random Number Generator of the
                 {Windows} Operating System",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "xv + 612",
  pages =        "476--485",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1315245.1315304",
  ISBN =         "1-59593-703-X",
  ISBN-13 =      "978-1-59593-703-2",
  LCCN =         "QA76.9.A25",
  bibdate =      "Fri Jan 06 09:36:58 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 jenson.stanford.edu:2210/unicorn",
  abstract =     "The pseudo-random number generator (PRNG) used by the
                 Windows operating system is the most commonly used
                 PRNG. The pseudo-randomness of the output of this
                 generator is crucial for the security of almost any
                 application running in Windows. Nevertheless, its exact
                 algorithm was never published.\par

                 We examined the binary code of a distribution of
                 Windows 2000, which is still the second most popular
                 operating system after Windows XP. (This investigation
                 was done without any help from Microsoft.) We
                 reconstructed, for the first time, the algorithm used
                 by the pseudo-random number generator (namely, the
                 function CryptGenRandom). We analyzed the security of
                 the algorithm and found a non-trivial attack: given the
                 internal state of the generator, the previous state can
                 be computed in $ O(2^{23}) $ work (this is an attack on
                 the forward-security of the generator, an $ O(1) $
                 attack on backward security is trivial). The attack on
                 the forward-security demonstrates that the design of
                 the generator is flawed, since it is well known how to
                 prevent such attacks.\par

                 We also analyzed the way in which the generator is run
                 by the operating system, and found that it amplifies
                 the effect of the attacks. As a result, learning a
                 single state may reveal 128 Kbytes of the past and
                 future output of the generator. The implication of
                 these findings is that a buffer overflow attack or a
                 similar attack can be used to learn a single state of
                 the generator, which can then be used to predict all
                 random values, such as SSL keys, used by a process in
                 all its past and future operation. This attack is more
                 severe and more efficient than known attacks, in which
                 an attacker can only learn SSL keys if it is
                 controlling the attacked machine at the time the keys
                 are used.",
  acknowledgement = ack-nhfb,
  xxeditor =     "Sabrina {De Capitani di Vimercati}; Paul Syverson and
                 David Evans.",
}

@InProceedings{Drutarovsky:2007:RCB,
  author =       "M. Drutarovsky and P. Galajda",
  editor =       "{IEEE}",
  booktitle =    "{17th International Conference Radioelektronika,
                 24--25 April, 2007, Brno, Czech Republic}",
  title =        "A Robust Chaos-Based True Random Number Generator
                 Embedded in Reconfigurable Switched-Capacitor
                 Hardware",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "1--6",
  year =         "2007",
  DOI =          "https://doi.org/10.1109/RADIOELEK.2007.371423",
  ISBN =         "1-4244-0821-0 (paperback), 1-4244-0822-9 (e-book)",
  ISBN-13 =      "978-1-4244-0821-4 (paperback), 978-1-4244-0822-1
                 (e-book)",
  LCCN =         "TK6541",
  bibdate =      "Thu Feb 23 09:12:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  keywords =     "true random numbers from physical sources",
}

@Article{Dupuis:2007:ISS,
  author =       "Paul Dupuis and Kevin Leder and Hui Wang",
  title =        "Importance sampling for sums of random variables with
                 regularly varying tails",
  journal =      j-TOMACS,
  volume =       "17",
  number =       "3",
  pages =        "14:1--14:21",
  month =        jul,
  year =         "2007",
  CODEN =        "ATMCEZ",
  DOI =          "https://doi.org/10.1145/1243991.1243995",
  ISSN =         "1049-3301 (print), 1558-1195 (electronic)",
  ISSN-L =       "1049-3301",
  bibdate =      "Mon Jun 16 16:52:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tomacs/;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
  abstract =     "Importance sampling is a variance reduction technique
                 for efficient estimation of rare-event probabilities by
                 Monte Carlo. For random variables with heavy tails
                 there is little consensus on how to choose the change
                 of measure used in importance sampling. In this article
                 we study dynamic importance sampling schemes for sums
                 of independent and identically distributed random
                 variables with regularly varying tails. The number of
                 summands can be random but must be independent of the
                 summands. For estimating the probability that the sum
                 exceeds a given threshold, we explicitly identify a
                 class of dynamic importance sampling algorithms with
                 bounded relative errors. In fact, these schemes are
                 nearly asymptotically optimal in the sense that the
                 second moment of the corresponding importance sampling
                 estimator can be made as close as desired to the
                 minimal possible value.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Modeling and Computer Simulation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J781",
  keywords =     "asymptotically optimal relative error; bounded
                 relative error; dynamic importance sampling; rare
                 events; regularly varying tails; variance reduction",
}

@InProceedings{Echeverria:2007:FGR,
  author =       "Pedro Echeverria and Marisa Lopez-Vallejo",
  editor =       "{IEEE}",
  booktitle =    "{50th Midwest Symposium on Circuits and Systems, 2007:
                 MWSCAS 2007, Montr{\'e}al, QC, Canada, 5--8 August
                 2007}",
  title =        "{FPGA Gaussian} random number generator based on
                 quintic {Hermite} interpolation inversion",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "871--874",
  year =         "2007",
  DOI =          "https://doi.org/10.1109/MWSCAS.2007.4488710",
  ISBN =         "1-4244-1175-0, 1-4244-1176-9",
  ISBN-13 =      "978-1-4244-1175-7, 978-1-4244-1176-4",
  LCCN =         "TK3226 .M55 2007",
  bibdate =      "Thu Nov 24 08:10:58 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://ieeexplore.ieee.org/document/4488710/",
  acknowledgement = ack-nhfb,
}

@Book{Edgington:2007:RT,
  author =       "Eugene S. Edgington and Patrick Onghena",
  title =        "Randomization tests",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  edition =      "Fourth",
  pages =        "345",
  year =         "2007",
  ISBN =         "1-58488-589-0",
  ISBN-13 =      "978-1-58488-589-4",
  LCCN =         "QA277 .E32 2007",
  bibdate =      "Thu Jan 26 12:03:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Statistics, textbooks and monographs",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0745/2006032352-d.html;
                 http://www.loc.gov/catdir/toc/ecip072/2006032352.html",
  acknowledgement = ack-nhfb,
  subject =      "Statistical hypothesis testing",
}