Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.
Anna Gl
,
Parikshit Gopalan
Venue
A*
FOCS
Year
2007
Proceedings
FOCS
DBLP record
conf/focs/GalG07 ↗
Browse the full
FOCS paper archive
.