On a problem in shuffling

Noga Alon*, Ken Berman, Daniel Kleitman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Upper and lower bounds are obtained for the number of shuffles necessary to reach the "furthest" two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2n)/2 and loglogn, respectively.

Original languageEnglish
Pages (from-to)5-14
Number of pages10
JournalJournal of Combinatorial Theory. Series A
Issue number1-2
StatePublished - Jul 2000


Dive into the research topics of 'On a problem in shuffling'. Together they form a unique fingerprint.

Cite this