A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.

DOI10.4230/LIPIcs.STACS.2020.41OpenAlexW3013657067MaRDI QIDQ5874314

Lech Duraj

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1902.06864

zbMATH Keywords

longest common increasing subsequencematching pairslog-shaving

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Longest common rollercoasters ⋮ Longest bordered and periodic subsequences ⋮ A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem

This page was built for publication: A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.