✦ LIBER ✦

On computing the length of longest increasing subsequences

✍ Scribed by Michael L. Fredman

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster algorithms for computing longest

✍ Martin Kutz; Gerth Stølting Brodal; Kanela Kaligosi; Irit Katriel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Moderate Deviations for Longest Increasi

✍ Matthias Löwe; Franz Merkl; Silke Rolles 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 144 KB

Moderate deviations for longest increasi

✍ Matthias Löwe; Franz Merkl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

Bounding the Expected Length of Longest

✍ R. A. Baeza-Yates; R. Gavaldà; G. Navarro; R. Scheihing 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 242 KB

Fast computation of a longest increasing

✍ Maxime Crochemore; Ely Porat 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Lower Bounds on Streaming Algorithms for

✍ Gál, Anna; Gopalan, Parikshit 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 256 KB