


























This article presents an efficient algorithm to generate a discrete uniform distribution on a set of $p$ elements using a biased random source for $p$ prime. The algorithm generalizes Von Neumann's method and improves computational efficiency of Dijkstra's method. In addition, the algorithm is extended to generate discrete uniform distribution on any finite set based on the prime factorization of integers. The time complexity of the proposed algorithm is overall sublinear $\operatorname{O}(n/\log n)$
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。