Pages that link to "Item:Q3768393"
From MaRDI portal
The following pages link to The complexity of generating an exponentially distributed variate (Q3768393):
Displaying 9 items.
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- Binary decompositions of probability densities and random-bit simulation (Q777909) (← links)
- An improved exact sampling algorithm for the standard normal distribution (Q2135885) (← links)
- Efficient sampling methods for discrete distributions (Q2408923) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Sampling Exactly from the Normal Distribution (Q2828164) (← links)
- Complexity Questions in Non-Uniform Random Variate Generation (Q3298440) (← links)
- Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms (Q3793730) (← links)
- Searching for losers (Q4034711) (← links)
