Share this page
Live Favorites
Digg
del.icio.us
ma.gnolia
Newsvine
Facebook
Projects
Publications
People
Downloads
Home
Our Research
Collaboration
Careers
Worldwide Labs
Research Areas
Research Groups
Project Tuva Enhanced Video Player
Watch the Feynman Lectures
>
Publications
>
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
Parikshit Gopalan and Anna Gal
October 2007
PDF file
PowerPoint presentation
In:
FOCS'07
Details
Type:
Inproceedings
Related People
Parikshit Gopalan