Searching for "Faster Algorithms for Computing Longest Common Increasing Subsequences." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Faster algorithms for computing longest common increasing subsequences
by Gerth Sto/lting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz — 2006 — of Lecture Notes in Computer Science
… Faster Algorithms for Computing Longest Common Increasing Subsequences Gerth Sto/lting Brodal?1…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB