On computing the length of longest increasing subsequences

• 1 January 1975
• journal article
• Published by Elsevier in Discrete Mathematics
• Vol. 11  (1) , 29-35
• https://doi.org/10.1016/0012-365x(75)90103-x

Abstract

Keywords

• BEHAVIOR
• WORST CASE
• LINEARLY
• DISTINCT
• LONGEST INCREASING