Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,744 papers from all fields of science
Search
Sign In
Create Free Account
Longest increasing subsequence
Known as:
LIS
, Longest nondecreasing subsequence
, Nondecreasing subsequence
Expand
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Algorithmics
Binary logarithm
Clique (graph theory)
Clique problem
Expand
Broader (1)
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Computing the Longest Increasing Subsequence of a Sequence Subject to Dynamic Insertion
Alex Chen
,
T. Chu
,
N. Pinsker
arXiv.org
2013
Corpus ID: 39350484
In this paper, we construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to…
Expand
2013
2013
XML Retrieval with Structural Context Relaxation
Yanlong Wen
,
Xinkun Li
,
Xiangrui Cai
,
Y. Zhang
,
Xiaojie Yuan
Fourth International Conference on Emerging…
2013
Corpus ID: 17866862
In this paper, we propose an approach to retrieval XML data with structural context relaxation. We process user query and XML…
Expand
2010
2010
On Some Variants of the Longest Increasing Subsequence Problem
S. Deorowicz
2010
Corpus ID: 15855073
The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many…
Expand
2009
2009
The Longest Increasing Subsequence Problem
2009
Corpus ID: 52240579
Given a string X = 〈x1, x2, . . . , xn〉 of n characters drawn from a totally ordered alphabet, an Increasing Subsequence (IS) of…
Expand
2008
2008
Fast Algorithms for the Constrained Longest Increasing Subsequence Problems
I-Hsuan Yang
,
Yi-Ching Chen
2008
Corpus ID: 8806468
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest…
Expand
2007
2007
An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS
D. Semé
,
S. Youlou
International Conference on Parallel and…
2007
Corpus ID: 9267256
In this paper, we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently…
Expand
2004
2004
Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems
D. Semé
,
S. Youlou
International Conference on Parallel and…
2004
Corpus ID: 17254
In this paper we give parallel solutions to the problem of finding the Longest Increasing Subsequence of a given sequence of n…
Expand
Review
2001
Review
2001
Efficient Software Decoder Design
R. Krishna
,
T. Austin
2001
Corpus ID: 14857412
In this paper, we evaluate several techniques for generating and optimizing high speed software decoders. We begin by presenting…
Expand
1995
1995
ON THE LENGTH OF THE LONGEST INCREASING SUBSEQUENCE IN A RANDOM PERMUTATION
S. Janson
1995
Corpus ID: 9107827
Complementing the results claiming that the maximal length Ln of an increasing subsequence in a random permutation of f ng is…
Expand
1993
1993
An efficient parallel solution for the longest increasing subsequence problem
C. Cérin
,
C. Dufourd
,
J. Myoupo
International Conference on Computing and…
1993
Corpus ID: 41687707
We derive a parallel solution to the problem of finding the longest increasing subsequence in a finite sequence of numbers. We…
Expand