Fisher–Yates shuffle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Fisher–Yates shuffle" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

4worldcat.org

5^th place

3acm.org

1,185^th place

840^th place

2semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1isa-afp.org

low place

1golangprojectstructure.com

low place

1handle.net

102^nd place

76^th place

1nist.gov

355^th place

454^th place

1inria.fr

4,903^rd place

3,679^th place

1codinghorror.com

low place

1okmij.org

low place

1szeryf.wordpress.com

low place

1robweir.com

low place

1microsoft.com

153^rd place

151^st place

1gnu.org

1,475^th place

1,188^th place

1stackoverflow.com

4,643^rd place

2,973^rd place

1pcg-random.org

low place

1c-faq.com

low place

1anu.edu.au

942^nd place

597^th place

1benpfaff.org

low place

1peteroupc.github.io

low place

acm.org

dl.acm.org

Durstenfeld, R. (July 1964). "Algorithm 235: Random permutation" (PDF). Communications of the ACM. 7 (7): 420. doi:10.1145/364520.364540. S2CID 494994.
Richard, Anderson (1990). "Parallel algorithms for generating random permutations on a shared memory machine". Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90. pp. 95–102. doi:10.1145/97444.97674. ISBN 0-89791-370-1. Retrieved 20 September 2024.

cacm.acm.org

Seacord, Robert C. (1 April 2017). "Uninitialized Reads: Understanding the proposed revisions to the C language". Communications of the ACM. 60 (4): 40–44. doi:10.1145/3024920. Copying uninitialized memory is legal in C if performed by memcpy(a+i, a+j, sizeof a[i]);.

anu.edu.au

maths-people.anu.edu.au

Arndt, Jörg (2009). Generating Random Permutations (PhD Thesis) (PDF). Australian National University. p. 9. Retrieved 25 April 2018.

arxiv.org

Bacher, Axel; Bodini, Olivier; Hollender, Alexandros; Lumbroso, Jérémie (2015). "MERGESHUFFLE: A Very Fast, Parallel Random Permutation Algorithm". arXiv:1508.03167 [cs.DS].
Lemire, Daniel (23 February 2019). "Fast Random Integer Generation in an Interval". ACM Transactions on Modeling and Computer Simulation. 29 (1): 1–12. arXiv:1805.10941. doi:10.1145/3230636. S2CID 44061046.

benpfaff.org

Pfaff, Ben. "How can I shuffle the contents of an array?". Retrieved 13 September 2024.

c-faq.com

Summit, Steve (1995). "Question 13.16: How can I get random integers in a certain range?". C Programming FAQs: Frequently Asked Questions. Addison-Wesley. ISBN 0-201-84519-9. Retrieved 8 September 2024.

codinghorror.com

blog.codinghorror.com

"The Danger of Naïveté". Jeff Atwood. 2007-12-07. Retrieved 2019-12-07.

doi.org

Durstenfeld, R. (July 1964). "Algorithm 235: Random permutation" (PDF). Communications of the ACM. 7 (7): 420. doi:10.1145/364520.364540. S2CID 494994.
Seacord, Robert C. (1 April 2017). "Uninitialized Reads: Understanding the proposed revisions to the C language". Communications of the ACM. 60 (4): 40–44. doi:10.1145/3024920. Copying uninitialized memory is legal in C if performed by memcpy(a+i, a+j, sizeof a[i]);.
Sattolo, Sandra (1986-05-30). "An algorithm to generate a random cyclic permutation". Information Processing Letters. 22 (6): 315–3017. doi:10.1016/0020-0190(86)90073-6.
Richard, Anderson (1990). "Parallel algorithms for generating random permutations on a shared memory machine". Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90. pp. 95–102. doi:10.1145/97444.97674. ISBN 0-89791-370-1. Retrieved 20 September 2024.
Lemire, Daniel (23 February 2019). "Fast Random Integer Generation in an Interval". ACM Transactions on Modeling and Computer Simulation. 29 (1): 1–12. arXiv:1805.10941. doi:10.1145/3230636. S2CID 44061046.

gnu.org

The GNU C Library: ISO Random

golangprojectstructure.com

Smith, James (2023-04-02). "Let's Do the Knuth Shuffle". Golang Project Structure. Retrieved 2023-04-03.

handle.net

hdl.handle.net

Fisher, Ronald A.; Yates, Frank (1948) [1938]. Statistical tables for biological, agricultural and medical research (3rd ed.). London: Oliver & Boyd. pp. 26–27. OCLC 14222135. Note: the 6th edition, ISBN 0-02-844720-4, is available on the web, but gives a different shuffling algorithm by C. R. Rao.

inria.fr

algo.inria.fr

Wilson, Mark C. (2004-06-21). "Overview of Sattolo's Algorithm" (PDF). In F. Chyzak (ed.). INRIA Research Report. Algorithms Seminar 2002–2004. Vol. 5542. summary by Éric Fusy. pp. 105–108. ISSN 0249-6399.

isa-afp.org

Eberl, Manuel (2016). "Fisher–Yates shuffle". Archive of Formal Proofs. Retrieved 28 September 2023.

microsoft.com

devblogs.microsoft.com

"Writing a sort comparison function, redux". require ‘brain’. 2009-05-08. Retrieved 2009-05-08.

nist.gov

xlinux.nist.gov

Black, Paul E. (2005-12-19). "Fisher–Yates shuffle". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology. Retrieved 2007-08-09.

okmij.org

"Provably perfect shuffle algorithms". Oleg Kiselyov. 3 Sep 2001. Retrieved 2013-07-09.

pcg-random.org

O'Neill, M.E. (22 July 2018). "Efficiently Generating a Number in a Range". Retrieved 23 August 2024.

peteroupc.github.io

Occil, Peter. "Random Number Generator Recommendations for Applications - Shuffling". peteroupc.github.io. Retrieved 17 September 2024.

robweir.com

"Doing the Microsoft Shuffle: Algorithm Fail in Browser Ballot". Rob Weir: An Antic Disposition. 2010-02-27. Retrieved 2010-02-28.

semanticscholar.org

api.semanticscholar.org

Durstenfeld, R. (July 1964). "Algorithm 235: Random permutation" (PDF). Communications of the ACM. 7 (7): 420. doi:10.1145/364520.364540. S2CID 494994.
Lemire, Daniel (23 February 2019). "Fast Random Integer Generation in an Interval". ACM Transactions on Modeling and Computer Simulation. 29 (1): 1–12. arXiv:1805.10941. doi:10.1145/3230636. S2CID 44061046.

stackoverflow.com

"Uniformity of random numbers taken modulo N". stackoverflow. Retrieved 13 September 2024.

szeryf.wordpress.com

"A simple shuffle that proved not so simple after all". require ‘brain’. 2007-06-19. Retrieved 2007-08-09.

worldcat.org

search.worldcat.org

Fisher, Ronald A.; Yates, Frank (1948) [1938]. Statistical tables for biological, agricultural and medical research (3rd ed.). London: Oliver & Boyd. pp. 26–27. OCLC 14222135. Note: the 6th edition, ISBN 0-02-844720-4, is available on the web, but gives a different shuffling algorithm by C. R. Rao.
Knuth, Donald E. (1969). Seminumerical algorithms. The Art of Computer Programming. Vol. 2. Reading, MA: Addison–Wesley. pp. 139–140. OCLC 85975465.
Knuth (1998). Seminumerical algorithms. The Art of Computer Programming. Vol. 2 (3rd ed.). Boston: Addison–Wesley. pp. 12–15, 145–146. ISBN 0-201-89684-2. OCLC 38207978.
Wilson, Mark C. (2004-06-21). "Overview of Sattolo's Algorithm" (PDF). In F. Chyzak (ed.). INRIA Research Report. Algorithms Seminar 2002–2004. Vol. 5542. summary by Éric Fusy. pp. 105–108. ISSN 0249-6399.