Another look at the ''longest ascending subsequence'' problem (Q1154283): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some beautiful arguments using mathematical induction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144755 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On computing the length of longest increasing subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Proof of a Theorem of Erdös and Szekeres<sup>*</sup> / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00289592 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026712710 / rank | |||
Normal rank | |||
Latest revision as of 11:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Another look at the ''longest ascending subsequence'' problem |
scientific article |
Statements
Another look at the ''longest ascending subsequence'' problem (English)
0 references
1981
0 references
efficient algorithm
0 references
monotonic subsequences
0 references
