Advanced search
Publication Cover
Journal of the American Statistical Association Volume 68, 1973 - Issue 344
Submit an article Journal homepage
19
Views
22
CrossRef citations to date
0
Altmetric
Application

Nonrandom Shuffling with Applications to the Game of Faro

Edward O. Thorp Department of Mathematics, University of California at Irvine, Irvine, Calif., 92664, USA
Pages 842-847 | Received 01 Aug 1971, Published online: 05 Apr 2012

Citations (22)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

David Aldous & Persi Diaconis. (1986) Shuffling Cards and Stopping Times. The American Mathematical Monthly 93:5, pages 333-348.
Read now

Articles from other publishers (21)

Nam-Su Jho & Jooyoung Lee. (2023) Partition and mix: generalizing the swap-or-not shuffle. Designs, Codes and Cryptography 91:6, pages 2237-2254.
Crossref
Mark Sellke. (2022) Cutoff for the asymmetric riffle shuffle. The Annals of Probability 50:6.
Crossref
Kirill Denisovich Tsaregorodtsev. (2022) Format-preserving encryption: a survey. Математические вопросы криптографии Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] 13:2, pages 133-153.
Crossref
Maan Haj Rachid, Ryan Riley & Qutaibah Malluhi. (2020) Enclave-based oblivious RAM using Intel’s SGX. Computers & Security 91, pages 101711.
Crossref
Valerie Nachef, Jacques Patarin & Emmanuel VolteValerie Nachef, Jacques Patarin & Emmanuel Volte. 2017. Feistel Ciphers. Feistel Ciphers 193 201 .
Mohammad H. Alshayeji, Suood Abdulaziz Al-Roomi & Sa'ed Abed. (2016) A high-capacity and secure least significant bit embedding approach based on word and letter frequencies. Security and Communication Networks 9:18, pages 5764-5788.
Crossref
Artur Czumaj & Berthold Vöcking. 2014. Automata, Languages, and Programming. Automata, Languages, and Programming 344 355 .
Ben Morris & Phillip Rogaway. 2014. Advances in Cryptology – EUROCRYPT 2014. Advances in Cryptology – EUROCRYPT 2014 311 326 .
Persi Diaconis, Jason Fulman & Susan Holmes. (2013) Analysis of casino shelf shuffling machines. The Annals of Applied Probability 23:4.
Crossref
BEN MORRIS. (2012) Improved Mixing Time Bounds for the Thorp Shuffle. Combinatorics, Probability and Computing 22:1, pages 118-132.
Crossref
Viet Tung Hoang, Ben Morris & Phillip Rogaway. 2012. Advances in Cryptology – CRYPTO 2012. Advances in Cryptology – CRYPTO 2012 1 13 .
Richard A. Epstein. 2010. The Theory of Gambling and Statistical Logic. The Theory of Gambling and Statistical Logic 217 264 .
Eyal Kaplan, Moni Naor & Omer Reingold. (2008) Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55:1, pages 113-133.
Crossref
Ben Morris, Phillip Rogaway & Till Stegers. 2009. Advances in Cryptology - CRYPTO 2009. Advances in Cryptology - CRYPTO 2009 286 302 .
Ben Morris. (2008) The Mixing Time of the Thorp Shuffle. SIAM Journal on Computing 38:2, pages 484-504.
Crossref
Johan Håstad. (2006) The square lattice shuffle. Random Structures and Algorithms 29:4, pages 466-474.
Crossref
E. Mossel, Y. Peres & A. Sinclair. (2004) Shuffling by Semi-Random Transpositions. Shuffling by Semi-Random Transpositions.
Laurent Saloff-Coste. 2004. Probability on Discrete Structures. Probability on Discrete Structures 263 346 .
A. Merchant & P.S. Yu. (1996) Analytic modeling of clustered RAID with mapping based on nearly random permutation. IEEE Transactions on Computers 45:3, pages 367-373.
Crossref
A. Merchant & P.S. Yu. (1992) Design and modeling of clustered RAID. Design and modeling of clustered RAID.
David Aldous & Persi Diaconis. (1987) Strong uniform times and finite random walks. Advances in Applied Mathematics 8:1, pages 69-97.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.