Methodical solution of the problem of ascending subsequences of maximum length within a given sequence

DOI10.1016/0020-0190(79)90111-XzbMath0406.68012OpenAlexW2009067638MaRDI QIDQ1257765

A. Quere, Martin Wirsing, Jean-Luc Rémy, Manfred Broy, Jean-Pierre Finance

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90111-x

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites Work

• The algebraic specification of abstract data types
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methodical solution of the problem of ascending subsequences of maximum length within a given sequence