Title of article
On a Problem in Shuffling
Author/Authors
Alon، نويسنده , , Noga and Berman، نويسنده , , Ken and Kleitman، نويسنده , , Daniel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
10
From page
5
To page
14
Abstract
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 (log2 n)/2 and log log n, respectively.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2000
Journal title
Journal of Combinatorial Theory Series A
Record number
1530490
Link To Document