Longest increasing subsequence

Known as: LIS, Longest nondecreasing subsequence, Nondecreasing subsequence 
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of… (More)
Is this relevant?
2009
2009
Given a string S = a1a2a3 · · · an, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2009
2009
Let X1,X2, . . . ,Xn, . . . be a sequence of iid random variables with values in a finite alphabet {1, . . . ,m}. Let LIn be the… (More)
Is this relevant?
2008
2008
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest… (More)
Is this relevant?
2007
2007
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which… (More)
Is this relevant?
2000
2000
We show that a wide variety of generalized increasing subsequence problems admit a one parameter family of extensions for which… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The authors consider the length, lN , of the length of the longest increasing subsequence of a random permutation of N numbers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In a famous paper 8] Hammersley investigated the length L n of the longest increasing subsequence of a random n-permutation… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
We shall describe an algorithm which performs this task and which has a worst case running time of O(n log n). This bound is… (More)
Is this relevant?