Location of Repository

P.: Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence

By Anna Gál and Parikshit Gopalan

Abstract

We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest increasing subsequence in a sequence of length n must use space Ω ( √ n). This proves a conjecture made by Gopalan, Jayram, Krauthgamer and Kumar [10] who proved a matching upper bound. Our results yield asymptotically tight lower bounds for all approximation factors, thus resolving the main open problem from their paper. Our proof is based on analyzing a related communication problem and proving a direct sum property for it.

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.359.7250
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://research.microsoft.com/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.