Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.
