Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?
M Waechter, K Hamacher, F Hoffgaard… - Parallel Processing and …, 2012 - Springer
Many papers on parallel random permutation algorithms assume the input size n to be a
power of two and imply that these algorithms can be easily generalized to arbitrary n. We …
power of two and imply that these algorithms can be easily generalized to arbitrary n. We …
[PDF][PDF] Is Your Permutation Algorithm Unbiased for n= 2m?
M Waechter, K Hamacher, F Hoffgaard, S Widmer… - download.hrz.tu-darmstadt.de
Many papers on parallel random permutation algorithms assume the input size n to be a
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …
Is your permutation algorithm unbiased for n ≠ 2m?
M Waechter, K Hamacher, F Hoffgaard… - Proceedings of the 9th …, 2011 - dl.acm.org
Many papers on parallel random permutation algorithms assume the input size n to be a
power of two and imply that these algorithms can be easily generalized to arbitrary n. We …
power of two and imply that these algorithms can be easily generalized to arbitrary n. We …
[PDF][PDF] Is Your Permutation Algorithm Unbiased for n= 2m?
M Waechter, K Hamacher, F Hoffgaard, S Widmer… - Citeseer
Many papers on parallel random permutation algorithms assume the input size n to be a
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …
[PDF][PDF] Is Your Permutation Algorithm Unbiased for n= 2m?
M Waechter, K Hamacher, F Hoffgaard, S Widmer… - download.hrz.tu-darmstadt.de
Many papers on parallel random permutation algorithms assume the input size n to be a
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …
power of two and imply that these algorithms can be easily generalized to arbitrary n, eg, by …