scientific article; zbMATH DE number 3982481

MaRDI QIDQ3746855zbMATH OpenFDO

Authors B. B. Pokhodzej

Publication date 1986

zbMATH Keywords

complexitydiscrete random variablesoptimal algorithmsprobability distributionsWalker's method

Mathematics Subject Classification ID

Distribution theory (60E99) Probabilistic methods, stochastic differential equations (65C99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4110061
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 3982480
• scientific article; zbMATH DE number 4048803
• Algorithms for generating random variables with a rational probability-generating function

Cited in

(11)

• Remarks on the complexity of simulation of a ``simple geometric distribution
• An analysis of the alias method for discrete random-variate generation
• scientific article; zbMATH DE number 4129950 (Why is no real title available?)
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 3954271 (Why is no real title available?)
• scientific article; zbMATH DE number 3982480 (Why is no real title available?)
• The complexity of generating an exponentially distributed variate
• scientific article; zbMATH DE number 4048803 (Why is no real title available?)
• scientific article; zbMATH DE number 4110061 (Why is no real title available?)
• On Distributions Computable by Random Walks on Graphs
• On distributions computable by random walks on graphs

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 Q3746855)