Efficient Sampling Methods for Discrete Distributions

DOI10.1007/978-3-642-31594-7_12zbMath1272.62011OpenAlexW183198974MaRDI QIDQ2843242

Karl Bringmann, Konstantinos D. Panagiotou

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-002B-85D0-8

Mathematics Subject Classification ID

Related Items (4)

Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ Sampling in space restricted settings ⋮ Bayesian Shape Clustering

This page was built for publication: Efficient Sampling Methods for Discrete Distributions