Lattice computations for random numbers

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Mathematics of Computation

• Publication date

  2000-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1090/S0025-5718-99-01112-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Maximally equidistributed combined Tausworthe generators

  1996cited by this paper
• The k -dimensional distribution of combined GFSR sequences

  1994cited by this paper
• New Primitive Trinomials Of Mersenne-Exponent Degrees For Random-Number Generation

  1992cited by this paper
• Supplement to On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences

  1991cited by this paper
• The k-distribution of generalized feedback shift register pseudorandom numbers

  1983cited by this paper
• Factoring multivariate polynomials over finite fields

  1983cited by this paper
• An Analogue to Minkowski's Geometry of Numbers in a Field of Series

  1941cited by this paper

• Online Appendix to : Implementing 64-bit Maximally Equidistributed F 2-Linear Generators with Mersenne Prime Period

  2017cites this paper
• Conversion of Mersenne Twister to double-precision floating-point numbers

  2017cites this paper
• Implementing 64-bit Maximally Equidistributed Mersenne Twisters

  2015cites this paper
• Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period

  2015cites this paper
• On the matrix feedback shift register synthesis for matrix sequences

  2015cites this paper
• The hybrid spectral test: a unifying concept

  2014cites this paper
• The hybrid spectral test

  2013influential citation
• An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm

  2011cites this paper
• Fast lattice reduction for F2-linear pseudorandom number generators

  2010cites this paper
• Maximally equidistributed pseudorandom number generators via linear output transformations

  2009cites this paper
• F2-Linear Random Number Generators

  2009influential citation
• Monte Carlo and Quasi-Monte Carlo Sampling

  2009cites this paper
• Random Number Generation

  2008cites this paper
• A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space

  2008cites this paper
• 2 F 2-Linear Generators 2 . 1 General Framework

  2007cites this paper
• F 2-Linear Random Number Generators

  2007influential citation
• Stochastic Computer Simulation

  2006cites this paper
• Chapter 3 Uniform Random Number Generation

  2006cites this paper
• Chapter 3 – Random Number Generation

  2006cites this paper
• Fast random number generators based on linear recurrences modulo 2: overview and comparison

  2005cites this paper
• Construction d'ensembles de points basee sur des recurrences lineaires dans un corps fini de caracteristique 2 pour la simulation Monte Carlo et l'integration quasi-Monte Carlo

  2004cites this paper
• Improved long-period generators based on linear recurrences modulo 2

  2004cites this paper
• Polynomial Integration Lattices

  2004cites this paper
• Quasi-monte carlo methods in practice: quasi-monte carlo methods for simulation

  2003cites this paper
• Quasi-Monte Carlo methods for simulation

  2003influential citation
• Recent Advances in Randomized Quasi-Monte Carlo Methods

  2002cites this paper
• Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation

  2001influential citation
• A new class of linear feedback shift register generators

  2000cites this paper
• Variance Reduction via Lattice Rules

  1999cites this paper
• Uniform random number generators

  1998cites this paper