Join
Approximating the longest increasing subsequence in a stream
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "algorithms-complexity" |
| 5 | ], |
| 6 | "type": "proof", |
| 7 | "also": [ |
| 8 | "algorithm" |
| 9 | ], |
| 10 | "source": { |
| 11 | "key": "sublinear", |
| 12 | "name": "Sublinear.info", |
| 13 | "url": "https://sublinear.info/44", |
| 14 | "id": "44", |
| 15 | "curator": "Sublinear.info editors", |
| 16 | "poser": "Amit Chakrabarti", |
| 17 | "status": "open", |
| 18 | "as_of": "2026-10-20", |
| 19 | "catalog": "0521c19bbd38" |
| 20 | }, |
| 21 | "review": true, |
| 22 | "approval": "first-time" |
| 23 | } |