The complexity of generating an exponentially distributed variate

DOI10.1016/0196-6774(86)90014-3zbMath0631.68034OpenAlexW2017952514MaRDI QIDQ3768393

Nasser Saheb, Philippe Flajolet

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076400/file/RR-0159.pdf

zbMATH Keywords

exponentially distributed variate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10)

Related Items (9)

An improved exact sampling algorithm for the standard normal distribution ⋮ Efficient sampling methods for discrete distributions ⋮ Searching for losers ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms ⋮ Complexity Questions in Non-Uniform Random Variate Generation ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ Sampling Exactly from the Normal Distribution ⋮ Binary decompositions of probability densities and random-bit simulation

This page was built for publication: The complexity of generating an exponentially distributed variate