✦ LIBER ✦

Faster algorithms for computing longest common increasing subsequences

✍ Scribed by Martin Kutz; Gerth Stølting Brodal; Kanela Kaligosi; Irit Katriel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear space algorithm for computing a

✍ Yoshifumi Sakai 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 107 KB

A faster linear systolic algorithm for r

✍ Thierry Lecroq; Guillaume Luce; Jean Frédéric Myoupo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Efficient algorithms for finding a longe

✍ Wun-Tat Chan; Yong Zhang; Stanley P. Y. Fung; Deshi Ye; Hong Zhu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 316 KB

On computing the length of longest incre

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

A New Efficient Algorithm for Computing

✍ Costas S. Iliopoulos; M. Sohel Rahman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 444 KB

Finding longest increasing and common su

✍ David Liben-Nowell; Erik Vee; An Zhu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 575 KB