Space-efficient algorithms for longest increasing subsequence (Q1987516): Difference between revisions
From MaRDI portal
Created a new 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W2913517735 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:10, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Space-efficient algorithms for longest increasing subsequence |
scientific article |
Statements
Space-efficient algorithms for longest increasing subsequence (English)
0 references
15 April 2020
0 references
longest increasing subsequence
0 references
patience sorting
0 references
space-efficient algorithm
0 references
