On a problem in shuffling

Noga Alon, Ken Berman, Daniel Kleitman

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 (log2n)/2 and loglogn, respectively.

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

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

Cite this