Sublinear Space Algorithms for the Longest Common Substring Problem (Q2921446): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1732081968 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1407.0522 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:02, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublinear Space Algorithms for the Longest Common Substring Problem |
scientific article |
Statements
Sublinear Space Algorithms for the Longest Common Substring Problem (English)
0 references
8 October 2014
0 references
