Binary decompositions of probability densities and random-bit simulation

DOI10.1515/mcma-2020-2063OpenAlexW3032518287MaRDI QIDQ777909

Vladimir Nekrutkin

Publication date: 8 July 2020

Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/mcma-2020-2063

zbMATH Keywords

complexity of simulationrandom-bit simulation

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Cites Work

• On the complexity of binary floating point pseudorandom generation
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Grid methods in simulation and random variate generation
• Randomness complexity of private computation
• The expected bit complexity of the von Neumann rejection algorithm
• Quantum and classical tradeoffs
• High Precision Discrete Gaussian Sampling on FPGAs
• The complexity of generating an exponentially distributed variate
• On Distributions Computable by Random Walks on Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary decompositions of probability densities and random-bit simulation