Dynamic generation of discrete random variates
From MaRDI portal
Publication:1405782
DOI10.1007/s00224-003-1078-6zbMath1040.68146OpenAlexW3136533148MaRDI QIDQ1405782
Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni
Publication date: 26 August 2003
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1808/7224
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (7)
Dynamic sampling from a discrete probability distribution with a known distribution of rates ⋮ Efficient sampling methods for discrete distributions ⋮ Parallel Weighted Random Sampling ⋮ Unnamed Item ⋮ A nearly linear-time PTAS for explicit fractional packing and covering linear programs ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ A method to reduce the rejection rate in Monte Carlo Markov chains
This page was built for publication: Dynamic generation of discrete random variates
