Another look at the longest ascending subsequence problem

DOI10.1007/BF00289592zbMath0464.68069OpenAlexW2026712710MaRDI QIDQ1154283

Paul A. Pritchard

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289592

zbMATH Keywords

efficient algorithmmonotonic subsequences

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items

Opportunistic algorithms for eliminating supersets

Cites Work

• Unnamed Item
• Some beautiful arguments using mathematical induction
• On computing the length of longest increasing subsequences
• A Simple Proof of a Theorem of Erdös and Szekeres^*