scientific article; zbMATH DE number 4110061

MaRDI QIDQ3833592zbMATH OpenFDO

Authors B. B. Pokhodzej

Publication date 1989

zbMATH Keywords

complexityfinite discrete distributionsvon Neumann's discrete analog method algorithm

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Statistical distribution theory (62E99) Probabilistic methods, stochastic differential equations (65C99)

Recommendations

• scientific article; zbMATH DE number 3982481
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 3982480
• scientific article; zbMATH DE number 4048803
• The expected bit complexity of the von Neumann rejection algorithm

Cited in

(7)

• Remarks on the complexity of simulation of a ``simple geometric distribution
• Sharp entropy bounds for discrete statistical simulation
• scientific article; zbMATH DE number 4129950 (Why is no real title available?)
• scientific article; zbMATH DE number 3878059 (Why is no real title available?)
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 3982481 (Why is no real title available?)
• scientific article; zbMATH DE number 4048803 (Why is no real title available?)

This page was built for publication:

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