1421 search results - page 3 / 285 » Algorithms for subsequence combinatorics |
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
CPM
2010
Springer
13 years 9 months ago
2010
Springer
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
COMBINATORICS
1998
13 years 4 months ago
1998
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
COMBINATORICS
1998
13 years 4 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...