An improved exact sampling algorithm for the standard normal distribution (Q2135885): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3723577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected bit complexity of the von Neumann rejection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generating an exponentially distributed variate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Exactly from the Normal Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian sampling over the integers: efficient, generic, constant-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5810192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers / rank
 
Normal rank

Latest revision as of 22:53, 28 July 2024

scientific article
Language Label Description Also known as
English
An improved exact sampling algorithm for the standard normal distribution
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references