TY - GEN

T1 - Computing a longest increasing subsequence of length k in time O (n\ log\ log k)

AU - Crochemore, M

AU - Porat, E.

N1 - Place of conference:UK

PY - 2008

Y1 - 2008

N2 - We consider the complexity of computing a longest increasing subsequence parameterised by the length of the output. Namely, we show that the maximal length k of an increasing subsequence of a permutation of the set of integers {1, 2, ... , n} can be computed in time O(n log log k) in the RAM model, improving the previous 30-year bound of O(n log log n). The optimality of the new bound is an open question.

AB - We consider the complexity of computing a longest increasing subsequence parameterised by the length of the output. Namely, we show that the maximal length k of an increasing subsequence of a permutation of the set of integers {1, 2, ... , n} can be computed in time O(n log log k) in the RAM model, improving the previous 30-year bound of O(n log log n). The optimality of the new bound is an open question.

UR - https://scholar.google.co.il/scholar?q=Computing+a+Longest+Increasing+Subsequence+of+Length+k+in+Time+O%28n+log+log+k%29&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Visions of computer science

PB - The British Computer Society

ER -