Sciweavers

RSA
2008
89views more  RSA 2008»
13 years 9 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
ALENEX
2004
92views Algorithms» more  ALENEX 2004»
13 years 11 months ago
Gap-Free Samples of Geometric Random Variables
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
Pawel Hitczenko, Arnold Knopfmacher