Q4993799 (Q4993799): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorics of patience sorting piles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition theorem for partially ordered sets / 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: Q3752383 / rank | |||
Normal rank | |||
Latest revision as of 00:54, 26 July 2024
scientific article; zbMATH DE number 7360039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No label defined |
scientific article; zbMATH DE number 7360039 |
Statements
16 June 2021
0 references
increasing subsequences
0 references
patience sorting algorithm
0 references
worst-case optimality
0 references
0 references
