Succinct sampling from discrete distributions

DOI10.1145/2488608.2488707zbMath1293.62019OpenAlexW2139639963MaRDI QIDQ5495848

Kasper Green Larsen, Karl Bringmann

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488707

zbMATH Keywords

Walkeralias method

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (5)

Succinct indices for path minimum, with applications ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ Efficient sampling methods for discrete distributions ⋮ Parallel Weighted Random Sampling ⋮ Sampling in space restricted settings

This page was built for publication: Succinct sampling from discrete distributions