𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Gál, Anna; Gopalan, Parikshit


Book ID
118181095
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
256 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


An algorithm for the determination of a
✍ M. Orlowski; M. Pachter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence