✦ 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
DOI: 10.1137/090770801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on randomized streaming space bou

A note on randomized streaming space bounds for the longest increasing subsequence problem

✍ Amit Chakrabarti 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 114 KB

On computing the length of longest incre

On computing the length of longest increasing subsequences

✍ Michael L. Fredman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 780 KB

An algorithm for the determination of a

An algorithm for the determination of a longest increasing subsequence in a sequence

✍ 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

Approximations and Lower Bounds for the

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees

✍ J. H. Rubinstein; J. Weng; N. Wormald 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 187 KB

A lower bound on the length of a sequenc

A lower bound on the length of a sequence containing all permutations as subsequences

✍ D.J Kleitman; D.J Kwiatkowski 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Algorithms meeting the lower bounds on t

Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms

✍ Duhamel, P. 📂 Article 📅 1990 🏛 IEEE ⚖ 704 KB