"Lower Bounds on Streaming Algorithms for Approximating the Length of the ..."

Anna Gál, Parikshit Gopalan (2007)

> Home

Details and statistics

DOI: 10.1109/FOCS.2007.54

access: closed

type: Conference or Workshop Paper

metadata version: 2025-07-08

- view
  authority control:
- export record
  dblp key:
  - conf/focs/GalG07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/GalG07
Anna Gál, Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. FOCS 2007: 294-304

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.