Skip to search formSkip to main contentSkip to account menu

Fisher–Yates shuffle

Known as: Fisher-Yates algorithm, Algorithm 235, Fisher-Yates Shuffle 
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite set—in plain terms, the algorithm shuffles the set. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Present paper proposed an image encryption technique using Fisher Yates shuffling along with pseudorandom permutation. Hazra et… 
Highly Cited
2006
Highly Cited
2006
Dengue virus (DV) is a member of the family Flaviviridae. These positive strand RNA viruses encode a polyprotein that is… 
Highly Cited
2003
Highly Cited
2003
This paper motivates and presents the Topic-based Vector Space Model (TVSM), a new vector-based approach for document comparison… 
2003
2003
Analysis of language data from the 2001 Census reveals an increasing shift to the sole use of English in the home for most, but… 
Highly Cited
2000
Highly Cited
2000
Support Vector Machines (SVMs) have recently proved to be powerful pattern classi(cid:12)cation tools with a strong con-nection… 
Highly Cited
1997
Highly Cited
1997
The stratigraphic distribution of fossil species contains potential information about phylogeny because some phylogenetic trees… 
Highly Cited
1982
Highly Cited
1982
In this correspondence we develop an algorithm to perform BPC permutations on a cube connected SIMD computer. The class of BPC… 
Highly Cited
1976
Highly Cited
1976
The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array…