The mixing time of the thorp shuffle

Authors:
Ben Morris
Affiliations:
Indiana University, Bloomington, IN
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 2
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Rearrangeability of $(2\protectn-1)$-Stage Shuffle-Exchange Networks

SIAM Journal on Computing

Derandomized constructions of k-wise (almost) independent permutations

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Thorp shuffle is defined as follows. Cut the deck into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip; then drop from the other pile. Continue this way until both piles are empty. We show that the mixing time for the Thorp shuffle with 2d cards is polynomial in d.