Binary decompositions of probability densities and random-bit simulation

DOI10.1515/MCMA-2020-2063OpenAlexW3032518287MaRDI QIDQ777909FDOQ777909

Authors: 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
• Title not available (Why is that?)
• Grid methods in simulation and random variate generation
• The complexity of generating an exponentially distributed variate
• High Precision Discrete Gaussian Sampling on FPGAs
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Randomness complexity of private computation
• The expected bit complexity of the von Neumann rejection algorithm
• Quantum and classical tradeoffs
• Title not available (Why is that?)
• On Distributions Computable by Random Walks on Graphs

Cited In (3)

• The distributions of individual bits in the output of multiplicative operations
• Title not available (Why is that?)
• Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777909)