Generating Random Permutations by Coin Tossing-Reference-Cited by-同舟云学术

Generating Random Permutations by Coin Tossing

Published:2017-05-29 Issue:2 Volume:13 Page:1-43
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Bacher Axel¹,Bodini Olivier¹,Hwang Hsien-Kuei²,Tsai Tsung-Hsi²

Affiliation:

1. LIPN, Université Paris 13, Villetaneuse

2. Academia Sinica, Taipei, Taiwan

Abstract

Several simple, classical, little-known algorithms in the statistics and computer science literature for generating random permutations by coin tossing are examined, analyzed, and implemented. These algorithms are either asymptotically optimal or close to being so in terms of the expected number of times the random bits are generated. In addition to asymptotic approximations to the expected complexity, we also clarify the corresponding variances, as well as the asymptotic distributions. A brief comparative discussion with numerical computations in a multicore system is also given.

Funder

ANR-MOST Joint Project MetAConC

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/3009909

Reference56 articles.

1. Parallel algorithms for generating random permutations on a shared memory machine

2. E. B. Barker and J. M. Kelsey. 2007. Recommendation for Random Number Generation using Deterministic Random Bit Generators (Revised). U.S. Department of Commerce Technology Administration National Institute of Standards and Technology Computer Security Division Information Technology Laboratory. E. B. Barker and J. M. Kelsey. 2007. Recommendation for Random Number Generation using Deterministic Random Bit Generators (Revised). U.S. Department of Commerce Technology Administration National Institute of Standards and Technology Computer Security Division Information Technology Laboratory.

3. K. J. Berry J. E. Johnston and P. W. Mielke Jr. 2014. A Chronicle of Permutation Statistical Methods (1920--2000 and Beyond). Springer Berlin. K. J. Berry J. E. Johnston and P. W. Mielke Jr. 2014. A Chronicle of Permutation Statistical Methods (1920--2000 and Beyond). Springer Berlin.

4. The generation of random permutations on the fly

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient isochronous fixed-weight sampling with applications to NTRU;IACR Communications in Cryptology;2024-07-08

2. Transposition Cipher as a Solution for a Better Bank Verification Number (BVN) Security in Communication Channel;International Journal of Innovative Science and Research Technology (IJISRT);2024-06-17

3. WAS: improved white-box cryptographic algorithm over AS iteration;Cybersecurity;2023-12-08

4. Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study;Advances in Applied Mathematics;2022-02

5. Bandwidth-Optimal Random Shuffling for GPUs;ACM Transactions on Parallel Computing;2022-01-31