8 search results - page 2 / 2 » Longest Increasing Subsequences in Pattern-Restricted Permut... |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
COMBINATORICS
2007
13 years 7 months ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
COMBINATORICS
2004
13 years 7 months ago
2004
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...