Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence - Microsoft Research

Microsoft Translator |

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Parikshit Gopalan and Anna Gal
October 2007

focs.pdf

Streaming.ppt

PowerPoint presentation

In FOCS'07

Details

Type	Inproceedings

Related People

Parikshit Gopalan

> Publications > Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence