Sciweavers

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

70

Voted

COMBINATORICS
2002

favoriteEmaildiscussreport

83views more COMBINATORICS 2002»

The Minimum Number of Monotone Subsequences

14 years 10 months ago

The Minimum Number of Monotone Subsequences

Download www.combinatorics.org

Erdos and Szekeres showed that any permutation of length n k2 + 1 contains

Joseph Samuel Myers

Real-time Traffic

COMBINATORICS 2002 | Permutation |

claim paper

Related Content

» On minimum kmodal partitions of permutations

» Maximizing the minimum load for selfish agents

» Algorithms for subsequence combinatorics

» Untangled Monotonic Chains and Adaptive Range Search

» Periodic Sorting Using Minimum Delay Recursively Constructed Merging Networks

» On the Readability of Monotone Boolean Formulae

» An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes

» Looking for monotonicity properties of a similarity constraint on sequences

» Positive Versions of Polynomial Time

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Joseph Samuel Myers

Comments (0)