RSA
2008
13 years 11 months ago
2008
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...
RSA
2000
13 years 11 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
COMBINATORICS
2002
13 years 11 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
COMBINATORICS
2007
13 years 11 months ago
2007
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
SACRYPT
2007
Springer
14 years 5 months ago
2007
Springer
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...