Fast algorithms for generating discrete random variates with changing distributions

DOI10.1145/151527.151529zbMath0842.68035OpenAlexW2013491876MaRDI QIDQ4876065

Keith W. Ross, Sanguthevar Rajasekaran

Publication date: 13 June 1996

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cis_reports/142

zbMATH Keywords

discrete-event dynamic systemMarkovian queuing networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (5)

Dynamic sampling from a discrete probability distribution with a known distribution of rates ⋮ Unnamed Item ⋮ Maintaining discrete probability distributions optimally ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ Non-uniform random variate generation by the vertical strip method

This page was built for publication: Fast algorithms for generating discrete random variates with changing distributions