Space-Efficient Algorithms for Longest Increasing Subsequence

Masashi Kiyomi, Hirotaka Ono, Yota Otachi +2

Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in $O(n\log n)$ time and space. Our goa…