Exact Sublinear Binomial Sampling

DOI10.1007/978-3-642-45030-3_23MaRDI QIDQ2872089zbMATH OpenOpenAlexFDO

Authors Martin Farach-Colton, Meng-Tsung Tsai

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_23

Mathematics Subject Classification ID

Recommendations

• Exact sublinear binomial sampling
• Binomial subsampling
• Faster sublinear algorithms using conditional sampling
• Sublinear time approximate sum via uniform random sampling
• Fast perfect sampling from linear extensions
• Sampling from binomial and Poisson distributions: a method with bounded computation times
• Exact sampling for intractable probability distributions via a Bernoulli factory
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Fast sampling of perfectly uniform satisfying assignments
• Polynomial time approximate or perfect samplers for discretized Dirichlet distribution

Cited in

(1)

• Exact sublinear binomial sampling

Describes a project that uses

Uses Software

• gmp
• R
• GSL

This page was built for publication: Exact Sublinear Binomial Sampling

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