Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

112

Voted

COMBINATORICS
1999

93views more COMBINATORICS 1999»

Longest Increasing Subsequences of Random Colored Permutations

15 years 2 months ago

Longest Increasing Subsequences of Random Colored Permutations

Download www.combinatorics.org

Alexei Borodin

Real-time Traffic

COMBINATORICS 1999 |

claim paper

Related Content

» Longest Increasing Subsequences in PatternRestricted Permutations

» Longest Alternating Subsequences in PatternRestricted Permutations

» Increasing Subsequences and the Classical Groups

» Permutations Without Long Decreasing Subsequences and Random Matrices

» Finding Longest Increasing and Common Subsequences in Streaming Data

» A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem

» Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input...

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» On distance to monotonicity and longest increasing subsequence of a data stream

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COMBINATORICS
Authors	Alexei Borodin

Comments (0)